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

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

=== Now, execution of the tool begins

BK_START 1463645348030

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ NeoElection-PT-3
FORMULA NeoElection-COL-3-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-ReachabilityFireability-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-ReachabilityFireability.task
lola: read: EF (!(!(!(!((((((((((((((((((((((((((((((((((((((((FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2)) OR FIREABLE(T-poll__handleAI1_3)) OR FIREABLE(T-poll__handleAI1_4)) OR FIREABLE(T-poll__handleAI1_17)) OR FIREABLE(T-poll__handleAI1_18)) OR FIREABLE(T-poll__handleAI1_19)) OR FIREABLE(T-poll__handleAI1_20)) OR FIREABLE(T-poll__handleAI1_21)) OR FIREABLE(T-poll__handleAI1_22)) OR FIRE... (shortened)
lola: formula length: 101205
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAI1_1) OR (FIREABLE(T-poll__handleAI1_2) OR (FIREABLE(T-poll__handleAI1_3) OR (FIREABLE(T-poll__handleAI1_4) OR (FIREABLE(T-poll__handleAI1_17) OR (FIREABLE(T-poll__handleAI1_18) OR (FIREABLE(T-poll__handleAI1_19) OR (FIREABLE(T-poll__handleAI1_20) OR (FIREABLE(T-poll__handleAI1_21) OR (FIREABLE(T-poll__handleAI1_22) OR (FIREABLE(T-poll__handleAI1_23) OR (FIREABLE(T-pol... (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 120 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-poll__handleAI1_1) OR (FIREABLE(T-poll__handleAI1_2) OR (FIREABLE(T-poll__handleAI1_3) OR (FIREABLE(T-poll__handleAI1_4) OR (FIREABLE(T-poll__handleAI1_17) OR (FIREABLE(T-poll__handleAI1_18) OR (FIREABLE(T-poll__handleAI1_19) OR (FIREABLE(T-poll__handleAI1_20) OR (FIREABLE(T-poll__handleAI1_21) OR (FIREABLE(T-poll__handleAI1_22) OR (FIREABLE(T-poll__handleAI1_23) OR (FIREABLE(T-pol... (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 5270347976501178138624 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-poll__handleAI2_9) AND (! FIREABLE(T-poll__handleAI2_10) AND (! FIREABLE(T-poll__handleAI2_11) AND (! FIREABLE(T-poll__handleAI2_12) AND (! FIREABLE(T-poll__handleAI2_13) AND (! FIREABLE(T-poll__handleAI2_14) AND (! FIREABLE(T-poll__handleAI2_15) AND (! FIREABLE(T-poll__handleAI2_16) AND (! FIREABLE(T-poll__handleAI2_17) AND (! FIREABLE(T-poll__handleAI2_18) AND (! FIREABLE(T-po... (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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-poll__handleAI2_9) OR (FIREABLE(T-poll__handleAI2_10) OR (FIREABLE(T-poll__handleAI2_11) OR (FIREABLE(T-poll__handleAI2_12) OR (FIREABLE(T-poll__handleAI2_13) OR (FIREABLE(T-poll__handleAI2_14) OR (FIREABLE(T-poll__handleAI2_15) OR (FIREABLE(T-poll__handleAI2_16) OR (FIREABLE(T-poll__handleAI2_17) OR (FIREABLE(T-poll__handleAI2_18) OR (FIREABLE(T-poll__handleAI2_19) OR (FIREABLE(T-... (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 1983420972322543368842781886099298632658862540143017048569624804088977601505546067911006634230582517369212522175167738150912 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-poll__iAmPrimary_1) OR (FIREABLE(T-poll__iAmPrimary_2) OR (FIREABLE(T-poll__iAmPrimary_3) OR FIREABLE(T-poll__iAmPrimary_4)))) AND (FIREABLE(T-poll__handleAnsP4_3) OR (FIREABLE(T-poll__handleAnsP4_4) OR (FIREABLE(T-poll__handleAnsP4_5) OR (FIREABLE(T-poll__handleAnsP4_6) OR (FIREABLE(T-poll__handleAnsP4_7) OR (FIREABLE(T-poll__handleAnsP4_8) OR (FIREABLE(T-poll__handleAnsP4_11) OR... (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 3456 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-startNeg__start_1) AND (! FIREABLE(T-startNeg__start_2) AND (! FIREABLE(T-startNeg__start_3) AND (! FIREABLE(T-startNeg__start_4) AND (! FIREABLE(T-startNeg__start_1) AND (! FIREABLE(T-startNeg__start_2) AND (! FIREABLE(T-startNeg__start_3) AND ! FIREABLE(T-startNeg__start_4)))))))) OR ((! FIREABLE(T-poll__iAmSecondary_1) AND (! FIREABLE(T-poll__iAmSecondary_2) AND (! FIREABLE(T... (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 13449218115035983730954407139385160550428738049948391210423348971748896297997115197890650335108014792646991201762803712 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-sendAnnPs__end_1) OR (FIREABLE(T-sendAnnPs__end_2) OR (FIREABLE(T-sendAnnPs__end_3) OR FIREABLE(T-sendAnnPs__end_4)))))
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-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityFireability-6.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 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-sendAnnPs__start_1) OR (FIREABLE(T-sendAnnPs__start_2) OR (FIREABLE(T-sendAnnPs__start_3) OR FIREABLE(T-sendAnnPs__start_4)))))
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-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityFireability-7.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 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAI2_9) OR (FIREABLE(T-poll__handleAI2_10) OR (FIREABLE(T-poll__handleAI2_11) OR (FIREABLE(T-poll__handleAI2_12) OR (FIREABLE(T-poll__handleAI2_13) OR (FIREABLE(T-poll__handleAI2_14) OR (FIREABLE(T-poll__handleAI2_15) OR (FIREABLE(T-poll__handleAI2_16) OR (FIREABLE(T-poll__handleAI2_17) OR (FIREABLE(T-poll__handleAI2_18) OR (FIREABLE(T-poll__handleAI2_19) OR (FIREABLE(T-... (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: yes
lola: The predicate is reachable.
lola: Transformation into DNF: expect 768 literals
lola: ========================================
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-poll__iAmPrimary_1) OR (FIREABLE(T-poll__iAmPrimary_2) OR (FIREABLE(T-poll__iAmPrimary_3) OR FIREABLE(T-poll__iAmPrimary_4)))) AND ((FIREABLE(T-startNeg__start_1) OR (FIREABLE(T-startNeg__start_2) OR (FIREABLE(T-startNeg__start_3) OR FIREABLE(T-startNeg__start_4)))) AND ((FIREABLE(T-poll__handleRI_1) OR (FIREABLE(T-poll__handleRI_2) OR (FIREABLE(T-poll__handleRI_3) OR (FIREABLE(T-... (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 3904 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-startSec_1) OR (FIREABLE(T-startSec_2) OR (FIREABLE(T-startSec_3) OR FIREABLE(T-startSec_4)))) AND ((FIREABLE(T-poll__handleAskP_1) OR (FIREABLE(T-poll__handleAskP_2) OR (FIREABLE(T-poll__handleAskP_3) OR (FIREABLE(T-poll__handleAskP_4) OR (FIREABLE(T-poll__handleAskP_5) OR (FIREABLE(T-poll__handleAskP_6) OR (FIREABLE(T-poll__handleAskP_7) OR (FIREABLE(T-poll__handleAskP_8) OR (FI... (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 172149991872460584875720563413915520213025161133078585103723899333542501401596556372231696023928165135825828052186827849728 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-poll__handleAskP_1) OR (FIREABLE(T-poll__handleAskP_2) OR (FIREABLE(T-poll__handleAskP_3) OR (FIREABLE(T-poll__handleAskP_4) OR (FIREABLE(T-poll__handleAskP_5) OR (FIREABLE(T-poll__handleAskP_6) OR (FIREABLE(T-poll__handleAskP_7) OR (FIREABLE(T-poll__handleAskP_8) OR (FIREABLE(T-poll__handleAskP_9) OR (FIREABLE(T-poll__handleAskP_10) OR (FIREABLE(T-poll__handleAskP_11) OR (FIREAB... (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 3643167034521217820275101656097020350465005319826454269157965824 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 858 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAnsP4_3) OR (FIREABLE(T-poll__handleAnsP4_4) OR (FIREABLE(T-poll__handleAnsP4_5) OR (FIREABLE(T-poll__handleAnsP4_6) OR (FIREABLE(T-poll__handleAnsP4_7) OR (FIREABLE(T-poll__handleAnsP4_8) OR (FIREABLE(T-poll__handleAnsP4_11) OR (FIREABLE(T-poll__handleAnsP4_12) OR (FIREABLE(T-poll__handleAnsP4_13) OR (FIREABLE(T-poll__handleAnsP4_14) OR (FIREABLE(T-poll__handleAnsP4_15... (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 288 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityFireability-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 1141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAI2_9) OR (FIREABLE(T-poll__handleAI2_10) OR (FIREABLE(T-poll__handleAI2_11) OR (FIREABLE(T-poll__handleAI2_12) OR (FIREABLE(T-poll__handleAI2_13) OR (FIREABLE(T-poll__handleAI2_14) OR (FIREABLE(T-poll__handleAI2_15) OR (FIREABLE(T-poll__handleAI2_16) OR (FIREABLE(T-poll__handleAI2_17) OR (FIREABLE(T-poll__handleAI2_18) OR (FIREABLE(T-poll__handleAI2_19) OR (FIREABLE(T-... (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: yes
lola: The predicate is reachable.
lola: Transformation into DNF: expect 768 literals
lola: ========================================
lola: subprocess 14 will run for 1711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAnsP4_3) OR (FIREABLE(T-poll__handleAnsP4_4) OR (FIREABLE(T-poll__handleAnsP4_5) OR (FIREABLE(T-poll__handleAnsP4_6) OR (FIREABLE(T-poll__handleAnsP4_7) OR (FIREABLE(T-poll__handleAnsP4_8) OR (FIREABLE(T-poll__handleAnsP4_11) OR (FIREABLE(T-poll__handleAnsP4_12) OR (FIREABLE(T-poll__handleAnsP4_13) OR (FIREABLE(T-poll__handleAnsP4_14) OR (FIREABLE(T-poll__handleAnsP4_15... (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 288 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityFireability-14.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 15 will run for 3411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T-sendAnnPs__send_1) AND (! FIREABLE(T-sendAnnPs__send_2) AND (! FIREABLE(T-sendAnnPs__send_3) AND (! FIREABLE(T-sendAnnPs__send_4) AND (! FIREABLE(T-sendAnnPs__send_5) AND (! FIREABLE(T-sendAnnPs__send_6) AND (! FIREABLE(T-sendAnnPs__send_7) AND (! FIREABLE(T-sendAnnPs__send_8) AND (! FIREABLE(T-sendAnnPs__send_13) AND (! FIREABLE(T-sendAnnPs__send_14) AND (! FIREABLE(T-sendAnnPs_... (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 64 literals
lola: write sara problem file to NeoElection-COL-3-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-3-ReachabilityFireability-15.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: RESULT
lola: summary: yes yes no yes no yes no no yes no no yes no yes no yes

BK_STOP 1463645481199

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