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_Philosophers-PT-000500, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433134200918
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464489104442

bkconf 3600
===========================================================================================
===========================================================================================
S_Philosophers-PT-000500: translating Petri net model.pnml into LoLA format
S_Philosophers-PT-000500: 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 3535
ReachabilityFireability @ S_Philosophers-PT-000500
FORMULA Philosophers-COL-000500-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000500-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3535 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5000/65536 symbol table entries, 37 collisions
lola: preprocessing...
lola: finding significant places
lola: 2500 places, 2500 transitions, 1500 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3500 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000500-ReachabilityFireability.task
lola: read: AG (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((... (shortened)
lola: formula length: 868645
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((((FIREABLE(FF2b_398) OR (FIREABLE(FF2b_399) OR (FIREABLE(FF2b_400) OR (FIREABLE(FF2b_401) OR (FIREABLE(FF2b_402) OR (FIREABLE(FF2b_403) OR (FIREABLE(FF2b_404) OR (FIREABLE(FF2b_405) OR (FIREABLE(FF2b_406) OR (FIREABLE(FF2b_407) OR (FIREABLE(FF2b_408) OR (FIREABLE(FF2b_409) OR (FIREABLE(FF2b_410) OR (FIREABLE(FF2b_411) OR (FIREABLE(FF2b_412) OR (FIREABLE(FF2b_413) OR (FIREABLE(FF2b_383) OR (... (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 6000 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((((FIREABLE(End_35) OR (FIREABLE(End_34) OR (FIREABLE(End_37) OR (FIREABLE(End_36) OR (FIREABLE(End_39) OR (FIREABLE(End_38) OR (FIREABLE(End_41) OR (FIREABLE(End_40) OR (FIREABLE(End_27) OR (FIREABLE(End_26) OR (FIREABLE(End_29) OR (FIREABLE(End_28) OR (FIREABLE(End_31) OR (FIREABLE(End_30) OR (FIREABLE(End_33) OR (FIREABLE(End_32) OR (FIREABLE(End_18) OR (FIREABLE(End_19) OR (FIREABLE(End_... (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 6000 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 2499253369472351694606290412666052918312319502006156225159229859289606730357747450700706015111381779409644888651496879575963430676322772908574650785654112256 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_4) OR (FIREABLE(FF1b_5) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_47) OR (FIREABLE(FF1b_46) OR (FIREABLE(FF1b_49) OR (FIREABLE(FF1b_48) OR (FIREABLE(FF1b_51) OR (FIREABLE(FF1b_50) OR (FIREABLE(FF1b_53) OR (FIREABLE(FF1b_52) OR (FIREABLE(FF1b_39) OR (FIREABLE(FF1b_38) OR (FIREABLE(FF1b_41) OR (FIREABLE(FF1b_40) OR (FIREABLE(FF1b_43) OR (FIRE... (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 6000 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(End_35) AND (! FIREABLE(End_34) AND (! FIREABLE(End_37) AND (! FIREABLE(End_36) AND (! FIREABLE(End_39) AND (! FIREABLE(End_38) AND (! FIREABLE(End_41) AND (! FIREABLE(End_40) AND (! FIREABLE(End_27) AND (! FIREABLE(End_26) AND (! FIREABLE(End_29) AND (! FIREABLE(End_28) AND (! FIREABLE(End_31) AND (! FIREABLE(End_30) AND (! FIREABLE(End_33) AND (! FIREABLE(End_32) AND (! FIREABLE... (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 6000 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1a_9) AND (! FIREABLE(FF1a_8) AND (! FIREABLE(FF1a_7) AND (! FIREABLE(FF1a_6) AND (! FIREABLE(FF1a_5) AND (! FIREABLE(FF1a_4) AND (! FIREABLE(FF1a_3) AND (! FIREABLE(FF1a_2) AND (! FIREABLE(FF1a_1) AND (! FIREABLE(FF1a_24) AND (! FIREABLE(FF1a_25) AND (! FIREABLE(FF1a_22) AND (! FIREABLE(FF1a_23) AND (! FIREABLE(FF1a_20) AND (! FIREABLE(FF1a_21) AND (! FIREABLE(FF1a_18) AND (! 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 6000 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 13093562431584566026375310196096615510218952408163190450650444097748414622638299858254504142507769976221445308983109162511825813651185705144110853128192 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(End_35) AND (! FIREABLE(End_34) AND (! FIREABLE(End_37) AND (! FIREABLE(End_36) AND (! FIREABLE(End_39) AND (! FIREABLE(End_38) AND (! FIREABLE(End_41) AND (! FIREABLE(End_40) AND (! FIREABLE(End_27) AND (! FIREABLE(End_26) AND (! FIREABLE(End_29) AND (! FIREABLE(End_28) AND (! FIREABLE(End_31) AND (! FIREABLE(End_30) AND (! FIREABLE(End_33) AND (! FIREABLE(End_32) AND (! FIREABL... (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 6000 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 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(End_35) OR (FIREABLE(End_34) OR (FIREABLE(End_37) OR (FIREABLE(End_36) OR (FIREABLE(End_39) OR (FIREABLE(End_38) OR (FIREABLE(End_41) OR (FIREABLE(End_40) OR (FIREABLE(End_27) OR (FIREABLE(End_26) OR (FIREABLE(End_29) OR (FIREABLE(End_28) OR (FIREABLE(End_31) OR (FIREABLE(End_30) OR (FIREABLE(End_33) OR (FIREABLE(End_32) OR (FIREABLE(End_18) OR (FIREABLE(End_19) OR (FIREABLE(End_20) ... (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 6000 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 7 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(FF2a_25) OR (FIREABLE(FF2a_24) OR (FIREABLE(FF2a_23) OR (FIREABLE(FF2a_22) OR (FIREABLE(FF2a_21) OR (FIREABLE(FF2a_20) OR (FIREABLE(FF2a_19) OR (FIREABLE(FF2a_18) OR (FIREABLE(FF2a_33) OR (FIREABLE(FF2a_32) OR (FIREABLE(FF2a_31) OR (FIREABLE(FF2a_30) OR (FIREABLE(FF2a_29) OR (FIREABLE(FF2a_28) OR (FIREABLE(FF2a_27) OR (FIREABLE(FF2a_26) OR (FIREABLE(FF2a_40) OR (FIREABLE(FF2a_41) 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 6000 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 8 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(FF1a_9) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_6) OR (FIREABLE(FF1a_5) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR (FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_24) OR (FIREABLE(FF1a_25) OR (FIREABLE(FF1a_22) OR (FIREABLE(FF1a_23) OR (FIREABLE(FF1a_20) OR (FIREABLE(FF1a_21) OR (FIREABLE(FF1a_18) OR (FIREABLE(FF1a_19) OR (FIREABLE(FF1a_16) OR (FIREABL... (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 6000 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(FF1a_9) AND (! FIREABLE(FF1a_8) AND (! FIREABLE(FF1a_7) AND (! FIREABLE(FF1a_6) AND (! FIREABLE(FF1a_5) AND (! FIREABLE(FF1a_4) AND (! FIREABLE(FF1a_3) AND (! FIREABLE(FF1a_2) AND (! FIREABLE(FF1a_1) AND (! FIREABLE(FF1a_24) AND (! FIREABLE(FF1a_25) AND (! FIREABLE(FF1a_22) AND (! FIREABLE(FF1a_23) AND (! FIREABLE(FF1a_20) AND (! FIREABLE(FF1a_21) AND (! FIREABLE(FF1a_18) 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 6000 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 42860344287450687848336228125600543281524409876124929129121864446170188288629338806698205480217669862708873185112873149651368700946454451812843339314810147367808775387218373141670116042535293273667513117704717943300935903709785086909636037982132279436146614790635774902839452137220393441452584596417479180288 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 10 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(End_35) OR (FIREABLE(End_34) OR (FIREABLE(End_37) OR (FIREABLE(End_36) OR (FIREABLE(End_39) OR (FIREABLE(End_38) OR (FIREABLE(End_41) OR (FIREABLE(End_40) OR (FIREABLE(End_27) OR (FIREABLE(End_26) OR (FIREABLE(End_29) OR (FIREABLE(End_28) OR (FIREABLE(End_31) OR (FIREABLE(End_30) OR (FIREABLE(End_33) OR (FIREABLE(End_32) OR (FIREABLE(End_18) OR (FIREABLE(End_19) OR (FIREABLE(End_20... (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 6000 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 2481243174347707122037477842954107467776823537468827282687492790182341802209928931299738263063404654737000710115427044065270717330807311475995237226857365504 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_9) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_6) OR (FIREABLE(FF1a_5) OR (FIREABLE(FF1a_4) OR (FIREABLE(FF1a_3) OR (FIREABLE(FF1a_2) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_24) OR (FIREABLE(FF1a_25) OR (FIREABLE(FF1a_22) OR (FIREABLE(FF1a_23) OR (FIREABLE(FF1a_20) OR (FIREABLE(FF1a_21) OR (FIREABLE(FF1a_18) OR (FIREABLE(FF1a_19) OR (FIREABLE(FF1a_16) OR (FIREABLE... (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 6000 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(End_35) OR (FIREABLE(End_34) OR (FIREABLE(End_37) OR (FIREABLE(End_36) OR (FIREABLE(End_39) OR (FIREABLE(End_38) OR (FIREABLE(End_41) OR (FIREABLE(End_40) OR (FIREABLE(End_27) OR (FIREABLE(End_26) OR (FIREABLE(End_29) OR (FIREABLE(End_28) OR (FIREABLE(End_31) OR (FIREABLE(End_30) OR (FIREABLE(End_33) OR (FIREABLE(End_32) OR (FIREABLE(End_18) OR (FIREABLE(End_19) OR (FIREABLE(End_20)... (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 6000 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 13 will run for 904 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_4) OR (FIREABLE(FF1b_5) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_47) OR (FIREABLE(FF1b_46) OR (FIREABLE(FF1b_49) OR (FIREABLE(FF1b_48) OR (FIREABLE(FF1b_51) OR (FIREABLE(FF1b_50) OR (FIREABLE(FF1b_53) OR (FIREABLE(FF1b_52) OR (FIREABLE(FF1b_39) OR (FIREABLE(FF1b_38) OR (FIREABLE(FF1b_41) OR (FIREABLE(FF1b_40) OR (FIREABLE(FF1b_43) OR (FIRE... (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 6000 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_4) AND (! FIREABLE(FF1b_5) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_47) AND (! FIREABLE(FF1b_46) AND (! FIREABLE(FF1b_49) AND (! FIREABLE(FF1b_48) AND (! FIREABLE(FF1b_51) AND (! FIREABLE(FF1b_50) AND (! FIREABLE(FF1b_53) AND (! FIREABLE(FF1b_52) AND (! FIREABLE(FF1b_39) AND (! FIREABLE(FF1b_38) AND (! FIREABLE(FF1b_41) 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 6000 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 15 will run for 2713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((! FIREABLE(FF1a_9) AND (! FIREABLE(FF1a_8) AND (! FIREABLE(FF1a_7) AND (! FIREABLE(FF1a_6) AND (! FIREABLE(FF1a_5) AND (! FIREABLE(FF1a_4) AND (! FIREABLE(FF1a_3) AND (! FIREABLE(FF1a_2) AND (! FIREABLE(FF1a_1) AND (! FIREABLE(FF1a_24) AND (! FIREABLE(FF1a_25) AND (! FIREABLE(FF1a_22) AND (! FIREABLE(FF1a_23) AND (! FIREABLE(FF1a_20) AND (! FIREABLE(FF1a_21) AND (! FIREABLE(FF1a_18) 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 6000 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: RESULT
lola: summary: no unknown no no yes yes yes yes no unknown no no yes no yes yes

BK_STOP 1464489932847

--------------------
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_Philosophers-PT-000500"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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_Philosophers-PT-000500.tgz
mv S_Philosophers-PT-000500 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_Philosophers-PT-000500, 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 r170kn-ebro-146433134200918"
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 ;