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

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

=== Now, execution of the tool begins

BK_START 1463761130745

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ SafeBus-PT-10
FORMULA SafeBus-COL-10-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-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: 1947/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 316 places, 1631 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 983 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-10-ReachabilityFireability.task
lola: read: AG (!(((((((((((((FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2)) OR FIREABLE(I_rec2_3_3)) OR FIREABLE(I_rec2_4_4)) OR FIREABLE(I_rec2_5_5)) OR FIREABLE(I_rec2_6_6)) OR FIREABLE(I_rec2_7_7)) OR FIREABLE(I_rec2_8_8)) OR FIREABLE(I_rec2_9_9)) OR FIREABLE(I_rec2_10_10)) AND (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3... (shortened)
lola: formula length: 155546
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(I_rec2_1_1) AND (! FIREABLE(I_rec2_2_2) AND (! FIREABLE(I_rec2_3_3) AND (! FIREABLE(I_rec2_4_4) AND (! FIREABLE(I_rec2_5_5) AND (! FIREABLE(I_rec2_6_6) AND (! FIREABLE(I_rec2_7_7) AND (! FIREABLE(I_rec2_8_8) AND (! FIREABLE(I_rec2_9_9) AND ! FIREABLE(I_rec2_10_10)))))))))) OR ((! FIREABLE(I_free_2_1) AND (! FIREABLE(I_free_3_1) AND (! FIREABLE(I_free_4_1) AND (! FIREABLE(I_free_5... (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 1044 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: Transformation into DNF: expect 54543260 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(I_rec2_1_1) AND (! FIREABLE(I_rec2_2_2) AND (! FIREABLE(I_rec2_3_3) AND (! FIREABLE(I_rec2_4_4) AND (! FIREABLE(I_rec2_5_5) AND (! FIREABLE(I_rec2_6_6) AND (! FIREABLE(I_rec2_7_7) AND (! FIREABLE(I_rec2_8_8) AND (! FIREABLE(I_rec2_9_9) AND (! FIREABLE(I_rec2_10_10) AND (FIREABLE(I_rec2_1_1) OR (FIREABLE(I_rec2_2_2) OR (FIREABLE(I_rec2_3_3) OR (FIREABLE(I_rec2_4_4) OR (FIREABLE(I_r... (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 1044 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 411966 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(C_free_1_1) OR (FIREABLE(C_free_2_2) OR (FIREABLE(C_free_3_3) OR (FIREABLE(C_free_4_4) OR (FIREABLE(C_free_5_5) OR (FIREABLE(C_free_6_6) OR (FIREABLE(C_free_7_7) OR (FIREABLE(C_free_8_8) OR (FIREABLE(C_free_9_9) OR FIREABLE(C_free_10_10)))))))))) AND ((! FIREABLE(C_provide_1_1_1) AND (! FIREABLE(C_provide_2_1_1) AND (! FIREABLE(C_provide_3_1_1) AND (! FIREABLE(C_provide_4_1_1) 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 1044 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 42851681180239748293106683560883701711450583564848536316018688 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(I_ask1_1_1) OR (FIREABLE(I_ask1_2_1) OR (FIREABLE(I_ask1_3_1) OR (FIREABLE(I_ask1_4_1) OR (FIREABLE(I_ask1_5_1) OR (FIREABLE(I_ask1_6_1) OR (FIREABLE(I_ask1_7_1) OR (FIREABLE(I_ask1_8_1) OR (FIREABLE(I_ask1_9_1) OR (FIREABLE(I_ask1_10_1) OR (FIREABLE(I_ask1_1_2) OR (FIREABLE(I_ask1_2_2) OR (FIREABLE(I_ask1_3_2) OR (FIREABLE(I_ask1_4_2) OR (FIREABLE(I_ask1_5_2) OR (FIREABLE(I_ask1_6_2... (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 1044 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 5070602400912917043036859400192 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 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(I_rec2_1_1) AND (! FIREABLE(I_rec2_2_2) AND (! FIREABLE(I_rec2_3_3) AND (! FIREABLE(I_rec2_4_4) AND (! FIREABLE(I_rec2_5_5) AND (! FIREABLE(I_rec2_6_6) AND (! FIREABLE(I_rec2_7_7) AND (! FIREABLE(I_rec2_8_8) AND (! FIREABLE(I_rec2_9_9) AND ! FIREABLE(I_rec2_10_10)))))))))))
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 1044 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 20 literals
lola: write sara problem file to SafeBus-COL-10-ReachabilityFireability-4.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Gto_1) OR (FIREABLE(Gto_2) OR (FIREABLE(Gto_3) OR (FIREABLE(Gto_4) OR (FIREABLE(Gto_5) OR (FIREABLE(Gto_6) OR (FIREABLE(Gto_7) OR (FIREABLE(Gto_8) OR (FIREABLE(Gto_9) OR (FIREABLE(Gto_10) OR (FIREABLE(I_ask2_1_1) OR (FIREABLE(I_ask2_2_1) OR (FIREABLE(I_ask2_3_1) OR (FIREABLE(I_ask2_4_1) OR (FIREABLE(I_ask2_5_1) OR (FIREABLE(I_ask2_6_1) OR (FIREABLE(I_ask2_7_1) OR (FIREABLE(I_ask2_8_... (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 1044 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 544693617285567250586870480896 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 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(I_emit_2_2_1) OR (FIREABLE(I_emit_3_3_1) OR (FIREABLE(I_emit_4_4_1) OR (FIREABLE(I_emit_5_5_1) OR (FIREABLE(I_emit_6_6_1) OR (FIREABLE(I_emit_7_7_1) OR (FIREABLE(I_emit_8_8_1) OR (FIREABLE(I_emit_9_9_1) OR (FIREABLE(I_emit_10_10_1) OR (FIREABLE(I_emit_1_1_2) OR (FIREABLE(I_emit_3_3_2) OR (FIREABLE(I_emit_4_4_2) OR (FIREABLE(I_emit_5_5_2) OR (FIREABLE(I_emit_6_6_2) OR (FIREABLE(I_emi... (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 1044 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 40500 literals
lola: write sara problem file to SafeBus-COL-10-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(I_ask2_1_1) AND (! FIREABLE(I_ask2_2_1) AND (! FIREABLE(I_ask2_3_1) AND (! FIREABLE(I_ask2_4_1) AND (! FIREABLE(I_ask2_5_1) AND (! FIREABLE(I_ask2_6_1) AND (! FIREABLE(I_ask2_7_1) AND (! FIREABLE(I_ask2_8_1) AND (! FIREABLE(I_ask2_9_1) AND (! FIREABLE(I_ask2_10_1) AND (! FIREABLE(I_ask2_1_2) AND (! FIREABLE(I_ask2_2_2) AND (! FIREABLE(I_ask2_3_2) AND (! FIREABLE(I_ask2_4_2) AND (! ... (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 1044 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 200 literals
lola: write sara problem file to SafeBus-COL-10-ReachabilityFireability-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(I_reemit_2_1) OR (FIREABLE(I_reemit_3_1) OR (FIREABLE(I_reemit_4_1) OR (FIREABLE(I_reemit_5_1) OR (FIREABLE(I_reemit_6_1) OR (FIREABLE(I_reemit_7_1) OR (FIREABLE(I_reemit_8_1) OR (FIREABLE(I_reemit_9_1) OR (FIREABLE(I_reemit_10_1) OR (FIREABLE(I_reemit_1_2) OR (FIREABLE(I_reemit_3_2) OR (FIREABLE(I_reemit_4_2) OR (FIREABLE(I_reemit_5_2) OR (FIREABLE(I_reemit_6_2) OR (FIREABLE(I_reemi... (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 1044 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 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(I_reemit_2_1) OR (FIREABLE(I_reemit_3_1) OR (FIREABLE(I_reemit_4_1) OR (FIREABLE(I_reemit_5_1) OR (FIREABLE(I_reemit_6_1) OR (FIREABLE(I_reemit_7_1) OR (FIREABLE(I_reemit_8_1) OR (FIREABLE(I_reemit_9_1) OR (FIREABLE(I_reemit_10_1) OR (FIREABLE(I_reemit_1_2) OR (FIREABLE(I_reemit_3_2) OR (FIREABLE(I_reemit_4_2) OR (FIREABLE(I_reemit_5_2) OR (FIREABLE(I_reemit_6_2) OR (FIREABLE(I_reem... (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 1044 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 126681380 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(C_provide_1_1_1) OR (FIREABLE(C_provide_2_1_1) OR (FIREABLE(C_provide_3_1_1) OR (FIREABLE(C_provide_4_1_1) OR (FIREABLE(C_provide_5_1_1) OR (FIREABLE(C_provide_6_1_1) OR (FIREABLE(C_provide_7_1_1) OR (FIREABLE(C_provide_8_1_1) OR (FIREABLE(C_provide_9_1_1) OR (FIREABLE(C_provide_10_1_1) OR (FIREABLE(C_provide_1_2_2) OR (FIREABLE(C_provide_2_2_2) OR (FIREABLE(C_provide_3_2_2) OR (FIR... (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 1044 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 54600 literals
lola: write sara problem file to SafeBus-COL-10-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(I_ask2_1_1) OR (FIREABLE(I_ask2_2_1) OR (FIREABLE(I_ask2_3_1) OR (FIREABLE(I_ask2_4_1) OR (FIREABLE(I_ask2_5_1) OR (FIREABLE(I_ask2_6_1) OR (FIREABLE(I_ask2_7_1) OR (FIREABLE(I_ask2_8_1) OR (FIREABLE(I_ask2_9_1) OR (FIREABLE(I_ask2_10_1) OR (FIREABLE(I_ask2_1_2) OR (FIREABLE(I_ask2_2_2) OR (FIREABLE(I_ask2_3_2) OR (FIREABLE(I_ask2_4_2) OR (FIREABLE(I_ask2_5_2) OR (FIREABLE(I_ask2_6_2... (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 1044 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 12 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(I_ask2_1_1) AND (! FIREABLE(I_ask2_2_1) AND (! FIREABLE(I_ask2_3_1) AND (! FIREABLE(I_ask2_4_1) AND (! FIREABLE(I_ask2_5_1) AND (! FIREABLE(I_ask2_6_1) AND (! FIREABLE(I_ask2_7_1) AND (! FIREABLE(I_ask2_8_1) AND (! FIREABLE(I_ask2_9_1) AND (! FIREABLE(I_ask2_10_1) AND (! FIREABLE(I_ask2_1_2) AND (! FIREABLE(I_ask2_2_2) AND (! FIREABLE(I_ask2_3_2) AND (! FIREABLE(I_ask2_4_2) AND (!... (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 1044 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 45038200 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 13 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(I_free_2_1) OR (FIREABLE(I_free_3_1) OR (FIREABLE(I_free_4_1) OR (FIREABLE(I_free_5_1) OR (FIREABLE(I_free_6_1) OR (FIREABLE(I_free_7_1) OR (FIREABLE(I_free_8_1) OR (FIREABLE(I_free_9_1) OR (FIREABLE(I_free_10_1) OR (FIREABLE(I_free_1_2) OR (FIREABLE(I_free_3_2) OR (FIREABLE(I_free_4_2) OR (FIREABLE(I_free_5_2) OR (FIREABLE(I_free_6_2) OR (FIREABLE(I_free_7_2) OR (FIREABLE(I_free_8_... (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 1044 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 98044851111402099757612129058816 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 987 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(C_provide_1_1_1) AND (! FIREABLE(C_provide_2_1_1) AND (! FIREABLE(C_provide_3_1_1) AND (! FIREABLE(C_provide_4_1_1) AND (! FIREABLE(C_provide_5_1_1) AND (! FIREABLE(C_provide_6_1_1) AND (! FIREABLE(C_provide_7_1_1) AND (! FIREABLE(C_provide_8_1_1) AND (! FIREABLE(C_provide_9_1_1) AND (! FIREABLE(C_provide_10_1_1) AND (! FIREABLE(C_provide_1_2_2) AND (! FIREABLE(C_provide_2_2_2) 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 1044 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 65833037797202313608403102999032749500129612249293456876626771968 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 1974 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(I_rec2_1_1) OR (FIREABLE(I_rec2_2_2) OR (FIREABLE(I_rec2_3_3) OR (FIREABLE(I_rec2_4_4) OR (FIREABLE(I_rec2_5_5) OR (FIREABLE(I_rec2_6_6) OR (FIREABLE(I_rec2_7_7) OR (FIREABLE(I_rec2_8_8) OR (FIREABLE(I_rec2_9_9) OR FIREABLE(I_rec2_10_10)))))))))))
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 1044 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 20 literals
lola: write sara problem file to SafeBus-COL-10-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no yes yes no no yes unknown no no yes unknown yes unknown yes yes yes

BK_STOP 1463762696212

--------------------
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="SafeBus-PT-10"
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/SafeBus-PT-10.tgz
mv SafeBus-PT-10 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 SafeBus-PT-10, 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 r110kn-smll-146373288700207"
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 ;