Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_DES-PT-00a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455600227
=====================================================================

--------------------
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 DES-PT-00a-UpperBounds-0
FORMULA_NAME DES-PT-00a-UpperBounds-1
FORMULA_NAME DES-PT-00a-UpperBounds-10
FORMULA_NAME DES-PT-00a-UpperBounds-11
FORMULA_NAME DES-PT-00a-UpperBounds-12
FORMULA_NAME DES-PT-00a-UpperBounds-13
FORMULA_NAME DES-PT-00a-UpperBounds-14
FORMULA_NAME DES-PT-00a-UpperBounds-15
FORMULA_NAME DES-PT-00a-UpperBounds-2
FORMULA_NAME DES-PT-00a-UpperBounds-3
FORMULA_NAME DES-PT-00a-UpperBounds-4
FORMULA_NAME DES-PT-00a-UpperBounds-5
FORMULA_NAME DES-PT-00a-UpperBounds-6
FORMULA_NAME DES-PT-00a-UpperBounds-7
FORMULA_NAME DES-PT-00a-UpperBounds-8
FORMULA_NAME DES-PT-00a-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1496449970563


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DES-PT-00a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_DES-PT-00a: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ S_DES-PT-00a @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 191/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 115 places, 76 transitions, 58 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 101 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-00a-UpperBounds.task
lola: MAX(p64) : MAX(p21) : MAX(p18) : MAX(p33) : MAX(p3) : MAX(p3) : MAX(p105) : MAX(p29) : MAX(p91) : MAX(p45) : MAX(p34) : MAX(p113) : MAX(p67) : MAX(p30) : MAX(p38) : MAX(p43)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p64)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1487742 markings, 2401620 edges, 297548 markings/sec, 0 secs
lola: 2946776 markings, 4741215 edges, 291807 markings/sec, 5 secs
lola: 4368642 markings, 7070000 edges, 284373 markings/sec, 10 secs
lola: 5714678 markings, 9387683 edges, 269207 markings/sec, 15 secs
lola: 6879924 markings, 11767515 edges, 233049 markings/sec, 20 secs
lola: 8007151 markings, 14084706 edges, 225445 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1272726 markings, 2496334 edges, 254545 markings/sec, 0 secs
lola: 2624504 markings, 5062515 edges, 270356 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: lola: ========================================
subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1311710 markings, 2514553 edges, 262342 markings/sec, 0 secs
lola: 2556878 markings, 5054432 edges, 249034 markings/sec, 5 secs
lola: 3719988 markings, 7623103 edges, 232622 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p33)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1641745 markings, 2598843 edges, 328349 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1255446 markings, 2604293 edges, 251089 markings/sec, 0 secs
lola: 2426923 markings, 5113577 edges, 234295 markings/sec, 5 secs
lola: 3504535 markings, 7645160 edges, 215522 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1248950 markings, 2591625 edges, 249790 markings/sec, 0 secs
lola: 2432265 markings, 5126933 edges, 236663 markings/sec, 5 secs
lola: 3518875 markings, 7682958 edges, 217322 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p105)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1073163 markings, 2821265 edges, 214633 markings/sec, 0 secs
lola: 2062623 markings, 5551275 edges, 197892 markings/sec, 5 secs
lola: 3048529 markings, 8247559 edges, 197181 markings/sec, 10 secs
lola: 3980286 markings, 10885874 edges, 186351 markings/sec, 15 secs
lola: 4898935 markings, 13358938 edges, 183730 markings/sec, 20 secs
lola: 5623813 markings, 15972628 edges, 144976 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1191631 markings, 2464288 edges, 238326 markings/sec, 0 secs
lola: 2392115 markings, 4930119 edges, 240097 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p91)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1473433 markings, 2533617 edges, 294687 markings/sec, 0 secs
lola: 2847729 markings, 5000702 edges, 274859 markings/sec, 5 secs
lola: 4155035 markings, 7419170 edges, 261461 markings/sec, 10 secs
lola: 5363217 markings, 9839660 edges, 241636 markings/sec, 15 secs
lola: 6467859 markings, 12310600 edges, 220928 markings/sec, 20 secs
lola: 7509256 markings, 14703883 edges, 208279 markings/sec, 25 secs
lola: 8492398 markings, 17107913 edges, 196628 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p45)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1469922 markings, 2373158 edges, 293984 markings/sec, 0 secs
lola: 2923570 markings, 4703712 edges, 290730 markings/sec, 5 secs
lola: 4338678 markings, 7023448 edges, 283022 markings/sec, 10 secs
lola: 5685823 markings, 9332974 edges, 269429 markings/sec, 15 secs
lola: 6852803 markings, 11708060 edges, 233396 markings/sec, 20 secs
lola: 7974697 markings, 14018086 edges, 224379 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p34)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1610767 markings, 2548403 edges, 322153 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p113)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1238051 markings, 2488927 edges, 247610 markings/sec, 0 secs
lola: 2416023 markings, 4926981 edges, 235594 markings/sec, 5 secs
lola: 3559616 markings, 7366749 edges, 228719 markings/sec, 10 secs
lola: 4593126 markings, 9797670 edges, 206702 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================...considering subproblem: MAX(p67)

lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1489019 markings, 2391320 edges, 297804 markings/sec, 0 secs
lola: 2932601 markings, 4752199 edges, 288716 markings/sec, 5 secs
lola: 4333478 markings, 7114646 edges, 280175 markings/sec, 10 secs
lola: 5659603 markings, 9445678 edges, 265225 markings/sec, 15 secs
lola: 6842540 markings, 11850746 edges, 236587 markings/sec, 20 secs
lola: 7943614 markings, 14160309 edges, 220215 markings/sec, 25 secs
lola: 8994682 markings, 16484534 edges, 210214 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1286591 markings, 2542788 edges, 257318 markings/sec, 0 secs
lola: 2497489 markings, 5126483 edges, 242180 markings/sec, 5 secs
lola: 3723919 markings, 7754259 edges, 245286 markings/sec, 10 secs
lola: 4938951 markings, 10445550 edges, 243006 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 14 will run for 1610 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p38)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1587416 markings, 2523192 edges, 317483 markings/sec, 0 secs
lola: 2969159 markings, 5025616 edges, 276349 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 15 will run for 3207 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: MAX(p43)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1491706 markings, 2414713 edges, 298341 markings/sec, 0 secs
lola: 2959233 markings, 4773449 edges, 293505 markings/sec, 5 secs
lola: 4388405 markings, 7117236 edges, 285834 markings/sec, 10 secs
lola: 5739254 markings, 9465334 edges, 270170 markings/sec, 15 secs
lola: 6896718 markings, 11853774 edges, 231493 markings/sec, 20 secs
lola: 8031154 markings, 14169531 edges, 226887 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: ========================================
FORMULA DES-PT-00a-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496450337673

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

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="S_DES-PT-00a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/S_DES-PT-00a.tgz
mv S_DES-PT-00a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DES-PT-00a, 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 r098-ebro-149488455600227"
echo "====================================================================="
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
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 ;