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.r234-tall-167856420200397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is LamportFastMutEx-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 13K Feb 25 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 13:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K Feb 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 48K Mar 5 18:22 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 LamportFastMutEx-PT-2-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679493420995

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:57:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 13:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:57:02] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-22 13:57:02] [INFO ] Transformed 69 places.
[2023-03-22 13:57:02] [INFO ] Transformed 96 transitions.
[2023-03-22 13:57:02] [INFO ] Found NUPN structural information;
[2023-03-22 13:57:02] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2023-03-22 13:57:02] [INFO ] Parsed PT model containing 69 places and 96 transitions and 402 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-PT-2-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 56 out of 62 initially.
// Phase 1: matrix 56 rows 44 cols
[2023-03-22 13:57:02] [INFO ] Computed 10 place invariants in 12 ms
FORMULA LamportFastMutEx-PT-2-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :15
FORMULA LamportFastMutEx-PT-2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :7
[2023-03-22 13:57:02] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2023-03-22 13:57:02] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-22 13:57:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 13:57:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 13:57:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 229 ms
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 13:57:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 95 ms
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:57:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 162 ms
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 13:57:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 13:57:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 181 ms
[2023-03-22 13:57:04] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-22 13:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 13:57:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:57:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 13:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:57:04] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 13:57:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 312 ms
Current structural bounds on expressions (after SMT) : [1, 1, 2, 1, 2] Max seen :[1, 1, 2, 1, 2]
FORMULA LamportFastMutEx-PT-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2134 ms.
ITS solved all properties within timeout

BK_STOP 1679493425671

--------------------
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 UpperBounds -timeout 360 -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="LamportFastMutEx-PT-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is LamportFastMutEx-PT-2, 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 r234-tall-167856420200397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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