Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716600119.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716600119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 16:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 253K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679424412913

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 18:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:46:55] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-21 18:46:55] [INFO ] Transformed 753 places.
[2023-03-21 18:46:55] [INFO ] Transformed 723 transitions.
[2023-03-21 18:46:55] [INFO ] Found NUPN structural information;
[2023-03-21 18:46:55] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 723 rows 753 cols
[2023-03-21 18:46:57] [INFO ] Computed 271 place invariants in 17 ms
[2023-03-21 18:46:57] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 18:46:57] [INFO ] [Nat]Absence check using 271 positive place invariants in 60 ms returned sat
[2023-03-21 18:47:00] [INFO ] After 2090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 18:47:00] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 10 ms to minimize.
[2023-03-21 18:47:00] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-21 18:47:01] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2023-03-21 18:47:01] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 14 ms to minimize.
[2023-03-21 18:47:01] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 26 ms to minimize.
[2023-03-21 18:47:01] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-21 18:47:02] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-21 18:47:02] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-21 18:47:02] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-21 18:47:02] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2023-03-21 18:47:02] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 8 ms to minimize.
[2023-03-21 18:47:03] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2023-03-21 18:47:03] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2023-03-21 18:47:03] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-21 18:47:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3146 ms
[2023-03-21 18:47:03] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-21 18:47:03] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-21 18:47:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2023-03-21 18:47:04] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-21 18:47:04] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-21 18:47:04] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-21 18:47:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 579 ms
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-21 18:47:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 540 ms
[2023-03-21 18:47:06] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-21 18:47:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-21 18:47:06] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2023-03-21 18:47:06] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-21 18:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2023-03-21 18:47:06] [INFO ] After 8791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2269 ms.
[2023-03-21 18:47:09] [INFO ] After 11503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 570 ms.
Support contains 190 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 753 transition count 722
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 110 times.
Drop transitions removed 110 transitions
Iterating global reduction 0 with 110 rules applied. Total rules applied 114 place count 751 transition count 721
Applied a total of 114 rules in 126 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 751/753 places, 721/723 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 114235 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114235 steps, saw 61225 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-21 18:47:13] [INFO ] Computed 271 place invariants in 7 ms
[2023-03-21 18:47:13] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 18:47:14] [INFO ] [Nat]Absence check using 271 positive place invariants in 74 ms returned sat
[2023-03-21 18:47:16] [INFO ] After 1935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 18:47:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 18:47:17] [INFO ] After 1446ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2023-03-21 18:47:18] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-21 18:47:19] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2023-03-21 18:47:20] [INFO ] Deduced a trap composed of 10 places in 1316 ms of which 1 ms to minimize.
[2023-03-21 18:47:20] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2023-03-21 18:47:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2508 ms
[2023-03-21 18:47:22] [INFO ] Deduced a trap composed of 6 places in 1363 ms of which 1 ms to minimize.
[2023-03-21 18:47:22] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 10 ms to minimize.
[2023-03-21 18:47:23] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-21 18:47:23] [INFO ] Deduced a trap composed of 9 places in 550 ms of which 1 ms to minimize.
[2023-03-21 18:47:23] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2023-03-21 18:47:24] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2023-03-21 18:47:24] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 15 ms to minimize.
[2023-03-21 18:47:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3246 ms
[2023-03-21 18:47:25] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-21 18:47:25] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-21 18:47:25] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-21 18:47:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 604 ms
[2023-03-21 18:47:26] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-21 18:47:26] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-21 18:47:26] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-21 18:47:26] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-21 18:47:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-21 18:47:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 919 ms
[2023-03-21 18:47:26] [INFO ] After 10533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1851 ms.
[2023-03-21 18:47:28] [INFO ] After 14821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 558 ms.
Support contains 190 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 19 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 751/751 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 18 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-21 18:47:29] [INFO ] Invariant cache hit.
[2023-03-21 18:47:29] [INFO ] Implicit Places using invariants in 366 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 371 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 721/721 transitions.
Applied a total of 0 rules in 26 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 416 ms. Remains : 750/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-21 18:47:30] [INFO ] Computed 270 place invariants in 5 ms
[2023-03-21 18:47:30] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 18:47:30] [INFO ] [Nat]Absence check using 270 positive place invariants in 53 ms returned sat
[2023-03-21 18:47:32] [INFO ] After 2013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 18:47:33] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-21 18:47:33] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 4 ms to minimize.
[2023-03-21 18:47:33] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 39 ms to minimize.
[2023-03-21 18:47:34] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 1 ms to minimize.
[2023-03-21 18:47:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1147 ms
[2023-03-21 18:47:34] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-21 18:47:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-21 18:47:34] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2023-03-21 18:47:34] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 13 ms to minimize.
[2023-03-21 18:47:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 640 ms
[2023-03-21 18:47:35] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-21 18:47:35] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-21 18:47:35] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2023-03-21 18:47:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 527 ms
[2023-03-21 18:47:36] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-21 18:47:36] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-21 18:47:36] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 25 ms to minimize.
[2023-03-21 18:47:36] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 29 ms to minimize.
[2023-03-21 18:47:37] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-03-21 18:47:37] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-21 18:47:37] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2023-03-21 18:47:37] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 5 ms to minimize.
[2023-03-21 18:47:38] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 0 ms to minimize.
[2023-03-21 18:47:38] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 30 ms to minimize.
[2023-03-21 18:47:38] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 0 ms to minimize.
[2023-03-21 18:47:38] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2023-03-21 18:47:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-21 18:47:39] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2023-03-21 18:47:39] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2023-03-21 18:47:39] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2023-03-21 18:47:39] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3372 ms
[2023-03-21 18:47:40] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-21 18:47:40] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-21 18:47:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2023-03-21 18:47:40] [INFO ] After 9624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1409 ms.
[2023-03-21 18:47:41] [INFO ] After 11394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 346 ms.
Support contains 158 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 721
Applied a total of 20 rules in 31 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 750/750 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 102434 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102434 steps, saw 95065 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-21 18:47:45] [INFO ] Computed 270 place invariants in 4 ms
[2023-03-21 18:47:46] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 18:47:46] [INFO ] [Nat]Absence check using 270 positive place invariants in 44 ms returned sat
[2023-03-21 18:47:47] [INFO ] After 1517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 18:47:48] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-21 18:47:48] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 1 ms to minimize.
[2023-03-21 18:47:48] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-21 18:47:48] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-21 18:47:48] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-21 18:47:49] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-21 18:47:49] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-21 18:47:49] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-21 18:47:49] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-21 18:47:49] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-03-21 18:47:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-03-21 18:47:50] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2023-03-21 18:47:50] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2023-03-21 18:47:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2256 ms
[2023-03-21 18:47:50] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 29 ms to minimize.
[2023-03-21 18:47:50] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-21 18:47:50] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2023-03-21 18:47:51] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-21 18:47:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 656 ms
[2023-03-21 18:47:51] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-21 18:47:51] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-21 18:47:52] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-21 18:47:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-21 18:47:52] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-21 18:47:52] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-21 18:47:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1092 ms
[2023-03-21 18:47:53] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2023-03-21 18:47:53] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-21 18:47:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-21 18:47:53] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-21 18:47:53] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2023-03-21 18:47:53] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-21 18:47:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2023-03-21 18:47:53] [INFO ] After 7635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1148 ms.
[2023-03-21 18:47:55] [INFO ] After 9086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 454 ms.
Support contains 158 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 18 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 750/750 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 18 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-21 18:47:55] [INFO ] Invariant cache hit.
[2023-03-21 18:47:56] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-21 18:47:56] [INFO ] Invariant cache hit.
[2023-03-21 18:47:57] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2023-03-21 18:47:57] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-21 18:47:57] [INFO ] Invariant cache hit.
[2023-03-21 18:47:57] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2094 ms. Remains : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-21 18:47:57] [INFO ] Invariant cache hit.
[2023-03-21 18:47:57] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 18:47:58] [INFO ] [Nat]Absence check using 270 positive place invariants in 48 ms returned sat
[2023-03-21 18:47:59] [INFO ] After 1441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 18:48:00] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2023-03-21 18:48:00] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-21 18:48:00] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2023-03-21 18:48:00] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-21 18:48:01] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2023-03-21 18:48:01] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-21 18:48:01] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2023-03-21 18:48:01] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 1 ms to minimize.
[2023-03-21 18:48:02] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2023-03-21 18:48:02] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2023-03-21 18:48:02] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2023-03-21 18:48:02] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2023-03-21 18:48:02] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2023-03-21 18:48:03] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 1 ms to minimize.
[2023-03-21 18:48:03] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 9 ms to minimize.
[2023-03-21 18:48:03] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2023-03-21 18:48:03] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3561 ms
[2023-03-21 18:48:03] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-21 18:48:04] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-21 18:48:04] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2023-03-21 18:48:04] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 4 ms to minimize.
[2023-03-21 18:48:05] [INFO ] Deduced a trap composed of 15 places in 999 ms of which 0 ms to minimize.
[2023-03-21 18:48:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1790 ms
[2023-03-21 18:48:05] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-21 18:48:06] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2023-03-21 18:48:06] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-21 18:48:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 579 ms
[2023-03-21 18:48:06] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2023-03-21 18:48:07] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2023-03-21 18:48:07] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2023-03-21 18:48:07] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2023-03-21 18:48:07] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2023-03-21 18:48:07] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2023-03-21 18:48:07] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-21 18:48:08] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2023-03-21 18:48:08] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-21 18:48:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1646 ms
[2023-03-21 18:48:08] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-21 18:48:09] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 12 ms to minimize.
[2023-03-21 18:48:09] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-21 18:48:09] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-21 18:48:09] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-21 18:48:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 855 ms
[2023-03-21 18:48:09] [INFO ] After 11312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1542 ms.
[2023-03-21 18:48:11] [INFO ] After 13214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-21 18:48:11] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 21 ms.
[2023-03-21 18:48:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 721 transitions and 3515 arcs took 4 ms.
[2023-03-21 18:48:11] [INFO ] Flatten gal took : 142 ms
Total runtime 76114 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/957/inv_0_ --invariant=/tmp/957/inv_1_ --invariant=/tmp/957/inv_2_ --invariant=/tmp/957/inv_3_ --invariant=/tmp/957/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12017828 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094484 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldIIPs-PT-030A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-030A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716600119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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