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-000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110kn-smll-146373288900367
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463781496539

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ SharedMemory-PT-000010
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-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: 341/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 131 places, 210 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 240 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000010-ReachabilityCardinality.task
lola: read: EF (2 <= Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc... (shortened)
lola: formula length: 27944
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Acc_... (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 16 bytes per marking, with 18 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 1 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + Memory_10 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + ... (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 16 bytes per marking, with 18 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 2 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 <= -1 AND (-Queue_10 + -Queue_9 + -Queue_8 + -Queue_7 + -Queue_6 + -Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 > -2 AND -Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -... (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 16 bytes per marking, with 18 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 3 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Mem_Acc_8_10 + Active_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + Active_9 + Active_8 + Active_7 + Active_6 + Active_5 + Active_4 + Active_2 + Active_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_... (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 16 bytes per marking, with 18 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 1 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: calling and running sara
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 ((Active_10 + Active_9 + Active_8 + Active_7 + Active_6 + Active_5 + Active_4 + Active_2 + Active_1 + Active_3 + -Ext_Bus > 0 OR (-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_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 16 bytes per marking, with 18 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)
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-3.sara.
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 <= -1)
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 16 bytes per marking, with 18 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 1 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Acc_... (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 16 bytes per marking, with 18 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 1 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 <= -2 AND -Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + Memory_10 + -Active_2 + -Active_1 + -Active_3 + Memory_9 + Memory_8 + Memory_7 + Memory_6 + Memory_5 + Memory_4 + Memory_3 + Memory_2 + Memory_1 <= 0))... (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 16 bytes per marking, with 18 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 2 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SharedMemory-COL-000010-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Ac... (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 16 bytes per marking, with 18 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 4 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 <= -2 OR -Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 <= -2))
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 16 bytes per marking, with 18 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 2 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 > -1 AND (-OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 > -1 AND -Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Acti... (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 16 bytes per marking, with 18 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 3 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + Memory_10 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -... (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 16 bytes per marking, with 18 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 1 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((Ext_Mem_Acc_8_10 + -Active_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_1 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8... (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 16 bytes per marking, with 18 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 12 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Ext_Mem_Acc_8_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_1 + -Memory_10 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_7_8 + Ex... (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 16 bytes per marking, with 18 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 1 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SharedMemory-COL-000010-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola: summary: no no no yes yes yes no no yes no yes yes no yes yes yes
lola: ========================================

BK_STOP 1463781498254

--------------------
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-000010"
export BK_EXAMINATION="ReachabilityCardinality"
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-000010.tgz
mv SharedMemory-PT-000010 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-000010, examination is ReachabilityCardinality"
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-146373288900367"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;