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-3254
Executing tool lola
Input is S_GlobalResAllocation-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612500488
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496391701806


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


checking for too many tokens
===========================================================================================
S_GlobalResAllocation-PT-03: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ S_GlobalResAllocation-PT-03 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4824/65536 symbol table entries, 2874 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 4791 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 243 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-03-UpperBounds.task
lola: MAX(Processes_1 + Processes_2 + Processes_3) : MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6) : MAX(pr_released_3 + pr_released_2 + pr_released_1) : MAX(pr_in_1 + pr_in_2 + pr_in_3) : MAX(Processes_1 + Processes_2 + Processes_3) : MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6) : MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6) : MAX(Processes_1 + Processes_2 + Processes_3) : MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6) : MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6) : MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6) : MAX(pr_released_3 + pr_released_2 + pr_released_1) : MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6) : MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6) : MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6) : MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
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(Processes_1 + Processes_2 + Processes_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(pr_released_3 + pr_released_2 + pr_released_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(pr_in_1 + pr_in_2 + pr_in_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Processes_1 + Processes_2 + Processes_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Processes_1 + Processes_2 + Processes_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(pr_released_3 + pr_released_2 + pr_released_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: subprocess 13 will run for 1170 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 14 will run for 1755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 15 will run for 3508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: RESULT
lola:
SUMMARY: 3 6 12 6 3 6 6 3 6 6 6 12 6 6 6 6
lola: ========================================
FORMULA GlobalResAllocation-COL-03-UpperBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-1 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-2 12 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-3 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-4 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-5 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-6 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-7 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-8 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-9 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-10 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-11 12 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-12 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-13 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-14 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-03-UpperBounds-15 6 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496391735927

--------------------
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_GlobalResAllocation-PT-03"
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_GlobalResAllocation-PT-03.tgz
mv S_GlobalResAllocation-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_GlobalResAllocation-PT-03, 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 r108-blw3-149441612500488"
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 ;