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 S_NeoElection-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182kn-smll-146444117401071
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464704964666

bkconf 3600
===========================================================================================
===========================================================================================
S_NeoElection-PT-4: translating Petri net model.pnml into LoLA format
S_NeoElection-PT-4: translating formula ReachabilityFireability into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityFireability.xml
touch formulae;


in benchkit_head lolaszeit 3538
ReachabilityFireability @ S_NeoElection-PT-4
FORMULA NeoElection-COL-4-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4170/65536 symbol table entries, 89 collisions
lola: preprocessing...
lola: finding significant places
lola: 1830 places, 2340 transitions, 515 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 895 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-4-ReachabilityFireability.task
lola: read: EF (!((((((((((((((((((((((((((((FIREABLE(T-poll__iAmSecondary_1) OR FIREABLE(T-poll__iAmSecondary_2)) OR FIREABLE(T-poll__iAmSecondary_3)) OR FIREABLE(T-poll__iAmSecondary_4)) OR FIREABLE(T-poll__iAmSecondary_5)) OR FIREABLE(T-poll__iAmSecondary_6)) OR FIREABLE(T-poll__iAmSecondary_7)) OR FIREABLE(T-poll__iAmSecondary_8)) OR FIREABLE(T-poll__iAmSecondary_9)) OR FIREABLE(T-poll__iAmSecondary_10)) ... (shortened)
lola: formula length: 276123
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 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_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 2060 bytes per marking, with 0 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 234 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-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__h... (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 2060 bytes per marking, with 0 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 2380072707366301187702784000 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 2 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleAnsP1_1) OR (FIREABLE(T-poll__handleAnsP1_2) OR (FIREABLE(T-poll__handleAnsP1_3) OR (FIREABLE(T-poll__handleAnsP1_4) OR (FIREABLE(T-poll__handleAnsP1_5) OR (FIREABLE(T-poll__handleAnsP1_6) OR (FIREABLE(T-poll__handleAnsP1_7) OR (FIREABLE(T-poll__handleAnsP1_8) OR (FIREABLE(T-poll__handleAnsP1_9) OR (FIREABLE(T-poll__handleAnsP1_10) OR (FIREABLE(T-poll__handleAnsP1_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 2060 bytes per marking, with 0 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 50 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to NeoElection-COL-4-ReachabilityFireability-2.sara
lola: ========================================
lola: calling and running sara
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleRP_1) OR (FIREABLE(T-poll__handleRP_2) OR (FIREABLE(T-poll__handleRP_3) OR (FIREABLE(T-poll__handleRP_4) OR (FIREABLE(T-poll__handleRP_5) OR (FIREABLE(T-poll__handleRP_6) OR (FIREABLE(T-poll__handleRP_7) OR (FIREABLE(T-poll__handleRP_8) OR (FIREABLE(T-poll__handleRP_9) OR (FIREABLE(T-poll__handleRP_10) OR (FIREABLE(T-poll__handleRP_11) OR (FIREABLE(T-poll__handleRP_12) ... (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 2060 bytes per marking, with 0 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 50 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityFireability-2.sara.
sara: try reading problem file NeoElection-COL-4-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((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-poll__handleAI2_20) OR (FIREABLE(T-poll__handleAI2_21) 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 2060 bytes per marking, with 0 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 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-poll__handleRP_1) OR (FIREABLE(T-poll__handleRP_2) OR (FIREABLE(T-poll__handleRP_3) OR (FIREABLE(T-poll__handleRP_4) OR (FIREABLE(T-poll__handleRP_5) OR (FIREABLE(T-poll__handleRP_6) OR (FIREABLE(T-poll__handleRP_7) OR (FIREABLE(T-poll__handleRP_8) OR (FIREABLE(T-poll__handleRP_9) OR (FIREABLE(T-poll__handleRP_10) OR (FIREABLE(T-poll__handleRP_11) OR (FIREABLE(T-poll__handleRP_12) ... (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 2060 bytes per marking, with 0 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 50 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 328 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) OR FIREABLE(T-sendAnnPs__start_5))))))
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 2060 bytes per marking, with 0 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 5 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityFireability-6.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 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T-poll__start_1) AND (! FIREABLE(T-poll__start_2) AND (! FIREABLE(T-poll__start_3) AND (! FIREABLE(T-poll__start_4) AND ! FIREABLE(T-poll__start_5))))) OR ((! FIREABLE(T-poll__handleAnsP3_13) AND (! FIREABLE(T-poll__handleAnsP3_14) AND (! FIREABLE(T-poll__handleAnsP3_15) AND (! FIREABLE(T-poll__handleAnsP3_18) AND (! FIREABLE(T-poll__handleAnsP3_19) AND (! FIREABLE(T-poll__handle... (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 2060 bytes per marking, with 0 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 281089155582718949745567048896518853409233831789675044780612759676427209687995560757487296955898782479677401496904493679346797292845963047289087525000662321105759535150357888566760546563747829975656862323732198034461077311376818968253331566206085875414446567149606437735722032619252088832 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 8 will run for 364 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_13) OR (FIREABLE(T-poll__handleAnsP2_14) 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 2060 bytes per marking, with 0 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 318736786651049518073225247644960654204074203218763210917704162445117404555403517958519972150902784 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 9 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-poll__start_1) AND (! FIREABLE(T-poll__start_2) AND (! FIREABLE(T-poll__start_3) AND (! FIREABLE(T-poll__start_4) AND (! FIREABLE(T-poll__start_5) 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 (! ... (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 2060 bytes per marking, with 0 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 inf literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 424 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 2060 bytes per marking, with 0 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 75 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityFireability-10.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 11 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-poll__handleRI_1) AND (! FIREABLE(T-poll__handleRI_2) AND (! FIREABLE(T-poll__handleRI_3) AND (! FIREABLE(T-poll__handleRI_4) AND (! FIREABLE(T-poll__handleRI_5) AND (! FIREABLE(T-poll__handleRI_6) AND (! FIREABLE(T-poll__handleRI_7) AND (! FIREABLE(T-poll__handleRI_8) AND (! FIREABLE(T-poll__handleRI_9) AND (! FIREABLE(T-poll__handleRI_10) AND (! FIREABLE(T-poll__handleRI_11) AN... (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 2060 bytes per marking, with 0 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 8266068859306129764089506427376476278174515200 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 507 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))))))
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 2060 bytes per marking, with 0 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 35 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-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 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! 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-poll__handleAI2_19) AND (! FIREABLE(T-poll__handleAI2_20) AND (! FIREABLE(T-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 2060 bytes per marking, with 0 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 3146281843927141299184273783655442777381818056075431828030963351506647388354018586669250840678036195278080624228022098067456 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 14 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-poll__handleRI_1) OR (FIREABLE(T-poll__handleRI_2) OR (FIREABLE(T-poll__handleRI_3) OR (FIREABLE(T-poll__handleRI_4) OR (FIREABLE(T-poll__handleRI_5) OR (FIREABLE(T-poll__handleRI_6) OR (FIREABLE(T-poll__handleRI_7) OR (FIREABLE(T-poll__handleRI_8) OR (FIREABLE(T-poll__handleRI_9) OR (FIREABLE(T-poll__handleRI_10) OR (FIREABLE(T-poll__handleRI_11) OR (FIREABLE(T-poll__handleRI_12)... (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 2060 bytes per marking, with 0 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 31773322855715000 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1350 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 (FIREA... (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 2060 bytes per marking, with 0 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: RESULT
lola: summary: yes unknown yes no yes no no unknown unknown no no unknown no unknown yes yes
lola: ========================================

BK_STOP 1464707154362

--------------------
content from stderr:

parsing of model.pnml complete

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="S_NeoElection-PT-4"
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/S_NeoElection-PT-4.tgz
mv S_NeoElection-PT-4 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 S_NeoElection-PT-4, 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 r182kn-smll-146444117401071"
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 ;