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 Philosophers-PT-000050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088500351
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463704637977

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Philosophers-PT-000050
FORMULA Philosophers-COL-000050-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA Philosophers-COL-000050-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA Philosophers-COL-000050-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA Philosophers-COL-000050-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA Philosophers-COL-000050-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-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: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 250 places, 250 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000050-ReachabilityFireability.task
lola: read: AG ((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(FF1b_8) OR FIREABLE(FF1b_9)) OR FIREABLE(FF1b_6)) OR FIREABLE(FF1b_7)) OR FIREABLE(FF1b_12)) OR FIREABLE(FF1b_13)) OR FIREABLE(FF1b_10)) OR FIREABLE(FF1b_11)) OR FIREABLE(FF1b_1)) OR FIREABLE(FF1b_4)) OR FIREABLE(FF1b_5)) OR FIREABLE(FF1b_2)) OR FIREABLE(FF1b_3)) OR FIREABLE(FF1b_38)) OR FIREABLE(FF1b_39)) OR FIREABLE(FF1b_40)) OR FIREA... (shortened)
lola: formula length: 96452
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_8) OR (FIREABLE(FF1b_9) OR (FIREABLE(FF1b_6) OR (FIREABLE(FF1b_7) OR (FIREABLE(FF1b_12) OR (FIREABLE(FF1b_13) OR (FIREABLE(FF1b_10) OR (FIREABLE(FF1b_11) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR (FIREABLE(FF1b_5) OR (FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_38) OR (FIREABLE(FF1b_39) OR (FIREABLE(FF1b_40) OR (FIREABLE(FF1b_41) OR (FIREABLE(FF1b_42) 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 20 bytes per marking, with 10 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: Transformation into DNF: expect 4503599627370392 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF2b_3) AND (! FIREABLE(FF2b_2) AND (! FIREABLE(FF2b_5) AND (! FIREABLE(FF2b_4) AND (! FIREABLE(FF2b_7) AND (! FIREABLE(FF2b_6) AND (! FIREABLE(FF2b_9) AND (! FIREABLE(FF2b_8) AND (! FIREABLE(FF2b_11) AND (! FIREABLE(FF2b_10) AND (! FIREABLE(FF2b_13) AND (! FIREABLE(FF2b_12) AND (! FIREABLE(FF2b_15) AND (! FIREABLE(FF2b_14) AND (! FIREABLE(FF2b_17) AND (! FIREABLE(FF2b_16) AND (! F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 285449538541227308169186755099777543388289564672 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_8) OR (FIREABLE(FF1b_9) OR (FIREABLE(FF1b_6) OR (FIREABLE(FF1b_7) OR (FIREABLE(FF1b_12) OR (FIREABLE(FF1b_13) OR (FIREABLE(FF1b_10) OR (FIREABLE(FF1b_11) OR (FIREABLE(FF1b_1) OR (FIREABLE(FF1b_4) OR (FIREABLE(FF1b_5) OR (FIREABLE(FF1b_2) OR (FIREABLE(FF1b_3) OR (FIREABLE(FF1b_38) OR (FIREABLE(FF1b_39) OR (FIREABLE(FF1b_40) OR (FIREABLE(FF1b_41) OR (FIREABLE(FF1b_42) 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 20 bytes per marking, with 10 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 4503599627370392 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 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1b_8) AND (! FIREABLE(FF1b_9) AND (! FIREABLE(FF1b_6) AND (! FIREABLE(FF1b_7) AND (! FIREABLE(FF1b_12) AND (! FIREABLE(FF1b_13) AND (! FIREABLE(FF1b_10) AND (! FIREABLE(FF1b_11) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_4) AND (! FIREABLE(FF1b_5) AND (! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_38) AND (! FIREABLE(FF1b_39) AND (! FIREABLE(FF1b_40) 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 20 bytes per marking, with 10 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 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1a_26) AND (! FIREABLE(FF1a_27) 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 (! FIREABLE(FF1a_19) AND (! FIREABLE(FF1a_16) AND (! FIREABLE(FF1a_17) AND (! FIREABLE(FF1a_14) AND (! FIREABLE(FF1a_15) AND (! FIREABLE(FF1a_12) AND (! FIREABLE(FF1a_13) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 12929423504107832834007352333171157892523979855410311840969785344 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 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(FF1a_26) OR (FIREABLE(FF1a_27) 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(FF1a_17) OR (FIREABLE(FF1a_14) OR (FIREABLE(FF1a_15) OR (FIREABLE(FF1a_12) OR (FIREABLE(FF1a_13) OR (FIREABLE(FF1a_11) OR (FIREABLE(FF1a_10) 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 20 bytes per marking, with 10 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 56576470318841839222784 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 6 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(End_2) AND (! FIREABLE(End_3) AND (! FIREABLE(End_1) AND (! FIREABLE(End_23) AND (! FIREABLE(End_22) AND (! FIREABLE(End_21) AND (! FIREABLE(End_20) AND (! FIREABLE(End_27) AND (! FIREABLE(End_26) AND (! FIREABLE(End_25) AND (! FIREABLE(End_24) AND (! FIREABLE(End_31) AND (! FIREABLE(End_30) AND (! FIREABLE(End_29) AND (! FIREABLE(End_28) AND (! FIREABLE(End_35) AND (! FIREABLE(En... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 7 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(FF1b_8) AND (! FIREABLE(FF1b_9) AND (! FIREABLE(FF1b_6) AND (! FIREABLE(FF1b_7) AND (! FIREABLE(FF1b_12) AND (! FIREABLE(FF1b_13) AND (! FIREABLE(FF1b_10) AND (! FIREABLE(FF1b_11) AND (! FIREABLE(FF1b_1) AND (! FIREABLE(FF1b_4) AND (! FIREABLE(FF1b_5) AND (! FIREABLE(FF1b_2) AND (! FIREABLE(FF1b_3) AND (! FIREABLE(FF1b_38) AND (! FIREABLE(FF1b_39) AND (! FIREABLE(FF1b_40) 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 20 bytes per marking, with 10 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 1252438793025491513369871222046720 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 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(FF2a_21) AND (! FIREABLE(FF2a_20) AND (! FIREABLE(FF2a_23) AND (! FIREABLE(FF2a_22) AND (! FIREABLE(FF2a_17) AND (! FIREABLE(FF2a_16) AND (! FIREABLE(FF2a_19) AND (! FIREABLE(FF2a_18) AND (! FIREABLE(FF2a_29) AND (! FIREABLE(FF2a_28) AND (! FIREABLE(FF2a_31) AND (! FIREABLE(FF2a_30) AND (! FIREABLE(FF2a_25) AND (! FIREABLE(FF2a_24) AND (! FIREABLE(FF2a_27) AND (! FIREABLE(FF2a_26)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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: Transformation into DNF: expect 2319353808095765331968 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 9 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(End_2) OR (FIREABLE(End_3) OR (FIREABLE(End_1) OR (FIREABLE(End_23) OR (FIREABLE(End_22) OR (FIREABLE(End_21) OR (FIREABLE(End_20) OR (FIREABLE(End_27) OR (FIREABLE(End_26) OR (FIREABLE(End_25) OR (FIREABLE(End_24) OR (FIREABLE(End_31) OR (FIREABLE(End_30) OR (FIREABLE(End_29) OR (FIREABLE(End_28) OR (FIREABLE(End_35) OR (FIREABLE(End_34) OR (FIREABLE(End_33) OR (FIREABLE(End_32) 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 20 bytes per marking, with 10 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 20282409603654534713310258921472 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 10 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(FF2b_3) OR (FIREABLE(FF2b_2) OR (FIREABLE(FF2b_5) OR (FIREABLE(FF2b_4) OR (FIREABLE(FF2b_7) OR (FIREABLE(FF2b_6) OR (FIREABLE(FF2b_9) OR (FIREABLE(FF2b_8) OR (FIREABLE(FF2b_11) OR (FIREABLE(FF2b_10) OR (FIREABLE(FF2b_13) OR (FIREABLE(FF2b_12) OR (FIREABLE(FF2b_15) OR (FIREABLE(FF2b_14) OR (FIREABLE(FF2b_17) OR (FIREABLE(FF2b_16) OR (FIREABLE(FF2b_1) OR (FIREABLE(FF2b_41) 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 20 bytes per marking, with 10 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 11 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1a_26) AND (! FIREABLE(FF1a_27) 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 (! FIREABLE(FF1a_19) AND (! FIREABLE(FF1a_16) AND (! FIREABLE(FF1a_17) AND (! FIREABLE(FF1a_14) AND (! FIREABLE(FF1a_15) AND (! FIREABLE(FF1a_12) AND (! FIREABLE(FF1a_13) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 5070602400912917043036859400192 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(End_2) AND (! FIREABLE(End_3) AND (! FIREABLE(End_1) AND (! FIREABLE(End_23) AND (! FIREABLE(End_22) AND (! FIREABLE(End_21) AND (! FIREABLE(End_20) AND (! FIREABLE(End_27) AND (! FIREABLE(End_26) AND (! FIREABLE(End_25) AND (! FIREABLE(End_24) AND (! FIREABLE(End_31) AND (! FIREABLE(End_30) AND (! FIREABLE(End_29) AND (! FIREABLE(End_28) AND (! FIREABLE(End_35) AND (! FIREABLE(En... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 13 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(End_2) AND (! FIREABLE(End_3) AND (! FIREABLE(End_1) AND (! FIREABLE(End_23) AND (! FIREABLE(End_22) AND (! FIREABLE(End_21) AND (! FIREABLE(End_20) AND (! FIREABLE(End_27) AND (! FIREABLE(End_26) AND (! FIREABLE(End_25) AND (! FIREABLE(End_24) AND (! FIREABLE(End_31) AND (! FIREABLE(End_30) AND (! FIREABLE(End_29) AND (! FIREABLE(End_28) AND (! FIREABLE(End_35) AND (! FIREABLE(End... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 14 will run for 1223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_26) OR (FIREABLE(FF1a_27) 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(FF1a_17) OR (FIREABLE(FF1a_14) OR (FIREABLE(FF1a_15) OR (FIREABLE(FF1a_12) OR (FIREABLE(FF1a_13) OR (FIREABLE(FF1a_11) OR (FIREABLE(FF1a_10) 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 20 bytes per marking, with 10 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 4503599627370392 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 15 will run for 2447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(FF1a_26) OR (FIREABLE(FF1a_27) 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(FF1a_17) OR (FIREABLE(FF1a_14) OR (FIREABLE(FF1a_15) OR (FIREABLE(FF1a_12) OR (FIREABLE(FF1a_13) OR (FIREABLE(FF1a_11) OR (FIREABLE(FF1a_10) 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 20 bytes per marking, with 10 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 yes unknown unknown no unknown no no no yes no yes no yes

BK_STOP 1463705731600

--------------------
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="Philosophers-PT-000050"
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/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 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 Philosophers-PT-000050, 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 r086kn-ebro-146369088500351"
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 ;