Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r215-oct2-165281606000256.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SharedMemory-PT-000050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-oct2-165281606000256
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 635K Apr 30 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Apr 30 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 904K Apr 30 11:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.5M Apr 30 11:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 462K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 689K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 146K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 304K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.6M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653213320642

Running Version 0
[2022-05-22 09:55:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 09:55:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 09:55:25] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-05-22 09:55:25] [INFO ] Transformed 2651 places.
[2022-05-22 09:55:25] [INFO ] Transformed 5050 transitions.
[2022-05-22 09:55:25] [INFO ] Found NUPN structural information;
[2022-05-22 09:55:25] [INFO ] Completing missing partition info from NUPN : creating a component with [Ext_Mem_Acc_8_2, Ext_Mem_Acc_7_2, Ext_Mem_Acc_20_3, Ext_Mem_Acc_19_3, Ext_Mem_Acc_24_4, Ext_Mem_Acc_15_4, Ext_Mem_Acc_13_5, Ext_Mem_Acc_14_5, Ext_Mem_Acc_17_6, Ext_Mem_Acc_14_6, Ext_Mem_Acc_2_8, Ext_Mem_Acc_1_8, Ext_Mem_Acc_16_9, Ext_Mem_Acc_21_9, Ext_Mem_Acc_26_9, Ext_Mem_Acc_25_9, Ext_Mem_Acc_6_11, Ext_Mem_Acc_7_11, Ext_Mem_Acc_27_11, Ext_Mem_Acc_28_11, Ext_Mem_Acc_40_13, Ext_Mem_Acc_39_13, Ext_Mem_Acc_39_14, Ext_Mem_Acc_38_14, Ext_Mem_Acc_20_14, Ext_Mem_Acc_21_14, Ext_Mem_Acc_43_15, Ext_Mem_Acc_44_15, Ext_Mem_Acc_49_16, Ext_Mem_Acc_48_16, Ext_Mem_Acc_40_18, Ext_Mem_Acc_41_18, Ext_Mem_Acc_13_20, Ext_Mem_Acc_14_20, Ext_Mem_Acc_37_21, Ext_Mem_Acc_38_21, Ext_Mem_Acc_41_20, Ext_Mem_Acc_40_20, Ext_Mem_Acc_45_23, Ext_Mem_Acc_46_23, Ext_Mem_Acc_16_22, Ext_Mem_Acc_15_22, Ext_Mem_Acc_11_26, Ext_Mem_Acc_12_26, Ext_Mem_Acc_31_24, Ext_Mem_Acc_30_24, Ext_Mem_Acc_31_25, Ext_Mem_Acc_32_25, Ext_Mem_Acc_21_29, Ext_Mem_Acc_20_29, Ext_Mem_Acc_13_28, Ext_Mem_Acc_16_28, Ext_Mem_Acc_15_31, Ext_Mem_Acc_14_31, Ext_Mem_Acc_16_30, Ext_Mem_Acc_13_30, Ext_Mem_Acc_24_34, Ext_Mem_Acc_21_34, Ext_Mem_Acc_9_34, Ext_Mem_Acc_12_34, Ext_Mem_Acc_20_32, Ext_Mem_Acc_21_32, Ext_Mem_Acc_25_37, Ext_Mem_Acc_22_37, Ext_Mem_Acc_2_36, Ext_Mem_Acc_49_35, Ext_Mem_Acc_6_40, Ext_Mem_Acc_5_40, Ext_Mem_Acc_42_38, Ext_Mem_Acc_43_38, Ext_Mem_Acc_44_37, Ext_Mem_Acc_43_37, Ext_Mem_Acc_38_41, Ext_Mem_Acc_39_41, Ext_Mem_Acc_43_40, Ext_Mem_Acc_42_40, Ext_Mem_Acc_36_45, Ext_Mem_Acc_37_45, Ext_Mem_Acc_6_46, Ext_Mem_Acc_5_46, Ext_Mem_Acc_29_47, Ext_Mem_Acc_28_47, Ext_Mem_Acc_41_43, Ext_Mem_Acc_40_43, Ext_Mem_Acc_17_44, Ext_Mem_Acc_18_44, Ext_Mem_Acc_34_50, Ext_Mem_Acc_33_50, Ext_Mem_Acc_44_48, Ext_Mem_Acc_45_48, Ext_Mem_Acc_2_50, Ext_Mem_Acc_3_50]
[2022-05-22 09:55:25] [INFO ] Parsed PT model containing 2651 places and 5050 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 79 ms.
FORMULA SharedMemory-PT-000050-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 5050 rows 2651 cols
[2022-05-22 09:55:26] [INFO ] Computed 101 place invariants in 295 ms
FORMULA SharedMemory-PT-000050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3391 ms. (steps per millisecond=2 ) properties (out of 10) seen :123
FORMULA SharedMemory-PT-000050-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 7) seen :65
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 7) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 7) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :62
// Phase 1: matrix 5050 rows 2651 cols
[2022-05-22 09:55:31] [INFO ] Computed 101 place invariants in 210 ms
[2022-05-22 09:55:31] [INFO ] [Real]Absence check using 101 positive place invariants in 86 ms returned sat
[2022-05-22 09:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:33] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2022-05-22 09:55:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:55:35] [INFO ] [Nat]Absence check using 101 positive place invariants in 93 ms returned sat
[2022-05-22 09:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:36] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2022-05-22 09:55:37] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 233 ms.
[2022-05-22 09:55:37] [INFO ] Added : 1 causal constraints over 1 iterations in 738 ms. Result :sat
[2022-05-22 09:55:37] [INFO ] [Real]Absence check using 101 positive place invariants in 51 ms returned unsat
[2022-05-22 09:55:38] [INFO ] [Real]Absence check using 101 positive place invariants in 46 ms returned unsat
[2022-05-22 09:55:38] [INFO ] [Real]Absence check using 101 positive place invariants in 78 ms returned sat
[2022-05-22 09:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:39] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2022-05-22 09:55:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:55:40] [INFO ] [Nat]Absence check using 101 positive place invariants in 75 ms returned sat
[2022-05-22 09:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:41] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2022-05-22 09:55:41] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 249 ms.
[2022-05-22 09:55:42] [INFO ] Added : 0 causal constraints over 0 iterations in 505 ms. Result :sat
[2022-05-22 09:55:42] [INFO ] [Real]Absence check using 101 positive place invariants in 52 ms returned unsat
[2022-05-22 09:55:43] [INFO ] [Real]Absence check using 101 positive place invariants in 108 ms returned sat
[2022-05-22 09:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:44] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2022-05-22 09:55:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:55:44] [INFO ] [Nat]Absence check using 101 positive place invariants in 83 ms returned sat
[2022-05-22 09:55:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:46] [INFO ] [Nat]Absence check using state equation in 1142 ms returned sat
[2022-05-22 09:55:46] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 185 ms.
[2022-05-22 09:55:46] [INFO ] Added : 0 causal constraints over 0 iterations in 476 ms. Result :sat
[2022-05-22 09:55:47] [INFO ] [Real]Absence check using 101 positive place invariants in 80 ms returned sat
[2022-05-22 09:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:48] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2022-05-22 09:55:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:55:48] [INFO ] [Nat]Absence check using 101 positive place invariants in 79 ms returned sat
[2022-05-22 09:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:55:50] [INFO ] [Nat]Absence check using state equation in 1183 ms returned sat
[2022-05-22 09:55:50] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 187 ms.
[2022-05-22 09:55:50] [INFO ] Added : 1 causal constraints over 1 iterations in 682 ms. Result :sat
Current structural bounds on expressions (after SMT) : [50, 1, 1, 50, 1, 50, 1] Max seen :[42, 1, 1, 49, 1, 49, 0]
FORMULA SharedMemory-PT-000050-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 2000 steps, including 94 resets, run finished after 24 ms. (steps per millisecond=83 ) properties (out of 4) seen :34 could not realise parikh vector
FORMULA SharedMemory-PT-000050-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5000 steps, including 96 resets, run finished after 83 ms. (steps per millisecond=60 ) properties (out of 3) seen :100 could not realise parikh vector
FORMULA SharedMemory-PT-000050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5000 steps, including 96 resets, run finished after 69 ms. (steps per millisecond=72 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4700 steps, including 96 resets, run finished after 105 ms. (steps per millisecond=44 ) properties (out of 1) seen :43 could not realise parikh vector
Support contains 50 out of 2651 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Drop transitions removed 2450 transitions
Trivial Post-agglo rules discarded 2450 transitions
Performed 2450 trivial Post agglomeration. Transition count delta: 2450
Iterating post reduction 0 with 2450 rules applied. Total rules applied 2450 place count 2651 transition count 2600
Reduce places removed 2501 places and 0 transitions.
Ensure Unique test removed 2400 transitions
Reduce isomorphic transitions removed 2400 transitions.
Graph (trivial) has 100 edges and 150 vertex of which 100 / 150 are part of one of the 50 SCC in 1859 ms
Free SCC test removed 50 places
Iterating post reduction 1 with 4902 rules applied. Total rules applied 7352 place count 100 transition count 200
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 7452 place count 100 transition count 100
Applied a total of 7452 rules in 1959 ms. Remains 100 /2651 variables (removed 2551) and now considering 100/5050 (removed 4950) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/2651 places, 100/5050 transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-22 09:55:53] [INFO ] Computed 50 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3942 ms. (steps per millisecond=253 ) properties (out of 1) seen :41
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 1) seen :50
FORMULA SharedMemory-PT-000050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653213373643

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SharedMemory-PT-000050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is SharedMemory-PT-000050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r215-oct2-165281606000256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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