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

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

=== Now, execution of the tool begins

BK_START 1463654801762

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ NeoElection-PT-5
FORMULA NeoElection-COL-5-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-ReachabilityFireability-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: 7764/65536 symbol table entries, 409 collisions
lola: preprocessing...
lola: finding significant places
lola: 3090 places, 4674 transitions, 810 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1524 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-5-ReachabilityFireability.task
lola: read: EF (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((... (shortened)
lola: formula length: 540567
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((((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 (FIRE... (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 104 bytes per marking, with 22 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 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(T-poll__handleRP_1) AND (! FIREABLE(T-poll__handleRP_2) AND (! FIREABLE(T-poll__handleRP_3) AND (! FIREABLE(T-poll__handleRP_4) AND (! FIREABLE(T-poll__handleRP_5) AND (! FIREABLE(T-poll__handleRP_6) AND (! FIREABLE(T-poll__handleRP_7) AND (! FIREABLE(T-poll__handleRP_8) AND (! FIREABLE(T-poll__handleRP_9) AND (! FIREABLE(T-poll__handleRP_10) AND (! FIREABLE(T-poll__handleRP_11) A... (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 104 bytes per marking, with 22 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 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-poll__iAmSecondary_1) AND (! FIREABLE(T-poll__iAmSecondary_2) AND (! FIREABLE(T-poll__iAmSecondary_3) AND (! FIREABLE(T-poll__iAmSecondary_4) AND (! FIREABLE(T-poll__iAmSecondary_5) AND (! FIREABLE(T-poll__iAmSecondary_6) AND (! FIREABLE(T-poll__iAmSecondary_7) AND (! FIREABLE(T-poll__iAmSecondary_8) AND (! FIREABLE(T-poll__iAmSecondary_9) AND (! FIREABLE(T-poll__iAmSecondary_10)... (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 104 bytes per marking, with 22 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 37087834703820199323083267391881216 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAnsP2_3) OR (FIREABLE(T-poll__handleAnsP2_4) OR (FIREABLE(T-poll__handleAnsP2_5) OR (FIREABLE(T-poll__handleAnsP2_6) OR (FIREABLE(T-poll__handleAnsP2_7) OR (FIREABLE(T-poll__handleAnsP2_8) OR (FIREABLE(T-poll__handleAnsP2_9) OR (FIREABLE(T-poll__handleAnsP2_10) OR (FIREABLE(T-poll__handleAnsP2_11) OR (FIREABLE(T-poll__handleAnsP2_12) OR (FIREABLE(T-poll__handleAnsP2_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 104 bytes per marking, with 22 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 1080 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-startNeg__end_1) OR (FIREABLE(T-startNeg__end_2) OR (FIREABLE(T-startNeg__end_3) OR (FIREABLE(T-startNeg__end_4) OR (FIREABLE(T-startNeg__end_5) OR FIREABLE(T-startNeg__end_6)))))) AND ((FIREABLE(T-startNeg__send_1) OR (FIREABLE(T-startNeg__send_2) OR (FIREABLE(T-startNeg__send_3) OR (FIREABLE(T-startNeg__send_4) OR (FIREABLE(T-startNeg__send_5) OR (FIREABLE(T-startNeg__send_6) 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 104 bytes per marking, with 22 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 11382756 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-poll__handleAnsP1_1) AND (! FIREABLE(T-poll__handleAnsP1_2) AND (! FIREABLE(T-poll__handleAnsP1_3) AND (! FIREABLE(T-poll__handleAnsP1_4) AND (! FIREABLE(T-poll__handleAnsP1_5) AND (! FIREABLE(T-poll__handleAnsP1_6) AND (! FIREABLE(T-poll__handleAnsP1_7) AND (! FIREABLE(T-poll__handleAnsP1_8) AND (! FIREABLE(T-poll__handleAnsP1_9) AND (! FIREABLE(T-poll__handleAnsP1_10) AND (! F... (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 104 bytes per marking, with 22 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 504 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAnnP2_1) OR (FIREABLE(T-poll__handleAnnP2_2) OR (FIREABLE(T-poll__handleAnnP2_3) OR (FIREABLE(T-poll__handleAnnP2_4) OR (FIREABLE(T-poll__handleAnnP2_5) OR (FIREABLE(T-poll__handleAnnP2_6) OR (FIREABLE(T-poll__handleAnnP2_7) OR (FIREABLE(T-poll__handleAnnP2_8) OR (FIREABLE(T-poll__handleAnnP2_9) OR (FIREABLE(T-poll__handleAnnP2_10) OR (FIREABLE(T-poll__handleAnnP2_11) O... (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 104 bytes per marking, with 22 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 222 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-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 302 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) OR (FIREABLE(T-poll__iAmPrimary_5) OR FIREABLE(T-poll__iAmPrimary_6)))))))
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 104 bytes per marking, with 22 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 48 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-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 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((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 reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 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 8856 literals
lola: ========================================
lola: subprocess 9 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAnsP2_3) OR (FIREABLE(T-poll__handleAnsP2_4) OR (FIREABLE(T-poll__handleAnsP2_5) OR (FIREABLE(T-poll__handleAnsP2_6) OR (FIREABLE(T-poll__handleAnsP2_7) OR (FIREABLE(T-poll__handleAnsP2_8) OR (FIREABLE(T-poll__handleAnsP2_9) OR (FIREABLE(T-poll__handleAnsP2_10) OR (FIREABLE(T-poll__handleAnsP2_11) OR (FIREABLE(T-poll__handleAnsP2_12) OR (FIREABLE(T-poll__handleAnsP2_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 104 bytes per marking, with 22 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 1080 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 387 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) OR (FIREABLE(T-poll__iAmPrimary_5) OR (FIREABLE(T-poll__iAmPrimary_6) OR (FIREABLE(T-poll__handleAnnP2_1) OR (FIREABLE(T-poll__handleAnnP2_2) OR (FIREABLE(T-poll__handleAnnP2_3) OR (FIREABLE(T-poll__handleAnnP2_4) OR (FIREABLE(T-poll__handleAnnP2_5) OR (FIRE... (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 104 bytes per marking, with 22 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 2376 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-startNeg__end_1) OR (FIREABLE(T-startNeg__end_2) OR (FIREABLE(T-startNeg__end_3) OR (FIREABLE(T-startNeg__end_4) OR (FIREABLE(T-startNeg__end_5) OR FIREABLE(T-startNeg__end_6)))))) AND ((FIREABLE(T-startSec_1) OR (FIREABLE(T-startSec_2) OR (FIREABLE(T-startSec_3) OR (FIREABLE(T-startSec_4) OR (FIREABLE(T-startSec_5) OR FIREABLE(T-startSec_6)))))) AND (FIREABLE(T-sendAnnPs__start_... (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 104 bytes per marking, with 22 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 117525465859392 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-poll__end_1) OR (FIREABLE(T-poll__end_2) OR (FIREABLE(T-poll__end_3) OR (FIREABLE(T-poll__end_4) OR (FIREABLE(T-poll__end_5) OR FIREABLE(T-poll__end_6)))))) AND (! FIREABLE(T-sendAnnPs__start_1) AND (! FIREABLE(T-sendAnnPs__start_2) AND (! FIREABLE(T-sendAnnPs__start_3) AND (! FIREABLE(T-sendAnnPs__start_4) AND (! FIREABLE(T-sendAnnPs__start_5) AND (! FIREABLE(T-sendAnnPs__start_6... (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 104 bytes per marking, with 22 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 2353176724011330701027601398204053129163637696603346431454043972063690637538652915614144807873471028893964039300225140782406516569007455069235718021204133095426301328672951897504060982069187311582876817948672 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 13 will run for 516 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_9) OR (FIREABLE(T-poll__handleAnsP4_10) OR (FIREABLE(T-poll__handleAnsP4_11) OR (FIREABLE(T-poll__handleAnsP4_12) 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 104 bytes per marking, with 22 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 1080 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityFireability-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 518 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) OR (FIREABLE(T-sendAnnPs__end_5) OR (FIREABLE(T-sendAnnPs__end_6) OR (FIREABLE(T-startNeg__send_1) OR (FIREABLE(T-startNeg__send_2) OR (FIREABLE(T-startNeg__send_3) OR (FIREABLE(T-startNeg__send_4) OR (FIREABLE(T-startNeg__send_5) OR (FIREABLE(T-startNeg__send_6) ... (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 104 bytes per marking, with 22 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 639462 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 518 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-poll__handleAnsP3_15) OR (FIREABLE(T-poll__handleAnsP3_16) OR (FIREABLE(T-poll__handleAnsP3_17) OR (FIREABLE(T-poll__handleAnsP3_18) OR (FIREABLE(T-poll__handleAnsP3_21) OR (FIREABLE(T-poll__handleAnsP3_22) OR (FIREABLE(T-poll__handleAnsP3_23) OR (FIREABLE(T-poll__handleAnsP3_24) OR (FIREABLE(T-poll__handleAnsP3_26) OR (FIREABLE(T-poll__handleAnsP3_28) OR (FIREABLE(T-poll__handle... (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 104 bytes per marking, with 22 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: RESULT
lola: summary: yes yes yes unknown unknown no no no yes unknown unknown unknown yes no unknown no
lola: ========================================

BK_STOP 1463657824275

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