Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r204-smll-162089465300166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 SafeBus-PT-03, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-smll-162089465300166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 176K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 25 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 95K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1621021197962

Running Version 0
[2021-05-14 19:40:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2021-05-14 19:40:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:40:01] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2021-05-14 19:40:01] [INFO ] Transformed 57 places.
[2021-05-14 19:40:01] [INFO ] Transformed 91 transitions.
[2021-05-14 19:40:01] [INFO ] Found NUPN structural information;
[2021-05-14 19:40:01] [INFO ] Parsed PT model containing 57 places and 91 transitions in 204 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 8 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 3 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 7 ms.21129KB memory used
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 33 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 13 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2021-05-14 19:40:01] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 19:40:01] [INFO ] Computed 17 place invariants in 20 ms
[2021-05-14 19:40:02] [INFO ] Implicit Places using invariants in 415 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 470 ms to find 3 implicit places.
[2021-05-14 19:40:02] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 19:40:02] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 51 cols
[2021-05-14 19:40:02] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-14 19:40:02] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned [7, 11, 15, 16, 20, 24, 25, 29, 33]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions :[33, 29, 25, 24, 20, 16, 15, 11, 7]
Starting structural reductions, iteration 1 : 51/54 places, 82/91 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 82
Applied a total of 12 rules in 30 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2021-05-14 19:40:02] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2021-05-14 19:40:02] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 19:40:02] [INFO ] Implicit Places using invariants in 146 ms returned []
[2021-05-14 19:40:02] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2021-05-14 19:40:02] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 19:40:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:40:02] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/54 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2131 ms (no deadlock found). (steps per millisecond=586 )
Random directed walk for 1250001 steps, including 0 resets, run took 1293 ms (no deadlock found). (steps per millisecond=966 )
[2021-05-14 19:40:06] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2021-05-14 19:40:06] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 19:40:06] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:40:06] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 16 ms returned sat
[2021-05-14 19:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:40:06] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 19:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:40:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:40:06] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2021-05-14 19:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:40:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-14 19:40:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:40:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:40:06] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 11 ms.
[2021-05-14 19:40:06] [INFO ] Added : 32 causal constraints over 7 iterations in 136 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Parikh directed walk for 13000 steps, including 430 resets, run took 46 ms. (steps per millisecond=282 )
Random directed walk for 500001 steps, including 0 resets, run took 864 ms (no deadlock found). (steps per millisecond=578 )
Random walk for 500000 steps, including 0 resets, run took 672 ms (no deadlock found). (steps per millisecond=744 )
Random directed walk for 500000 steps, including 0 resets, run took 583 ms (no deadlock found). (steps per millisecond=857 )
Random walk for 500000 steps, including 0 resets, run took 987 ms (no deadlock found). (steps per millisecond=506 )
Starting structural reductions, iteration 0 : 45/45 places, 82/82 transitions.
Applied a total of 0 rules in 16 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2021-05-14 19:40:09] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2021-05-14 19:40:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:40:09] [INFO ] Implicit Places using invariants in 152 ms returned []
[2021-05-14 19:40:09] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2021-05-14 19:40:09] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:40:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:40:10] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2021-05-14 19:40:10] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 19:40:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2021-05-14 19:40:10] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:40:10] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 82/82 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1811 ms (no deadlock found). (steps per millisecond=690 )
Random directed walk for 1250000 steps, including 0 resets, run took 1283 ms (no deadlock found). (steps per millisecond=974 )
[2021-05-14 19:40:13] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2021-05-14 19:40:13] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-14 19:40:13] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-14 19:40:13] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 25 ms returned sat
[2021-05-14 19:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:40:13] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:40:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:40:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-14 19:40:13] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 10 ms returned sat
[2021-05-14 19:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:40:13] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-14 19:40:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:40:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:40:13] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 13 ms.
[2021-05-14 19:40:13] [INFO ] Added : 32 causal constraints over 7 iterations in 163 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Parikh directed walk for 13000 steps, including 424 resets, run took 64 ms. (steps per millisecond=203 )
Random directed walk for 500001 steps, including 0 resets, run took 759 ms (no deadlock found). (steps per millisecond=658 )
Random walk for 500000 steps, including 0 resets, run took 661 ms (no deadlock found). (steps per millisecond=756 )
Random directed walk for 500003 steps, including 0 resets, run took 509 ms (no deadlock found). (steps per millisecond=982 )
Random walk for 500000 steps, including 0 resets, run took 660 ms (no deadlock found). (steps per millisecond=757 )
[2021-05-14 19:40:16] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin386805749673882843
[2021-05-14 19:40:16] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2021-05-14 19:40:16] [INFO ] Applying decomposition
[2021-05-14 19:40:16] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:40:16] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2021-05-14 19:40:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:40:16] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2021-05-14 19:40:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:40:16] [INFO ] Flatten gal took : 28 ms
[2021-05-14 19:40:16] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin386805749673882843
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin386805749673882843]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6044426825370514798.txt, -o, /tmp/graph6044426825370514798.bin, -w, /tmp/graph6044426825370514798.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6044426825370514798.bin, -l, -1, -v, -w, /tmp/graph6044426825370514798.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:40:17] [INFO ] Decomposing Gal with order
[2021-05-14 19:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:40:17] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-14 19:40:17] [INFO ] Flatten gal took : 82 ms
[2021-05-14 19:40:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 13 ms.
[2021-05-14 19:40:17] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock15079018886404103884.gal : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock15079018886404103884.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock15079018886404103884.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 1362 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin386805749673882843]
Link finished in 53 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -d], workingDir=/tmp/ltsmin386805749673882843]
LTSmin run took 491 ms.
FORMULA ReachabilityDeadlock FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621021219988

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -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 1800 -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="SafeBus-PT-03"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-PT-03, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r204-smll-162089465300166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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