Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r144-tall-171631143400068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Dekker-PT-050, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-tall-171631143400068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 21:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 20:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Apr 11 20:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 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 StableMarking

=== Now, execution of the tool begins

BK_START 1716404434059

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Dekker-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 19:00:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 19:00:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:00:35] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-22 19:00:35] [INFO ] Transformed 250 places.
[2024-05-22 19:00:35] [INFO ] Transformed 2600 transitions.
[2024-05-22 19:00:35] [INFO ] Found NUPN structural information;
[2024-05-22 19:00:35] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 315 ms.
RANDOM walk for 40000 steps (8 resets) in 2564 ms. (15 steps per ms) remains 50/250 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
[2024-05-22 19:00:36] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2024-05-22 19:00:36] [INFO ] Computed 150 invariants in 14 ms
[2024-05-22 19:00:36] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 93/124 variables, 62/93 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 93/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 31/155 variables, 31/217 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 31/248 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 124/279 variables, 155/403 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 38/317 variables, 50/453 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 114/431 variables, 76/529 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 76/605 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 19/450 variables, 38/643 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 19/662 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 19/681 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 19/700 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (OVERLAPS) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 700 constraints, problems are : Problem set: 0 solved, 31 unsolved in 2042 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 93/124 variables, 62/93 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 93/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-22 19:00:39] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 12 ms to minimize.
[2024-05-22 19:00:39] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-22 19:00:39] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-22 19:00:39] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-22 19:00:39] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 2 ms to minimize.
[2024-05-22 19:00:39] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
[2024-05-22 19:00:39] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 3 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 11 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:00:40] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:00:41] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-22 19:00:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 19:00:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
SMT process timed out in 7206ms, After SMT, problems are : Problem set: 0 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 183 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 250/250 places, 2600/2600 transitions.
RANDOM walk for 4000000 steps (8 resets) in 52030 ms. (76 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 707 ms. (564 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 698 ms. (572 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 690 ms. (578 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 696 ms. (573 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 697 ms. (573 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 696 ms. (573 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 695 ms. (574 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 695 ms. (574 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 699 ms. (571 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 700 ms. (570 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 696 ms. (573 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 695 ms. (574 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 691 ms. (578 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 691 ms. (578 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 691 ms. (578 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 700 ms. (570 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 711 ms. (561 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 693 ms. (576 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 690 ms. (578 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 703 ms. (568 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 27/27 properties
[2024-05-22 19:01:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 19:01:03] [INFO ] Invariant cache hit.
[2024-05-22 19:01:03] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 81/108 variables, 54/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 27/135 variables, 27/189 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 27/216 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 108/243 variables, 135/351 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 46/289 variables, 50/401 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 138/427 variables, 92/493 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 92/585 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 23/450 variables, 46/631 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 23/654 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 23/677 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 23/700 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 700 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1362 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 81/108 variables, 54/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:04] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 19:01:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-22 19:01:06] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:01:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:01:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-22 19:01:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-22 19:01:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 19:01:11] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 19:01:12] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:01:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 19:01:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 19:01:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/108 variables, 16/378 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/108 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 27/135 variables, 27/405 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/135 variables, 27/432 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/135 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 108/243 variables, 135/567 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/243 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (OVERLAPS) 46/289 variables, 50/617 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/289 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (OVERLAPS) 138/427 variables, 92/709 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/427 variables, 92/801 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/427 variables, 27/828 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/427 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 27 (OVERLAPS) 23/450 variables, 46/874 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/450 variables, 23/897 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/450 variables, 23/920 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/450 variables, 23/943 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/450 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 32 (OVERLAPS) 0/450 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 943 constraints, problems are : Problem set: 0 solved, 27 unsolved in 13840 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 216/216 constraints]
After SMT, in 15252ms problems are : Problem set: 0 solved, 27 unsolved
Finished Parikh walk after 108 steps, including 1 resets, run visited all 27 properties in 7 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 27 properties in 34 ms.
Able to resolve query StableMarking after proving 250 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 43471 ms.
ITS solved all properties within timeout

BK_STOP 1716404478652

--------------------
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 StableMarking -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="Dekker-PT-050"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Dekker-PT-050, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r144-tall-171631143400068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;