fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872700278
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyElection-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
227.604 9114.00 19687.00 114.10 TFTFTFFTFTFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872700278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 itstools
Input is StigmergyElection-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 30 14:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.5K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 117K May 29 12:20 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 StigmergyElection-PT-03b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-03b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654841495769

Running Version 202205111006
[2022-06-10 06:11:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-06-10 06:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 06:11:38] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2022-06-10 06:11:38] [INFO ] Transformed 427 places.
[2022-06-10 06:11:38] [INFO ] Transformed 518 transitions.
[2022-06-10 06:11:38] [INFO ] Found NUPN structural information;
[2022-06-10 06:11:38] [INFO ] Parsed PT model containing 427 places and 518 transitions in 505 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 173 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 15) seen :5
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 10) seen :2
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 518 rows 427 cols
[2022-06-10 06:11:41] [INFO ] Computed 4 place invariants in 23 ms
[2022-06-10 06:11:41] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2022-06-10 06:11:41] [INFO ] After 750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-10 06:11:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-06-10 06:11:42] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2022-06-10 06:11:43] [INFO ] Deduced a trap composed of 190 places in 330 ms of which 13 ms to minimize.
[2022-06-10 06:11:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2022-06-10 06:11:43] [INFO ] After 1339ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 159 ms.
[2022-06-10 06:11:43] [INFO ] After 1892ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 895 ms.
Support contains 2 out of 427 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 427/427 places, 518/518 transitions.
Graph (trivial) has 430 edges and 427 vertex of which 54 / 427 are part of one of the 8 SCC in 6 ms
Free SCC test removed 46 places
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 589 edges and 381 vertex of which 375 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 275 rules applied. Total rules applied 277 place count 375 transition count 181
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 286 rules applied. Total rules applied 563 place count 103 transition count 167
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 572 place count 96 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 574 place count 94 transition count 165
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 574 place count 94 transition count 157
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 590 place count 86 transition count 157
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 616 place count 60 transition count 131
Iterating global reduction 4 with 26 rules applied. Total rules applied 642 place count 60 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 644 place count 60 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 645 place count 59 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 645 place count 59 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 649 place count 57 transition count 127
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 657 place count 49 transition count 82
Iterating global reduction 6 with 8 rules applied. Total rules applied 665 place count 49 transition count 82
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 672 place count 49 transition count 75
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 692 place count 39 transition count 65
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 693 place count 39 transition count 64
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 696 place count 36 transition count 61
Iterating global reduction 8 with 3 rules applied. Total rules applied 699 place count 36 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 705 place count 33 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 706 place count 33 transition count 62
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 710 place count 33 transition count 58
Free-agglomeration rule applied 16 times.
Iterating global reduction 9 with 16 rules applied. Total rules applied 726 place count 33 transition count 42
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 745 place count 17 transition count 39
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 748 place count 14 transition count 36
Iterating global reduction 10 with 3 rules applied. Total rules applied 751 place count 14 transition count 36
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 758 place count 14 transition count 29
Applied a total of 758 rules in 85 ms. Remains 14 /427 variables (removed 413) and now considering 29/518 (removed 489) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/427 places, 29/518 transitions.
Finished random walk after 49 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=12 )
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6745 ms.

BK_STOP 1654841504883

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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="StigmergyElection-PT-03b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyElection-PT-03b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872700278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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