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.r479-smll-167912664100029.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 gold2022
Input is SmartHome-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r479-smll-167912664100029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 05:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 68K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679415317258

Running Version 202205111006
[2023-03-21 16:15:19] [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]
[2023-03-21 16:15:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:15:19] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-21 16:15:19] [INFO ] Transformed 273 places.
[2023-03-21 16:15:19] [INFO ] Transformed 308 transitions.
[2023-03-21 16:15:19] [INFO ] Found NUPN structural information;
[2023-03-21 16:15:19] [INFO ] Parsed PT model containing 273 places and 308 transitions in 436 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 263 rows 233 cols
[2023-03-21 16:15:20] [INFO ] Computed 12 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :12
FORMULA SmartHome-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
// Phase 1: matrix 263 rows 233 cols
[2023-03-21 16:15:20] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-21 16:15:20] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2023-03-21 16:15:20] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-21 16:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:15:20] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2023-03-21 16:15:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:15:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-03-21 16:15:21] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 16:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:15:21] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2023-03-21 16:15:21] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 6 ms to minimize.
[2023-03-21 16:15:21] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
[2023-03-21 16:15:22] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2023-03-21 16:15:22] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 3 ms to minimize.
[2023-03-21 16:15:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 748 ms
[2023-03-21 16:15:22] [INFO ] Computed and/alt/rep : 252/543/252 causal constraints (skipped 10 transitions) in 57 ms.
[2023-03-21 16:15:24] [INFO ] Added : 251 causal constraints over 51 iterations in 1964 ms. Result :sat
Minimization took 195 ms.
[2023-03-21 16:15:24] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-21 16:15:24] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 16:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:15:24] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-21 16:15:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:15:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2023-03-21 16:15:24] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-21 16:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:15:25] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-21 16:15:25] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 2 ms to minimize.
[2023-03-21 16:15:25] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2023-03-21 16:15:25] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2023-03-21 16:15:25] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2023-03-21 16:15:25] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2023-03-21 16:15:25] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-21 16:15:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 843 ms
[2023-03-21 16:15:25] [INFO ] Computed and/alt/rep : 252/543/252 causal constraints (skipped 10 transitions) in 43 ms.
[2023-03-21 16:15:27] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2023-03-21 16:15:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-21 16:15:28] [INFO ] Added : 247 causal constraints over 51 iterations in 2169 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 233/233 places, 263/263 transitions.
Graph (trivial) has 219 edges and 233 vertex of which 102 / 233 are part of one of the 6 SCC in 7 ms
Free SCC test removed 96 places
Drop transitions removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 137 transition count 94
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 97 place count 92 transition count 88
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 100 place count 89 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 100 place count 89 transition count 85
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 86 transition count 85
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 133 place count 59 transition count 58
Iterating global reduction 3 with 27 rules applied. Total rules applied 160 place count 59 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 163 place count 59 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 163 place count 59 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 175 place count 53 transition count 49
Graph (complete) has 144 edges and 53 vertex of which 49 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 177 place count 49 transition count 46
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 184 place count 48 transition count 40
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 6 with 20 rules applied. Total rules applied 204 place count 38 transition count 30
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 210 place count 38 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 216 place count 32 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 217 place count 31 transition count 23
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 7 with 15 rules applied. Total rules applied 232 place count 25 transition count 14
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 10 rules applied. Total rules applied 242 place count 16 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 243 place count 15 transition count 13
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 243 place count 15 transition count 7
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 257 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 258 place count 6 transition count 6
Iterating global reduction 10 with 1 rules applied. Total rules applied 259 place count 6 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 261 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 261 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 263 place count 4 transition count 4
Applied a total of 263 rules in 83 ms. Remains 4 /233 variables (removed 229) and now considering 4/263 (removed 259) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/233 places, 4/263 transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-21 16:15:28] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 2) seen :2
FORMULA SmartHome-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9926 ms.

BK_STOP 1679415329420

--------------------
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
+ [[ 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
+ 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 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=@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="SmartHome-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is SmartHome-PT-10, 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 r479-smll-167912664100029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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