Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600082.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is CANConstruction-PT-050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 21:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.8M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678933659163

Running Version 202205111006
[2023-03-16 02:27:40] [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-16 02:27:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:27:40] [INFO ] Load time of PNML (sax parser for PT used): 375 ms
[2023-03-16 02:27:40] [INFO ] Transformed 5602 places.
[2023-03-16 02:27:41] [INFO ] Transformed 10400 transitions.
[2023-03-16 02:27:41] [INFO ] Parsed PT model containing 5602 places and 10400 transitions in 555 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 10400 rows 5602 cols
[2023-03-16 02:27:41] [INFO ] Computed 101 place invariants in 156 ms
Incomplete random walk after 10000 steps, including 10 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 16) seen :8
FORMULA CANConstruction-PT-050-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
// Phase 1: matrix 10400 rows 5602 cols
[2023-03-16 02:27:41] [INFO ] Computed 101 place invariants in 69 ms
[2023-03-16 02:27:42] [INFO ] [Real]Absence check using 51 positive place invariants in 157 ms returned sat
[2023-03-16 02:27:42] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 29 ms returned sat
[2023-03-16 02:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:46] [INFO ] [Real]Absence check using state equation in 4044 ms returned unknown
[2023-03-16 02:27:47] [INFO ] [Real]Absence check using 51 positive place invariants in 124 ms returned sat
[2023-03-16 02:27:47] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 27 ms returned sat
[2023-03-16 02:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:51] [INFO ] [Real]Absence check using state equation in 4109 ms returned sat
0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
[2023-03-16 02:27:52] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-16 02:27:52] [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 expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:27:53] [INFO ] [Real]Absence check using 51 positive place invariants in 151 ms returned sat
[2023-03-16 02:27:53] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 30 ms returned sat
[2023-03-16 02:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:56] [INFO ] [Real]Absence check using state equation in 3836 ms returned sat
[2023-03-16 02:27:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:27:57] [INFO ] [Nat]Absence check using 51 positive place invariants in 113 ms returned sat
[2023-03-16 02:27:57] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 27 ms returned sat
[2023-03-16 02:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:01] [INFO ] [Nat]Absence check using state equation in 3867 ms returned sat
[2023-03-16 02:28:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 02:28:02] [INFO ] [Nat]Added 4950 Read/Feed constraints in 434 ms returned unknown
[2023-03-16 02:28:03] [INFO ] [Real]Absence check using 51 positive place invariants in 155 ms returned sat
[2023-03-16 02:28:03] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 43 ms returned sat
[2023-03-16 02:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:07] [INFO ] [Real]Absence check using state equation in 4107 ms returned unknown
[2023-03-16 02:28:08] [INFO ] [Real]Absence check using 51 positive place invariants in 146 ms returned sat
[2023-03-16 02:28:08] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 29 ms returned sat
[2023-03-16 02:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:12] [INFO ] [Real]Absence check using state equation in 4187 ms returned unknown
[2023-03-16 02:28:12] [INFO ] [Real]Absence check using 51 positive place invariants in 116 ms returned sat
[2023-03-16 02:28:12] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 27 ms returned sat
[2023-03-16 02:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:17] [INFO ] [Real]Absence check using state equation in 4212 ms returned sat
[2023-03-16 02:28:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:28:18] [INFO ] [Nat]Absence check using 51 positive place invariants in 158 ms returned sat
[2023-03-16 02:28:18] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 34 ms returned sat
[2023-03-16 02:28:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:22] [INFO ] [Nat]Absence check using state equation in 4133 ms returned unknown
[2023-03-16 02:28:23] [INFO ] [Real]Absence check using 51 positive place invariants in 145 ms returned sat
[2023-03-16 02:28:23] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 37 ms returned sat
[2023-03-16 02:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:26] [INFO ] [Real]Absence check using state equation in 3831 ms returned sat
[2023-03-16 02:28:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:28:28] [INFO ] [Nat]Absence check using 51 positive place invariants in 137 ms returned sat
[2023-03-16 02:28:28] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 29 ms returned sat
[2023-03-16 02:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:32] [INFO ] [Nat]Absence check using state equation in 4128 ms returned unknown
[2023-03-16 02:28:33] [INFO ] [Real]Absence check using 51 positive place invariants in 183 ms returned sat
[2023-03-16 02:28:33] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 35 ms returned sat
[2023-03-16 02:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:28:37] [INFO ] [Real]Absence check using state equation in 4266 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5602 transition count 10050
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5252 transition count 10050
Discarding 2394 places :
Symmetric choice reduction at 2 with 2394 rule applications. Total rules 3094 place count 2858 transition count 5262
Iterating global reduction 2 with 2394 rules applied. Total rules applied 5488 place count 2858 transition count 5262
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 5588 place count 2808 transition count 5212
Free-agglomeration rule applied 88 times.
Iterating global reduction 2 with 88 rules applied. Total rules applied 5676 place count 2808 transition count 5124
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 5764 place count 2720 transition count 5124
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 5776 place count 2720 transition count 5124
Applied a total of 5776 rules in 3084 ms. Remains 2720 /5602 variables (removed 2882) and now considering 5124/10400 (removed 5276) transitions.
Finished structural reductions, in 1 iterations. Remains : 2720/5602 places, 5124/10400 transitions.
// Phase 1: matrix 5124 rows 2720 cols
[2023-03-16 02:28:40] [INFO ] Computed 101 place invariants in 47 ms
Incomplete random walk after 1000000 steps, including 2895 resets, run finished after 12780 ms. (steps per millisecond=78 ) properties (out of 8) seen :8
FORMULA CANConstruction-PT-050-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 72957 ms.

BK_STOP 1678933733561

--------------------
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="CANConstruction-PT-050"
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 CANConstruction-PT-050, 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 r063-tajo-167813711600082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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