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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 97K 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-08-UpperBounds-00
FORMULA_NAME FireWire-PT-08-UpperBounds-01
FORMULA_NAME FireWire-PT-08-UpperBounds-02
FORMULA_NAME FireWire-PT-08-UpperBounds-03
FORMULA_NAME FireWire-PT-08-UpperBounds-04
FORMULA_NAME FireWire-PT-08-UpperBounds-05
FORMULA_NAME FireWire-PT-08-UpperBounds-06
FORMULA_NAME FireWire-PT-08-UpperBounds-07
FORMULA_NAME FireWire-PT-08-UpperBounds-08
FORMULA_NAME FireWire-PT-08-UpperBounds-09
FORMULA_NAME FireWire-PT-08-UpperBounds-10
FORMULA_NAME FireWire-PT-08-UpperBounds-11
FORMULA_NAME FireWire-PT-08-UpperBounds-12
FORMULA_NAME FireWire-PT-08-UpperBounds-13
FORMULA_NAME FireWire-PT-08-UpperBounds-14
FORMULA_NAME FireWire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717366563054

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:16:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 22:16:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:16:04] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 22:16:04] [INFO ] Transformed 127 places.
[2024-06-02 22:16:04] [INFO ] Transformed 397 transitions.
[2024-06-02 22:16:04] [INFO ] Found NUPN structural information;
[2024-06-02 22:16:04] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 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 22:16:04] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 22:16:04] [INFO ] Computed 8 invariants in 16 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 (539 resets) in 48 ms. (204 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (1303 resets) in 135 ms. (661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 22:16:04] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
[2024-06-02 22:16:04] [INFO ] Invariant cache hit.
[2024-06-02 22:16:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 22:16:04] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-02 22:16:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:16:05] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 22:16:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:16:05] [INFO ] [Nat]Added 45 Read/Feed constraints in 46 ms returned sat
[2024-06-02 22:16:05] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 35 ms.
[2024-06-02 22:16:05] [INFO ] Added : 27 causal constraints over 6 iterations in 337 ms. Result :sat
Minimization took 77 ms.
[2024-06-02 22:16:05] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 22:16:05] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-02 22:16:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:05] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 22:16:05] [INFO ] [Nat]Added 45 Read/Feed constraints in 35 ms returned sat
[2024-06-02 22:16:05] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 66 ms.
[2024-06-02 22:16:06] [INFO ] Added : 14 causal constraints over 4 iterations in 180 ms. Result :sat
Minimization took 76 ms.
[2024-06-02 22:16:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:06] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 22:16:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 22:16:06] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 22:16:06] [INFO ] [Nat]Added 45 Read/Feed constraints in 38 ms returned sat
[2024-06-02 22:16:06] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 28 ms.
[2024-06-02 22:16:06] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 11 ms to minimize.
[2024-06-02 22:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2024-06-02 22:16:06] [INFO ] Added : 29 causal constraints over 8 iterations in 368 ms. Result :sat
Minimization took 66 ms.
[2024-06-02 22:16:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:07] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 22:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:16:07] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 22:16:07] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2024-06-02 22:16:07] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 48 ms.
[2024-06-02 22:16:07] [INFO ] Added : 38 causal constraints over 8 iterations in 213 ms. Result :sat
Minimization took 78 ms.
[2024-06-02 22:16:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:07] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 22:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:07] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 22:16:07] [INFO ] [Nat]Added 45 Read/Feed constraints in 14 ms returned sat
[2024-06-02 22:16:07] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 25 ms.
[2024-06-02 22:16:08] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:16:08] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:16:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2024-06-02 22:16:08] [INFO ] Added : 33 causal constraints over 8 iterations in 404 ms. Result :sat
Minimization took 73 ms.
[2024-06-02 22:16:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:08] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 22:16:08] [INFO ] [Real]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:16:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:08] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 22:16:08] [INFO ] [Nat]Added 45 Read/Feed constraints in 20 ms returned sat
[2024-06-02 22:16:08] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 24 ms.
[2024-06-02 22:16:08] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:16:08] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:16:08] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:16:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2024-06-02 22:16:08] [INFO ] Added : 22 causal constraints over 6 iterations in 401 ms. Result :sat
Minimization took 79 ms.
[2024-06-02 22:16:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:09] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 22:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:09] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 22:16:09] [INFO ] [Nat]Added 45 Read/Feed constraints in 27 ms returned sat
[2024-06-02 22:16:09] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 17 ms.
[2024-06-02 22:16:09] [INFO ] Added : 20 causal constraints over 5 iterations in 210 ms. Result :sat
Minimization took 79 ms.
[2024-06-02 22:16:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:09] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 22:16:09] [INFO ] [Real]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:16:09] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 22:16:09] [INFO ] [Nat]Added 45 Read/Feed constraints in 45 ms returned sat
[2024-06-02 22:16:09] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 23 ms.
[2024-06-02 22:16:09] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Minimization took 62 ms.
[2024-06-02 22:16:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:10] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 22:16:10] [INFO ] [Real]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-06-02 22:16:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:10] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 22:16:10] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:16:10] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 23 ms.
[2024-06-02 22:16:10] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-06-02 22:16:10] [INFO ] Added : 26 causal constraints over 8 iterations in 281 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 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 127 transition count 341
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 121 transition count 327
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 121 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 121 transition count 324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 117 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 117 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 116 transition count 314
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 34 place count 113 transition count 320
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 40 place count 113 transition count 314
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 49 place count 113 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 113 transition count 307
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 112 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 112 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 111 transition count 302
Applied a total of 56 rules in 226 ms. Remains 111 /127 variables (removed 16) and now considering 302/344 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 111/127 places, 302/344 transitions.
[2024-06-02 22:16:11] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 22:16:11] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57680 resets) in 1249 ms. (800 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000003 steps (84648 resets) in 2498 ms. (2400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 22:16:14] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:16:14] [INFO ] Invariant cache hit.
[2024-06-02 22:16:14] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:14] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:16:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:15] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 22:16:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:16:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2024-06-02 22:16:15] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 22:16:15] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-06-02 22:16:15] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:16:15] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:16:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2024-06-02 22:16:15] [INFO ] Added : 59 causal constraints over 14 iterations in 580 ms. Result :sat
Minimization took 100 ms.
[2024-06-02 22:16:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:15] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 22:16:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:16] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 22:16:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 28 ms returned sat
[2024-06-02 22:16:16] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 22:16:16] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:16:16] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:16:16] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:16:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
[2024-06-02 22:16:16] [INFO ] Added : 38 causal constraints over 9 iterations in 568 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 22:16:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:16] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-02 22:16:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:16] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 22:16:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:16:17] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 28 ms.
[2024-06-02 22:16:17] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:16:17] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:16:17] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:16:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2024-06-02 22:16:17] [INFO ] Added : 45 causal constraints over 9 iterations in 439 ms. Result :sat
Minimization took 89 ms.
[2024-06-02 22:16:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 22:16:17] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 22:16:17] [INFO ] [Real]Added 42 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:16:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:17] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 22:16:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 34 ms returned sat
[2024-06-02 22:16:17] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 19 ms.
[2024-06-02 22:16:17] [INFO ] Added : 22 causal constraints over 5 iterations in 111 ms. Result :sat
Minimization took 80 ms.
[2024-06-02 22:16:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Real]Added 42 Read/Feed constraints in 6 ms returned sat
[2024-06-02 22:16:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:16:18] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 19 ms.
[2024-06-02 22:16:18] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-02 22:16:18] [INFO ] Added : 52 causal constraints over 12 iterations in 299 ms. Result :sat
Minimization took 87 ms.
[2024-06-02 22:16:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Real]Added 42 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:16:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:16:18] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:16:18] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 22:16:18] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 22:16:19] [INFO ] Added : 37 causal constraints over 9 iterations in 211 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 12 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 111/111 places, 302/302 transitions.
[2024-06-02 22:16:19] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:16:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (58099 resets) in 1117 ms. (894 steps per ms)
BEST_FIRST walk for 6000005 steps (84670 resets) in 2386 ms. (2513 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 22:16:22] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:16:22] [INFO ] Invariant cache hit.
[2024-06-02 22:16:22] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 22:16:22] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:16:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:22] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:16:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:16:22] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2024-06-02 22:16:23] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 22:16:23] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:16:23] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
[2024-06-02 22:16:23] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:16:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 302 ms
[2024-06-02 22:16:23] [INFO ] Added : 59 causal constraints over 14 iterations in 551 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 22:16:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:23] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-02 22:16:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:23] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 22:16:23] [INFO ] [Nat]Added 42 Read/Feed constraints in 30 ms returned sat
[2024-06-02 22:16:23] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 22:16:24] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:16:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:16:24] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:16:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2024-06-02 22:16:24] [INFO ] Added : 38 causal constraints over 9 iterations in 411 ms. Result :sat
Minimization took 82 ms.
[2024-06-02 22:16:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 22:16:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:24] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:16:24] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:16:24] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 22:16:24] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:16:24] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:16:25] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:16:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2024-06-02 22:16:25] [INFO ] Added : 45 causal constraints over 9 iterations in 413 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 22:16:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Real]Added 42 Read/Feed constraints in 6 ms returned sat
[2024-06-02 22:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 34 ms returned sat
[2024-06-02 22:16:25] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 22:16:25] [INFO ] Added : 22 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 80 ms.
[2024-06-02 22:16:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Real]Added 42 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 22:16:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:16:25] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 22:16:25] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-02 22:16:26] [INFO ] Added : 52 causal constraints over 12 iterations in 274 ms. Result :sat
Minimization took 91 ms.
[2024-06-02 22:16:26] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:26] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:16:26] [INFO ] [Real]Added 42 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:16:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:16:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:26] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 22:16:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:16:26] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 22:16:26] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 22:16:26] [INFO ] Added : 37 causal constraints over 9 iterations in 226 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 22:16:26] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:16:26] [INFO ] Invariant cache hit.
[2024-06-02 22:16:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:16:26] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:16:26] [INFO ] Invariant cache hit.
[2024-06-02 22:16:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:16:26] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 22:16:27] [INFO ] Redundant transitions in 20 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 22:16:27] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:16:27] [INFO ] Invariant cache hit.
[2024-06-02 22:16:27] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:16:28] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:16:29] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:16:29] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 1/384 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 172 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9999 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 300/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 22:16:51] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:16:51] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/384 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 29628 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 13/13 constraints]
After SMT, in 39893ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 39907ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40192 ms. Remains : 111/111 places, 302/302 transitions.
RANDOM walk for 40000 steps (2338 resets) in 1777 ms. (22 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (555 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (594 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (555 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (553 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (509 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (606 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (588 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (524 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (556 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (566 resets) in 72 ms. (547 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (554 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (564 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 777273 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :6 out of 12
Probabilistic random walk after 777273 steps, saw 173831 distinct states, run finished after 3004 ms. (steps per millisecond=258 ) properties seen :6
[2024-06-02 22:17:11] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:17:11] [INFO ] Invariant cache hit.
[2024-06-02 22:17:11] [INFO ] State equation strengthened by 42 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) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 101/293 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/295 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 83/378 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/384 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/384 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/384 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 161 constraints, problems are : Problem set: 0 solved, 6 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 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) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 101/293 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/295 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 83/378 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/378 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/384 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/384 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 167 constraints, problems are : Problem set: 0 solved, 6 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1385ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 495 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 13 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 111/111 places, 302/302 transitions.
RANDOM walk for 40000 steps (2269 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (543 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (537 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (562 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (549 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (583 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (510 resets) in 31 ms. (1250 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 664109 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 6
Probabilistic random walk after 664109 steps, saw 149387 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
[2024-06-02 22:17:16] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:17:16] [INFO ] Invariant cache hit.
[2024-06-02 22:17:16] [INFO ] State equation strengthened by 42 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) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 101/293 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/295 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 83/378 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/384 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/384 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/384 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 161 constraints, problems are : Problem set: 0 solved, 6 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 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) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 101/293 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/295 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 83/378 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/378 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/384 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/384 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 167 constraints, problems are : Problem set: 0 solved, 6 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 709ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 559 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 22:17:17] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:17:17] [INFO ] Invariant cache hit.
[2024-06-02 22:17:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:17:17] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:17:17] [INFO ] Invariant cache hit.
[2024-06-02 22:17:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:17:17] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-06-02 22:17:17] [INFO ] Redundant transitions in 5 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 22:17:17] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:17:17] [INFO ] Invariant cache hit.
[2024-06-02 22:17:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 22:17:18] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:17:18] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:17:19] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 1/384 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 172 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9477 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 300/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 22:17:41] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:17:41] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/384 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 29783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 13/13 constraints]
After SMT, in 39460ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 39466ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39692 ms. Remains : 111/111 places, 302/302 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 111 vertex of which 29 / 111 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 172
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 8 place count 84 transition count 171
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 9 place count 84 transition count 170
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 11 place count 83 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 82 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 82 transition count 143
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 82 transition count 138
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 79 transition count 137
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 79 transition count 137
Applied a total of 22 rules in 32 ms. Remains 79 /111 variables (removed 32) and now considering 137/302 (removed 165) transitions.
Running SMT prover for 6 properties.
[2024-06-02 22:17:57] [INFO ] Flow matrix only has 135 transitions (discarded 2 similar events)
// Phase 1: matrix 135 rows 79 cols
[2024-06-02 22:17:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:17:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:17:57] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 22:17:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:17:57] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-02 22:17:57] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-02 22:17:57] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 288 ms.
FORMULA FireWire-PT-08-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Starting property specific reduction for FireWire-PT-08-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:17:57] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 22:17:57] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (577 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (130 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:17:57] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:17:57] [INFO ] Invariant cache hit.
[2024-06-02 22:17:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:17:57] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:17:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:17:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:17:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:17:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:17:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2024-06-02 22:17:57] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 18 ms.
[2024-06-02 22:17:58] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:17:58] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 8 ms to minimize.
[2024-06-02 22:17:58] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:17:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2024-06-02 22:17:58] [INFO ] Added : 59 causal constraints over 14 iterations in 522 ms. Result :sat
Minimization took 90 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 111 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p85) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 300/300 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 298
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 295
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 108 transition count 293
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 107 transition count 290
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 106 transition count 288
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 105 transition count 285
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 104 transition count 283
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 103 transition count 280
Applied a total of 8 rules in 13 ms. Remains 103 /111 variables (removed 8) and now considering 280/300 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 103/111 places, 280/300 transitions.
[2024-06-02 22:17:58] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
// Phase 1: matrix 251 rows 103 cols
[2024-06-02 22:17:58] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (58050 resets) in 1077 ms. (927 steps per ms)
BEST_FIRST walk for 1000001 steps (14036 resets) in 398 ms. (2506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:17:59] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:17:59] [INFO ] Invariant cache hit.
[2024-06-02 22:18:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:18:00] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 22:18:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:18:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:18:00] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:18:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:18:00] [INFO ] [Nat]Added 38 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:18:00] [INFO ] Computed and/alt/rep : 115/465/115 causal constraints (skipped 134 transitions) in 16 ms.
[2024-06-02 22:18:00] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:18:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 22:18:00] [INFO ] Added : 45 causal constraints over 10 iterations in 239 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 280/280 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 103/103 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 280/280 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 22:18:00] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:00] [INFO ] Invariant cache hit.
[2024-06-02 22:18:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:18:00] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:00] [INFO ] Invariant cache hit.
[2024-06-02 22:18:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:18:00] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 22:18:00] [INFO ] Redundant transitions in 1 ms returned []
Running 278 sub problems to find dead transitions.
[2024-06-02 22:18:00] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:00] [INFO ] Invariant cache hit.
[2024-06-02 22:18:00] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:01] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-02 22:18:01] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:05] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 251/353 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:18:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 11 (OVERLAPS) 1/354 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 13 (OVERLAPS) 0/354 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 161 constraints, problems are : Problem set: 0 solved, 278 unsolved in 13333 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 251/353 variables, 102/122 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 278/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 439 constraints, problems are : Problem set: 0 solved, 278 unsolved in 17376 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 12/12 constraints]
After SMT, in 30845ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 30848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31085 ms. Remains : 103/103 places, 280/280 transitions.
RANDOM walk for 40000 steps (2339 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (569 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (547 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 973021 steps, run timeout after 3008 ms. (steps per millisecond=323 ) properties seen :0 out of 2
Probabilistic random walk after 973021 steps, saw 218608 distinct states, run finished after 3008 ms. (steps per millisecond=323 ) properties seen :0
[2024-06-02 22:18:34] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:34] [INFO ] Invariant cache hit.
[2024-06-02 22:18:34] [INFO ] State equation strengthened by 38 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) 101/263 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/265 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 83/348 variables, 39/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/354 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 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) 101/263 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/265 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 83/348 variables, 39/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/354 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/354 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 280/280 transitions.
RANDOM walk for 40000 steps (2318 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (581 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (572 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1092969 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 2
Probabilistic random walk after 1092969 steps, saw 242787 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
[2024-06-02 22:18:38] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:38] [INFO ] Invariant cache hit.
[2024-06-02 22:18:38] [INFO ] State equation strengthened by 38 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) 101/263 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/265 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 83/348 variables, 39/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/354 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 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) 101/263 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/265 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 83/348 variables, 39/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/354 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/354 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 280/280 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 280/280 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 22:18:38] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:38] [INFO ] Invariant cache hit.
[2024-06-02 22:18:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:18:38] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:38] [INFO ] Invariant cache hit.
[2024-06-02 22:18:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:18:38] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 22:18:38] [INFO ] Redundant transitions in 2 ms returned []
Running 278 sub problems to find dead transitions.
[2024-06-02 22:18:38] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 22:18:38] [INFO ] Invariant cache hit.
[2024-06-02 22:18:38] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:39] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:18:39] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:41] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:18:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:18:41] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:18:41] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:18:41] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:18:41] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:18:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:42] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 251/353 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:18:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 22:18:45] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 11 (OVERLAPS) 1/354 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 13 (OVERLAPS) 0/354 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 161 constraints, problems are : Problem set: 0 solved, 278 unsolved in 12700 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 251/353 variables, 102/122 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 278/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 439 constraints, problems are : Problem set: 0 solved, 278 unsolved in 17922 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 12/12 constraints]
After SMT, in 30802ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 30806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31035 ms. Remains : 103/103 places, 280/280 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 103 vertex of which 29 / 103 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 77 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 77 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 76 transition count 149
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 9 place count 76 transition count 148
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 11 place count 75 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 74 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 74 transition count 126
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 74 transition count 121
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 71 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 71 transition count 120
Applied a total of 22 rules in 40 ms. Remains 71 /103 variables (removed 32) and now considering 120/280 (removed 160) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:19:09] [INFO ] Flow matrix only has 118 transitions (discarded 2 similar events)
// Phase 1: matrix 118 rows 71 cols
[2024-06-02 22:19:09] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:19:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:19:09] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:19:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:19:09] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:19:09] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:19:09] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-08-UpperBounds-00 in 72217 ms.
Starting property specific reduction for FireWire-PT-08-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:19:09] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 22:19:09] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (569 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (127 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:19:09] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:19:09] [INFO ] Invariant cache hit.
[2024-06-02 22:19:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:19:09] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:19:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:19:10] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 22:19:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:19:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 32 ms returned sat
[2024-06-02 22:19:10] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 22:19:10] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:19:10] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:19:10] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:19:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2024-06-02 22:19:10] [INFO ] Added : 38 causal constraints over 9 iterations in 424 ms. Result :sat
Minimization took 78 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 111 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p77) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 111/111 places, 299/299 transitions.
[2024-06-02 22:19:10] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
// Phase 1: matrix 270 rows 111 cols
[2024-06-02 22:19:10] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57789 resets) in 1096 ms. (911 steps per ms)
BEST_FIRST walk for 1000000 steps (13984 resets) in 414 ms. (2409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:19:12] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:12] [INFO ] Invariant cache hit.
[2024-06-02 22:19:12] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 22:19:12] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:19:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:19:12] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 22:19:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:19:12] [INFO ] [Nat]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-06-02 22:19:12] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 145 transitions) in 15 ms.
[2024-06-02 22:19:12] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 22:19:12] [INFO ] Added : 37 causal constraints over 8 iterations in 209 ms. Result :sat
Minimization took 81 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 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 111/111 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-02 22:19:12] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:12] [INFO ] Invariant cache hit.
[2024-06-02 22:19:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 22:19:12] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:12] [INFO ] Invariant cache hit.
[2024-06-02 22:19:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:19:12] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-06-02 22:19:13] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 22:19:13] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:13] [INFO ] Invariant cache hit.
[2024-06-02 22:19:13] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 22:19:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:19:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 270/380 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 22:19:20] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:19:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 0/381 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 169 constraints, problems are : Problem set: 0 solved, 297 unsolved in 15479 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 270/380 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 41/168 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 297/465 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 0/381 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 466 constraints, problems are : Problem set: 0 solved, 297 unsolved in 18890 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 9/9 constraints]
After SMT, in 34570ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 34573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34869 ms. Remains : 111/111 places, 299/299 transitions.
RANDOM walk for 40000 steps (2312 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (531 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (499 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 950027 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 2
Probabilistic random walk after 950027 steps, saw 213079 distinct states, run finished after 3006 ms. (steps per millisecond=316 ) properties seen :0
[2024-06-02 22:19:50] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:50] [INFO ] Invariant cache hit.
[2024-06-02 22:19:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/189 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/290 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/292 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 83/375 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/381 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/381 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 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) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/189 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/290 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/292 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 83/375 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/381 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/381 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/381 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 111/111 places, 299/299 transitions.
RANDOM walk for 40000 steps (2284 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (548 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (570 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1250465 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 2
Probabilistic random walk after 1250465 steps, saw 274758 distinct states, run finished after 3002 ms. (steps per millisecond=416 ) properties seen :0
[2024-06-02 22:19:54] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:54] [INFO ] Invariant cache hit.
[2024-06-02 22:19:54] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/189 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/290 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/292 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 83/375 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/381 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/381 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 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) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/189 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/290 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/292 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 83/375 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/381 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/381 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/381 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 111/111 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 299/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-02 22:19:54] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:54] [INFO ] Invariant cache hit.
[2024-06-02 22:19:54] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:19:54] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:54] [INFO ] Invariant cache hit.
[2024-06-02 22:19:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:19:54] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-02 22:19:54] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 22:19:54] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 22:19:54] [INFO ] Invariant cache hit.
[2024-06-02 22:19:54] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 22:19:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:19:56] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 22:19:57] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2024-06-02 22:19:58] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:19:58] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:19:58] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2024-06-02 22:19:58] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 270/380 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 0/381 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 169 constraints, problems are : Problem set: 0 solved, 297 unsolved in 15461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 270/380 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 41/168 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 297/465 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 0/381 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 466 constraints, problems are : Problem set: 0 solved, 297 unsolved in 18970 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 9/9 constraints]
After SMT, in 34621ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 34624ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34930 ms. Remains : 111/111 places, 299/299 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 111 vertex of which 29 / 111 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 85 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 169
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 8 place count 84 transition count 168
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 9 place count 84 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 83 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 82 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 82 transition count 141
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 82 transition count 136
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 79 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 79 transition count 135
Applied a total of 22 rules in 17 ms. Remains 79 /111 variables (removed 32) and now considering 135/299 (removed 164) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:20:29] [INFO ] Flow matrix only has 133 transitions (discarded 2 similar events)
// Phase 1: matrix 133 rows 79 cols
[2024-06-02 22:20:29] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:20:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:20:29] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:20:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:20:29] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:20:29] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:20:29] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2024-06-02 22:20:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
TRAPS : Iteration 1
[2024-06-02 22:20:29] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:20:29] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 454 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-08-UpperBounds-04 in 80137 ms.
Starting property specific reduction for FireWire-PT-08-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:20:29] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 22:20:29] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (590 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (137 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:20:30] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:20:30] [INFO ] Invariant cache hit.
[2024-06-02 22:20:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:20:30] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 22:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:20:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:20:30] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 22:20:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:20:30] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2024-06-02 22:20:30] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 22:20:30] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:20:30] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:20:30] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:20:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2024-06-02 22:20:30] [INFO ] Added : 45 causal constraints over 9 iterations in 469 ms. Result :sat
Minimization took 81 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 111 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p82) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 300/300 transitions.
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 297
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 295
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 108 transition count 292
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 107 transition count 290
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 106 transition count 287
Applied a total of 5 rules in 8 ms. Remains 106 /111 variables (removed 5) and now considering 287/300 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 106/111 places, 287/300 transitions.
[2024-06-02 22:20:30] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
// Phase 1: matrix 258 rows 106 cols
[2024-06-02 22:20:30] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57557 resets) in 1036 ms. (964 steps per ms)
BEST_FIRST walk for 1000001 steps (13853 resets) in 380 ms. (2624 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 22:20:32] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:20:32] [INFO ] Invariant cache hit.
[2024-06-02 22:20:32] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:20:32] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 22:20:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:20:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:20:32] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 22:20:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:20:32] [INFO ] [Nat]Added 39 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:20:32] [INFO ] Computed and/alt/rep : 119/483/119 causal constraints (skipped 137 transitions) in 14 ms.
[2024-06-02 22:20:32] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 22:20:32] [INFO ] Added : 77 causal constraints over 17 iterations in 369 ms. Result :sat
Minimization took 83 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 106/106 places, 287/287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 22:20:32] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:20:32] [INFO ] Invariant cache hit.
[2024-06-02 22:20:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 22:20:33] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:20:33] [INFO ] Invariant cache hit.
[2024-06-02 22:20:33] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:20:33] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-02 22:20:33] [INFO ] Redundant transitions in 1 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 22:20:33] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:20:33] [INFO ] Invariant cache hit.
[2024-06-02 22:20:33] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:20:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:20:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 258/363 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:20:39] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:20:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:20:41] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 11 (OVERLAPS) 1/364 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 13 (OVERLAPS) 0/364 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 163 constraints, problems are : Problem set: 0 solved, 285 unsolved in 14444 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 258/363 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 285/447 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 1/364 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:20:58] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 13 (OVERLAPS) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 449 constraints, problems are : Problem set: 0 solved, 285 unsolved in 21787 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 11/11 constraints]
After SMT, in 36403ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 36405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36754 ms. Remains : 106/106 places, 287/287 transitions.
RANDOM walk for 40000 steps (2321 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (554 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (558 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1053476 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 2
Probabilistic random walk after 1053476 steps, saw 233333 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-06-02 22:21:12] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:21:12] [INFO ] Invariant cache hit.
[2024-06-02 22:21:12] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/273 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/275 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 83/358 variables, 39/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/364 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/364 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/273 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/275 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 83/358 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/364 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/364 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 106/106 places, 287/287 transitions.
RANDOM walk for 40000 steps (2313 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (548 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (551 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1049556 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 2
Probabilistic random walk after 1049556 steps, saw 232052 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
[2024-06-02 22:21:16] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:21:16] [INFO ] Invariant cache hit.
[2024-06-02 22:21:16] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/273 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/275 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 83/358 variables, 39/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/364 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/364 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/172 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/273 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/275 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 83/358 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/364 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/364 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 106/106 places, 287/287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 22:21:16] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:21:16] [INFO ] Invariant cache hit.
[2024-06-02 22:21:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:21:16] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:21:16] [INFO ] Invariant cache hit.
[2024-06-02 22:21:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:21:16] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 22:21:17] [INFO ] Redundant transitions in 1 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 22:21:17] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 22:21:17] [INFO ] Invariant cache hit.
[2024-06-02 22:21:17] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:21:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:21:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:21:19] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:21:19] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:21:19] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:21:19] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:21:20] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 258/363 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:21:22] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:21:23] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:21:25] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 11 (OVERLAPS) 1/364 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 13 (OVERLAPS) 0/364 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 163 constraints, problems are : Problem set: 0 solved, 285 unsolved in 14520 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 258/363 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 285/447 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 1/364 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 22:21:42] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 13 (OVERLAPS) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 449 constraints, problems are : Problem set: 0 solved, 285 unsolved in 22569 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 11/11 constraints]
After SMT, in 37246ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 37249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37599 ms. Remains : 106/106 places, 287/287 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 106 vertex of which 29 / 106 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 80 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 157
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 8 place count 79 transition count 156
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 9 place count 79 transition count 155
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 11 place count 78 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 77 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 77 transition count 131
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 77 transition count 126
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 74 transition count 125
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 74 transition count 125
Applied a total of 22 rules in 20 ms. Remains 74 /106 variables (removed 32) and now considering 125/287 (removed 162) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:21:54] [INFO ] Flow matrix only has 123 transitions (discarded 2 similar events)
// Phase 1: matrix 123 rows 74 cols
[2024-06-02 22:21:54] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:21:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:21:54] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:21:54] [INFO ] After 133ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 22:21:54] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 206 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-08-UpperBounds-05 in 84479 ms.
[2024-06-02 22:21:54] [INFO ] Flatten gal took : 161 ms
[2024-06-02 22:21:54] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-02 22:21:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 302 transitions and 1125 arcs took 4 ms.
Total runtime 350641 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 111
TRANSITIONS: 302
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]


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


----------------------------------------------------------------------
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: 1346
MODEL NAME: /home/mcc/execution/412/model
111 places, 302 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-08-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366916136

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-08"
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-08, 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-171734898100229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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