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

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

=== Now, execution of the tool begins

BK_START 1463645200713

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ NeoElection-PT-3
FORMULA NeoElection-COL-3-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-LTLCardinality-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: 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-LTLCardinality.task
lola: read: AG (X (P-masterState_0_F_0 + P-masterState_0_F_1 + P-masterState_0_F_2 + P-masterState_0_F_3 + P-masterState_0_T_0 + P-masterState_0_T_1 + P-masterState_0_T_2 + P-masterState_0_T_3 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_1_T_0 + P-masterState_1_T_1 + P-masterState_1_T_2 + P-masterState_1_T_3 + P-masterState_2_F_0 + P-masterState_2_F_1... (shortened)
lola: formula length: 107816
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 (-P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + P-masterState_1_T_3 + -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-masterState_3_F_3 + -P-masterList_0_1_0 + -P-masterList_0_1_1 + -P-masterList_0_1_2 + -P-masterList_0_1_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 40 bytes per marking, with 20 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((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: 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 40 bytes per marking, with 20 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((P-stage_1_PRIM + P-stage_0_NEG + P-stage_3_PRIM + P-stage_2_NEG + P-stage_0_PRIM + P-stage_2_PRIM + P-stage_1_NEG + -P-sendAnnPs__broadcasting_0_1 + -P-sendAnnPs__broadcasting_0_2 + -P-sendAnnPs__broadcasting_0_3 + P-stage_3_SEC + P-stage_0_SEC + -P-sendAnnPs__broadcasting_1_1 + -P-sendAnnPs__broadcasting_1_2 + -P-sendAnnPs__broadcasting_1_3 + -P-sendAnnPs__broadcasting_2_1 + -P-sendAnnPs__br... (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 40 bytes per marking, with 20 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 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (-P-startNeg__broadcasting_1_3 + -P-startNeg__broadcasting_1_2 + -P-startNeg__broadcasting_0_3 + -P-startNeg__broadcasting_0_2 + P-crashed_0 + P-crashed_1 + P-crashed_2 + P-crashed_3 + -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__bro... (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 40 bytes per marking, with 20 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 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((X (-P-electionInit_3 + -P-electionInit_2 + P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 + -P-electionInit_0 + -P-electionInit_1 <= 0) U P-stage_1_PRIM + P-stage_0_NEG + P-stage_3_PRIM + P-stage_2_NEG + P-stage_0_PRIM + P-stage_2_PRIM + P-stage_1_NEG + -P-electedPrimary_3 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 + P-stage_3_SEC + 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 40 bytes per marking, with 20 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 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (G (-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 <= -1)) U F (-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-... (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 40 bytes per marking, with 20 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 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-P-electionInit_3 + -P-electionInit_2 + P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 + -P-electionInit_0 + -P-electionInit_1 <= 0 U P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 + -P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 <= 0) U G (F (-P-stage_1_PRIM + -P-stage_0_NEG + P-electionFailed_3 + P-electionFailed_2 + P-elect... (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 40 bytes per marking, with 20 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 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (-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... (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 40 bytes per marking, with 20 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 8 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-P-negotiation_1_3_DONE + 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__net... (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 40 bytes per marking, with 20 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 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-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 + -... (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 40 bytes per marking, with 20 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 10 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (X (-P-negotiation_1_3_DONE + 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
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: 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 11 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (X (-P-negotiation_1_3_DONE + 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_... (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 40 bytes per marking, with 20 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 12 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (-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_... (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 40 bytes per marking, with 20 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 1161 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= -1 U -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= -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 40 bytes per marking, with 20 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 14 will run for 1742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (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_... (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 40 bytes per marking, with 20 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 15 will run for 3451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (-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 2 states
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: 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: RESULT
lola: summary: no no no no no no yes no no no yes yes no no yes no
lola: ========================================

BK_STOP 1463645289187

--------------------
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="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-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 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-146363810900086"
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 ;