About the Execution of ITS-Tools for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1709.176 | 157425.00 | 241660.00 | 360.80 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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.r550-tall-171734899000277.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 itstools
Input is FireWire-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-14-UpperBounds-00
FORMULA_NAME FireWire-PT-14-UpperBounds-01
FORMULA_NAME FireWire-PT-14-UpperBounds-02
FORMULA_NAME FireWire-PT-14-UpperBounds-03
FORMULA_NAME FireWire-PT-14-UpperBounds-04
FORMULA_NAME FireWire-PT-14-UpperBounds-05
FORMULA_NAME FireWire-PT-14-UpperBounds-06
FORMULA_NAME FireWire-PT-14-UpperBounds-07
FORMULA_NAME FireWire-PT-14-UpperBounds-08
FORMULA_NAME FireWire-PT-14-UpperBounds-09
FORMULA_NAME FireWire-PT-14-UpperBounds-10
FORMULA_NAME FireWire-PT-14-UpperBounds-11
FORMULA_NAME FireWire-PT-14-UpperBounds-12
FORMULA_NAME FireWire-PT-14-UpperBounds-13
FORMULA_NAME FireWire-PT-14-UpperBounds-14
FORMULA_NAME FireWire-PT-14-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717367016190
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 22:23:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:23:37] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 22:23:37] [INFO ] Transformed 205 places.
[2024-06-02 22:23:37] [INFO ] Transformed 610 transitions.
[2024-06-02 22:23:37] [INFO ] Found NUPN structural information;
[2024-06-02 22:23:37] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 22:23:37] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
// Phase 1: matrix 501 rows 205 cols
[2024-06-02 22:23:37] [INFO ] Computed 10 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (301 resets) in 51 ms. (192 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (282 resets) in 60 ms. (819 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 22:23:37] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
[2024-06-02 22:23:37] [INFO ] Invariant cache hit.
[2024-06-02 22:23:37] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 22:23:38] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-02 22:23:38] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 22:23:38] [INFO ] [Real]Added 73 Read/Feed constraints in 34 ms returned sat
[2024-06-02 22:23:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:23:38] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 22:23:38] [INFO ] [Nat]Added 73 Read/Feed constraints in 86 ms returned sat
[2024-06-02 22:23:38] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 67 ms.
[2024-06-02 22:23:38] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 12 ms to minimize.
[2024-06-02 22:23:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-06-02 22:23:38] [INFO ] Added : 11 causal constraints over 3 iterations in 388 ms. Result :sat
Minimization took 213 ms.
[2024-06-02 22:23:39] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 22:23:39] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-06-02 22:23:39] [INFO ] [Real]Added 73 Read/Feed constraints in 32 ms returned sat
[2024-06-02 22:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:23:39] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-06-02 22:23:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 37 ms returned sat
[2024-06-02 22:23:39] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 57 ms.
[2024-06-02 22:23:40] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-06-02 22:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-06-02 22:23:40] [INFO ] Added : 41 causal constraints over 10 iterations in 576 ms. Result :sat
Minimization took 129 ms.
[2024-06-02 22:23:40] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:23:40] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 22:23:40] [INFO ] [Real]Added 73 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:23:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:23:40] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-02 22:23:40] [INFO ] [Nat]Added 73 Read/Feed constraints in 29 ms returned sat
[2024-06-02 22:23:40] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 44 ms.
[2024-06-02 22:23:41] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-02 22:23:41] [INFO ] Added : 38 causal constraints over 9 iterations in 434 ms. Result :sat
Minimization took 129 ms.
[2024-06-02 22:23:41] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:23:41] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-02 22:23:41] [INFO ] [Real]Added 73 Read/Feed constraints in 29 ms returned sat
[2024-06-02 22:23:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:23:41] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-02 22:23:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 20 ms returned sat
[2024-06-02 22:23:41] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 39 ms.
[2024-06-02 22:23:42] [INFO ] Deduced a trap composed of 24 places in 349 ms of which 2 ms to minimize.
[2024-06-02 22:23:42] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2024-06-02 22:23:42] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2024-06-02 22:23:42] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-06-02 22:23:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 881 ms
[2024-06-02 22:23:42] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2024-06-02 22:23:43] [INFO ] Added : 31 causal constraints over 9 iterations in 1402 ms. Result :sat
Minimization took 141 ms.
[2024-06-02 22:23:43] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:23:43] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 22:23:43] [INFO ] [Real]Added 73 Read/Feed constraints in 39 ms returned sat
[2024-06-02 22:23:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 22:23:43] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-02 22:23:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 41 ms returned sat
[2024-06-02 22:23:43] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 34 ms.
[2024-06-02 22:23:43] [INFO ] Added : 26 causal constraints over 6 iterations in 208 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 533
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 533
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 196 transition count 521
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 193 transition count 509
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 193 transition count 509
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 191 transition count 505
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 189 transition count 499
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 189 transition count 499
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 187 transition count 495
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 185 transition count 489
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 185 transition count 489
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 183 transition count 485
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 181 transition count 479
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 179 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 178 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 178 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 177 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 177 transition count 470
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 174 transition count 467
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 171 transition count 473
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 171 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 89 place count 171 transition count 458
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 171 transition count 464
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 101 place count 168 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 107 place count 168 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 167 transition count 451
Applied a total of 108 rules in 274 ms. Remains 167 /205 variables (removed 38) and now considering 451/539 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 167/205 places, 451/539 transitions.
[2024-06-02 22:23:44] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
// Phase 1: matrix 414 rows 167 cols
[2024-06-02 22:23:44] [INFO ] Computed 10 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (32180 resets) in 1685 ms. (593 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (20536 resets) in 1530 ms. (1959 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:23:47] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:23:47] [INFO ] Invariant cache hit.
[2024-06-02 22:23:47] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 22:23:48] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:23:48] [INFO ] [Real]Added 61 Read/Feed constraints in 19 ms returned sat
[2024-06-02 22:23:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:48] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 22:23:48] [INFO ] [Nat]Added 61 Read/Feed constraints in 29 ms returned sat
[2024-06-02 22:23:48] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 34 ms.
[2024-06-02 22:23:48] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:23:48] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:23:48] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:23:48] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:23:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 349 ms
[2024-06-02 22:23:48] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:23:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-02 22:23:48] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:23:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-02 22:23:49] [INFO ] Added : 36 causal constraints over 11 iterations in 814 ms. Result :sat
Minimization took 116 ms.
[2024-06-02 22:23:49] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 22:23:49] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-02 22:23:49] [INFO ] [Real]Added 61 Read/Feed constraints in 28 ms returned sat
[2024-06-02 22:23:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:49] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 22:23:49] [INFO ] [Nat]Added 61 Read/Feed constraints in 38 ms returned sat
[2024-06-02 22:23:49] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 26 ms.
[2024-06-02 22:23:49] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:23:49] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:23:49] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:23:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 175 ms
[2024-06-02 22:23:49] [INFO ] Added : 18 causal constraints over 4 iterations in 333 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 22:23:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:50] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 22:23:50] [INFO ] [Real]Added 61 Read/Feed constraints in 34 ms returned sat
[2024-06-02 22:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 22:23:50] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-02 22:23:50] [INFO ] [Nat]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:23:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-06-02 22:23:50] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 22 ms.
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:23:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-06-02 22:23:50] [INFO ] Added : 33 causal constraints over 8 iterations in 396 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 451/451 transitions.
Applied a total of 0 rules in 14 ms. Remains 167 /167 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 167/167 places, 451/451 transitions.
[2024-06-02 22:23:50] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:23:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (32251 resets) in 1690 ms. (591 steps per ms)
BEST_FIRST walk for 3000003 steps (20491 resets) in 1562 ms. (1919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:23:54] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:23:54] [INFO ] Invariant cache hit.
[2024-06-02 22:23:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:54] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 22:23:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:23:54] [INFO ] [Real]Added 61 Read/Feed constraints in 22 ms returned sat
[2024-06-02 22:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:54] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 22:23:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 30 ms returned sat
[2024-06-02 22:23:54] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 29 ms.
[2024-06-02 22:23:54] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:23:54] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:23:54] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:23:54] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:23:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-02 22:23:55] [INFO ] Added : 36 causal constraints over 11 iterations in 842 ms. Result :sat
Minimization took 128 ms.
[2024-06-02 22:23:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:55] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 22:23:55] [INFO ] [Real]Added 61 Read/Feed constraints in 32 ms returned sat
[2024-06-02 22:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:55] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 22:23:55] [INFO ] [Nat]Added 61 Read/Feed constraints in 40 ms returned sat
[2024-06-02 22:23:55] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 25 ms.
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2024-06-02 22:23:56] [INFO ] Added : 18 causal constraints over 4 iterations in 340 ms. Result :sat
Minimization took 114 ms.
[2024-06-02 22:23:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:23:56] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 22:23:56] [INFO ] [Real]Added 61 Read/Feed constraints in 35 ms returned sat
[2024-06-02 22:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:23:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 22:23:56] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 22:23:56] [INFO ] [Nat]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-06-02 22:23:56] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 24 ms.
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2024-06-02 22:23:57] [INFO ] Added : 33 causal constraints over 8 iterations in 399 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 451/451 transitions.
Applied a total of 0 rules in 19 ms. Remains 167 /167 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 167/167 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 167 /167 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-02 22:23:57] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:23:57] [INFO ] Invariant cache hit.
[2024-06-02 22:23:57] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-02 22:23:57] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:23:57] [INFO ] Invariant cache hit.
[2024-06-02 22:23:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:23:57] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [18, 66, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 629 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/167 places, 451/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 650 ms. Remains : 164/167 places, 451/451 transitions.
[2024-06-02 22:23:57] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
// Phase 1: matrix 414 rows 164 cols
[2024-06-02 22:23:57] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (32122 resets) in 1545 ms. (646 steps per ms)
BEST_FIRST walk for 3000002 steps (20486 resets) in 1416 ms. (2117 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:24:00] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:24:00] [INFO ] Invariant cache hit.
[2024-06-02 22:24:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:24:00] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 22:24:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:24:00] [INFO ] [Real]Added 61 Read/Feed constraints in 26 ms returned sat
[2024-06-02 22:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:24:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:24:01] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 22:24:01] [INFO ] [Nat]Added 61 Read/Feed constraints in 30 ms returned sat
[2024-06-02 22:24:01] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 4 ms to minimize.
[2024-06-02 22:24:01] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-06-02 22:24:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-06-02 22:24:01] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 23 ms.
[2024-06-02 22:24:01] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 22:24:01] [INFO ] Added : 32 causal constraints over 8 iterations in 271 ms. Result :sat
Minimization took 165 ms.
[2024-06-02 22:24:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 22:24:01] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 22:24:01] [INFO ] [Real]Added 61 Read/Feed constraints in 32 ms returned sat
[2024-06-02 22:24:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:24:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:24:01] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 22:24:02] [INFO ] [Nat]Added 61 Read/Feed constraints in 27 ms returned sat
[2024-06-02 22:24:02] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 22:24:02] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 20 ms.
[2024-06-02 22:24:02] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:24:02] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:24:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-06-02 22:24:02] [INFO ] Added : 26 causal constraints over 7 iterations in 376 ms. Result :sat
Minimization took 150 ms.
[2024-06-02 22:24:02] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:24:02] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 22:24:02] [INFO ] [Real]Added 61 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:24:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:24:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:24:02] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 22:24:02] [INFO ] [Nat]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 22:24:02] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 23 ms.
[2024-06-02 22:24:03] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:24:03] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2024-06-02 22:24:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2024-06-02 22:24:03] [INFO ] Added : 24 causal constraints over 6 iterations in 312 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/164 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-02 22:24:03] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:24:03] [INFO ] Invariant cache hit.
[2024-06-02 22:24:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 22:24:03] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:24:03] [INFO ] Invariant cache hit.
[2024-06-02 22:24:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 22:24:03] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-02 22:24:03] [INFO ] Redundant transitions in 27 ms returned []
Running 445 sub problems to find dead transitions.
[2024-06-02 22:24:03] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:24:03] [INFO ] Invariant cache hit.
[2024-06-02 22:24:03] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 22:24:06] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:24:06] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:24:06] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:24:06] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:24:07] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 3 ms to minimize.
[2024-06-02 22:24:07] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:24:07] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:24:07] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:24:07] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:24:08] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:24:08] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:24:08] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:24:08] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (OVERLAPS) 414/578 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 22:24:14] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:24:16] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 3 ms to minimize.
[2024-06-02 22:24:16] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 22:24:17] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:24:19] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 22:24:24] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:24:26] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 22:24:27] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/578 variables, and 253 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 22:24:36] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 414/578 variables, 164/193 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 61/254 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 445/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 8 (OVERLAPS) 0/578 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 699 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 22/22 constraints]
After SMT, in 60638ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60652ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61060 ms. Remains : 164/164 places, 451/451 transitions.
RANDOM walk for 40000 steps (1298 resets) in 1535 ms. (26 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (279 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
[2024-06-02 22:25:05] [INFO ] Flatten gal took : 160 ms
BEST_FIRST walk for 40004 steps (306 resets) in 136 ms. (292 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
[2024-06-02 22:25:05] [INFO ] Flatten gal took : 80 ms
BEST_FIRST walk for 40003 steps (285 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
[2024-06-02 22:25:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10162042810126701803.gal : 13 ms
[2024-06-02 22:25:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9077881650636589688.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10162042810126701803.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9077881650636589688.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (271 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality9077881650636589688.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 3
BEST_FIRST walk for 40002 steps (260 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :18 after 48
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :48 after 93
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :93 after 122
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :122 after 163
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :163 after 449
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :449 after 2821
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2821 after 13980
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :13980 after 17320
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :17320 after 29214
Interrupted probabilistic random walk after 453868 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 6
Probabilistic random walk after 453868 steps, saw 134966 distinct states, run finished after 3005 ms. (steps per millisecond=151 ) properties seen :0
[2024-06-02 22:25:08] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 22:25:08] [INFO ] Invariant cache hit.
[2024-06-02 22:25:08] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 91/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 273/366 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 119/485 variables, 21/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 41/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/486 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :29214 after 179047
At refinement iteration 12 (OVERLAPS) 83/569 variables, 43/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/569 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/569 variables, 20/225 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/569 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/577 variables, 5/230 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/577 variables, 1/231 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/578 variables, 1/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/578 variables, 0/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 232 constraints, problems are : Problem set: 2 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 198/393 variables, 16/67 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 1/68 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 22/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/93 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 166/560 variables, 85/179 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 2/181 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 39/220 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/220 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/576 variables, 10/230 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/576 variables, 2/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/576 variables, 0/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/578 variables, 2/234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/578 variables, 0/234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/578 variables, 0/234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 234 constraints, problems are : Problem set: 2 solved, 2 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 160 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 160 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 159 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 159 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 158 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 158 transition count 438
Applied a total of 12 rules in 14 ms. Remains 158 /164 variables (removed 6) and now considering 438/451 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 158/164 places, 438/451 transitions.
RANDOM walk for 40000 steps (1299 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (280 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (254 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :179047 after 258376
Interrupted probabilistic random walk after 620196 steps, run timeout after 3009 ms. (steps per millisecond=206 ) properties seen :0 out of 2
Probabilistic random walk after 620196 steps, saw 183313 distinct states, run finished after 3010 ms. (steps per millisecond=206 ) properties seen :0
[2024-06-02 22:25:12] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
// Phase 1: matrix 401 rows 158 cols
[2024-06-02 22:25:12] [INFO ] Computed 7 invariants in 11 ms
[2024-06-02 22:25:12] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/541 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/557 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/559 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/382 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/541 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/557 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/559 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/559 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/559 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 551ms 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 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 158/158 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2024-06-02 22:25:12] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2024-06-02 22:25:12] [INFO ] Invariant cache hit.
[2024-06-02 22:25:12] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 22:25:12] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2024-06-02 22:25:12] [INFO ] Invariant cache hit.
[2024-06-02 22:25:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:25:13] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-06-02 22:25:13] [INFO ] Redundant transitions in 4 ms returned []
Running 432 sub problems to find dead transitions.
[2024-06-02 22:25:13] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2024-06-02 22:25:13] [INFO ] Invariant cache hit.
[2024-06-02 22:25:13] [INFO ] State equation strengthened by 60 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :258376 after 872270
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 22:25:14] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:25:15] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:25:16] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:25:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:25:17] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :872270 after 2.03753e+06
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 22:25:24] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 22:25:25] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:25:28] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.03753e+06 after 1.5616e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 22:25:34] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 fixpoint passes
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/179 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.25709e+08,42.431,882692,2,19396,26,1.67026e+06,6,0,1107,2.45859e+06,0
Total reachable state count : 125708938
Verifying 6 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,77,42.4362,882692,2,304,26,1.67026e+06,7,0,1110,2.45859e+06,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,77,42.4395,882692,2,304,26,1.67026e+06,8,0,1111,2.45859e+06,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,10376,42.44,882692,2,844,26,1.67026e+06,9,0,1113,2.45859e+06,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,10376,42.4404,882692,2,844,26,1.67026e+06,10,0,1114,2.45859e+06,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1,42.4414,882692,2,165,26,1.67026e+06,11,0,1116,2.45859e+06,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1,42.4427,882692,2,165,26,1.67026e+06,12,0,1117,2.45859e+06,0
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 432/671 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 22:25:59] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/559 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 672 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 15/15 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60797 ms. Remains : 158/158 places, 438/438 transitions.
FORMULA FireWire-PT-14-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-14-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-14-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 156253 ms.
BK_STOP 1717367173615
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-14, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899000277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;