fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r341-tall-167889213600151
Last Updated
May 14, 2023

About the Execution of LoLa+red for RERS2020-PT-pb104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1412620.00 0.00 0.00 [undef] Cannot compute

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r341-tall-167889213600151.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 lolaxred
Input is RERS2020-PT-pb104, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213600151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 81M
-rw-r--r-- 1 mcc users 7.5K Feb 26 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 08:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 08:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 80M 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679103233395

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=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb104
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 01:33:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 01:33:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:33:58] [INFO ] Load time of PNML (sax parser for PT used): 3028 ms
[2023-03-18 01:33:58] [INFO ] Transformed 1353 places.
[2023-03-18 01:33:58] [INFO ] Transformed 143642 transitions.
[2023-03-18 01:33:58] [INFO ] Found NUPN structural information;
[2023-03-18 01:33:58] [INFO ] Parsed PT model containing 1353 places and 143642 transitions and 572292 arcs in 3641 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13930 transitions
Reduce redundant transitions removed 13930 transitions.
Built sparse matrix representations for Structural reductions in 117 ms.283722KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1353/1353 places, 129712/129712 transitions.
Computed a total of 397 stabilizing places and 51386 stable transitions
Ensure Unique test removed 8 places
Computed a total of 389 stabilizing places and 51386 stable transitions
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1345 transition count 129712
Computed a total of 389 stabilizing places and 51386 stable transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 8 place count 1345 transition count 129703
Deduced a syphon composed of 9 places in 63 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 26 place count 1336 transition count 129703
Computed a total of 381 stabilizing places and 51378 stable transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 134 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 70 place count 1314 transition count 129681
Computed a total of 369 stabilizing places and 51366 stable transitions
Computed a total of 369 stabilizing places and 51366 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1313 transition count 129680
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Applied a total of 71 rules in 6199 ms. Remains 1313 /1353 variables (removed 40) and now considering 129680/129712 (removed 32) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 6213 ms. Remains : 1313/1353 places, 129680/129712 transitions.
Interrupted Random walk after 335130 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 01:34:37] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
// Phase 1: matrix 96724 rows 1313 cols
[2023-03-18 01:34:37] [INFO ] Computed 9 place invariants in 630 ms
[2023-03-18 01:34:46] [INFO ] [Real]Absence check using 9 positive place invariants in 52 ms returned sat
[2023-03-18 01:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:35:13] [INFO ] [Real]Absence check using state equation in 26615 ms returned sat
[2023-03-18 01:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:35:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 81 ms returned sat
[2023-03-18 01:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:35:52] [INFO ] [Nat]Absence check using state equation in 28915 ms returned sat
[2023-03-18 01:35:54] [INFO ] State equation strengthened by 3453 read => feed constraints.
[2023-03-18 01:36:05] [INFO ] [Nat]Added 3453 Read/Feed constraints in 11169 ms returned sat
[2023-03-18 01:36:18] [INFO ] Deduced a trap composed of 231 places in 11891 ms of which 11 ms to minimize.
[2023-03-18 01:36:31] [INFO ] Deduced a trap composed of 43 places in 11308 ms of which 3 ms to minimize.
[2023-03-18 01:36:43] [INFO ] Deduced a trap composed of 52 places in 11198 ms of which 2 ms to minimize.
[2023-03-18 01:36:57] [INFO ] Deduced a trap composed of 35 places in 12194 ms of which 2 ms to minimize.
[2023-03-18 01:37:09] [INFO ] Deduced a trap composed of 102 places in 10759 ms of which 2 ms to minimize.
[2023-03-18 01:37:21] [INFO ] Deduced a trap composed of 188 places in 10779 ms of which 2 ms to minimize.
[2023-03-18 01:37:33] [INFO ] Deduced a trap composed of 242 places in 10689 ms of which 1 ms to minimize.
[2023-03-18 01:37:45] [INFO ] Deduced a trap composed of 247 places in 10891 ms of which 3 ms to minimize.
[2023-03-18 01:37:57] [INFO ] Deduced a trap composed of 51 places in 10312 ms of which 2 ms to minimize.
[2023-03-18 01:38:08] [INFO ] Deduced a trap composed of 61 places in 10335 ms of which 2 ms to minimize.
[2023-03-18 01:38:20] [INFO ] Deduced a trap composed of 119 places in 10103 ms of which 2 ms to minimize.
[2023-03-18 01:38:32] [INFO ] Deduced a trap composed of 150 places in 10777 ms of which 5 ms to minimize.
[2023-03-18 01:38:44] [INFO ] Deduced a trap composed of 74 places in 11102 ms of which 2 ms to minimize.
[2023-03-18 01:38:56] [INFO ] Deduced a trap composed of 407 places in 10623 ms of which 2 ms to minimize.
[2023-03-18 01:39:05] [INFO ] Deduced a trap composed of 142 places in 7788 ms of which 2 ms to minimize.
[2023-03-18 01:39:16] [INFO ] Deduced a trap composed of 38 places in 9277 ms of which 2 ms to minimize.
[2023-03-18 01:39:27] [INFO ] Deduced a trap composed of 21 places in 9499 ms of which 1 ms to minimize.
[2023-03-18 01:39:37] [INFO ] Deduced a trap composed of 90 places in 8855 ms of which 1 ms to minimize.
[2023-03-18 01:39:45] [INFO ] Deduced a trap composed of 71 places in 6952 ms of which 1 ms to minimize.
[2023-03-18 01:39:53] [INFO ] Deduced a trap composed of 104 places in 7004 ms of which 1 ms to minimize.
[2023-03-18 01:40:03] [INFO ] Deduced a trap composed of 102 places in 8325 ms of which 2 ms to minimize.
[2023-03-18 01:40:10] [INFO ] Deduced a trap composed of 338 places in 6344 ms of which 1 ms to minimize.
[2023-03-18 01:40:18] [INFO ] Deduced a trap composed of 285 places in 6119 ms of which 10 ms to minimize.
[2023-03-18 01:40:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 227516 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 344516 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 226391 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=7 )
Interrupted Random walk after 354771 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1313/1313 places, 129680/129680 transitions.
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Computed a total of 368 stabilizing places and 51365 stable transitions
Applied a total of 0 rules in 1233 ms. Remains 1313 /1313 variables (removed 0) and now considering 129680/129680 (removed 0) transitions.
[2023-03-18 01:42:19] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-18 01:42:19] [INFO ] Invariant cache hit.
[2023-03-18 01:42:24] [INFO ] Implicit Places using invariants in 4488 ms returned []
Implicit Place search using SMT only with invariants took 4497 ms to find 0 implicit places.
[2023-03-18 01:42:24] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-18 01:42:24] [INFO ] Invariant cache hit.
[2023-03-18 01:42:54] [INFO ] Performed 78762/129680 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:43:12] [INFO ] Dead Transitions using invariants and state equation in 48053 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 53801 ms. Remains : 1313/1313 places, 129680/129680 transitions.
Interrupted Random walk after 347237 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 01:43:42] [INFO ] Flow matrix only has 96724 transitions (discarded 32956 similar events)
[2023-03-18 01:43:42] [INFO ] Invariant cache hit.
[2023-03-18 01:43:51] [INFO ] [Real]Absence check using 9 positive place invariants in 36 ms returned sat
[2023-03-18 01:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:44:17] [INFO ] [Real]Absence check using state equation in 26010 ms returned sat
[2023-03-18 01:44:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:44:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 74 ms returned sat
[2023-03-18 01:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:44:52] [INFO ] [Nat]Absence check using state equation in 25041 ms returned sat
[2023-03-18 01:44:53] [INFO ] State equation strengthened by 3453 read => feed constraints.
[2023-03-18 01:45:04] [INFO ] [Nat]Added 3453 Read/Feed constraints in 10831 ms returned sat
[2023-03-18 01:45:14] [INFO ] Deduced a trap composed of 43 places in 8780 ms of which 2 ms to minimize.
[2023-03-18 01:45:27] [INFO ] Deduced a trap composed of 114 places in 12485 ms of which 2 ms to minimize.
[2023-03-18 01:45:41] [INFO ] Deduced a trap composed of 62 places in 11928 ms of which 3 ms to minimize.
[2023-03-18 01:45:54] [INFO ] Deduced a trap composed of 74 places in 10721 ms of which 2 ms to minimize.
[2023-03-18 01:46:05] [INFO ] Deduced a trap composed of 47 places in 10003 ms of which 2 ms to minimize.
[2023-03-18 01:46:15] [INFO ] Deduced a trap composed of 233 places in 8979 ms of which 2 ms to minimize.
[2023-03-18 01:46:28] [INFO ] Deduced a trap composed of 168 places in 11042 ms of which 1 ms to minimize.
[2023-03-18 01:46:40] [INFO ] Deduced a trap composed of 119 places in 10995 ms of which 2 ms to minimize.
[2023-03-18 01:46:52] [INFO ] Deduced a trap composed of 113 places in 11069 ms of which 2 ms to minimize.
[2023-03-18 01:47:04] [INFO ] Deduced a trap composed of 33 places in 10510 ms of which 2 ms to minimize.
[2023-03-18 01:47:16] [INFO ] Deduced a trap composed of 22 places in 10406 ms of which 3 ms to minimize.
[2023-03-18 01:47:28] [INFO ] Deduced a trap composed of 105 places in 10683 ms of which 9 ms to minimize.
[2023-03-18 01:47:40] [INFO ] Deduced a trap composed of 163 places in 10833 ms of which 2 ms to minimize.
[2023-03-18 01:47:50] [INFO ] Deduced a trap composed of 38 places in 9514 ms of which 1 ms to minimize.
[2023-03-18 01:48:02] [INFO ] Deduced a trap composed of 93 places in 10369 ms of which 1 ms to minimize.
[2023-03-18 01:48:11] [INFO ] Deduced a trap composed of 143 places in 7756 ms of which 1 ms to minimize.
[2023-03-18 01:48:20] [INFO ] Deduced a trap composed of 231 places in 7976 ms of which 15 ms to minimize.
[2023-03-18 01:48:27] [INFO ] Deduced a trap composed of 141 places in 6064 ms of which 1 ms to minimize.
[2023-03-18 01:48:35] [INFO ] Deduced a trap composed of 338 places in 6537 ms of which 1 ms to minimize.
[2023-03-18 01:48:47] [INFO ] Deduced a trap composed of 78 places in 10522 ms of which 2 ms to minimize.
[2023-03-18 01:48:57] [INFO ] Deduced a trap composed of 95 places in 8806 ms of which 1 ms to minimize.
[2023-03-18 01:49:08] [INFO ] Deduced a trap composed of 82 places in 9700 ms of which 2 ms to minimize.
[2023-03-18 01:49:16] [INFO ] Deduced a trap composed of 23 places in 6762 ms of which 1 ms to minimize.
[2023-03-18 01:49:24] [INFO ] Deduced a trap composed of 124 places in 6587 ms of which 1 ms to minimize.
[2023-03-18 01:49:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 222596 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=7 )
Interrupted Random walk after 282908 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Interrupted Random directed walk after 208359 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 303982 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 01:51:28] [INFO ] Flatten gal took : 3816 ms
[2023-03-18 01:51:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 01:51:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1353 places, 129712 transitions and 516618 arcs took 274 ms.
Total runtime 1053836 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RERS2020-PT-pb104
BK_EXAMINATION: ReachabilityDeadlock
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
GlobalProperty: ReachabilityDeadlock

BK_STOP 1679104646015

--------------------
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 ReachabilityDeadlock -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 707 Killed lola --conf=$BIN_DIR/configfiles/globalconf --check=deadlockfreedom $DIR/model.pnml

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="RERS2020-PT-pb104"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is RERS2020-PT-pb104, 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 r341-tall-167889213600151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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