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

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

=== Now, execution of the tool begins

BK_START 1463645303669

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ NeoElection-PT-3
FORMULA NeoElection-COL-3-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityCardinality-15 TRUE 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-ReachabilityCardinality.task
lola: read: EF (!(((P-poll__networl_0_0_AskP_0 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_3 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_3 + P-poll__networl_0_0_RI_0 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_0_RI_3 + P-poll__networl_0_0_AI_0 + P-poll__networl_0_0_AI_1 ... (shortened)
lola: formula length: 82961
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((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 reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-negotiation_1_3_DONE + -P-negotiation_2_1_DONE + -P-negotiation_0_2_DONE + -P-negotiation_0_1_CO + -P-negotiation_3_2_CO + -P-negotiation_1_0_DONE + -P-negotiation_2_0_CO + -P-negotiation_2_3_NONE + -P-negotiation_3_1_NONE + -P-negotiation_1_2_NONE + -P-negotiation_3_3_CO + P-poll__waitingMessage_3 + -P-negotiation_0_3_CO + -P-negotiation_2_2_CO + -P-negotiation_3_0_NONE + -P-negotiation_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file NeoElection-COL-3-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-negotiation_1_3_DONE + P-startNeg__broadcasting_1_3 + P-startNeg__broadcasting_1_2 + -P-negotiation_2_1_DONE + -P-negotiation_0_2_DONE + -P-negotiation_0_1_CO + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_0_2 + -P-negotiation_3_2_CO + -P-negotiation_1_0_DONE + -P-negotiation_2_0_CO + -P-negotiation_2_3_NONE + -P-negotiation_3_1_NONE + -P-negotiation_1_2_NONE + -P-negotiation_3_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file NeoElection-COL-3-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_0_2_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using 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 unreachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 > -2 OR P-startNeg__broadcasting_1_3 + P-startNeg__broadcasting_1_2 + -P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_0_2 + -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-mast... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 > -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: lola: ========================================
calling and running sara
lola: ...considering subproblem: EF ((-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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-7.sara.
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 9 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (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-electionFailed_3 + -P-electionFailed_2 + -P-electionFaile... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-9.sara
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: AG ((-P-startNeg__broadcasting_1_3 + -P-startNeg__broadcasting_1_2 + -P-startNeg__broadcasting_0_3 + -P-startNeg__broadcasting_0_2 + -P-startNeg__broadcasting_3_3 + -P-startNeg__broadcasting_3_2 + -P-startNeg__broadcasting_3_1 + -P-startNeg__broadcasting_0_1 + -P-startNeg__broadcasting_2_3 + -P-startNeg__broadcasting_2_2 + -P-startNeg__broadcasting_2_1 + -P-startNeg__broadcasting_1_1 <= -2 OR P-cr... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-9.sara.
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file NeoElection-COL-3-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-P-electedPrimary_3 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 <= -1 OR P-dead_0 + P-dead_1 + P-dead_2 + P-dead_3 + -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__broadcast... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 7 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= -3 AND -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -1 AND ((-P-sendAnnPs__broadcasting_0_1 + -P-sendAnnPs__broadcasting_0_2 + -P-sendAnnPs__broadcasting_0_3 + P-electedSecondary_3 + P-electedSecondary_2 + P-electedSecondary_1 + P-electedSecondary_0 + -P-sendAnnPs__broadcasting_1_1 + -P-sendAnnPs__broadcasting_1_2 + -P-sendAnnPs__br... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using 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 unreachable.
lola: Transformation into DNF: expect 18 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityCardinality-14.sara
lola: subprocess 15 will run for 3531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: AG ((-P-masterState_1_T_3 + -P-masterState_3_F_3 + -P-masterState_0_F_3 + -P-masterState_2_F_3 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -P-masterState_2_T_3 + -P-masterState_2_F_0 + -P-masterState_2_F_1 + -P-masterState_2_F_2 + P-polling_3 + P-polling_2 + P-polling_1 + P-polling_0 + -P-masterState_0_T_0 + -P-masterState_0_T_1 + -P-masterState_0_T_2 + -P-masterState_0_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
sara: try reading problem file NeoElection-COL-3-ReachabilityCardinality-14.sara.
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 14 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes yes yes no no yes yes no no yes yes no no no yes

BK_STOP 1463645312534

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