About the Execution of LTSMin+red for FireWire-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
689.939 | 62329.00 | 175485.00 | 118.50 | T | 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.r564-tall-171734907600107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-01, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907600107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-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 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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 booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1717361544039
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:52:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 20:52:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:25] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 20:52:25] [INFO ] Transformed 107 places.
[2024-06-02 20:52:25] [INFO ] Transformed 346 transitions.
[2024-06-02 20:52:25] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:25] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 199 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 107/107 places, 346/346 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 107 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 106 transition count 292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 106 transition count 291
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 105 transition count 291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 104 transition count 290
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 65 place count 101 transition count 296
Applied a total of 65 rules in 66 ms. Remains 101 /107 variables (removed 6) and now considering 296/346 (removed 50) transitions.
[2024-06-02 20:52:25] [INFO ] Flow matrix only has 254 transitions (discarded 42 similar events)
// Phase 1: matrix 254 rows 101 cols
[2024-06-02 20:52:25] [INFO ] Computed 8 invariants in 26 ms
[2024-06-02 20:52:25] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-02 20:52:25] [INFO ] Flow matrix only has 254 transitions (discarded 42 similar events)
[2024-06-02 20:52:25] [INFO ] Invariant cache hit.
[2024-06-02 20:52:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:52:26] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 547 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 100/107 places, 296/346 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 637 ms. Remains : 100/107 places, 296/346 transitions.
Discarding 102 transitions out of 296. Remains 194
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2475 resets) in 1610 ms. (24 steps per ms) remains 83/193 properties
BEST_FIRST walk for 4003 steps (210 resets) in 47 ms. (83 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (195 resets) in 77 ms. (51 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (25 resets) in 47 ms. (83 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (81 resets) in 52 ms. (75 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4001 steps (215 resets) in 82 ms. (48 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (72 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (62 resets) in 27 ms. (142 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4001 steps (136 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (74 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 76/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (68 resets) in 13 ms. (286 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (156 resets) in 21 ms. (181 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (212 resets) in 20 ms. (190 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (63 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (59 resets) in 20 ms. (190 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (144 resets) in 17 ms. (222 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (72 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 73/76 properties
BEST_FIRST walk for 4004 steps (68 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (129 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (67 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (10 resets) in 36 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (64 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (145 resets) in 23 ms. (166 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (65 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (62 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (132 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (65 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 72/73 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 70/72 properties
BEST_FIRST walk for 4003 steps (62 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (159 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (61 resets) in 14 ms. (266 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 67/70 properties
BEST_FIRST walk for 4001 steps (137 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (139 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (67 resets) in 12 ms. (308 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (59 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4002 steps (52 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (135 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (73 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (61 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (150 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (63 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (137 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (73 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (60 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (144 resets) in 38 ms. (102 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (63 resets) in 10 ms. (364 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (62 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (64 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
[2024-06-02 20:52:27] [INFO ] Flow matrix only has 254 transitions (discarded 42 similar events)
// Phase 1: matrix 254 rows 100 cols
[2024-06-02 20:52:27] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:52:27] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 46/96 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 20:52:27] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 9 ms to minimize.
[2024-06-02 20:52:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
[2024-06-02 20:52:28] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 2/98 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 252/350 variables, 98/206 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 40/246 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 3/353 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 1/354 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 0/354 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 252 constraints, problems are : Problem set: 0 solved, 66 unsolved in 4748 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 46/96 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 2/98 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 252/350 variables, 98/206 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 40/246 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 64/310 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 20:52:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 3/353 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 20:52:36] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/353 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/354 variables, and 319 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5021 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints]
After SMT, in 9863ms problems are : Problem set: 0 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 100 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 100 transition count 278
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 100 transition count 281
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 25 place count 98 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 98 transition count 276
Applied a total of 27 rules in 49 ms. Remains 98 /100 variables (removed 2) and now considering 276/296 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 98/100 places, 276/296 transitions.
RANDOM walk for 4000000 steps (240761 resets) in 21076 ms. (189 steps per ms) remains 36/66 properties
BEST_FIRST walk for 400004 steps (6350 resets) in 937 ms. (426 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (13995 resets) in 631 ms. (632 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (300 resets) in 747 ms. (534 steps per ms) remains 33/36 properties
BEST_FIRST walk for 400004 steps (14087 resets) in 605 ms. (660 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (521 resets) in 831 ms. (480 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6336 resets) in 526 ms. (759 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (14134 resets) in 629 ms. (634 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6370 resets) in 516 ms. (773 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (228 resets) in 823 ms. (485 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6223 resets) in 551 ms. (724 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (14203 resets) in 629 ms. (634 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6629 resets) in 513 ms. (778 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (261 resets) in 738 ms. (541 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (6123 resets) in 556 ms. (718 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400000 steps (14096 resets) in 634 ms. (629 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6507 resets) in 554 ms. (720 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (364 resets) in 743 ms. (537 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6391 resets) in 528 ms. (756 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (265 resets) in 811 ms. (492 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (6253 resets) in 751 ms. (531 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (14064 resets) in 1332 ms. (300 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6506 resets) in 675 ms. (591 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (240 resets) in 1286 ms. (310 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6472 resets) in 675 ms. (591 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (181 resets) in 1007 ms. (396 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6555 resets) in 697 ms. (573 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (182 resets) in 1042 ms. (383 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (6253 resets) in 733 ms. (544 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (14150 resets) in 814 ms. (490 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6531 resets) in 751 ms. (531 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (178 resets) in 979 ms. (408 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (6225 resets) in 707 ms. (564 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (435 resets) in 791 ms. (505 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (14143 resets) in 811 ms. (492 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6165 resets) in 763 ms. (523 steps per ms) remains 32/33 properties
[2024-06-02 20:52:52] [INFO ] Flow matrix only has 247 transitions (discarded 29 similar events)
// Phase 1: matrix 247 rows 98 cols
[2024-06-02 20:52:52] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:52:52] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 67/92 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 67/97 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 4/96 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 246/342 variables, 96/204 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 40/244 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 3/345 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (OVERLAPS) 0/345 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 249 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2017 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 67/92 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 67/97 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 4/96 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 246/342 variables, 96/204 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 40/244 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 32/276 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 3/345 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (OVERLAPS) 0/345 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 281 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2077 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
After SMT, in 4131ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 1658 ms.
Support contains 25 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 276/276 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 275
Applied a total of 1 rules in 25 ms. Remains 97 /98 variables (removed 1) and now considering 275/276 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 97/98 places, 275/276 transitions.
RANDOM walk for 4000000 steps (256775 resets) in 22923 ms. (174 steps per ms) remains 28/32 properties
BEST_FIRST walk for 400004 steps (6300 resets) in 557 ms. (716 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (14660 resets) in 1054 ms. (379 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (456 resets) in 706 ms. (565 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (6408 resets) in 493 ms. (809 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (14688 resets) in 546 ms. (731 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6377 resets) in 457 ms. (873 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (203 resets) in 768 ms. (520 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6034 resets) in 455 ms. (877 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (14634 resets) in 552 ms. (723 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (6760 resets) in 470 ms. (849 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (288 resets) in 673 ms. (593 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (6278 resets) in 495 ms. (806 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (14681 resets) in 537 ms. (743 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6557 resets) in 475 ms. (840 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (232 resets) in 915 ms. (436 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (6495 resets) in 499 ms. (800 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (305 resets) in 754 ms. (529 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (6389 resets) in 489 ms. (816 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (6517 resets) in 515 ms. (775 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (6383 resets) in 492 ms. (811 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (6632 resets) in 506 ms. (788 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (208 resets) in 986 ms. (405 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6387 resets) in 500 ms. (798 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (14403 resets) in 597 ms. (668 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (6547 resets) in 506 ms. (788 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (166 resets) in 935 ms. (427 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6266 resets) in 495 ms. (806 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6583 resets) in 491 ms. (813 steps per ms) remains 28/28 properties
[2024-06-02 20:53:10] [INFO ] Flow matrix only has 246 transitions (discarded 29 similar events)
// Phase 1: matrix 246 rows 97 cols
[2024-06-02 20:53:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:53:10] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 68/91 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 20:53:11] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-02 20:53:11] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:53:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 243/334 variables, 91/190 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 40/230 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 8/342 variables, 5/235 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 1/343 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 0/343 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 244 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1824 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 68/91 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 20:53:12] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 243/334 variables, 91/191 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 40/231 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 28/259 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 8/342 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 1/343 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/343 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (OVERLAPS) 0/343 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 273 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2598 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 4/4 constraints]
After SMT, in 4461ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 1 properties in 1334 ms.
Support contains 23 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 275/275 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 97/97 places, 275/275 transitions.
RANDOM walk for 4000000 steps (255581 resets) in 16098 ms. (248 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (6527 resets) in 493 ms. (809 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (14587 resets) in 533 ms. (749 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (240 resets) in 898 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (6402 resets) in 501 ms. (796 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (14871 resets) in 563 ms. (709 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (6652 resets) in 456 ms. (875 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (151 resets) in 845 ms. (472 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (6272 resets) in 473 ms. (843 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (14662 resets) in 561 ms. (711 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (6771 resets) in 506 ms. (788 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (285 resets) in 866 ms. (461 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (6230 resets) in 474 ms. (842 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (14645 resets) in 560 ms. (713 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (6503 resets) in 479 ms. (833 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (237 resets) in 778 ms. (513 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (6736 resets) in 498 ms. (801 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (409 resets) in 690 ms. (578 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (6301 resets) in 473 ms. (843 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400004 steps (6562 resets) in 474 ms. (842 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6206 resets) in 459 ms. (869 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6343 resets) in 458 ms. (871 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (245 resets) in 700 ms. (570 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (6484 resets) in 496 ms. (804 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6552 resets) in 446 ms. (894 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6497 resets) in 469 ms. (851 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6544 resets) in 482 ms. (828 steps per ms) remains 25/25 properties
Finished probabilistic random walk after 113642 steps, run visited all 25 properties in 305 ms. (steps per millisecond=372 )
Probabilistic random walk after 113642 steps, saw 27102 distinct states, run finished after 310 ms. (steps per millisecond=366 ) properties seen :25
Able to resolve query QuasiLiveness after proving 194 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 61028 ms.
ITS solved all properties within timeout
BK_STOP 1717361606368
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-01"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-01, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r564-tall-171734907600107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-01.tgz
mv FireWire-PT-01 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;