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 Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100065
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463691931297

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
UpperBounds @ Peterson-PT-3
FORMULA Peterson-COL-3-UpperBounds-0 1 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-1 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-2 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-3 3 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-4 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-5 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-6 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-7 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-8 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-9 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-10 3 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-11 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-12 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-13 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-14 3 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-UpperBounds-15 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 576/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 244 places, 332 transitions, 229 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-3-UpperBounds.task
lola: read: MAX(CS_3 + CS_1 + CS_2 + CS_0 - 0) : MAX(AskForSection_0_2 + AskForSection_3_1 + AskForSection_2_1 + AskForSection_1_1 + AskForSection_0_1 + AskForSection_3_0 + AskForSection_2_0 + AskForSection_1_0 + AskForSection_0_0 + AskForSection_3_2 + AskForSection_1_2 + AskForSection_2_2 - 0) : MAX(TestTurn_0_0 + TestTurn_1_0 + TestTurn_2_0 + TestTurn_3_0 + TestTurn_0_1 + TestTurn_0_2 + TestTurn_3_1 + TestT... (shortened)
lola: formula length: 5773
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CS_3 + CS_2 + CS_1 + CS_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 1
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AskForSection_3_2 + AskForSection_3_0 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + AskForSection_3_1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(EndTurn_0_2 + EndTurn_0_0 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_1_2 + EndTurn_1_1 + EndTurn_1_0 + EndTurn_0_1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 3
lola: The maximum value of the given expression is 3
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Idle_3 + Idle_2 + Idle_1 + Idle_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TestIdentity_3_2_2 + TestIdentity_3_2_1 + TestIdentity_3_2_0 + TestIdentity_3_2_3 + TestIdentity_3_1_3 + TestIdentity_3_1_2 + TestIdentity_3_1_1 + TestIdentity_3_1_0 + TestIdentity_0_2_3 + TestIdentity_0_2_2 + TestIdentity_0_2_1 + TestIdentity_0_2_0 + TestIdentity_3_0_3 + TestIdentity_3_0_2 + TestIdentity_3_0_1 + TestIdentity_3_0_0 + TestIdentity_0_1_3 + TestIdentity_0_1_2 + TestIdentity_0_1_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TestAlone_1_2_3 + TestAlone_1_2_2 + TestAlone_1_2_0 + TestAlone_1_1_3 + TestAlone_1_1_2 + TestAlone_1_1_0 + TestAlone_1_0_3 + TestAlone_1_0_2 + TestAlone_1_0_0 + TestAlone_3_2_2 + TestAlone_3_2_1 + TestAlone_3_2_0 + TestAlone_3_1_2 + TestAlone_3_1_1 + TestAlone_3_1_0 + TestAlone_0_2_3 + TestAlone_0_2_2 + TestAlone_0_2_1 + TestAlone_3_0_2 + TestAlone_3_0_1 + TestAlone_3_0_0 + TestAlone_0_1_3 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 7 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(IsEndLoop_2_2_3 + IsEndLoop_2_2_2 + IsEndLoop_2_2_1 + IsEndLoop_2_2_0 + IsEndLoop_2_1_3 + IsEndLoop_2_1_2 + IsEndLoop_2_1_1 + IsEndLoop_2_1_0 + IsEndLoop_2_0_3 + IsEndLoop_2_0_2 + IsEndLoop_2_0_1 + IsEndLoop_2_0_0 + IsEndLoop_1_2_3 + IsEndLoop_1_2_2 + IsEndLoop_1_2_1 + IsEndLoop_1_2_0 + IsEndLoop_1_1_3 + IsEndLoop_1_1_2 + IsEndLoop_1_1_1 + IsEndLoop_1_1_0 + IsEndLoop_1_0_3 + IsEndLoop_1_0_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 9 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Idle_3 + Idle_2 + Idle_1 + Idle_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 10 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(EndTurn_0_2 + EndTurn_0_0 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_1_2 + EndTurn_1_1 + EndTurn_1_0 + EndTurn_0_1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 3
lola: The maximum value of the given expression is 3
lola: ========================================
lola: subprocess 11 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(BeginLoop_1_2_3 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_2_0 + BeginLoop_1_1_3 + BeginLoop_1_1_2 + BeginLoop_1_1_1 + BeginLoop_1_1_0 + BeginLoop_1_0_3 + BeginLoop_1_0_2 + BeginLoop_1_0_1 + BeginLoop_1_0_0 + BeginLoop_3_2_3 + BeginLoop_3_2_2 + BeginLoop_3_2_1 + BeginLoop_3_2_0 + BeginLoop_3_1_3 + BeginLoop_3_1_2 + BeginLoop_3_1_1 + BeginLoop_3_1_0 + BeginLoop_0_2_3 + BeginLoop_0_2_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 12 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(BeginLoop_1_2_3 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_2_0 + BeginLoop_1_1_3 + BeginLoop_1_1_2 + BeginLoop_1_1_1 + BeginLoop_1_1_0 + BeginLoop_1_0_3 + BeginLoop_1_0_2 + BeginLoop_1_0_1 + BeginLoop_1_0_0 + BeginLoop_3_2_3 + BeginLoop_3_2_2 + BeginLoop_3_2_1 + BeginLoop_3_2_0 + BeginLoop_3_1_3 + BeginLoop_3_1_2 + BeginLoop_3_1_1 + BeginLoop_3_1_0 + BeginLoop_0_2_3 + BeginLoop_0_2_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 13 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Idle_3 + Idle_2 + Idle_1 + Idle_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 14 will run for 1312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(EndTurn_0_2 + EndTurn_0_0 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_1_2 + EndTurn_1_1 + EndTurn_1_0 + EndTurn_0_1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 3
lola: The maximum value of the given expression is 3
lola: ========================================
lola: subprocess 15 will run for 2572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(WantSection_0_F + WantSection_0_T + WantSection_1_F + WantSection_1_T + WantSection_2_F + WantSection_2_T + WantSection_3_F + WantSection_3_T - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 27 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: 4
lola: The maximum value of the given expression is 4
lola: RESULT
lola: summary: 1 4 4 3 4 4 4 4 4 4 3 4 4 4 3 4
lola: ========================================

BK_STOP 1463692900902

--------------------
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="Peterson-PT-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Peterson-PT-3.tgz
mv Peterson-PT-3 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 Peterson-PT-3, 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 r086kn-ebro-146369088100065"
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 ;