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.r261-smll-167863536300373.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 itstools
Input is ParamProductionCell-PT-1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-UpperBounds-00
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-01
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-02
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-03
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-04
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-05
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-06
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-07
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-08
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-09
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-10
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-11
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-12
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-13
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-14
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678917519344

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 21:58:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 21:58:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:58:43] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-15 21:58:43] [INFO ] Transformed 231 places.
[2023-03-15 21:58:43] [INFO ] Transformed 202 transitions.
[2023-03-15 21:58:43] [INFO ] Found NUPN structural information;
[2023-03-15 21:58:43] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
FORMULA ParamProductionCell-PT-1-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 21:58:43] [INFO ] Computed 59 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 15) seen :12
FORMULA ParamProductionCell-PT-1-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
[2023-03-15 21:58:43] [INFO ] Invariant cache hit.
[2023-03-15 21:58:43] [INFO ] [Real]Absence check using 35 positive place invariants in 48 ms returned sat
[2023-03-15 21:58:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-15 21:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:44] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-15 21:58:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:58:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 77 ms returned sat
[2023-03-15 21:58:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-15 21:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:44] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2023-03-15 21:58:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:44] [INFO ] [Nat]Added 68 Read/Feed constraints in 43 ms returned sat
[2023-03-15 21:58:45] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 5 ms to minimize.
[2023-03-15 21:58:45] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-15 21:58:45] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2023-03-15 21:58:45] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 1 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 1 ms to minimize.
[2023-03-15 21:58:48] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:58:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 3157 ms
[2023-03-15 21:58:48] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2023-03-15 21:58:48] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-15 21:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:48] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-15 21:58:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:58:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 26 ms returned sat
[2023-03-15 21:58:48] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-15 21:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:48] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-15 21:58:48] [INFO ] [Nat]Added 68 Read/Feed constraints in 71 ms returned sat
[2023-03-15 21:58:48] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2023-03-15 21:58:50] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-15 21:58:50] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-03-15 21:58:50] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-15 21:58:50] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2023-03-15 21:58:50] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2023-03-15 21:58:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1799 ms
[2023-03-15 21:58:50] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2023-03-15 21:58:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-15 21:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:50] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-15 21:58:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:58:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2023-03-15 21:58:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-15 21:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:51] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-15 21:58:51] [INFO ] [Nat]Added 68 Read/Feed constraints in 64 ms returned sat
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 9 ms to minimize.
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-15 21:58:52] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2023-03-15 21:58:52] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2023-03-15 21:58:52] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:58:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1171 ms
Current structural bounds on expressions (after SMT) : [0, 0, 0] Max seen :[0, 0, 0]
FORMULA ParamProductionCell-PT-1-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9645 ms.

BK_STOP 1678917533172

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="UpperBounds"
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-5348"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-1, 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 r261-smll-167863536300373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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