Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r140-smll-174876533500132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r140-smll-174876533500132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 110K May 29 14:32 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 1748928484357

Invoking MCC driver with
BK_TOOL=gold2024
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
[2025-06-03 05:28:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-03 05:28:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:28:06] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-06-03 05:28:06] [INFO ] Transformed 192 places.
[2025-06-03 05:28:06] [INFO ] Transformed 475 transitions.
[2025-06-03 05:28:06] [INFO ] Found NUPN structural information;
[2025-06-03 05:28:06] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 307 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 7 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 4 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 145 ms. Remains 71 /192 variables (removed 121) and now considering 569/475 (removed -94) transitions.
[2025-06-03 05:28:06] [INFO ] Flow matrix only has 440 transitions (discarded 129 similar events)
// Phase 1: matrix 440 rows 71 cols
[2025-06-03 05:28:07] [INFO ] Computed 7 invariants in 53 ms
[2025-06-03 05:28:07] [INFO ] Implicit Places using invariants in 735 ms returned [21, 40]
[2025-06-03 05:28:07] [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 792 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 9 ms. Remains 66 /70 variables (removed 4) and now considering 515/567 (removed 52) transitions.
[2025-06-03 05:28:07] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
// Phase 1: matrix 357 rows 66 cols
[2025-06-03 05:28:07] [INFO ] Computed 6 invariants in 4 ms
[2025-06-03 05:28:07] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-03 05:28:07] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
[2025-06-03 05:28:07] [INFO ] Invariant cache hit.
[2025-06-03 05:28:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-03 05:28:08] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 621 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 1605 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 (6532 resets) in 4122 ms. (9 steps per ms) remains 75/179 properties
BEST_FIRST walk for 4003 steps (155 resets) in 61 ms. (64 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (150 resets) in 45 ms. (87 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (160 resets) in 51 ms. (76 steps per ms) remains 74/75 properties
BEST_FIRST walk for 4002 steps (155 resets) in 68 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (158 resets) in 53 ms. (74 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (153 resets) in 61 ms. (64 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (153 resets) in 36 ms. (108 steps per ms) remains 70/74 properties
BEST_FIRST walk for 4004 steps (162 resets) in 47 ms. (83 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (148 resets) in 30 ms. (129 steps per ms) remains 69/70 properties
BEST_FIRST walk for 4002 steps (166 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (157 resets) in 16 ms. (235 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4002 steps (151 resets) in 44 ms. (88 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (157 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (151 resets) in 17 ms. (222 steps per ms) remains 66/68 properties
BEST_FIRST walk for 4002 steps (167 resets) in 17 ms. (222 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (156 resets) in 17 ms. (222 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (157 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (143 resets) in 17 ms. (222 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (165 resets) in 15 ms. (250 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4003 steps (150 resets) in 19 ms. (200 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4003 steps (161 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (145 resets) in 16 ms. (235 steps per ms) remains 61/63 properties
BEST_FIRST walk for 4003 steps (147 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (148 resets) in 20 ms. (190 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4004 steps (150 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (155 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (151 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (159 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (168 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (156 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (129 resets) in 16 ms. (235 steps per ms) remains 52/59 properties
BEST_FIRST walk for 4003 steps (150 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (156 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (156 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (148 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (157 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (151 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (158 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (161 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (145 resets) in 22 ms. (173 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (140 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (152 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (140 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (155 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (158 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (153 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (163 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (165 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (153 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (167 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (148 resets) in 18 ms. (210 steps per ms) remains 50/52 properties
BEST_FIRST walk for 4004 steps (147 resets) in 15 ms. (250 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4003 steps (169 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (153 resets) in 21 ms. (182 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (153 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (149 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (153 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
[2025-06-03 05:28:10] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
[2025-06-03 05:28:10] [INFO ] Invariant cache hit.
[2025-06-03 05:28:10] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 23/42 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 24/66 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-06-03 05:28:11] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 356/422 variables, 66/139 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 62/201 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-06-03 05:28:12] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2025-06-03 05:28:13] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 49 unsolved
SMT process timed out in 5185ms, After SMT, problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 209 place count 59 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 216 place count 59 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 231 place count 59 transition count 270
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 238 place count 59 transition count 263
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 245 place count 52 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 51 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 50 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 4 with 74 rules applied. Total rules applied 321 place count 50 transition count 188
Applied a total of 321 rules in 108 ms. Remains 50 /66 variables (removed 16) and now considering 188/515 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 50/66 places, 188/515 transitions.
RANDOM walk for 4000000 steps (258 resets) in 27327 ms. (146 steps per ms) remains 42/49 properties
BEST_FIRST walk for 400000 steps (39 resets) in 1299 ms. (307 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400001 steps (29 resets) in 2126 ms. (188 steps per ms) remains 39/41 properties
BEST_FIRST walk for 400002 steps (94 resets) in 2078 ms. (192 steps per ms) remains 35/39 properties
BEST_FIRST walk for 400001 steps (66 resets) in 1936 ms. (206 steps per ms) remains 27/35 properties
BEST_FIRST walk for 400003 steps (130 resets) in 1067 ms. (374 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (40 resets) in 668 ms. (597 steps per ms) remains 24/26 properties
BEST_FIRST walk for 400000 steps (221 resets) in 2094 ms. (190 steps per ms) remains 19/24 properties
BEST_FIRST walk for 400001 steps (170 resets) in 2327 ms. (171 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400000 steps (129 resets) in 3351 ms. (119 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (40 resets) in 1692 ms. (236 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400000 steps (38 resets) in 977 ms. (408 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400001 steps (25 resets) in 1853 ms. (215 steps per ms) remains 13/15 properties
BEST_FIRST walk for 400000 steps (238 resets) in 1491 ms. (268 steps per ms) remains 10/13 properties
BEST_FIRST walk for 400000 steps (48 resets) in 1181 ms. (338 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400000 steps (364 resets) in 1250 ms. (319 steps per ms) remains 8/10 properties
BEST_FIRST walk for 400004 steps (19 resets) in 722 ms. (553 steps per ms) remains 8/8 properties
BEST_FIRST walk for 400001 steps (41 resets) in 1034 ms. (386 steps per ms) remains 8/8 properties
[2025-06-03 05:28:34] [INFO ] Flow matrix only has 174 transitions (discarded 14 similar events)
// Phase 1: matrix 174 rows 50 cols
[2025-06-03 05:28:34] [INFO ] Computed 5 invariants in 2 ms
[2025-06-03 05:28:34] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 116/152 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 68/220 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-03 05:28:34] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/224 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/224 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 91 constraints, problems are : Problem set: 0 solved, 8 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 116/152 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 68/220 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 4/224 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 24/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/224 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 99 constraints, problems are : Problem set: 0 solved, 8 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1080ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 1016 steps, including 90 resets, run visited all 1 properties in 4 ms. (steps per millisecond=254 )
Parikh walk visited 8 properties in 413 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 29364 ms.
ITS solved all properties within timeout

BK_STOP 1748928515861

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r140-smll-174876533500132"
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.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;