About the Execution of LoLA for ClientsAndServers-PT-N0005P0
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 ClientsAndServers-PT-N0005P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-ebro-149580919900173
=====================================================================
--------------------
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 ClientsAndServers-PT-N0005P0-UpperBounds-0
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-1
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-15
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-2
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-3
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-4
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-5
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-6
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-7
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-8
FORMULA_NAME ClientsAndServers-PT-N0005P0-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1496600963284
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
ClientsAndServers-PT-N0005P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0005P0: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ ClientsAndServers-PT-N0005P0 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0005P0-UpperBounds.task
lola: MAX(SwA) : MAX(CA) : MAX(Si) : MAX(SwG) : MAX(SF) : MAX(SwA) : MAX(MtF) : MAX(StR) : MAX(SF) : MAX(StR) : MAX(CA) : MAX(CA) : MAX(CG) : MAX(SG) : MAX(CwA) : MAX(Uf)
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(SwA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1932476 markings, 3278628 edges, 386495 markings/sec, 0 secs
lola: 3781318 markings, 6415789 edges, 369768 markings/sec, 5 secs
lola: 5629206 markings, 9537214 edges, 369578 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 2460242 markings, 2992366 edges, 492048 markings/sec, 0 secs
lola: 4831152 markings, 5878574 edges, 474182 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Si)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1495869 markings, 3314413 edges, 299174 markings/sec, 0 secs
lola: 2867789 markings, 6353683 edges, 274384 markings/sec, 5 secs
lola: 4228135 markings, 9359917 edges, 272069 markings/sec, 10 secs
lola: 5620195 markings, 12434049 edges, 278412 markings/sec, 15 secs
lola: 7016553 markings, 15516656 edges, 279272 markings/sec, 20 secs
lola: 8442835 markings, 18665770 edges, 285256 markings/sec, 25 secs
lola: 9837127 markings, 21743263 edges, 278858 markings/sec, 30 secs
lola: 11215655 markings, 24795287 edges, 275706 markings/sec, 35 secs
lola: 12593392 markings, 27846134 edges, 275547 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: MAX(SwG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1938807 markings, 3428890 edges, 387761 markings/sec, 0 secs
lola: 3900366 markings, 6897020 edges, 392312 markings/sec, 5 secs
lola: 5805157 markings, 10273027 edges, 380958 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: ========================================
lola: 1933281 markings, 3280114 edges, 386656 markings/sec, 0 secs
lola: 3797976 markings, 6444298 edges, 372939 markings/sec, 5 secs
lola: 5680617 markings, 9621445 edges, 376528 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SwA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1911556 markings, 3243128 edges, 382311 markings/sec, 0 secs
lola: 3754674 markings, 6370625 edges, 368624 markings/sec, 5 secs
lola: 5614140 markings, 9511366 edges, 371893 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(MtF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1785124 markings, 3170262 edges, 357025 markings/sec, 0 secs
lola: 3472237 markings, 6161033 edges, 337423 markings/sec, 5 secs
lola: 5175367 markings, 9161681 edges, 340626 markings/sec, 10 secs
lola: 6875113 markings, 12133695 edges, 339949 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(StR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1786291 markings, 3400931 edges, 357258 markings/sec, 0 secs
lola: 3594142 markings, 6844836 edges, 361570 markings/sec, 5 secs
lola: 5410813 markings, 10303569 edges, 363334 markings/sec, 10 secs
lola: 7194071 markings, 13706371 edges, 356652 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1925396 markings, 3266878 edges, 385079 markings/sec, 0 secs
lola: 3794792 markings, 6438297 edges, 373879 markings/sec, 5 secs
lola: 5655285 markings, 9579593 edges, 372099 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 9 will run for 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(StR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 1824490 markings, 3474304 edges, 364898 markings/sec, 0 secs
lola: 3647318 markings, 6946182 edges, 364566 markings/sec, 5 secs
lola: 5473383 markings, 10423794 edges, 365213 markings/sec, 10 secs
lola: 7278927 markings, 13868407 edges, 361109 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 2544514 markings, 3095014 edges, 508903 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: ========================================
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 2561289 markings, 3115434 edges, 512258 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: ========================================
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 2512970 markings, 3085483 edges, 502594 markings/sec, 0 secs
lola: 4903281 markings, 6023356 edges, 478062 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: ========================================
lola: subprocess 13 will run for 1097 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 2123139 markings, 3064290 edges, 424628 markings/sec, 0 secs
lola: 4139112 markings, 5963299 edges, 403195 markings/sec, 5 secs
lola: 6171766 markings, 8878339 edges, 406531 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 14 will run for 1636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CwA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 2613828 markings, 3094483 edges, 522766 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: ========================================
lola: subprocess 15 will run for 3264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Uf)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 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: 2051148 markings, 3217038 edges, 410230 markings/sec, 0 secs
lola: 4001542 markings, 6274854 edges, 390079 markings/sec, 5 secs
lola: 5928948 markings, 9290765 edges, 385481 markings/sec, 10 secs
lola: 7838692 markings, 12265179 edges, 381949 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: RESULT
lola:
SUMMARY: 10 40 10 10 10 10 10 10 10 10 40 40 20 10 40 20
lola: ========================================
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-0 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-1 40 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-4 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-5 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-6 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-10 40 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-11 40 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-12 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-14 40 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-UpperBounds-15 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496601260889
--------------------
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="ClientsAndServers-PT-N0005P0"
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/ClientsAndServers-PT-N0005P0.tgz
mv ClientsAndServers-PT-N0005P0 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 ClientsAndServers-PT-N0005P0, 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 r168-ebro-149580919900173"
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 '
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 ;