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

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

=== Now, execution of the tool begins

BK_START 1463658466914

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ NeoElection-PT-6
FORMULA NeoElection-COL-6-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-6 CANNOT_COMPUTE
FORMULA NeoElection-COL-6-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-10 CANNOT_COMPUTE
FORMULA NeoElection-COL-6-LTLCardinality-11 CANNOT_COMPUTE
FORMULA NeoElection-COL-6-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-13 CANNOT_COMPUTE
FORMULA NeoElection-COL-6-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-LTLCardinality-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: 13265/65536 symbol table entries, 1397 collisions
lola: preprocessing...
lola: finding significant places
lola: 4830 places, 8435 transitions, 1197 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2401 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-6-LTLCardinality.task
lola: read: AG ((G (3 <= P-negotiation_0_0_NONE + P-negotiation_0_0_CO + P-negotiation_0_0_DONE + P-negotiation_0_1_NONE + P-negotiation_0_1_CO + P-negotiation_0_1_DONE + P-negotiation_0_2_NONE + P-negotiation_0_2_CO + P-negotiation_0_2_DONE + P-negotiation_0_3_NONE + P-negotiation_0_3_CO + P-negotiation_0_3_DONE + P-negotiation_0_4_NONE + P-negotiation_0_4_CO + P-negotiation_0_4_DONE + P-negotiation_0_5_NONE... (shortened)
lola: formula length: 187435
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((G (-P-negotiation_1_3_DONE + -P-negotiation_4_5_NONE + -P-negotiation_5_0_CO + -P-negotiation_0_6_CO + -P-negotiation_2_6_NONE + -P-negotiation_4_0_DONE + -P-negotiation_2_1_DONE + -P-negotiation_2_5_CO + -P-negotiation_5_3_NONE + -P-negotiation_0_2_DONE + -P-negotiation_3_4_NONE + -P-negotiation_5_6_DONE + -P-negotiation_1_5_NONE + -P-negotiation_0_1_CO + -P-negotiation_4_4_CO + -P-negotiati... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (-P-network_3_0_RI_6 + -P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -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_5_1_AskP_6 + -P-network_5_1_AskP_5 + -P-network_5_1_AskP_4 + -P-network_5_1_AskP_3 + -P-network_5_1_AskP_2 + -P-network_5_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_2_2_Ann... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 2 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-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_1_1 + -P-sendAnnPs__broadcasting_1_2 + -P-sendAnnPs__broadcasting_1_3 + -P-sendAnnPs__broadcasting_1_4 + -P-sendAnnPs__broadcasting_1_5 + -P-sendAnnPs__broadcasting_1_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((F (-P-electedSecondary_0 + -P-electedSecondary_1 + -P-electedSecondary_2 + -P-electedSecondary_3 + -P-electedSecondary_4 + -P-electedSecondary_5 + -P-electedSecondary_6 <= -3) U F (-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 + -P-crashed_6 + P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-electedSecondar... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 4 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (F (-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_1_6 + -P-masterList_5_1_5 + -P-masterList_5_1_4 + -P-masterList_5_1_3 + -P-masterList_5_1_2 + -P-masterList_5_1_1 + -P-masterList_5_1_0 + -P-masterList_5_2_0 + -P-masterList_5_2_1 + -P-masterList_5_2_2 + -P-masterList_5_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (X (F (-P-electionFailed_6 + -P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (G (-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 + -P-dead_6 + P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-electedSecondary_4 + P-electedSecondary_5 + P-electedSecondary_6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-startNeg__broadcasting_1_6 + -P-startNeg__broadcasting_1_5 + -P-startNeg__broadcasting_0_6 + -P-startNeg__broadcasting_0_5 + -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_5_6 + -P-startNeg__broadcasting_5_5 + -P-startNeg_... (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 152 bytes per marking, with 19 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 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-P-electedPrimary_0 + -P-electedPrimary_1 + -P-electedPrimary_2 + -P-electedPrimary_3 + -P-electedPrimary_4 + -P-electedPrimary_5 + -P-electedPrimary_6 <= -3 U F (P-negotiation_1_3_DONE + P-negotiation_4_5_NONE + P-negotiation_5_0_CO + P-negotiation_0_6_CO + P-negotiation_2_6_NONE + P-negotiation_4_0_DONE + P-negotiation_2_1_DONE + P-negotiation_2_5_CO + P-negotiation_5_3_NONE + P-negotiation_0_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: P-negotiation_1_3_DONE + P-negotiation_4_5_NONE + P-negotiation_5_0_CO + P-negotiation_0_6_CO + P-negotiation_2_6_NONE + -P-masterState_6_F_6 + -P-masterState_1_T_6 + P-negotiation_4_0_DONE + P-negotiation_2_1_DONE + P-negotiation_2_5_CO + P-negotiation_5_3_NONE + P-negotiation_0_2_DONE + P-negotiation_3_4_NONE + P-negotiation_5_6_DONE + P-negotiation_1_5_NONE + P-negotiation_0_1_CO + P-negotiatio... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-6-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_6_PRIM + -P-stage_5_NEG + -P-stage_4_SEC + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + -P-stage_5_PRIM + -P-stage_4_NEG + -P-stage_6_NEG + -P-stage_2_PRIM + -P-stage_1_NEG + -P-stage_0_SEC + -P-stage_3_SEC + -P-stage_6_SEC + -P-stage_1_SEC + -P-stage_4_PRIM + -P-stage_5_SEC + -P-stage_3_NEG + -P-stage_2_SEC <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
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 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-electedSecondary_4 + P-electedSecondary_5 + P-electedSecondary_6 + -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_1_1 + -P-... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (G (P-stage_1_PRIM + P-stage_0_NEG + P-stage_6_PRIM + P-stage_5_NEG + P-stage_4_SEC + P-stage_3_PRIM + P-stage_2_NEG + P-stage_0_PRIM + P-stage_5_PRIM + P-stage_4_NEG + P-stage_6_NEG + P-stage_2_PRIM + P-stage_1_NEG + P-stage_0_SEC + -P-sendAnnPs__broadcasting_0_1 + -P-sendAnnPs__broadcasting_0_2 + -P-sendAnnPs__broadcasting_0_3 + -P-sendAnnPs__broadcasting_0_4 + -P-sendAnnPs__broadcastin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((X (-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_1_6 + -P-masterList_5_1_5 + -P-masterList_5_1_4 + -P-masterList_5_1_3 + -P-masterList_5_1_2 + -P-masterList_5_1_1 + -P-masterList_5_1_0 + -P-masterList_5_2_0 + -P-masterList_5_2_1 + -P-masterList_5_2_2 + -P-masterList_5_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
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 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (-P-startNeg__broadcasting_1_6 + -P-startNeg__broadcasting_1_5 + -P-startNeg__broadcasting_0_6 + -P-startNeg__broadcasting_0_5 + -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_5_6 + -P-startNeg__broadcasting_5_5 + -P-startNeg... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (G (-P-masterState_6_F_6 + -P-masterState_1_T_6 + -P-masterState_3_F_6 + -P-masterState_0_F_6 + -P-masterState_5_F_6 + -P-masterState_2_F_6 + -P-masterState_4_F_6 + -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_4_F_5 + -P-masterState_4_F_4 + -P-masterState_4_F_3 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no yes no yes yes no unknown no no no unknown unknown no unknown no unknown

BK_STOP 1463662006749

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