About the Execution of LoLa for NeoElection-PT-7
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1961.610 | 3540125.00 | 3546681.00 | 8313.80 | 42 42 ? 7 ? ? 0 ? 42 7 7 ? 49 ? 49 ? | 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 NeoElection-PT-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363810900119
=====================================================================
--------------------
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-7-UpperBounds-0
FORMULA_NAME NeoElection-COL-7-UpperBounds-1
FORMULA_NAME NeoElection-COL-7-UpperBounds-10
FORMULA_NAME NeoElection-COL-7-UpperBounds-11
FORMULA_NAME NeoElection-COL-7-UpperBounds-12
FORMULA_NAME NeoElection-COL-7-UpperBounds-13
FORMULA_NAME NeoElection-COL-7-UpperBounds-14
FORMULA_NAME NeoElection-COL-7-UpperBounds-15
FORMULA_NAME NeoElection-COL-7-UpperBounds-2
FORMULA_NAME NeoElection-COL-7-UpperBounds-3
FORMULA_NAME NeoElection-COL-7-UpperBounds-4
FORMULA_NAME NeoElection-COL-7-UpperBounds-5
FORMULA_NAME NeoElection-COL-7-UpperBounds-6
FORMULA_NAME NeoElection-COL-7-UpperBounds-7
FORMULA_NAME NeoElection-COL-7-UpperBounds-8
FORMULA_NAME NeoElection-COL-7-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1463662542956
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
UpperBounds @ NeoElection-PT-7
FORMULA NeoElection-COL-7-UpperBounds-0 42 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-1 42 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-2 42 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-3 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-4 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-5 CANNOT_COMPUTE
FORMULA NeoElection-COL-7-UpperBounds-6 49 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-7 CANNOT_COMPUTE
FORMULA NeoElection-COL-7-UpperBounds-8 49 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-9 CANNOT_COMPUTE
FORMULA NeoElection-COL-7-UpperBounds-10 CANNOT_COMPUTE
FORMULA NeoElection-COL-7-UpperBounds-11 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-UpperBounds-12 CANNOT_COMPUTE
FORMULA NeoElection-COL-7-UpperBounds-13 CANNOT_COMPUTE
FORMULA NeoElection-COL-7-UpperBounds-14 0 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-7-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: 21240/65536 symbol table entries, 3557 collisions
lola: preprocessing...
lola: finding significant places
lola: 7128 places, 14112 transitions, 1688 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3568 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-7-UpperBounds.task
lola: read: MAX(P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_1_4 + P-masterList_0_1_5 + P-masterList_0_1_6 + P-masterList_0_1_7 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_0_2_2 + P-masterList_0_2_3 + P-masterList_0_2_4 + P-masterList_0_2_5 + P-masterList_0_2_6 + P-masterList_0_2_7 + P-masterList_0_3_0 + P-masterList_0_3_1 + P-masterList_0_3_2... (shortened)
lola: formula length: 200365
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterList_7_6_7 + P-masterList_7_6_6 + P-masterList_7_6_5 + P-masterList_7_6_4 + P-masterList_7_6_3 + P-masterList_7_6_2 + P-masterList_7_6_1 + P-masterList_7_6_0 + P-masterList_2_3_7 + P-masterList_2_3_6 + P-masterList_2_3_5 + P-masterList_2_3_4 + P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_5_2_0 + P-masterList_5_2_1 + P-masterList_5_2_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 42
lola: The maximum value of the given expression is 42
lola: ========================================
lola: subprocess 1 will run for 131 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterList_7_6_7 + P-masterList_7_6_6 + P-masterList_7_6_5 + P-masterList_7_6_4 + P-masterList_7_6_3 + P-masterList_7_6_2 + P-masterList_7_6_1 + P-masterList_7_6_0 + P-masterList_2_3_7 + P-masterList_2_3_6 + P-masterList_2_3_5 + P-masterList_2_3_4 + P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_5_2_0 + P-masterList_5_2_1 + P-masterList_5_2_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 42
lola: The maximum value of the given expression is 42
lola: ========================================
lola: subprocess 2 will run for 141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterList_7_6_7 + P-masterList_7_6_6 + P-masterList_7_6_5 + P-masterList_7_6_4 + P-masterList_7_6_3 + P-masterList_7_6_2 + P-masterList_7_6_1 + P-masterList_7_6_0 + P-masterList_2_3_7 + P-masterList_2_3_6 + P-masterList_2_3_5 + P-masterList_2_3_4 + P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_5_2_0 + P-masterList_5_2_1 + P-masterList_5_2_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 42
lola: The maximum value of the given expression is 42
lola: ========================================
lola: subprocess 3 will run for 152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-startNeg__broadcasting_1_7 + P-startNeg__broadcasting_1_6 + P-startNeg__broadcasting_0_7 + P-startNeg__broadcasting_0_6 + P-startNeg__broadcasting_6_1 + P-startNeg__broadcasting_6_2 + P-startNeg__broadcasting_6_3 + P-startNeg__broadcasting_6_4 + P-startNeg__broadcasting_6_5 + P-startNeg__broadcasting_6_6 + P-startNeg__broadcasting_6_7 + P-startNeg__broadcasting_5_7 + P-startNeg__broadcasting... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 4 will run for 164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-electionInit_7 + P-electionInit_6 + P-electionInit_5 + P-electionInit_3 + P-electionInit_0 + P-electionInit_1 + P-electionInit_2 + P-electionInit_4 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 5 will run for 179 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_0_4 + P-sendAnnPs__broadcasting_0_5 + P-sendAnnPs__broadcasting_0_6 + P-sendAnnPs__broadcasting_0_7 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_4 + P-sendAnnPs__broadcasting_1_5 + P-sendAnnPs_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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 6 will run for 179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-negotiation_1_3_DONE + P-negotiation_4_5_NONE + P-negotiation_5_0_CO + P-negotiation_6_7_DONE + P-negotiation_0_6_CO + P-negotiation_2_6_NONE + P-negotiation_0_7_NONE + P-negotiation_3_7_CO + P-negotiation_4_0_DONE + P-negotiation_7_2_NONE + P-negotiation_2_1_DONE + P-negotiation_2_5_CO + P-negotiation_5_3_NONE + P-negotiation_0_2_DONE + P-negotiation_7_5_DONE + P-negotiation_3_4_NONE + P-ne... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 49
lola: The maximum value of the given expression is 49
lola: ========================================
lola: subprocess 7 will run for 199 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_0_4 + P-sendAnnPs__broadcasting_0_5 + P-sendAnnPs__broadcasting_0_6 + P-sendAnnPs__broadcasting_0_7 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_4 + P-sendAnnPs__broadcasting_1_5 + P-sendAnnPs_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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 8 will run for 200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-negotiation_1_3_DONE + P-negotiation_4_5_NONE + P-negotiation_5_0_CO + P-negotiation_6_7_DONE + P-negotiation_0_6_CO + P-negotiation_2_6_NONE + P-negotiation_0_7_NONE + P-negotiation_3_7_CO + P-negotiation_4_0_DONE + P-negotiation_7_2_NONE + P-negotiation_2_1_DONE + P-negotiation_2_5_CO + P-negotiation_5_3_NONE + P-negotiation_0_2_DONE + P-negotiation_7_5_DONE + P-negotiation_3_4_NONE + P-ne... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 49
lola: The maximum value of the given expression is 49
lola: ========================================
lola: subprocess 9 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 + P-poll__pollEnd_5 + P-poll__pollEnd_6 + P-poll__pollEnd_7 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-network_0_7_RP_7 + P-network_0_7_RP_6 + P-network_0_7_RP_5 + P-network_0_7_RP_4 + P-network_3_0_RI_7 + P-network_0_7_RP_3 + P-network_3_0_RI_6 + P-network_0_7_RP_2 + P-network_3_0_RI_5 + P-network_0_7_RP_1 + P-network_3_0_RI_4 + P-network_2_2_AnnP_1 + P-network_3_0_RI_3 + P-network_3_0_RI_2 + P-network_3_0_RI_1 + P-network_2_2_AnnP_2 + P-network_2_2_AnnP_3 + P-network_2_2_AnnP_4 + P-network_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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 11 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-masterState_6_F_7 + P-masterState_1_T_7 + P-masterState_3_F_7 + P-masterState_0_F_7 + P-masterState_5_F_7 + P-masterState_2_F_7 + P-masterState_7_F_7 + P-masterState_4_F_7 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_T_3 + P-masterState_2_T_4 + P-masterState_2_T_5 + P-masterState_2_T_6 + P-masterState_2_T_7 + P-masterState_4_F_6 + P-masterState_4_F_5 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 12 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__handlingMessage_7 + P-poll__handlingMessage_6 + P-poll__handlingMessage_5 + P-poll__handlingMessage_4 + P-poll__handlingMessage_3 + P-poll__handlingMessage_2 + P-poll__handlingMessage_0 + P-poll__handlingMessage_1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 + P-poll__pollEnd_5 + P-poll__pollEnd_6 + P-poll__pollEnd_7 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__networl_7_7_AnnP_7 + P-poll__networl_7_7_AnnP_6 + P-poll__networl_7_7_AnnP_5 + P-poll__networl_7_7_AnnP_4 + P-poll__networl_7_7_AnnP_3 + P-poll__networl_7_7_AnnP_2 + P-poll__networl_7_7_AnnP_1 + P-poll__networl_7_7_AnnP_0 + P-poll__networl_3_5_RI_7 + P-poll__networl_3_5_RI_6 + P-poll__networl_3_5_RI_5 + P-poll__networl_3_5_RI_4 + P-poll__networl_3_5_RI_3 + P-poll__networl_3_5_RI_2 + P-... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 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 15 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__handlingMessage_7 + P-poll__handlingMessage_6 + P-poll__handlingMessage_5 + P-poll__handlingMessage_4 + P-poll__handlingMessage_3 + P-poll__handlingMessage_2 + P-poll__handlingMessage_0 + P-poll__handlingMessage_1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 212 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: time limit reached - aborting
lola: preliminary result: 42 42 42 7 7 unknown 49 unknown 49 unknown unknown 7 unknown unknown 0
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 1 - aborting LoLA
BK_STOP 1463666083081
--------------------
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-7"
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-7.tgz
mv NeoElection-PT-7 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-7, 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-146363810900119"
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 ;