About the Execution of GreatSPN+red for MedleyA-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 813.831 | 67749.00 | 197550.00 | 186.00 | 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.r586-smll-171734923800072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-15, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923800072
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K 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 110K 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 1717352311115
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:18:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:18:33] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-06-02 18:18:34] [INFO ] Transformed 192 places.
[2024-06-02 18:18:34] [INFO ] Transformed 475 transitions.
[2024-06-02 18:18:34] [INFO ] Found NUPN structural information;
[2024-06-02 18:18:34] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 499 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 192/192 places, 475/475 transitions.
Graph (trivial) has 227 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 9 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 186 transition count 438
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 157 transition count 436
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 61 place count 157 transition count 430
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 73 place count 151 transition count 430
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 147 place count 114 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 152 place count 114 transition count 388
Performed 43 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 238 place count 71 transition count 601
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 270 place count 71 transition count 569
Applied a total of 270 rules in 224 ms. Remains 71 /192 variables (removed 121) and now considering 569/475 (removed -94) transitions.
[2024-06-02 18:18:34] [INFO ] Flow matrix only has 440 transitions (discarded 129 similar events)
// Phase 1: matrix 440 rows 71 cols
[2024-06-02 18:18:34] [INFO ] Computed 7 invariants in 51 ms
[2024-06-02 18:18:34] [INFO ] Implicit Places using invariants in 572 ms returned [21, 40]
[2024-06-02 18:18:34] [INFO ] Actually due to overlaps returned [40]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 660 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 70/192 places, 567/475 transitions.
Graph (trivial) has 84 edges and 70 vertex of which 8 / 70 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Applied a total of 1 rules in 12 ms. Remains 66 /70 variables (removed 4) and now considering 515/567 (removed 52) transitions.
[2024-06-02 18:18:35] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
// Phase 1: matrix 357 rows 66 cols
[2024-06-02 18:18:35] [INFO ] Computed 6 invariants in 10 ms
[2024-06-02 18:18:35] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-02 18:18:35] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
[2024-06-02 18:18:35] [INFO ] Invariant cache hit.
[2024-06-02 18:18:35] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 18:18:35] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 66/192 places, 515/475 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1732 ms. Remains : 66/192 places, 515/475 transitions.
Discarding 335 transitions out of 515. Remains 180
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6530 resets) in 3168 ms. (12 steps per ms) remains 82/179 properties
BEST_FIRST walk for 4003 steps (147 resets) in 73 ms. (54 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (159 resets) in 48 ms. (81 steps per ms) remains 80/82 properties
BEST_FIRST walk for 4002 steps (156 resets) in 34 ms. (114 steps per ms) remains 79/80 properties
BEST_FIRST walk for 4003 steps (151 resets) in 52 ms. (75 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4004 steps (151 resets) in 60 ms. (65 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (143 resets) in 38 ms. (102 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4002 steps (169 resets) in 15 ms. (250 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4004 steps (284 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (162 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (173 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (145 resets) in 29 ms. (133 steps per ms) remains 75/78 properties
BEST_FIRST walk for 4004 steps (156 resets) in 38 ms. (102 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (154 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (156 resets) in 12 ms. (308 steps per ms) remains 74/75 properties
BEST_FIRST walk for 4004 steps (133 resets) in 24 ms. (160 steps per ms) remains 72/74 properties
BEST_FIRST walk for 4001 steps (162 resets) in 33 ms. (117 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (150 resets) in 18 ms. (210 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (158 resets) in 21 ms. (181 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (154 resets) in 21 ms. (181 steps per ms) remains 71/72 properties
BEST_FIRST walk for 4003 steps (169 resets) in 20 ms. (190 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (150 resets) in 22 ms. (174 steps per ms) remains 69/71 properties
BEST_FIRST walk for 4004 steps (158 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (146 resets) in 17 ms. (222 steps per ms) remains 67/69 properties
BEST_FIRST walk for 4002 steps (149 resets) in 39 ms. (100 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (159 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (135 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (151 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (147 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (147 resets) in 16 ms. (235 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4002 steps (167 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (148 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (152 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (149 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (148 resets) in 19 ms. (200 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4003 steps (157 resets) in 11 ms. (333 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4002 steps (163 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (162 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (166 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (161 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (156 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (152 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (134 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (160 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (149 resets) in 18 ms. (210 steps per ms) remains 61/63 properties
BEST_FIRST walk for 4003 steps (158 resets) in 17 ms. (222 steps per ms) remains 58/61 properties
BEST_FIRST walk for 4004 steps (160 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (147 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (164 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (166 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (157 resets) in 16 ms. (235 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (168 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (154 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (165 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (165 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (154 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (146 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (164 resets) in 46 ms. (85 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4002 steps (158 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (152 resets) in 16 ms. (235 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (139 resets) in 17 ms. (222 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (163 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (158 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (155 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (160 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
[2024-06-02 18:18:37] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
[2024-06-02 18:18:37] [INFO ] Invariant cache hit.
[2024-06-02 18:18:37] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 24/66 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:18:38] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 356/422 variables, 66/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 62/201 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:18:40] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 1/423 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 4 ms to minimize.
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
SMT process timed out in 5207ms, After SMT, problems are : Problem set: 0 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 515/515 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 66 transition count 484
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 61 transition count 450
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 61 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 164 transitions
Redundant transition composition rules discarded 164 transitions
Iterating global reduction 1 with 164 rules applied. Total rules applied 205 place count 61 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 60 transition count 285
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 214 place count 60 transition count 278
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 221 place count 53 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 52 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 51 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 3 with 86 rules applied. Total rules applied 309 place count 51 transition count 191
Applied a total of 309 rules in 124 ms. Remains 51 /66 variables (removed 15) and now considering 191/515 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 51/66 places, 191/515 transitions.
RANDOM walk for 4000000 steps (96 resets) in 27285 ms. (146 steps per ms) remains 52/54 properties
BEST_FIRST walk for 400003 steps (83 resets) in 2671 ms. (149 steps per ms) remains 49/52 properties
BEST_FIRST walk for 400000 steps (45 resets) in 2655 ms. (150 steps per ms) remains 47/49 properties
BEST_FIRST walk for 400000 steps (180 resets) in 2460 ms. (162 steps per ms) remains 40/47 properties
BEST_FIRST walk for 400001 steps (141 resets) in 2000 ms. (199 steps per ms) remains 36/40 properties
BEST_FIRST walk for 400000 steps (92 resets) in 2098 ms. (190 steps per ms) remains 33/36 properties
BEST_FIRST walk for 400000 steps (371 resets) in 1812 ms. (220 steps per ms) remains 26/33 properties
BEST_FIRST walk for 400002 steps (65 resets) in 1269 ms. (314 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (183 resets) in 1789 ms. (223 steps per ms) remains 24/26 properties
BEST_FIRST walk for 400000 steps (60 resets) in 2384 ms. (167 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (324 resets) in 1953 ms. (204 steps per ms) remains 18/24 properties
BEST_FIRST walk for 400001 steps (55 resets) in 2213 ms. (180 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (18 resets) in 1100 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (111 resets) in 1796 ms. (222 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400004 steps (43 resets) in 532 ms. (750 steps per ms) remains 15/17 properties
BEST_FIRST walk for 400000 steps (155 resets) in 1581 ms. (252 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400000 steps (81 resets) in 2225 ms. (179 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (126 resets) in 465 ms. (858 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400001 steps (212 resets) in 1869 ms. (213 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400001 steps (285 resets) in 1341 ms. (298 steps per ms) remains 13/13 properties
[2024-06-02 18:19:04] [INFO ] Flow matrix only has 177 transitions (discarded 14 similar events)
// Phase 1: matrix 177 rows 51 cols
[2024-06-02 18:19:04] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:19:04] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 22/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 119/156 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 68/224 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/228 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 90 constraints, problems are : Problem set: 0 solved, 13 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 22/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 119/156 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 68/224 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 4/228 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:19:06] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:19:06] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 106 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 1843ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 2 properties in 4333 ms.
Support contains 12 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 191/191 transitions.
Graph (trivial) has 28 edges and 51 vertex of which 7 / 51 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 47 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 45 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 44 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 44 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 44 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 42 transition count 183
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 21 place count 42 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 40 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 40 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 39 transition count 171
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 39 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 39 transition count 170
Applied a total of 29 rules in 38 ms. Remains 39 /51 variables (removed 12) and now considering 170/191 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 39/51 places, 170/191 transitions.
RANDOM walk for 4000000 steps (332 resets) in 13458 ms. (297 steps per ms) remains 8/11 properties
BEST_FIRST walk for 3913578 steps (33 resets) in 8525 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3768568 steps (60 resets) in 10020 ms. (376 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3771123 steps (48 resets) in 11500 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3624765 steps (53 resets) in 8198 ms. (442 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000002 steps (50 resets) in 4069 ms. (982 steps per ms) remains 3/7 properties
BEST_FIRST walk for 4000000 steps (262 resets) in 7189 ms. (556 steps per ms) remains 2/3 properties
[2024-06-02 18:19:38] [INFO ] Flow matrix only has 153 transitions (discarded 17 similar events)
// Phase 1: matrix 153 rows 39 cols
[2024-06-02 18:19:38] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:19:38] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/120 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 68/188 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/192 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 24/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 79 constraints, problems are : Problem set: 0 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 35/35 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/120 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 68/188 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:19:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/192 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 24/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:19:38] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/192 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 83 constraints, problems are : Problem set: 0 solved, 2 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1184 steps, including 240 resets, run visited all 2 properties in 15 ms. (steps per millisecond=78 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 27 ms.
Able to resolve query QuasiLiveness after proving 180 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 65301 ms.
ITS solved all properties within timeout
BK_STOP 1717352378864
--------------------
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="MedleyA-PT-15"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-15, 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 r586-smll-171734923800072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 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 ;