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-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363810900096
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-4-LTLFireability-0
FORMULA_NAME NeoElection-COL-4-LTLFireability-1
FORMULA_NAME NeoElection-COL-4-LTLFireability-10
FORMULA_NAME NeoElection-COL-4-LTLFireability-11
FORMULA_NAME NeoElection-COL-4-LTLFireability-12
FORMULA_NAME NeoElection-COL-4-LTLFireability-13
FORMULA_NAME NeoElection-COL-4-LTLFireability-14
FORMULA_NAME NeoElection-COL-4-LTLFireability-15
FORMULA_NAME NeoElection-COL-4-LTLFireability-2
FORMULA_NAME NeoElection-COL-4-LTLFireability-3
FORMULA_NAME NeoElection-COL-4-LTLFireability-4
FORMULA_NAME NeoElection-COL-4-LTLFireability-5
FORMULA_NAME NeoElection-COL-4-LTLFireability-6
FORMULA_NAME NeoElection-COL-4-LTLFireability-7
FORMULA_NAME NeoElection-COL-4-LTLFireability-8
FORMULA_NAME NeoElection-COL-4-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1463648868792

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLFireability @ NeoElection-PT-4
FORMULA NeoElection-COL-4-LTLFireability-0 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-LTLFireability-2 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-3 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-4 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-5 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-6 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-LTLFireability-8 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-LTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-LTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-LTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-LTLFireability-13 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-LTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-LTLFireability-15 FALSE 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: 4170/65536 symbol table entries, 89 collisions
lola: preprocessing...
lola: finding significant places
lola: 1830 places, 2340 transitions, 515 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 895 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-4-LTLFireability.task
lola: read: AG (X (F (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(T-startNeg__send_1) OR FIREABLE(T-startNeg__send_2)) OR FIREABLE(T-startNeg__send_3)) OR FIREABLE(T-startNeg__send_4)) OR FIREABLE(T-startNeg__send_5)) OR FIREABLE(T-startNeg__send_6)) OR FIREABLE(T-startNeg__send_7)) OR FIREABLE(T-startNeg__send_8)) OR FIREABLE(T-startNeg__send_9)) OR FIREABLE(T-startNeg_... (shortened)
lola: formula length: 114790
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (F ((FIREABLE(T-startNeg__send_1) OR (FIREABLE(T-startNeg__send_2) OR (FIREABLE(T-startNeg__send_3) OR (FIREABLE(T-startNeg__send_4) OR (FIREABLE(T-startNeg__send_5) OR (FIREABLE(T-startNeg__send_6) OR (FIREABLE(T-startNeg__send_7) OR (FIREABLE(T-startNeg__send_8) OR (FIREABLE(T-startNeg__send_9) OR (FIREABLE(T-startNeg__send_10) OR (FIREABLE(T-startNeg__send_11) OR (FIREABLE(T-startNeg__sen... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-sendAnnPs__send_1) OR (FIREABLE(T-sendAnnPs__send_2) OR (FIREABLE(T-sendAnnPs__send_3) OR (FIREABLE(T-sendAnnPs__send_4) OR (FIREABLE(T-sendAnnPs__send_5) OR (FIREABLE(T-sendAnnPs__send_6) OR (FIREABLE(T-sendAnnPs__send_7) OR (FIREABLE(T-sendAnnPs__send_8) OR (FIREABLE(T-sendAnnPs__send_9) OR (FIREABLE(T-sendAnnPs__send_10) OR (FIREABLE(T-sendAnnPs__send_11) OR (FIREABLE(T-sendAnnP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (((FIREABLE(T-sendAnnPs__end_1) OR (FIREABLE(T-sendAnnPs__end_2) OR (FIREABLE(T-sendAnnPs__end_3) OR (FIREABLE(T-sendAnnPs__end_4) OR FIREABLE(T-sendAnnPs__end_5))))) U (FIREABLE(T-startNeg__send_1) OR (FIREABLE(T-startNeg__send_2) OR (FIREABLE(T-startNeg__send_3) OR (FIREABLE(T-startNeg__send_4) OR (FIREABLE(T-startNeg__send_5) OR (FIREABLE(T-startNeg__send_6) OR (FIREABLE(T-startNeg__send_7)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((((FIREABLE(T-startSec_1) OR (FIREABLE(T-startSec_2) OR (FIREABLE(T-startSec_3) OR (FIREABLE(T-startSec_4) OR FIREABLE(T-startSec_5))))) U (FIREABLE(T-poll__handleAnsP3_13) OR (FIREABLE(T-poll__handleAnsP3_14) OR (FIREABLE(T-poll__handleAnsP3_15) OR (FIREABLE(T-poll__handleAnsP3_18) OR (FIREABLE(T-poll__handleAnsP3_19) OR (FIREABLE(T-poll__handleAnsP3_20) OR (FIREABLE(T-poll__handleAnsP3_22) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F ((FIREABLE(T-poll__iAmSecondary_1) OR (FIREABLE(T-poll__iAmSecondary_2) OR (FIREABLE(T-poll__iAmSecondary_3) OR (FIREABLE(T-poll__iAmSecondary_4) OR (FIREABLE(T-poll__iAmSecondary_5) OR (FIREABLE(T-poll__iAmSecondary_6) OR (FIREABLE(T-poll__iAmSecondary_7) OR (FIREABLE(T-poll__iAmSecondary_8) OR (FIREABLE(T-poll__iAmSecondary_9) OR (FIREABLE(T-poll__iAmSecondary_10) OR (FIREABLE(T-poll__iAmS... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (((FIREABLE(T-startSec_1) OR (FIREABLE(T-startSec_2) OR (FIREABLE(T-startSec_3) OR (FIREABLE(T-startSec_4) OR FIREABLE(T-startSec_5))))) U (FIREABLE(T-poll__handleAI2_11) OR (FIREABLE(T-poll__handleAI2_12) OR (FIREABLE(T-poll__handleAI2_13) OR (FIREABLE(T-poll__handleAI2_14) OR (FIREABLE(T-poll__handleAI2_15) OR (FIREABLE(T-poll__handleAI2_16) OR (FIREABLE(T-poll__handleAI2_17) OR (FIREABLE(T-... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (((FIREABLE(T-poll__handleAnsP4_3) OR (FIREABLE(T-poll__handleAnsP4_4) OR (FIREABLE(T-poll__handleAnsP4_5) OR (FIREABLE(T-poll__handleAnsP4_6) OR (FIREABLE(T-poll__handleAnsP4_7) OR (FIREABLE(T-poll__handleAnsP4_8) OR (FIREABLE(T-poll__handleAnsP4_9) OR (FIREABLE(T-poll__handleAnsP4_10) OR (FIREABLE(T-poll__handleAnsP4_13) OR (FIREABLE(T-poll__handleAnsP4_14) OR (FIREABLE(T-poll__handleAnsP4_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-poll__handleRP_1) OR (FIREABLE(T-poll__handleRP_2) OR (FIREABLE(T-poll__handleRP_3) OR (FIREABLE(T-poll__handleRP_4) OR (FIREABLE(T-poll__handleRP_5) OR (FIREABLE(T-poll__handleRP_6) OR (FIREABLE(T-poll__handleRP_7) OR (FIREABLE(T-poll__handleRP_8) OR (FIREABLE(T-poll__handleRP_9) OR (FIREABLE(T-poll__handleRP_10) OR (FIREABLE(T-poll__handleRP_11) OR (FIREABLE(T-poll__handleRP_12) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (G (G ((FIREABLE(T-poll__iAmPrimary_1) OR (FIREABLE(T-poll__iAmPrimary_2) OR (FIREABLE(T-poll__iAmPrimary_3) OR (FIREABLE(T-poll__iAmPrimary_4) OR FIREABLE(T-poll__iAmPrimary_5)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-startNeg__start_1) OR (FIREABLE(T-startNeg__start_2) OR (FIREABLE(T-startNeg__start_3) OR (FIREABLE(T-startNeg__start_4) OR FIREABLE(T-startNeg__start_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file NeoElection-COL-4-LTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(T-poll__iAmPrimary_1) OR (FIREABLE(T-poll__iAmPrimary_2) OR (FIREABLE(T-poll__iAmPrimary_3) OR (FIREABLE(T-poll__iAmPrimary_4) OR FIREABLE(T-poll__iAmPrimary_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(T-poll__iAmPrimary_1) OR (FIREABLE(T-poll__iAmPrimary_2) OR (FIREABLE(T-poll__iAmPrimary_3) OR (FIREABLE(T-poll__iAmPrimary_4) OR FIREABLE(T-poll__iAmPrimary_5))))))
lola: processed formula length: 184
lola: 574051 rewrites
lola: formula mentions 0 of 1830 places; total mentions: 0
lola: closed formula file NeoElection-COL-4-LTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((FIREABLE(T-poll__iAmSecondary_1) OR (FIREABLE(T-poll__iAmSecondary_2) OR (FIREABLE(T-poll__iAmSecondary_3) OR (FIREABLE(T-poll__iAmSecondary_4) OR (FIREABLE(T-poll__iAmSecondary_5) OR (FIREABLE(T-poll__iAmSecondary_6) OR (FIREABLE(T-poll__iAmSecondary_7) OR (FIREABLE(T-poll__iAmSecondary_8) OR (FIREABLE(T-poll__iAmSecondary_9) OR (FIREABLE(T-poll__iAmSecondary_10) OR (FIREABLE(T-poll__iAmSeco... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((FIREABLE(T-poll__iAmSecondary_1) OR (FIREABLE(T-poll__iAmSecondary_2) OR (FIREABLE(T-poll__iAmSecondary_3) OR (FIREABLE(T-poll__iAmSecondary_4) OR (FIREABLE(T-poll__iAmSecondary_5) OR (FIREABLE(T-poll__iAmSecondary_6) OR (FIREABLE(T-poll__iAmSecondary_7) OR (FIREABLE(T-poll__iAmSecondary_8) OR (FIREABLE(T-poll__iAmSecondary_9) OR (FIREABLE(T-poll__iAmSecondary_10) OR (FIREABLE(T-poll__iAmSecon... (shortened)
lola: processed formula length: 964
lola: 574051 rewrites
lola: formula mentions 0 of 1830 places; total mentions: 0
lola: closed formula file NeoElection-COL-4-LTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-startSec_1) OR (FIREABLE(T-startSec_2) OR (FIREABLE(T-startSec_3) OR (FIREABLE(T-startSec_4) OR FIREABLE(T-startSec_5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file NeoElection-COL-4-LTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (G (((FIREABLE(T-poll__handleAnsP3_13) OR (FIREABLE(T-poll__handleAnsP3_14) OR (FIREABLE(T-poll__handleAnsP3_15) OR (FIREABLE(T-poll__handleAnsP3_18) OR (FIREABLE(T-poll__handleAnsP3_19) OR (FIREABLE(T-poll__handleAnsP3_20) OR (FIREABLE(T-poll__handleAnsP3_22) OR (FIREABLE(T-poll__handleAnsP3_24) OR (FIREABLE(T-poll__handleAnsP3_25) OR (FIREABLE(T-poll__handleAnsP3_27) OR (FIREABLE(T-poll__h... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((FIREABLE(T-poll__handleRI_1) OR (FIREABLE(T-poll__handleRI_2) OR (FIREABLE(T-poll__handleRI_3) OR (FIREABLE(T-poll__handleRI_4) OR (FIREABLE(T-poll__handleRI_5) OR (FIREABLE(T-poll__handleRI_6) OR (FIREABLE(T-poll__handleRI_7) OR (FIREABLE(T-poll__handleRI_8) OR (FIREABLE(T-poll__handleRI_9) OR (FIREABLE(T-poll__handleRI_10) OR (FIREABLE(T-poll__handleRI_11) OR (FIREABLE(T-poll__handleRI_12) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((FIREABLE(T-poll__handleRI_1) OR (FIREABLE(T-poll__handleRI_2) OR (FIREABLE(T-poll__handleRI_3) OR (FIREABLE(T-poll__handleRI_4) OR (FIREABLE(T-poll__handleRI_5) OR (FIREABLE(T-poll__handleRI_6) OR (FIREABLE(T-poll__handleRI_7) OR (FIREABLE(T-poll__handleRI_8) OR (FIREABLE(T-poll__handleRI_9) OR (FIREABLE(T-poll__handleRI_10) OR (FIREABLE(T-poll__handleRI_11) OR (FIREABLE(T-poll__handleRI_12) O... (shortened)
lola: processed formula length: 864
lola: 574051 rewrites
lola: formula mentions 0 of 1830 places; total mentions: 0
lola: closed formula file NeoElection-COL-4-LTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 1312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-poll__handleAnsP4_3) OR (FIREABLE(T-poll__handleAnsP4_4) OR (FIREABLE(T-poll__handleAnsP4_5) OR (FIREABLE(T-poll__handleAnsP4_6) OR (FIREABLE(T-poll__handleAnsP4_7) OR (FIREABLE(T-poll__handleAnsP4_8) OR (FIREABLE(T-poll__handleAnsP4_9) OR (FIREABLE(T-poll__handleAnsP4_10) OR (FIREABLE(T-poll__handleAnsP4_13) OR (FIREABLE(T-poll__handleAnsP4_14) OR (FIREABLE(T-poll__handleAnsP4_15)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: RESULT
lola: summary: unknown no unknown unknown unknown unknown unknown no unknown yes no no no unknown no no
lola: ========================================

BK_STOP 1463651096821

--------------------
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-4"
export BK_EXAMINATION="LTLFireability"
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-4.tgz
mv NeoElection-PT-4 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-4, examination is LTLFireability"
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-146363810900096"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;