About the Execution of LoLa for QuasiCertifProtocol-PT-32
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15940.530 | 3119425.00 | 3125087.00 | 8021.70 | ? ? ? ? ? ? 33 ? ? ? ? ? 33 ? ? ? | normal |
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-2979
Executing tool lola
Input is QuasiCertifProtocol-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300128
=====================================================================
--------------------
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 QuasiCertifProtocol-COL-32-UpperBounds-0
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-1
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-2
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-3
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-4
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-5
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-6
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-7
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-8
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1463714446768
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
UpperBounds @ QuasiCertifProtocol-PT-32
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-1 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-2 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-3 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-4 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-5 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-6 33 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-7 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-8 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-9 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 CANNOT_COMPUTE
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: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-32-UpperBounds.task
lola: read: MAX(s6_0 + s6_1 + s6_4 + s6_5 + s6_2 + s6_3 + s6_8 + s6_9 + s6_6 + s6_7 + s6_13 + s6_12 + s6_11 + s6_10 + s6_17 + s6_16 + s6_15 + s6_14 + s6_21 + s6_20 + s6_19 + s6_18 + s6_25 + s6_24 + s6_23 + s6_22 + s6_30 + s6_31 + s6_32 + s6_26 + s6_27 + s6_28 + s6_29 - 0) : MAX(n7_10_0 + n7_9_0 + n7_8_0 + n7_7_0 + n7_6_0 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_7_1 + n7_6_1 + n7_9_1 + n7_8_1... (shortened)
lola: formula length: 36692
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18 + s6_19 + s6_20 + s6_21 + s6_22 + s6_23 + s6_24 + s6_25 + s6_26 + s6_27 + s6_28 + s6_29 + s6_30 + s6_31 + s6_32 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_29_9 + n7_29_8 + n7_29_7 + n7_29_6 + n7_29_5 + n7_29_4 + n7_29_3 + n7_29_2 + n7_29_1 + n7_29_0 + n7_9_32 + n7_9_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s4_10 + s4_11 + s4_12 + s4_13 + s4_14 + s4_15 + s4_16 + s4_17 + s4_18 + s4_19 + s4_20 + s4_21 + s4_22 + s4_23 + s4_24 + s4_25 + s4_26 + s4_27 + s4_28 + s4_29 + s4_30 + s4_31 + s4_32 + s4_9 + s4_8 + s4_7 + s4_6 + s4_5 + s4_4 + s4_3 + s4_2 + s4_1 + s4_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s5_9 + s5_8 + s5_7 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 + s5_10 + s5_11 + s5_12 + s5_13 + s5_14 + s5_15 + s5_16 + s5_17 + s5_18 + s5_19 + s5_20 + s5_21 + s5_22 + s5_23 + s5_24 + s5_25 + s5_26 + s5_27 + s5_28 + s5_29 + s5_30 + s5_31 + s5_32 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Sstart_32 + Sstart_31 + Sstart_30 + Sstart_29 + Sstart_28 + Sstart_27 + Sstart_26 + Sstart_25 + Sstart_24 + Sstart_23 + Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + Sstart_7 + Sstart_8 + Sstart_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 33
lola: The maximum value of the given expression is 33
lola: ========================================
lola: subprocess 7 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_10_9 + n8_10_8 + n8_10_7 + n8_10_6 + n8_10_5 + n8_10_4 + n8_10_3 + n8_10_2 + n8_10_1 + n8_10_0 + n8_23_9 + n8_23_8 + n8_23_7 + n8_23_6 + n8_23_5 + n8_23_4 + n8_23_3 + n8_23_2 + n8_23_1 + n8_23_0 + n8_0_32 + n8_0_31 + n8_0_30 + n8_0_29 + n8_0_28 + n8_0_27 + n8_0_26 + n8_0_25 + n8_0_24 + n8_0_23 + n8_0_22 + n8_0_21 + n8_0_20 + n8_0_19 + n8_0_18 + n8_0_17 + n8_0_16 + n8_0_15 + n8_0_14 + n8_0_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n2_9 + n2_8 + n2_7 + n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + n2_10 + n2_11 + n2_12 + n2_13 + n2_14 + n2_15 + n2_16 + n2_17 + n2_18 + n2_19 + n2_20 + n2_21 + n2_22 + n2_23 + n2_24 + n2_25 + n2_26 + n2_27 + n2_28 + n2_29 + n2_30 + n2_31 + n2_32 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a2 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 + n6_19 + n6_20 + n6_21 + n6_22 + n6_23 + n6_24 + n6_25 + n6_26 + n6_27 + n6_28 + n6_29 + n6_30 + n6_31 + n6_32 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_29_9 + n7_29_8 + n7_29_7 + n7_29_6 + n7_29_5 + n7_29_4 + n7_29_3 + n7_29_2 + n7_29_1 + n7_29_0 + n7_9_32 + n7_9_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s5_9 + s5_8 + s5_7 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 + s5_10 + s5_11 + s5_12 + s5_13 + s5_14 + s5_15 + s5_16 + s5_17 + s5_18 + s5_19 + s5_20 + s5_21 + s5_22 + s5_23 + s5_24 + s5_25 + s5_26 + s5_27 + s5_28 + s5_29 + s5_30 + s5_31 + s5_32 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n3_32 + n3_31 + n3_30 + n3_29 + n3_28 + n3_27 + n3_26 + n3_25 + n3_24 + n3_23 + n3_22 + n3_21 + n3_20 + n3_19 + n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + n3_6 + n3_7 + n3_8 + n3_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Sstart_32 + Sstart_31 + Sstart_30 + Sstart_29 + Sstart_28 + Sstart_27 + Sstart_26 + Sstart_25 + Sstart_24 + Sstart_23 + Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + Sstart_7 + Sstart_8 + Sstart_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 33
lola: The maximum value of the given expression is 33
lola: ========================================
lola: subprocess 15 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: unknown unknown unknown unknown unknown unknown 33 unknown unknown unknown unknown unknown unknown unknown 33 unknown
BK_STOP 1463717566193
--------------------
content from 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="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is QuasiCertifProtocol-PT-32, 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 r098kn-smll-146369140300128"
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 ;