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.r266-tall-174931350400267.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 MedleyB-PT-B01, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-tall-174931350400267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 155K Jun 5 20:08 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 1749323444163

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-07 19:10:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-07 19:10:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:10:45] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-06-07 19:10:45] [INFO ] Transformed 925 places.
[2025-06-07 19:10:45] [INFO ] Transformed 1037 transitions.
[2025-06-07 19:10:45] [INFO ] Found NUPN structural information;
[2025-06-07 19:10:45] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 198 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Graph (trivial) has 918 edges and 925 vertex of which 60 / 925 are part of one of the 9 SCC in 7 ms
Free SCC test removed 51 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 697 place count 874 transition count 284
Reduce places removed 696 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 708 rules applied. Total rules applied 1405 place count 178 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1408 place count 175 transition count 272
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1408 place count 175 transition count 239
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1474 place count 142 transition count 239
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1566 place count 96 transition count 193
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1584 place count 87 transition count 225
Applied a total of 1584 rules in 93 ms. Remains 87 /925 variables (removed 838) and now considering 225/1037 (removed 812) transitions.
[2025-06-07 19:10:45] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
// Phase 1: matrix 216 rows 87 cols
[2025-06-07 19:10:45] [INFO ] Computed 4 invariants in 15 ms
[2025-06-07 19:10:45] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-06-07 19:10:45] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2025-06-07 19:10:45] [INFO ] Invariant cache hit.
[2025-06-07 19:10:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-07 19:10:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-07 19:10:46] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2025-06-07 19:10:46] [INFO ] Invariant cache hit.
[2025-06-07 19:10:46] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-07 19:10:47] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 7 ms to minimize.
[2025-06-07 19:10:47] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2025-06-07 19:10:47] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2025-06-07 19:10:47] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2025-06-07 19:10:48] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2025-06-07 19:10:48] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2025-06-07 19:10:48] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2025-06-07 19:10:48] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2025-06-07 19:10:48] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2025-06-07 19:10:48] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2025-06-07 19:10:48] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-07 19:10:49] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-07 19:10:49] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 215/302 variables, 87/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 63/254 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/303 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/303 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 255 constraints, problems are : Problem set: 0 solved, 198 unsolved in 8888 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 215/302 variables, 87/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 63/254 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 198/452 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-07 19:10:58] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2025-06-07 19:10:58] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/303 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-07 19:11:03] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 14 (OVERLAPS) 0/303 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 456 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13900 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 16/16 constraints]
After SMT, in 23037ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 23058ms
Starting structural reductions in LIVENESS mode, iteration 1 : 87/925 places, 225/1037 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 23630 ms. Remains : 87/925 places, 225/1037 transitions.
Discarding 97 transitions out of 225. Remains 128
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (7765 resets) in 1923 ms. (20 steps per ms) remains 32/127 properties
BEST_FIRST walk for 4004 steps (67 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (37 resets) in 23 ms. (166 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (59 resets) in 11 ms. (333 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (69 resets) in 20 ms. (190 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (48 resets) in 19 ms. (200 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (54 resets) in 16 ms. (235 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (45 resets) in 7 ms. (500 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 7 ms. (500 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (36 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (36 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (33 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (34 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (38 resets) in 10 ms. (363 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 13/15 properties
[2025-06-07 19:11:10] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2025-06-07 19:11:10] [INFO ] Invariant cache hit.
[2025-06-07 19:11:10] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 73/87 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 215/302 variables, 87/178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 63/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/303 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 242 constraints, problems are : Problem set: 0 solved, 13 unsolved in 579 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 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/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 73/87 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 215/302 variables, 87/178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 63/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 13/254 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-06-07 19:11:10] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2025-06-07 19:11:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2025-06-07 19:11:10] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2025-06-07 19:11:11] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2025-06-07 19:11:11] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2025-06-07 19:11:11] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2025-06-07 19:11:11] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-06-07 19:11:11] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/303 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/303 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 263 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1263 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 8/8 constraints]
After SMT, in 1867ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 1 properties in 1204 ms.
Support contains 13 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 225/225 transitions.
Graph (complete) has 288 edges and 87 vertex of which 84 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 10 place count 84 transition count 213
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 30 place count 64 transition count 150
Iterating global reduction 1 with 20 rules applied. Total rules applied 50 place count 64 transition count 150
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 63 place count 64 transition count 137
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 57 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 57 transition count 127
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 53 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 53 transition count 123
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 104 place count 53 transition count 104
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 50 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 113 place count 50 transition count 98
Free-agglomeration rule applied 16 times with reduction of 3 identical transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 129 place count 50 transition count 79
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 155 place count 34 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 169 place count 34 transition count 55
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 34 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 34 transition count 53
Applied a total of 174 rules in 44 ms. Remains 34 /87 variables (removed 53) and now considering 53/225 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 34/87 places, 53/225 transitions.
RANDOM walk for 3762 steps (543 resets) in 37 ms. (99 steps per ms) remains 0/12 properties
Able to resolve query QuasiLiveness after proving 128 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 27783 ms.
ITS solved all properties within timeout

BK_STOP 1749323473446

--------------------
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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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 r266-tall-174931350400267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B01.tgz
mv MedleyB-PT-B01 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 ;