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

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

=== Now, execution of the tool begins

BK_START 1463706102472

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Philosophers-PT-000200
FORMULA Philosophers-COL-000200-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA Philosophers-COL-000200-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-ReachabilityFireability-15 CANNOT_COMPUTE
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: 2000/65536 symbol table entries, 3 collisions
lola: preprocessing...
lola: finding significant places
lola: 1000 places, 1000 transitions, 600 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1400 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000200-ReachabilityFireability.task
lola: read: EF ((((!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(FF1a_14) OR FIREABLE(FF1a_15)) OR FIREABLE(FF1a_16)) OR FIREABLE(FF1a_17)) OR FIREABLE(FF1a_18)) OR FIREABLE(FF1a_19)) OR FIREABLE(FF1a_20)) OR FIREABLE(FF1a_21)) OR FIREABLE(FF1a_6))... (shortened)
lola: formula length: 237999
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1a_14) AND (! FIREABLE(FF1a_15) AND (! FIREABLE(FF1a_16) AND (! FIREABLE(FF1a_17) AND (! FIREABLE(FF1a_18) AND (! FIREABLE(FF1a_19) AND (! FIREABLE(FF1a_20) AND (! FIREABLE(FF1a_21) AND (! FIREABLE(FF1a_6) AND (! FIREABLE(FF1a_7) AND (! FIREABLE(FF1a_8) AND (! FIREABLE(FF1a_9) AND (! FIREABLE(FF1a_10) AND (! FIREABLE(FF1a_11) AND (! FIREABLE(FF1a_12) AND (! FIREABLE(FF1a_13) 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 76 bytes per marking, with 8 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(End_111) AND (! FIREABLE(End_110) AND (! FIREABLE(End_113) AND (! FIREABLE(End_112) AND (! FIREABLE(End_115) AND (! FIREABLE(End_114) AND (! FIREABLE(End_117) AND (! FIREABLE(End_116) AND (! FIREABLE(End_103) AND (! FIREABLE(End_102) AND (! FIREABLE(End_105) AND (! FIREABLE(End_104) AND (! FIREABLE(End_107) AND (! FIREABLE(End_106) AND (! FIREABLE(End_109) AND (! FIREABLE(End_108)... (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 76 bytes per marking, with 8 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_14) OR (FIREABLE(FF1a_15) OR (FIREABLE(FF1a_16) OR (FIREABLE(FF1a_17) OR (FIREABLE(FF1a_18) OR (FIREABLE(FF1a_19) OR (FIREABLE(FF1a_20) OR (FIREABLE(FF1a_21) OR (FIREABLE(FF1a_6) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_9) OR (FIREABLE(FF1a_10) OR (FIREABLE(FF1a_11) OR (FIREABLE(FF1a_12) OR (FIREABLE(FF1a_13) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_3) OR (FIREA... (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 76 bytes per marking, with 8 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 6427752177035960388544002016384709880945827250383603149832192 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1b_19) AND (! FIREABLE(FF1b_18) AND (! FIREABLE(FF1b_21) AND (! FIREABLE(FF1b_20) AND (! FIREABLE(FF1b_15) AND (! FIREABLE(FF1b_14) AND (! FIREABLE(FF1b_17) AND (! FIREABLE(FF1b_16) AND (! FIREABLE(FF1b_27) AND (! FIREABLE(FF1b_26) AND (! FIREABLE(FF1b_29) AND (! FIREABLE(FF1b_28) AND (! FIREABLE(FF1b_23) AND (! FIREABLE(FF1b_22) AND (! FIREABLE(FF1b_25) AND (! FIREABLE(FF1b_24) ... (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 76 bytes per marking, with 8 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 6427752177035960388544002016384709880945827250383603149832192 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1a_14) OR (FIREABLE(FF1a_15) OR (FIREABLE(FF1a_16) OR (FIREABLE(FF1a_17) OR (FIREABLE(FF1a_18) OR (FIREABLE(FF1a_19) OR (FIREABLE(FF1a_20) OR (FIREABLE(FF1a_21) OR (FIREABLE(FF1a_6) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_9) OR (FIREABLE(FF1a_10) OR (FIREABLE(FF1a_11) OR (FIREABLE(FF1a_12) OR (FIREABLE(FF1a_13) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_3) OR (FIREA... (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 76 bytes per marking, with 8 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 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1b_19) AND (! FIREABLE(FF1b_18) AND (! FIREABLE(FF1b_21) AND (! FIREABLE(FF1b_20) AND (! FIREABLE(FF1b_15) AND (! FIREABLE(FF1b_14) AND (! FIREABLE(FF1b_17) AND (! FIREABLE(FF1b_16) AND (! FIREABLE(FF1b_27) AND (! FIREABLE(FF1b_26) AND (! FIREABLE(FF1b_29) AND (! FIREABLE(FF1b_28) AND (! FIREABLE(FF1b_23) AND (! FIREABLE(FF1b_22) AND (! FIREABLE(FF1b_25) AND (! FIREABLE(FF1b_24) ... (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 76 bytes per marking, with 8 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 6427752177035960388544002016384709880945827250383603149832192 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_19) OR (FIREABLE(FF1b_18) OR (FIREABLE(FF1b_21) OR (FIREABLE(FF1b_20) OR (FIREABLE(FF1b_15) OR (FIREABLE(FF1b_14) OR (FIREABLE(FF1b_17) OR (FIREABLE(FF1b_16) OR (FIREABLE(FF1b_27) OR (FIREABLE(FF1b_26) OR (FIREABLE(FF1b_29) OR (FIREABLE(FF1b_28) OR (FIREABLE(FF1b_23) OR (FIREABLE(FF1b_22) OR (FIREABLE(FF1b_25) OR (FIREABLE(FF1b_24) OR (FIREABLE(FF1b_34) OR (FIREABLE(FF1b_35) 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 76 bytes per marking, with 8 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 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_19) OR (FIREABLE(FF1b_18) OR (FIREABLE(FF1b_21) OR (FIREABLE(FF1b_20) OR (FIREABLE(FF1b_15) OR (FIREABLE(FF1b_14) OR (FIREABLE(FF1b_17) OR (FIREABLE(FF1b_16) OR (FIREABLE(FF1b_27) OR (FIREABLE(FF1b_26) OR (FIREABLE(FF1b_29) OR (FIREABLE(FF1b_28) OR (FIREABLE(FF1b_23) OR (FIREABLE(FF1b_22) OR (FIREABLE(FF1b_25) OR (FIREABLE(FF1b_24) OR (FIREABLE(FF1b_34) OR (FIREABLE(FF1b_35) 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 76 bytes per marking, with 8 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 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF2a_3) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_4) AND (! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_92) AND (! FIREABLE(FF2a_93) AND (! FIREABLE(FF2a_90) AND (! FIREABLE(FF2a_91) AND (! FIREABLE(FF2a_88) AND (! FIREABLE(FF2a_89) AND (! FIREABLE(FF2a_86) AND (! FIREABLE(FF2a_87) AND (! FIREABLE(FF2a_100) AND (! FIREABLE(FF2a_101) AND (! FIREABLE(FF2a_98) 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 76 bytes per marking, with 8 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 80016173194558239444185178422943613242102086573551432158717975846449428764120132633137002951162338539708548601144041670325864768934872397355503734886771295359299765701016172714443169740619612914474588009194262077913901084936131484370562187264 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF1b_19) OR (FIREABLE(FF1b_18) OR (FIREABLE(FF1b_21) OR (FIREABLE(FF1b_20) OR (FIREABLE(FF1b_15) OR (FIREABLE(FF1b_14) OR (FIREABLE(FF1b_17) OR (FIREABLE(FF1b_16) OR (FIREABLE(FF1b_27) OR (FIREABLE(FF1b_26) OR (FIREABLE(FF1b_29) OR (FIREABLE(FF1b_28) OR (FIREABLE(FF1b_23) OR (FIREABLE(FF1b_22) OR (FIREABLE(FF1b_25) OR (FIREABLE(FF1b_24) OR (FIREABLE(FF1b_34) OR (FIREABLE(FF1b_35) 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 76 bytes per marking, with 8 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 6427752177035960388544002016384709880945827250383603149832192 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 542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(FF2a_3) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_4) AND (! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_92) AND (! FIREABLE(FF2a_93) AND (! FIREABLE(FF2a_90) AND (! FIREABLE(FF2a_91) AND (! FIREABLE(FF2a_88) AND (! FIREABLE(FF2a_89) AND (! FIREABLE(FF2a_86) AND (! FIREABLE(FF2a_87) AND (! FIREABLE(FF2a_100) AND (! FIREABLE(FF2a_101) AND (! FIREABLE(FF2a_98) A... (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 76 bytes per marking, with 8 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 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(FF2b_40) OR (FIREABLE(FF2b_41) OR (FIREABLE(FF2b_38) OR (FIREABLE(FF2b_39) OR (FIREABLE(FF2b_44) OR (FIREABLE(FF2b_45) OR (FIREABLE(FF2b_42) OR (FIREABLE(FF2b_43) OR (FIREABLE(FF2b_32) OR (FIREABLE(FF2b_33) OR (FIREABLE(FF2b_30) OR (FIREABLE(FF2b_31) OR (FIREABLE(FF2b_36) OR (FIREABLE(FF2b_37) OR (FIREABLE(FF2b_34) OR (FIREABLE(FF2b_35) OR (FIREABLE(FF2b_57) OR (FIREABLE(FF2b_56) 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 76 bytes per marking, with 8 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 2070964402225700395336224329217262037027349447181908835329870190405615554446135196566847434004615107849219545826055610695680 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 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF1a_14) AND (! FIREABLE(FF1a_15) AND (! FIREABLE(FF1a_16) AND (! FIREABLE(FF1a_17) AND (! FIREABLE(FF1a_18) AND (! FIREABLE(FF1a_19) AND (! FIREABLE(FF1a_20) AND (! FIREABLE(FF1a_21) AND (! FIREABLE(FF1a_6) AND (! FIREABLE(FF1a_7) AND (! FIREABLE(FF1a_8) AND (! FIREABLE(FF1a_9) AND (! FIREABLE(FF1a_10) AND (! FIREABLE(FF1a_11) AND (! FIREABLE(FF1a_12) AND (! FIREABLE(FF1a_13) 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 76 bytes per marking, with 8 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 6427752177035960388544002016384709880945827250383603149832192 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(End_111) OR (FIREABLE(End_110) OR (FIREABLE(End_113) OR (FIREABLE(End_112) OR (FIREABLE(End_115) OR (FIREABLE(End_114) OR (FIREABLE(End_117) OR (FIREABLE(End_116) OR (FIREABLE(End_103) OR (FIREABLE(End_102) OR (FIREABLE(End_105) OR (FIREABLE(End_104) OR (FIREABLE(End_107) OR (FIREABLE(End_106) OR (FIREABLE(End_109) OR (FIREABLE(End_108) OR (FIREABLE(End_94) OR (FIREABLE(End_95) 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 76 bytes per marking, with 8 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 1301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(FF1a_14) OR (FIREABLE(FF1a_15) OR (FIREABLE(FF1a_16) OR (FIREABLE(FF1a_17) OR (FIREABLE(FF1a_18) OR (FIREABLE(FF1a_19) OR (FIREABLE(FF1a_20) OR (FIREABLE(FF1a_21) OR (FIREABLE(FF1a_6) OR (FIREABLE(FF1a_7) OR (FIREABLE(FF1a_8) OR (FIREABLE(FF1a_9) OR (FIREABLE(FF1a_10) OR (FIREABLE(FF1a_11) OR (FIREABLE(FF1a_12) OR (FIREABLE(FF1a_13) OR (FIREABLE(FF1a_1) OR (FIREABLE(FF1a_3) 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 76 bytes per marking, with 8 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 2602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(FF2a_3) AND (! FIREABLE(FF2a_2) AND (! FIREABLE(FF2a_5) AND (! FIREABLE(FF2a_4) AND (! FIREABLE(FF2a_1) AND (! FIREABLE(FF2a_92) AND (! FIREABLE(FF2a_93) AND (! FIREABLE(FF2a_90) AND (! FIREABLE(FF2a_91) AND (! FIREABLE(FF2a_88) AND (! FIREABLE(FF2a_89) AND (! FIREABLE(FF2a_86) AND (! FIREABLE(FF2a_87) AND (! FIREABLE(FF2a_100) AND (! FIREABLE(FF2a_101) AND (! FIREABLE(FF2a_98) 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 76 bytes per marking, with 8 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 7764983019069205680019106875529097784969120026111043278132993952055296 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: yes no no yes no yes no no yes no no unknown yes yes yes unknown

BK_STOP 1463707593114

--------------------
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-000200"
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-000200.tgz
mv Philosophers-PT-000200 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-000200, 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-146369088500369"
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 ;