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

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

=== Now, execution of the tool begins

BK_START 1463786673790

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ SharedMemory-PT-000020
FORMULA SharedMemory-COL-000020-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA SharedMemory-COL-000020-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA SharedMemory-COL-000020-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA SharedMemory-COL-000020-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000020-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA SharedMemory-COL-000020-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: 1281/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 461 places, 820 transitions, 420 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 880 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000020-ReachabilityFireability.task
lola: read: AG ((((((((((((((((((((FIREABLE(Req_Ext_Acc_6) OR FIREABLE(Req_Ext_Acc_5)) OR FIREABLE(Req_Ext_Acc_8)) OR FIREABLE(Req_Ext_Acc_7)) OR FIREABLE(Req_Ext_Acc_2)) OR FIREABLE(Req_Ext_Acc_1)) OR FIREABLE(Req_Ext_Acc_4)) OR FIREABLE(Req_Ext_Acc_3)) OR FIREABLE(Req_Ext_Acc_13)) OR FIREABLE(Req_Ext_Acc_14)) OR FIREABLE(Req_Ext_Acc_15)) OR FIREABLE(Req_Ext_Acc_16)) OR FIREABLE(Req_Ext_Acc_9)) OR FIREABLE(R... (shortened)
lola: formula length: 305742
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_8) OR (FIREABLE(Req_Ext_Acc_7) OR (FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_13) OR (FIREABLE(Req_Ext_Acc_14) OR (FIREABLE(Req_Ext_Acc_15) OR (FIREABLE(Req_Ext_Acc_16) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_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 56 bytes per marking, with 28 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to SharedMemory-COL-000020-ReachabilityFireability.sara
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: calling and running sara
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_8) OR (FIREABLE(Req_Ext_Acc_7) OR (FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_13) OR (FIREABLE(Req_Ext_Acc_14) OR (FIREABLE(Req_Ext_Acc_15) OR (FIREABLE(Req_Ext_Acc_16) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_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 56 bytes per marking, with 28 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 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_1) OR (FIREABLE(Begin_Own_Acc_2) OR (FIREABLE(Begin_Own_Acc_15) OR (FIREABLE(Begin_Own_Acc_16) OR (FIREABLE(Begin_Own_Acc_13) OR (FIREABLE(Begin_Own_Acc_14) OR (FIREABLE(Begin_Own_Acc_11) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file SharedMemory-COL-000020-ReachabilityFireability.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 28 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 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_8) OR (FIREABLE(Req_Ext_Acc_7) OR (FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_13) OR (FIREABLE(Req_Ext_Acc_14) OR (FIREABLE(Req_Ext_Acc_15) OR (FIREABLE(Req_Ext_Acc_16) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_10)... (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 56 bytes per marking, with 28 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 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Req_Ext_Acc_6) AND (! FIREABLE(Req_Ext_Acc_5) AND (! FIREABLE(Req_Ext_Acc_8) AND (! FIREABLE(Req_Ext_Acc_7) AND (! FIREABLE(Req_Ext_Acc_2) AND (! FIREABLE(Req_Ext_Acc_1) AND (! FIREABLE(Req_Ext_Acc_4) AND (! FIREABLE(Req_Ext_Acc_3) AND (! FIREABLE(Req_Ext_Acc_13) AND (! FIREABLE(Req_Ext_Acc_14) AND (! FIREABLE(Req_Ext_Acc_15) AND (! FIREABLE(Req_Ext_Acc_16) AND (! FIREABLE(Req_Ext_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: place or transition ordering is non-deterministic

lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 28 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 1053769882700 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 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Begin_Own_Acc_7) AND (! FIREABLE(Begin_Own_Acc_8) AND (! FIREABLE(Begin_Own_Acc_5) AND (! FIREABLE(Begin_Own_Acc_6) AND (! FIREABLE(Begin_Own_Acc_3) AND (! FIREABLE(Begin_Own_Acc_4) AND (! FIREABLE(Begin_Own_Acc_1) AND (! FIREABLE(Begin_Own_Acc_2) AND (! FIREABLE(Begin_Own_Acc_15) AND (! FIREABLE(Begin_Own_Acc_16) AND (! FIREABLE(Begin_Own_Acc_13) AND (! FIREABLE(Begin_Own_Acc_14) ... (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 56 bytes per marking, with 28 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 2322887460 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 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_1) OR (FIREABLE(Begin_Own_Acc_2) OR (FIREABLE(Begin_Own_Acc_15) OR (FIREABLE(Begin_Own_Acc_16) OR (FIREABLE(Begin_Own_Acc_13) OR (FIREABLE(Begin_Own_Acc_14) OR (FIREABLE(Begin_Own_Acc_11) 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 56 bytes per marking, with 28 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to SharedMemory-COL-000020-ReachabilityFireability-6.sara
lola: ========================================
lola: lola: calling and running sara
subprocess 7 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_1) OR (FIREABLE(Begin_Own_Acc_2) OR (FIREABLE(Begin_Own_Acc_15) OR (FIREABLE(Begin_Own_Acc_16) OR (FIREABLE(Begin_Own_Acc_13) OR (FIREABLE(Begin_Own_Acc_14) OR (FIREABLE(Begin_Own_Acc_11) 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 56 bytes per marking, with 28 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file SharedMemory-COL-000020-ReachabilityFireability-6.sara.
lola: ...considering subproblem: AG ((((! FIREABLE(End_Ext_Acc_16_1) AND (! FIREABLE(End_Ext_Acc_17_1) AND (! FIREABLE(End_Ext_Acc_14_1) AND (! FIREABLE(End_Ext_Acc_15_1) AND (! FIREABLE(End_Ext_Acc_12_1) AND (! FIREABLE(End_Ext_Acc_13_1) AND (! FIREABLE(End_Ext_Acc_10_1) AND (! FIREABLE(End_Ext_Acc_11_1) AND (! FIREABLE(End_Ext_Acc_8_1) AND (! FIREABLE(End_Ext_Acc_9_1) AND (! FIREABLE(End_Ext_Acc_6_1) AND (! FIREABLE(End_Ext_Acc... (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 56 bytes per marking, with 28 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 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Req_Ext_Acc_6) AND (! FIREABLE(Req_Ext_Acc_5) AND (! FIREABLE(Req_Ext_Acc_8) AND (! FIREABLE(Req_Ext_Acc_7) AND (! FIREABLE(Req_Ext_Acc_2) AND (! FIREABLE(Req_Ext_Acc_1) AND (! FIREABLE(Req_Ext_Acc_4) AND (! FIREABLE(Req_Ext_Acc_3) AND (! FIREABLE(Req_Ext_Acc_13) AND (! FIREABLE(Req_Ext_Acc_14) AND (! FIREABLE(Req_Ext_Acc_15) AND (! FIREABLE(Req_Ext_Acc_16) AND (! FIREABLE(Req_Ext_... (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 56 bytes per marking, with 28 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Begin_Ext_Acc_20_2) OR (FIREABLE(Begin_Ext_Acc_19_2) OR (FIREABLE(Begin_Ext_Acc_2_3) OR (FIREABLE(Begin_Ext_Acc_1_3) OR (FIREABLE(Begin_Ext_Acc_5_3) OR (FIREABLE(Begin_Ext_Acc_4_3) OR (FIREABLE(Begin_Ext_Acc_7_3) OR (FIREABLE(Begin_Ext_Acc_6_3) OR (FIREABLE(Begin_Ext_Acc_9_3) OR (FIREABLE(Begin_Ext_Acc_8_3) OR (FIREABLE(Begin_Ext_Acc_11_3) OR (FIREABLE(Begin_Ext_Acc_10_3) OR (FIREAB... (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 56 bytes per marking, with 28 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 11 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Req_Ext_Acc_6) AND (! FIREABLE(Req_Ext_Acc_5) AND (! FIREABLE(Req_Ext_Acc_8) AND (! FIREABLE(Req_Ext_Acc_7) AND (! FIREABLE(Req_Ext_Acc_2) AND (! FIREABLE(Req_Ext_Acc_1) AND (! FIREABLE(Req_Ext_Acc_4) AND (! FIREABLE(Req_Ext_Acc_3) AND (! FIREABLE(Req_Ext_Acc_13) AND (! FIREABLE(Req_Ext_Acc_14) AND (! FIREABLE(Req_Ext_Acc_15) AND (! FIREABLE(Req_Ext_Acc_16) AND (! FIREABLE(Req_Ext_... (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 56 bytes per marking, with 28 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 734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Begin_Ext_Acc_20_2) OR (FIREABLE(Begin_Ext_Acc_19_2) OR (FIREABLE(Begin_Ext_Acc_2_3) OR (FIREABLE(Begin_Ext_Acc_1_3) OR (FIREABLE(Begin_Ext_Acc_5_3) OR (FIREABLE(Begin_Ext_Acc_4_3) OR (FIREABLE(Begin_Ext_Acc_7_3) OR (FIREABLE(Begin_Ext_Acc_6_3) OR (FIREABLE(Begin_Ext_Acc_9_3) OR (FIREABLE(Begin_Ext_Acc_8_3) OR (FIREABLE(Begin_Ext_Acc_11_3) OR (FIREABLE(Begin_Ext_Acc_10_3) OR (FIREAB... (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 56 bytes per marking, with 28 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 192562609750 literals
lola: DNF formula is too big, sara cannot be used
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 13 will run for 733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_1) OR (FIREABLE(Begin_Own_Acc_2) OR (FIREABLE(Begin_Own_Acc_15) OR (FIREABLE(Begin_Own_Acc_16) OR (FIREABLE(Begin_Own_Acc_13) OR (FIREABLE(Begin_Own_Acc_14) OR (FIREABLE(Begin_Own_Acc_11) 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 56 bytes per marking, with 28 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to SharedMemory-COL-000020-ReachabilityFireability-13.sara
lola: ========================================
lola: calling and running sara
lola: subprocess 14 will run for 1100 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_8) OR (FIREABLE(Req_Ext_Acc_7) OR (FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_13) OR (FIREABLE(Req_Ext_Acc_14) OR (FIREABLE(Req_Ext_Acc_15) OR (FIREABLE(Req_Ext_Acc_16) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_10)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file SharedMemory-COL-000020-ReachabilityFireability-13.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
sara: place or transition ordering is non-deterministic
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING

lola: Transformation into DNF: expect 137744806160 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 15 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_8) OR (FIREABLE(Req_Ext_Acc_7) OR (FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_13) OR (FIREABLE(Req_Ext_Acc_14) OR (FIREABLE(Req_Ext_Acc_15) OR (FIREABLE(Req_Ext_Acc_16) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_10) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: no no no no unknown unknown no no no yes yes yes unknown no unknown yes
lola: Transformation into DNF: expect 463980 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================

BK_STOP 1463789112172

--------------------
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="SharedMemory-PT-000020"
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/SharedMemory-PT-000020.tgz
mv SharedMemory-PT-000020 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 SharedMemory-PT-000020, 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-146373288900378"
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 ;