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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.3K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 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 482K 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 1749323616181

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-B03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-07 19:13:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-07 19:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:13:37] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-06-07 19:13:37] [INFO ] Transformed 1529 places.
[2025-06-07 19:13:37] [INFO ] Transformed 2131 transitions.
[2025-06-07 19:13:37] [INFO ] Found NUPN structural information;
[2025-06-07 19:13:37] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 258 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Graph (trivial) has 1518 edges and 1529 vertex of which 100 / 1529 are part of one of the 15 SCC in 10 ms
Free SCC test removed 85 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1152 transitions
Trivial Post-agglo rules discarded 1152 transitions
Performed 1152 trivial Post agglomeration. Transition count delta: 1152
Iterating post reduction 0 with 1152 rules applied. Total rules applied 1153 place count 1444 transition count 884
Reduce places removed 1152 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 1172 rules applied. Total rules applied 2325 place count 292 transition count 864
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2330 place count 287 transition count 864
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 2330 place count 287 transition count 809
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2440 place count 232 transition count 809
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2588 place count 158 transition count 735
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 2612 place count 146 transition count 753
Applied a total of 2612 rules in 155 ms. Remains 146 /1529 variables (removed 1383) and now considering 753/2131 (removed 1378) transitions.
[2025-06-07 19:13:38] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
// Phase 1: matrix 738 rows 146 cols
[2025-06-07 19:13:38] [INFO ] Computed 6 invariants in 27 ms
[2025-06-07 19:13:38] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-07 19:13:38] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2025-06-07 19:13:38] [INFO ] Invariant cache hit.
[2025-06-07 19:13:38] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-07 19:13:38] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2025-06-07 19:13:38] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2025-06-07 19:13:39] [INFO ] Invariant cache hit.
[2025-06-07 19:13:39] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-07 19:13:48] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 12 ms to minimize.
[2025-06-07 19:13:48] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 1 ms to minimize.
[2025-06-07 19:13:48] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2025-06-07 19:13:48] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2025-06-07 19:13:48] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2025-06-07 19:13:49] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2025-06-07 19:13:49] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2025-06-07 19:13:49] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2025-06-07 19:13:49] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2025-06-07 19:13:49] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2025-06-07 19:13:49] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 1 ms to minimize.
[2025-06-07 19:13:50] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2025-06-07 19:13:50] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 1 ms to minimize.
[2025-06-07 19:13:50] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2025-06-07 19:13:50] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2025-06-07 19:13:50] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2025-06-07 19:13:51] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 1 ms to minimize.
[2025-06-07 19:13:51] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2025-06-07 19:13:51] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 1 ms to minimize.
[2025-06-07 19:13:51] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-07 19:13:51] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2025-06-07 19:13:52] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2025-06-07 19:13:52] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2025-06-07 19:13:52] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2025-06-07 19:13:52] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2025-06-07 19:13:52] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2025-06-07 19:13:52] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2025-06-07 19:13:53] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2025-06-07 19:13:53] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 0 ms to minimize.
[2025-06-07 19:13:53] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2025-06-07 19:13:56] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 1 ms to minimize.
[2025-06-07 19:13:56] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2025-06-07 19:13:56] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2025-06-07 19:13:56] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
[2025-06-07 19:13:56] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2025-06-07 19:13:56] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2025-06-07 19:13:57] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 17/189 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-07 19:13:57] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 1 ms to minimize.
[2025-06-07 19:13:57] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2025-06-07 19:13:58] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2025-06-07 19:13:58] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2025-06-07 19:13:58] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2025-06-07 19:13:58] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2025-06-07 19:13:58] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-07 19:14:03] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2025-06-07 19:14:04] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2025-06-07 19:14:04] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2025-06-07 19:14:04] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2025-06-07 19:14:07] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2025-06-07 19:14:07] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 0 ms to minimize.
[2025-06-07 19:14:07] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-07 19:14:08] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-07 19:14:11] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 146/884 variables, and 205 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30030 ms.
Refiners :[Domain max(s): 146/146 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/146 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 53/205 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-07 19:14:17] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2025-06-07 19:14:17] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2025-06-07 19:14:17] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 7 (OVERLAPS) 737/883 variables, 146/354 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/883 variables, 100/454 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 726/1180 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 883/884 variables, and 1180 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30028 ms.
Refiners :[Domain max(s): 146/146 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, ReadFeed: 100/101 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 56/56 constraints]
After SMT, in 62871ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 62897ms
Starting structural reductions in LIVENESS mode, iteration 1 : 146/1529 places, 753/2131 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 64015 ms. Remains : 146/1529 places, 753/2131 transitions.
Discarding 122 transitions out of 753. Remains 631
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4919 resets) in 2965 ms. (13 steps per ms) remains 595/630 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 595/595 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 595/595 properties
Probabilistic random walk after 30001 steps, saw 9428 distinct states, run finished after 528 ms. (steps per millisecond=56 ) properties seen :131
[2025-06-07 19:14:43] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2025-06-07 19:14:43] [INFO ] Invariant cache hit.
[2025-06-07 19:14:43] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 44/146 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 44/152 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2025-06-07 19:14:48] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 6 ms to minimize.
[2025-06-07 19:14:48] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 1 ms to minimize.
[2025-06-07 19:14:49] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2025-06-07 19:14:49] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2025-06-07 19:14:49] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2025-06-07 19:14:49] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2025-06-07 19:14:49] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2025-06-07 19:14:49] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2025-06-07 19:14:50] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 1 ms to minimize.
[2025-06-07 19:14:50] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 1 ms to minimize.
SMT process timed out in 6745ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 753/753 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 146 transition count 737
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 140 transition count 731
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 140 transition count 731
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 135 transition count 726
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 135 transition count 726
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 130 transition count 721
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 130 transition count 721
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 69 place count 130 transition count 700
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 89 place count 130 transition count 680
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 130 transition count 678
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 128 transition count 678
Applied a total of 93 rules in 122 ms. Remains 128 /146 variables (removed 18) and now considering 678/753 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 128/146 places, 678/753 transitions.
RANDOM walk for 4000000 steps (440458 resets) in 70567 ms. (56 steps per ms) remains 74/464 properties
BEST_FIRST walk for 400004 steps (4574 resets) in 692 ms. (577 steps per ms) remains 73/74 properties
BEST_FIRST walk for 400004 steps (4540 resets) in 833 ms. (479 steps per ms) remains 66/73 properties
BEST_FIRST walk for 400004 steps (86 resets) in 505 ms. (790 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400004 steps (3378 resets) in 291 ms. (1369 steps per ms) remains 62/65 properties
BEST_FIRST walk for 400004 steps (58 resets) in 414 ms. (963 steps per ms) remains 61/62 properties
BEST_FIRST walk for 400004 steps (28 resets) in 417 ms. (956 steps per ms) remains 60/61 properties
BEST_FIRST walk for 400004 steps (32 resets) in 528 ms. (756 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400003 steps (41 resets) in 411 ms. (970 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400004 steps (3396 resets) in 273 ms. (1459 steps per ms) remains 57/58 properties
BEST_FIRST walk for 400004 steps (37 resets) in 480 ms. (831 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400004 steps (53 resets) in 337 ms. (1183 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400003 steps (24 resets) in 472 ms. (845 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (42 resets) in 474 ms. (842 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400004 steps (64 resets) in 317 ms. (1257 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (2240 resets) in 220 ms. (1809 steps per ms) remains 50/52 properties
BEST_FIRST walk for 400004 steps (33 resets) in 237 ms. (1680 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (30 resets) in 291 ms. (1369 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400004 steps (59 resets) in 339 ms. (1176 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400003 steps (48 resets) in 458 ms. (871 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400003 steps (60 resets) in 450 ms. (886 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400003 steps (29 resets) in 384 ms. (1038 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400003 steps (44 resets) in 380 ms. (1049 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400003 steps (62 resets) in 302 ms. (1320 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (36 resets) in 229 ms. (1739 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400003 steps (21 resets) in 297 ms. (1342 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (44 resets) in 300 ms. (1328 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400002 steps (31 resets) in 366 ms. (1089 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400002 steps (106 resets) in 372 ms. (1072 steps per ms) remains 37/38 properties
BEST_FIRST walk for 400004 steps (59 resets) in 223 ms. (1785 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400004 steps (95 resets) in 307 ms. (1298 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400003 steps (97 resets) in 296 ms. (1346 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400003 steps (56 resets) in 288 ms. (1384 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400004 steps (2734 resets) in 217 ms. (1834 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400004 steps (2656 resets) in 278 ms. (1433 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (2648 resets) in 283 ms. (1408 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (2659 resets) in 284 ms. (1403 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (2653 resets) in 284 ms. (1403 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (2663 resets) in 288 ms. (1384 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2660 resets) in 286 ms. (1393 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (2647 resets) in 281 ms. (1418 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (2649 resets) in 282 ms. (1413 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 278 ms. (1433 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400002 steps (2636 resets) in 275 ms. (1449 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (2645 resets) in 277 ms. (1438 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (2640 resets) in 281 ms. (1418 steps per ms) remains 25/29 properties
BEST_FIRST walk for 400004 steps (2643 resets) in 273 ms. (1459 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (2636 resets) in 266 ms. (1498 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (2661 resets) in 267 ms. (1492 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (2634 resets) in 268 ms. (1487 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 265 ms. (1503 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (2650 resets) in 275 ms. (1449 steps per ms) remains 15/25 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 248 ms. (1606 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (2650 resets) in 247 ms. (1612 steps per ms) remains 11/15 properties
// Phase 1: matrix 678 rows 128 cols
[2025-06-07 19:15:13] [INFO ] Computed 6 invariants in 4 ms
[2025-06-07 19:15:13] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 92/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 24/128 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 678/806 variables, 128/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 85/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/806 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 219 constraints, problems are : Problem set: 0 solved, 11 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 128/128 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 92/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 24/128 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 678/806 variables, 128/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 85/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 11/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-07 19:15:14] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2025-06-07 19:15:14] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2025-06-07 19:15:14] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/806 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 233 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 128/128 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 2227ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 1569 ms.
Support contains 12 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 678/678 transitions.
Graph (complete) has 532 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 123 transition count 673
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 38 place count 91 transition count 220
Iterating global reduction 1 with 32 rules applied. Total rules applied 70 place count 91 transition count 220
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 86 place count 91 transition count 204
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 96 place count 81 transition count 194
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 81 transition count 194
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 77 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 77 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 77 transition count 189
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 125 place count 72 transition count 184
Free-agglomeration rule applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 153 place count 72 transition count 156
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 214 place count 44 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 244 place count 44 transition count 93
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 252 place count 44 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 257 place count 44 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 258 place count 43 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 43 transition count 86
Applied a total of 259 rules in 48 ms. Remains 43 /128 variables (removed 85) and now considering 86/678 (removed 592) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 43/128 places, 86/678 transitions.
RANDOM walk for 23725 steps (654 resets) in 141 ms. (167 steps per ms) remains 0/11 properties
Able to resolve query QuasiLiveness after proving 631 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 99579 ms.
ITS solved all properties within timeout

BK_STOP 1749323717197

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-B03"
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-B03, 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-174931350400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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