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 NeoElection-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363810900083
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463644888722

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
UpperBounds @ NeoElection-PT-3
FORMULA NeoElection-COL-3-UpperBounds-0 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-1 3 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-2 6 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-3 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-4 6 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-5 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-6 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-7 3 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-8 3 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-9 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-10 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-11 6 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-12 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-13 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-14 3 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-UpperBounds-15 6 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: 1988/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 972 places, 1016 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 472 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-3-UpperBounds.task
lola: read: MAX(P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3 - 0) : MAX(P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting... (shortened)
lola: formula length: 43193
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(P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-startNeg__broadcasting_1_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_1_1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-network_3_0_RI_3 + P-network_3_0_RI_2 + P-network_3_0_RI_1 + P-network_2_2_AnnP_1 + P-network_2_2_AnnP_2 + P-network_2_2_AnnP_3 + P-network_1_1_RI_3 + P-network_1_1_RI_2 + P-network_1_1_RI_1 + P-network_1_1_AskP_3 + P-network_1_1_AskP_2 + P-network_1_1_AskP_1 + P-network_2_0_AskP_1 + P-network_2_0_AskP_2 + P-network_2_0_AskP_3 + P-network_1_3_AnnP_3 + P-network_1_3_AnnP_2 + P-network_1_3_Ann... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 6
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__waitingMessage_3 + P-poll__waitingMessage_2 + P-poll__waitingMessage_1 + P-poll__waitingMessage_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-network_3_0_RI_3 + P-network_3_0_RI_2 + P-network_3_0_RI_1 + P-network_2_2_AnnP_1 + P-network_2_2_AnnP_2 + P-network_2_2_AnnP_3 + P-network_1_1_RI_3 + P-network_1_1_RI_2 + P-network_1_1_RI_1 + P-network_1_1_AskP_3 + P-network_1_1_AskP_2 + P-network_1_1_AskP_1 + P-network_2_0_AskP_1 + P-network_2_0_AskP_2 + P-network_2_0_AskP_3 + P-network_1_3_AnnP_3 + P-network_1_3_AnnP_2 + P-network_1_3_Ann... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 6
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-crashed_0 + P-crashed_1 + P-crashed_2 + P-crashed_3 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: lola: ========================================
subprocess 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterState_1_T_3 + P-masterState_3_F_3 + P-masterState_0_F_3 + P-masterState_2_F_3 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_T_3 + P-masterState_2_F_0 + P-masterState_2_F_1 + P-masterState_2_F_2 + P-masterState_0_T_0 + P-masterState_0_T_1 + P-masterState_0_T_2 + P-masterState_0_T_3 + P-masterState_3_T_0 + P-masterState_3_T_1 + P-masterState_3_T_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-polling_3 + P-polling_2 + P-polling_1 + P-polling_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__networl_3_2_AI_3 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_0 + P-poll__networl_1_0_AskP_3 + P-poll__networl_1_0_AskP_2 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_0 + P-poll__networl_0_0_RI_0 + P-poll__networl_0_3_AnsP_0 + P-poll__networl_1_3_AI_3 + P-poll__networl_1_3_AI_2 + P-poll__networl_1_3_AI_1 + P-poll__networl_1_3_AI_0 + P-poll__... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_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 40 bytes per marking, with 20 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: 6
lola: The maximum value of the given expression is 6
lola: ========================================
lola: subprocess 12 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-sendAnnPs__broadcasting_0_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_3 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 13 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__networl_3_2_AI_3 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_0 + P-poll__networl_1_0_AskP_3 + P-poll__networl_1_0_AskP_2 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_0 + P-poll__networl_0_0_RI_0 + P-poll__networl_0_3_AnsP_0 + P-poll__networl_1_3_AI_3 + P-poll__networl_1_3_AI_2 + P-poll__networl_1_3_AI_1 + P-poll__networl_1_3_AI_0 + P-poll__... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 0
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 14 will run for 1682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterState_1_T_3 + P-masterState_3_F_3 + P-masterState_0_F_3 + P-masterState_2_F_3 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_T_3 + P-masterState_2_F_0 + P-masterState_2_F_1 + P-masterState_2_F_2 + P-masterState_0_T_0 + P-masterState_0_T_1 + P-masterState_0_T_2 + P-masterState_0_T_3 + P-masterState_3_T_0 + P-masterState_3_T_1 + P-masterState_3_T_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 3365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_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 40 bytes per marking, with 20 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: 6
lola: The maximum value of the given expression is 6
lola: RESULT
lola: summary: 0 3 6 0 6 0 0 3 3 0 0 6 0 0 3 6
lola: ========================================

BK_STOP 1463645063661

--------------------
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="NeoElection-PT-3"
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/NeoElection-PT-3.tgz
mv NeoElection-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 NeoElection-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 r074kn-smll-146363810900083"
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 ;