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.r553-tall-171734901200229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200229
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:56:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:56:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:56:31] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 18:56:31] [INFO ] Transformed 127 places.
[2024-06-02 18:56:31] [INFO ] Transformed 397 transitions.
[2024-06-02 18:56:31] [INFO ] Found NUPN structural information;
[2024-06-02 18:56:31] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 18:56:31] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 18:56:31] [INFO ] Computed 8 invariants in 23 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 (534 resets) in 61 ms. (161 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-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (1254 resets) in 174 ms. (514 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 18:56:31] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
[2024-06-02 18:56:31] [INFO ] Invariant cache hit.
[2024-06-02 18:56:32] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:56:32] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-02 18:56:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:32] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 18:56:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 18:56:32] [INFO ] [Nat]Added 45 Read/Feed constraints in 26 ms returned sat
[2024-06-02 18:56:32] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 42 ms.
[2024-06-02 18:56:32] [INFO ] Added : 27 causal constraints over 6 iterations in 214 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 18:56:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:32] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 18:56:32] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:56:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:32] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:56:32] [INFO ] [Nat]Added 45 Read/Feed constraints in 27 ms returned sat
[2024-06-02 18:56:32] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 30 ms.
[2024-06-02 18:56:32] [INFO ] Added : 15 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 61 ms.
[2024-06-02 18:56:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:56:33] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 18:56:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:56:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 18:56:33] [INFO ] [Nat]Added 45 Read/Feed constraints in 35 ms returned sat
[2024-06-02 18:56:33] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 36 ms.
[2024-06-02 18:56:33] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 14 ms to minimize.
[2024-06-02 18:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-06-02 18:56:33] [INFO ] Added : 29 causal constraints over 8 iterations in 380 ms. Result :sat
Minimization took 72 ms.
[2024-06-02 18:56:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:33] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 18:56:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:33] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-02 18:56:33] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:56:34] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 31 ms.
[2024-06-02 18:56:34] [INFO ] Added : 38 causal constraints over 8 iterations in 185 ms. Result :sat
Minimization took 78 ms.
[2024-06-02 18:56:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:34] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:56:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:34] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 18:56:34] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 18:56:34] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 22 ms.
[2024-06-02 18:56:34] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:56:34] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:56:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2024-06-02 18:56:34] [INFO ] Added : 33 causal constraints over 8 iterations in 376 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 18:56:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:56:35] [INFO ] [Real]Added 45 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:56:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:35] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:56:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 18:56:35] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 31 ms.
[2024-06-02 18:56:35] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:56:35] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:56:35] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:56:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 251 ms
[2024-06-02 18:56:35] [INFO ] Added : 22 causal constraints over 6 iterations in 407 ms. Result :sat
Minimization took 66 ms.
[2024-06-02 18:56:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:56:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:35] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 18:56:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 29 ms returned sat
[2024-06-02 18:56:35] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 18 ms.
[2024-06-02 18:56:36] [INFO ] Added : 20 causal constraints over 5 iterations in 130 ms. Result :sat
Minimization took 64 ms.
[2024-06-02 18:56:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:56:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Nat]Added 45 Read/Feed constraints in 44 ms returned sat
[2024-06-02 18:56:36] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 21 ms.
[2024-06-02 18:56:36] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Minimization took 58 ms.
[2024-06-02 18:56:36] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:56:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 18:56:36] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:56:36] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 22 ms.
[2024-06-02 18:56:36] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-06-02 18:56:37] [INFO ] Added : 26 causal constraints over 8 iterations in 264 ms. Result :sat
Minimization took 66 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-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 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 133 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 144 ms. Remains : 111/127 places, 302/344 transitions.
[2024-06-02 18:56:37] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 18:56:37] [INFO ] Computed 8 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (58002 resets) in 1197 ms. (834 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000003 steps (84555 resets) in 2349 ms. (2553 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 18:56:41] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:56:41] [INFO ] Invariant cache hit.
[2024-06-02 18:56:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:41] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 18:56:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:41] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:56:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:56:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:56:41] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 19 ms.
[2024-06-02 18:56:41] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:56:41] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:56:41] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:56:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2024-06-02 18:56:41] [INFO ] Added : 59 causal constraints over 14 iterations in 498 ms. Result :sat
Minimization took 92 ms.
[2024-06-02 18:56:41] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:41] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:56:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:41] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:56:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 28 ms returned sat
[2024-06-02 18:56:42] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:56:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2024-06-02 18:56:42] [INFO ] Added : 38 causal constraints over 9 iterations in 431 ms. Result :sat
Minimization took 87 ms.
[2024-06-02 18:56:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:42] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 18:56:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 18:56:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:56:42] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 18:56:42] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 5 ms to minimize.
[2024-06-02 18:56:43] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:56:43] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:56:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2024-06-02 18:56:43] [INFO ] Added : 45 causal constraints over 9 iterations in 424 ms. Result :sat
Minimization took 88 ms.
[2024-06-02 18:56:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Real]Added 42 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:56:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2024-06-02 18:56:43] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 18:56:43] [INFO ] Added : 22 causal constraints over 5 iterations in 96 ms. Result :sat
Minimization took 85 ms.
[2024-06-02 18:56:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Real]Added 42 Read/Feed constraints in 4 ms returned sat
[2024-06-02 18:56:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:56:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:56:43] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 19 ms.
[2024-06-02 18:56:44] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-06-02 18:56:44] [INFO ] Added : 52 causal constraints over 12 iterations in 292 ms. Result :sat
Minimization took 88 ms.
[2024-06-02 18:56:44] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:44] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 18:56:44] [INFO ] [Real]Added 42 Read/Feed constraints in 4 ms returned sat
[2024-06-02 18:56:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:44] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:56:44] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-06-02 18:56:44] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 20 ms.
[2024-06-02 18:56:44] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-02 18:56:44] [INFO ] Added : 37 causal constraints over 9 iterations in 246 ms. Result :sat
Minimization took 79 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 15 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 15 ms. Remains : 111/111 places, 302/302 transitions.
[2024-06-02 18:56:44] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:56:44] [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 (58167 resets) in 1088 ms. (918 steps per ms)
BEST_FIRST walk for 6000005 steps (84679 resets) in 2360 ms. (2541 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 18:56:48] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:56:48] [INFO ] Invariant cache hit.
[2024-06-02 18:56:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:48] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:56:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:48] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:56:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:56:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:56:48] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 18:56:48] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:56:48] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-06-02 18:56:49] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:56:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2024-06-02 18:56:49] [INFO ] Added : 59 causal constraints over 14 iterations in 548 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 18:56:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 18:56:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:56:49] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:56:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2024-06-02 18:56:49] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 19 ms.
[2024-06-02 18:56:49] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:56:49] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:56:49] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:56:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 257 ms
[2024-06-02 18:56:49] [INFO ] Added : 38 causal constraints over 9 iterations in 416 ms. Result :sat
Minimization took 79 ms.
[2024-06-02 18:56:50] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:50] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:50] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 18:56:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:56:50] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 19 ms.
[2024-06-02 18:56:50] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:56:50] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:56:50] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:56:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2024-06-02 18:56:50] [INFO ] Added : 45 causal constraints over 9 iterations in 463 ms. Result :sat
Minimization took 86 ms.
[2024-06-02 18:56:50] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:50] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:56:50] [INFO ] [Real]Added 42 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:50] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:56:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2024-06-02 18:56:50] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 14 ms.
[2024-06-02 18:56:51] [INFO ] Added : 22 causal constraints over 5 iterations in 94 ms. Result :sat
Minimization took 81 ms.
[2024-06-02 18:56:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Real]Added 42 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:56:51] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 18:56:51] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-06-02 18:56:51] [INFO ] Added : 52 causal constraints over 12 iterations in 299 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 18:56:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Real]Added 42 Read/Feed constraints in 5 ms returned sat
[2024-06-02 18:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:56:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 18:56:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-06-02 18:56:51] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 13 ms.
[2024-06-02 18:56:52] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 18:56:52] [INFO ] Added : 37 causal constraints over 9 iterations in 222 ms. Result :sat
Minimization took 73 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 6 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 18:56:52] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:56:52] [INFO ] Invariant cache hit.
[2024-06-02 18:56:52] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:56:52] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:56:52] [INFO ] Invariant cache hit.
[2024-06-02 18:56:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:56:52] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 18:56:52] [INFO ] Redundant transitions in 13 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 18:56:52] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:56:52] [INFO ] Invariant cache hit.
[2024-06-02 18:56:52] [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 18:56:54] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 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 9844 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 18:57:17] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-06-02 18:57:17] [INFO ] Deduced a trap composed of 43 places in 42 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 30012 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 40221ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 40237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40593 ms. Remains : 111/111 places, 302/302 transitions.
RANDOM walk for 40000 steps (2349 resets) in 1142 ms. (34 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (579 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (559 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (607 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (598 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (564 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (552 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (589 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (578 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (549 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (586 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (506 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (561 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 733984 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :6 out of 12
Probabilistic random walk after 733984 steps, saw 163659 distinct states, run finished after 3005 ms. (steps per millisecond=244 ) properties seen :6
[2024-06-02 18:57:37] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:57:37] [INFO ] Invariant cache hit.
[2024-06-02 18:57:37] [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 401 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 2040 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 2448ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 619 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.
RANDOM walk for 40000 steps (2299 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (555 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (585 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (530 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (521 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (570 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (510 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 583337 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 6
Probabilistic random walk after 583337 steps, saw 133769 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-06-02 18:57:43] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:57:43] [INFO ] Invariant cache hit.
[2024-06-02 18:57:43] [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 375 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 373 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 762ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 434 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 18:57:44] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:57:44] [INFO ] Invariant cache hit.
[2024-06-02 18:57:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:57:44] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:57:44] [INFO ] Invariant cache hit.
[2024-06-02 18:57:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:57:44] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 18:57:44] [INFO ] Redundant transitions in 4 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 18:57:44] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:57:44] [INFO ] Invariant cache hit.
[2024-06-02 18:57:44] [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 18:57:45] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:57:45] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 14 ms to minimize.
[2024-06-02 18:57:47] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:57:47] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 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 9770 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 18:58:08] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:58:08] [INFO ] Deduced a trap composed of 43 places in 55 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 29714 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 39690ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 39694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39952 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 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 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 38 ms. Remains 79 /111 variables (removed 32) and now considering 137/302 (removed 165) transitions.
Running SMT prover for 6 properties.
[2024-06-02 18:58:24] [INFO ] Flow matrix only has 135 transitions (discarded 2 similar events)
// Phase 1: matrix 135 rows 79 cols
[2024-06-02 18:58:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:58:24] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 18:58:24] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 18:58:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:58:24] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-02 18:58:24] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-02 18:58:24] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 320 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 18:58:24] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 18:58:24] [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 (584 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (155 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:58:24] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:58:24] [INFO ] Invariant cache hit.
[2024-06-02 18:58:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:58:24] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:58:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:58:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:58:25] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:58:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:58:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:58:25] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 20 ms.
[2024-06-02 18:58:25] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:58:25] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 5 ms to minimize.
[2024-06-02 18:58:25] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:58:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2024-06-02 18:58:25] [INFO ] Added : 59 causal constraints over 14 iterations in 503 ms. Result :sat
Minimization took 93 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 12 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 12 ms. Remains : 103/111 places, 280/300 transitions.
[2024-06-02 18:58:25] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
// Phase 1: matrix 251 rows 103 cols
[2024-06-02 18:58:25] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57957 resets) in 1097 ms. (910 steps per ms)
BEST_FIRST walk for 1000001 steps (14197 resets) in 421 ms. (2369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:58:27] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:58:27] [INFO ] Invariant cache hit.
[2024-06-02 18:58:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:58:27] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:58:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:58:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:58:27] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 18:58:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:58:27] [INFO ] [Nat]Added 38 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:58:27] [INFO ] Computed and/alt/rep : 115/465/115 causal constraints (skipped 134 transitions) in 14 ms.
[2024-06-02 18:58:27] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-06-02 18:58:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 18:58:27] [INFO ] Added : 45 causal constraints over 10 iterations in 228 ms. Result :sat
Minimization took 74 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 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 5 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 18:58:27] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:58:27] [INFO ] Invariant cache hit.
[2024-06-02 18:58:27] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 18:58:27] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:58:27] [INFO ] Invariant cache hit.
[2024-06-02 18:58:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:58:28] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-06-02 18:58:28] [INFO ] Redundant transitions in 3 ms returned []
Running 278 sub problems to find dead transitions.
[2024-06-02 18:58:28] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:58:28] [INFO ] Invariant cache hit.
[2024-06-02 18:58:28] [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 18:58:29] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:58:29] [INFO ] Deduced a trap composed of 15 places in 23 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 18:58:31] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:58:31] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 1 ms to minimize.
[2024-06-02 18:58:31] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-06-02 18:58:32] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:58:32] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-06-02 18:58:32] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:58:32] [INFO ] Deduced a trap composed of 15 places in 62 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 18:58:32] [INFO ] Deduced a trap composed of 35 places in 59 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 18:58:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:58:36] [INFO ] Deduced a trap composed of 15 places in 55 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 13768 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 17359 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 31356ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 31375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31752 ms. Remains : 103/103 places, 280/280 transitions.
RANDOM walk for 40000 steps (2307 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (537 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (517 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1258498 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 2
Probabilistic random walk after 1258498 steps, saw 275798 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
[2024-06-02 18:59:02] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:59:02] [INFO ] Invariant cache hit.
[2024-06-02 18:59:02] [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 187 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 190 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 399ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 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 6 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 6 ms. Remains : 103/103 places, 280/280 transitions.
RANDOM walk for 40000 steps (2378 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (554 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (572 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1092752 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 2
Probabilistic random walk after 1092752 steps, saw 242722 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
[2024-06-02 18:59:06] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:59:06] [INFO ] Invariant cache hit.
[2024-06-02 18:59:06] [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 143 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 204 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 353ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 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 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 4 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 18:59:06] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:59:06] [INFO ] Invariant cache hit.
[2024-06-02 18:59:06] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:59:06] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:59:06] [INFO ] Invariant cache hit.
[2024-06-02 18:59:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:59:06] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-02 18:59:06] [INFO ] Redundant transitions in 1 ms returned []
Running 278 sub problems to find dead transitions.
[2024-06-02 18:59:06] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 18:59:06] [INFO ] Invariant cache hit.
[2024-06-02 18:59:06] [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 18:59:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:59:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 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 18:59:09] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 15 places in 60 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 18:59:10] [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 18:59:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-06-02 18:59:13] [INFO ] Deduced a trap composed of 15 places in 45 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 12589 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 17383 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 30124ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 30128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30413 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 1 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 1 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 18 ms. Remains 71 /103 variables (removed 32) and now considering 120/280 (removed 160) transitions.
Running SMT prover for 2 properties.
[2024-06-02 18:59:36] [INFO ] Flow matrix only has 118 transitions (discarded 2 similar events)
// Phase 1: matrix 118 rows 71 cols
[2024-06-02 18:59:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:59:36] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 18:59:36] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 18:59:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 18:59:36] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 18:59:36] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 18:59:37] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 185 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 72183 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 18:59:37] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 18:59:37] [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 (574 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (138 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:59:37] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 18:59:37] [INFO ] Invariant cache hit.
[2024-06-02 18:59:37] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:59:37] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:59:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:59:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:59:37] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:59:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:59:37] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2024-06-02 18:59:37] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 18:59:37] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:59:37] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:59:37] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:59:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2024-06-02 18:59:37] [INFO ] Added : 38 causal constraints over 9 iterations in 443 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 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 7 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 8 ms. Remains : 111/111 places, 299/299 transitions.
[2024-06-02 18:59:37] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
// Phase 1: matrix 270 rows 111 cols
[2024-06-02 18:59:37] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57755 resets) in 1062 ms. (940 steps per ms)
BEST_FIRST walk for 1000000 steps (14153 resets) in 386 ms. (2583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:59:39] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 18:59:39] [INFO ] Invariant cache hit.
[2024-06-02 18:59:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:59:39] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 18:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:59:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 18:59:39] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:59:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:59:39] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:59:39] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 145 transitions) in 13 ms.
[2024-06-02 18:59:39] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-06-02 18:59:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 18:59:39] [INFO ] Added : 37 causal constraints over 8 iterations in 228 ms. Result :sat
Minimization took 80 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 5 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 3 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-02 18:59:39] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 18:59:39] [INFO ] Invariant cache hit.
[2024-06-02 18:59:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 18:59:39] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 18:59:39] [INFO ] Invariant cache hit.
[2024-06-02 18:59:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:59:40] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-02 18:59:40] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 18:59:40] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 18:59:40] [INFO ] Invariant cache hit.
[2024-06-02 18:59:40] [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 18:59:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:59:41] [INFO ] Deduced a trap composed of 15 places in 31 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 18:59:43] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:59:43] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-06-02 18:59:43] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-06-02 18:59:43] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:59:43] [INFO ] Deduced a trap composed of 32 places in 44 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 18:59:47] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:59:48] [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 15393 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 18706 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 34282ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 34286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34609 ms. Remains : 111/111 places, 299/299 transitions.
RANDOM walk for 40000 steps (2317 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (567 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (535 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1016451 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 2
Probabilistic random walk after 1016451 steps, saw 228878 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
[2024-06-02 19:00:17] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 19:00:17] [INFO ] Invariant cache hit.
[2024-06-02 19:00:17] [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 160 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 169 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 337ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 64 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.
RANDOM walk for 40000 steps (2329 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (564 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (570 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 851852 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 2
Probabilistic random walk after 851852 steps, saw 192656 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
[2024-06-02 19:00:21] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 19:00:21] [INFO ] Invariant cache hit.
[2024-06-02 19:00:21] [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 160 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 181 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 349ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 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 3 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 11 ms. Remains 111 /111 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-02 19:00:21] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 19:00:21] [INFO ] Invariant cache hit.
[2024-06-02 19:00:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 19:00:21] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 19:00:21] [INFO ] Invariant cache hit.
[2024-06-02 19:00:21] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 19:00:21] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 19:00:21] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 19:00:21] [INFO ] Flow matrix only has 270 transitions (discarded 29 similar events)
[2024-06-02 19:00:21] [INFO ] Invariant cache hit.
[2024-06-02 19:00:21] [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 19:00:23] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-02 19:00:23] [INFO ] Deduced a trap composed of 15 places in 27 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 19:00:24] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2024-06-02 19:00:24] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:00:24] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:00:25] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:00:25] [INFO ] Deduced a trap composed of 32 places in 40 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 19:00:29] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:00:29] [INFO ] Deduced a trap composed of 15 places in 60 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 15430 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 18739 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 34366ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 34371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34629 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 1 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 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 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 24 ms. Remains 79 /111 variables (removed 32) and now considering 135/299 (removed 164) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:00:56] [INFO ] Flow matrix only has 133 transitions (discarded 2 similar events)
// Phase 1: matrix 133 rows 79 cols
[2024-06-02 19:00:56] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:00:56] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 19:00:56] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:00:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:00:56] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:00:56] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:00:56] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-06-02 19:00:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
TRAPS : Iteration 1
[2024-06-02 19:00:56] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:00:56] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 270 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 79367 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 19:00:56] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 19:00:56] [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 (551 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (151 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:00:56] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 19:00:56] [INFO ] Invariant cache hit.
[2024-06-02 19:00:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:00:56] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 19:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:00:56] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 19:00:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 19:00:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:00:56] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 19:00:56] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:00:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:00:56] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:00:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 245 ms
[2024-06-02 19:00:57] [INFO ] Added : 45 causal constraints over 9 iterations in 417 ms. Result :sat
Minimization took 95 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 8 ms. Remains : 106/111 places, 287/300 transitions.
[2024-06-02 19:00:57] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
// Phase 1: matrix 258 rows 106 cols
[2024-06-02 19:00:57] [INFO ] Computed 8 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57729 resets) in 1070 ms. (933 steps per ms)
BEST_FIRST walk for 1000001 steps (14093 resets) in 397 ms. (2512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:00:58] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:00:58] [INFO ] Invariant cache hit.
[2024-06-02 19:00:58] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 19:00:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:00:58] [INFO ] [Nat]Added 39 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:00:58] [INFO ] Computed and/alt/rep : 119/483/119 causal constraints (skipped 137 transitions) in 17 ms.
[2024-06-02 19:00:59] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 19:00:59] [INFO ] Added : 77 causal constraints over 17 iterations in 387 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 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 12 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 12 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 6 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 19:00:59] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:00:59] [INFO ] Invariant cache hit.
[2024-06-02 19:00:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:00:59] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:00:59] [INFO ] Invariant cache hit.
[2024-06-02 19:00:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:00:59] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 19:00:59] [INFO ] Redundant transitions in 2 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 19:00:59] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:00:59] [INFO ] Invariant cache hit.
[2024-06-02 19:00:59] [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 19:01:00] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:01:00] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 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 19:01:02] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:01:02] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:01:02] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:01:02] [INFO ] Deduced a trap composed of 21 places in 75 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 19:01:05] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:05] [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 19:01:08] [INFO ] Deduced a trap composed of 15 places in 57 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 14313 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 19:01:25] [INFO ] Deduced a trap composed of 12 places in 62 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 22174 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 36621ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 36625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36864 ms. Remains : 106/106 places, 287/287 transitions.
RANDOM walk for 40000 steps (2329 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (558 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (587 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 996540 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :0 out of 2
Probabilistic random walk after 996540 steps, saw 224771 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
[2024-06-02 19:01:39] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:01:39] [INFO ] Invariant cache hit.
[2024-06-02 19:01:39] [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 156 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 158 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 319ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 41 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 5 ms. Remains : 106/106 places, 287/287 transitions.
RANDOM walk for 40000 steps (2217 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (584 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (581 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 979282 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :0 out of 2
Probabilistic random walk after 979282 steps, saw 220446 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
[2024-06-02 19:01:42] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:01:42] [INFO ] Invariant cache hit.
[2024-06-02 19:01:42] [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 192 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 180 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 389ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 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.
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.
[2024-06-02 19:01:43] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:01:43] [INFO ] Invariant cache hit.
[2024-06-02 19:01:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:01:43] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:01:43] [INFO ] Invariant cache hit.
[2024-06-02 19:01:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:01:43] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-06-02 19:01:43] [INFO ] Redundant transitions in 2 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 19:01:43] [INFO ] Flow matrix only has 258 transitions (discarded 29 similar events)
[2024-06-02 19:01:43] [INFO ] Invariant cache hit.
[2024-06-02 19:01:43] [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 19:01:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:01:44] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 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 19:01:46] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:01:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:01:46] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:01:46] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:01:46] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 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 19:01:49] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:01:49] [INFO ] Deduced a trap composed of 15 places in 45 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 19:01:51] [INFO ] Deduced a trap composed of 15 places in 52 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 14507 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 19:02:09] [INFO ] Deduced a trap composed of 12 places in 61 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 21875 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 36535ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 36540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36764 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 1 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 22 ms. Remains 74 /106 variables (removed 32) and now considering 125/287 (removed 162) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:02:19] [INFO ] Flow matrix only has 123 transitions (discarded 2 similar events)
// Phase 1: matrix 123 rows 74 cols
[2024-06-02 19:02:19] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:02:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 19:02:20] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:02:20] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 19:02:20] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 253 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 83824 ms.
[2024-06-02 19:02:20] [INFO ] Flatten gal took : 57 ms
[2024-06-02 19:02:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-02 19:02:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 302 transitions and 1125 arcs took 11 ms.
Total runtime 349239 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-08-UpperBounds-00
Could not compute solution for formula : FireWire-PT-08-UpperBounds-04
Could not compute solution for formula : FireWire-PT-08-UpperBounds-05

BK_STOP 1717354940742

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FireWire-PT-08-UpperBounds-00
ub formula formula --maxsum=/tmp/1320/ub_0_
ub formula name FireWire-PT-08-UpperBounds-04
ub formula formula --maxsum=/tmp/1320/ub_1_
ub formula name FireWire-PT-08-UpperBounds-05
ub formula formula --maxsum=/tmp/1320/ub_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r553-tall-171734901200229"
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 ;