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

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

=== Now, execution of the tool begins

BK_START 1463644820744

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ NeoElection-PT-2
FORMULA NeoElection-COL-2-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-2-ReachabilityCardinality-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: 795/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 357 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-2-ReachabilityCardinality.task
lola: read: AG (1 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2) : EF (((1 <= P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_0_2_2 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P... (shortened)
lola: formula length: 27565
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -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 20 bytes per marking, with 7 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 not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-P-masterList_2_2_2 + -P-masterList_2_2_1 + -P-masterList_2_2_0 + -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_2_0 + -P-masterList_0_2_1 + -P-masterList_0_2_2 + -P-masterList_1_2_2 + -P-masterList_1_2_1 + -P-masterList_1_2_0 + -P-masterList_1_1_2 + -P-masterList_1_1_1 + -P-masterList_1_1_0 ... (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 20 bytes per marking, with 7 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 <= -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 20 bytes per marking, with 7 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 not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-negotiation_2_1_DONE + -P-negotiation_0_2_DONE + -P-negotiation_0_1_CO + -P-negotiation_1_0_DONE + -P-negotiation_2_0_CO + -P-negotiation_1_2_NONE + -P-negotiation_2_2_CO + -P-negotiation_1_1_NONE + -P-negotiation_0_0_NONE + -P-negotiation_2_2_DONE + -P-negotiation_1_1_CO + -P-negotiation_1_1_DONE + -P-negotiation_2_2_NONE + -P-negotiation_1_0_CO + -P-negotiation_0_1_DONE + -P-negotiation_2... (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 20 bytes per marking, with 7 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: EF (((-P-negotiation_2_1_DONE + -P-negotiation_0_2_DONE + -P-negotiation_0_1_CO + -P-negotiation_1_0_DONE + -P-negotiation_2_0_CO + -P-negotiation_1_2_NONE + -P-negotiation_2_2_CO + -P-negotiation_1_1_NONE + -P-negotiation_0_0_NONE + -P-negotiation_2_2_DONE + -P-negotiation_1_1_CO + -P-negotiation_1_1_DONE + -P-negotiation_2_2_NONE + -P-negotiation_1_0_CO + -P-negotiation_0_1_DONE + -P-negotiation... (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 20 bytes per marking, with 7 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= 0 AND (P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_1 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_1 > ... (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 20 bytes per marking, with 7 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_1 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_1 > 0 OR (P-stage_1_PRIM + P-stage_0_NEG + P-stage_2_NEG + P-stage_0_PRIM + P-stage_2_PRIM + P-stage_1_NEG + -P-electedSecondary_2 + -P-electedSeco... (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 20 bytes per marking, with 7 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 3 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-network_1_1_RI_2 + P-network_1_1_RI_1 + P-network_2_2_AnnP_1 + P-network_1_1_AskP_2 + P-network_1_1_AskP_1 + P-network_2_2_AnnP_2 + P-network_2_0_AskP_1 + P-network_2_0_AskP_2 + P-network_0_0_RI_2 + P-network_0_0_RI_1 + P-network_1_0_RP_1 + P-network_1_0_RP_2 + P-network_0_2_AskP_2 + P-network_0_2_AskP_1 + P-network_0_0_AI_1 + P-network_0_0_AI_2 + P-network_2_2_RI_1 + P-network_1_0_AnnP_2 +... (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 20 bytes per marking, with 7 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 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P-electionInit_2 + -P-polling_2 + -P-polling_1 + -P-polling_0 + P-electionInit_0 + P-electionInit_1 <= 0)
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 20 bytes per marking, with 7 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 not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-dead_0 + -P-dead_1 + -P-dead_2 > -1)
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 20 bytes per marking, with 7 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: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: lola: calling and running sara
The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -3)
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 20 bytes per marking, with 7 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 not invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= 0)
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 20 bytes per marking, with 7 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-dead_0 + -P-dead_1 + -P-dead_2 <= -2)
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 20 bytes per marking, with 7 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 not invariant.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + P-electedSecondary_2 + P-electedSecondary_1 + P-electedSecondary_0 <= 0 OR -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 <= -2))
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 20 bytes per marking, with 7 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-2-ReachabilityCardinality-9.sara.
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-2-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-P-polling_2 + -P-polling_1 + -P-polling_0 <= -2 AND -P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_2_NEG + P-dead_0 + P-dead_1 + P-dead_2 + -P-stage_0_PRIM + -P-stage_2_PRIM + -P-stage_1_NEG + -P-stage_0_SEC + -P-stage_1_SEC + -P-stage_2_SEC <= 0) OR (-P-network_1_1_RI_2 + -P-network_1_1_RI_1 + -P-network_2_2_AnnP_1 + -P-network_1_1_AskP_2 + -P-network_1_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-... (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 20 bytes per marking, with 7 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 9 literals
lola: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-14.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-network_1_1_RI_2 + -P-network_1_1_RI_1 + -P-network_2_2_AnnP_1 + -P-network_1_1_AskP_2 + -P-network_1_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-network_2_0_AskP_1 + -P-network_2_0_AskP_2 + -P-network_0_0_RI_2 + -P-network_0_0_RI_1 + -P-network_1_0_RP_1 + -P-network_1_0_RP_2 + -P-network_0_2_AskP_2 + -P-network_0_2_AskP_1 + -P-network_0_0_AI_1 + -P-network_0_0_AI_2 + -P-network_2_2_RI_1 + -P-ne... (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 20 bytes per marking, with 7 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-2-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes no yes yes yes no no no yes no yes no yes no no

BK_STOP 1463644821320

--------------------
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-2"
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-2.tgz
mv NeoElection-PT-2 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-2, 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-146363810900079"
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 ;