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

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

=== Now, execution of the tool begins

BK_START 1463792759804

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ SharedMemory-PT-000050
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000050-ReachabilityCardinality-15 FALSE 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: 7701/65536 symbol table entries, 1440 collisions
lola: preprocessing...
lola: finding significant places
lola: 2651 places, 5050 transitions, 2550 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5200 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000050-ReachabilityCardinality.task
lola: read: AG (OwnMemAcc_12 + OwnMemAcc_11 + OwnMemAcc_10 + OwnMemAcc_9 + OwnMemAcc_8 + OwnMemAcc_7 + OwnMemAcc_6 + OwnMemAcc_5 + OwnMemAcc_20 + OwnMemAcc_19 + OwnMemAcc_18 + OwnMemAcc_17 + OwnMemAcc_16 + OwnMemAcc_15 + OwnMemAcc_14 + OwnMemAcc_13 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_38 + OwnMemAcc_37 + OwnMemAcc_40 + OwnMemAcc_39 + OwnMemAcc_42 + OwnMemAcc_41 + OwnMemAcc_44 + ... (shortened)
lola: formula length: 457268
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 9 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Active_1 + -Active_2 + -Active_4 + -Active_5 + -Active_6 + -Active_7 + -Active_10 + -Active_11 + -Active_12 + -Active_13 + -Active_14 + -Active_15 + -Active_16 + -Active_17 + -Active_21 + -Active_22 + -Active_23 + -Active_24 + -Active_25 + -Active_26 + -Active_27 + -Active_28 + -Active_29 + -Active_30 + -Active_31 + -Active_33 + -Active_34 + -Active_35 + -Active_36 + -Active_37 + -Active_38 +... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 10 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Memory_50 + -Memory_49 + -Memory_48 + -Memory_47 + -Memory_46 + -Memory_45 + -Memory_44 + -Memory_43 + -Memory_42 + -Memory_41 + -Memory_40 + -Memory_39 + -Memory_38 + -Memory_37 + -Memory_36 + -Memory_35 + -Memory_34 + -Memory_33 + -Memory_32 + -Memory_31 + -Memory_30 + -Memory_29 + -Memory_28 + -Memory_27 + -Memory_26 + -Memory_25 + -Memory_24 + -Memory_23 + -Memory_22 + -Memory_21 + -Memor... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-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 10 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Ext_Bus > -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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-2.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 3 will run for 10 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Queue_50 + -Queue_49 + -Queue_48 + -Queue_47 + -Queue_46 + -Queue_45 + -Queue_44 + -Queue_43 + -Queue_42 + -Queue_41 + -Queue_40 + -Queue_39 + -Queue_38 + -Queue_37 + -Queue_36 + -Queue_35 + -Queue_34 + -Queue_33 + -Queue_32 + -Queue_31 + -Queue_30 + -Queue_29 + -Queue_28 + -Queue_27 + -Queue_26 + -Queue_25 + -Queue_24 + -Queue_23 + -Queue_22 + -Queue_21 + -Queue_20 + -Queue_19 + -Queue_18 ... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-3.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 4 will run for 10 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-000050-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 11 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Active_1 + Active_2 + Active_4 + Active_5 + Active_6 + Active_7 + Active_10 + Active_11 + Active_12 + Active_13 + Active_14 + Active_15 + Active_16 + Active_17 + Active_21 + Active_22 + Active_23 + Active_24 + Active_25 + Active_26 + Active_27 + Active_28 + Active_29 + Active_30 + Active_31 + Active_33 + Active_34 + Active_35 + Active_36 + Active_37 + Active_38 + Active_39 + Active_40 + Active... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 12 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Mem_Acc_42_9 + -Ext_Mem_Acc_42_8 + -Ext_Mem_Acc_42_7 + -Ext_Mem_Acc_42_6 + -Ext_Mem_Acc_42_5 + -Ext_Mem_Acc_42_4 + -Ext_Mem_Acc_42_3 + -Ext_Mem_Acc_42_2 + -Ext_Mem_Acc_42_1 + -Ext_Mem_Acc_19_9 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_44_50 + -Ext_Mem_Acc_44_49 + -Ext_Mem_Acc_44_48 + -Ext_Mem_Acc_44_47 + -Ext_Mem_Acc_44_46 + -Ext_Mem_Acc_44_45 + -Ext_Mem_Acc_44_43 + -Ext_Mem_Acc_44_42 + -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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-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 13 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_50 + -OwnMemAcc_49 + -OwnMemAcc_48 + -OwnMemAcc_47 + -OwnMemAcc_46 + -OwnMemAcc_45 + -OwnMemAcc_44 + -OwnMemAcc_43 + -OwnMemAcc_42 + -OwnMemAcc_41 + -OwnMemAcc_40 + -OwnMemAcc_39 + -OwnMemAcc_38 + -OwnMemAcc_37 + -OwnMemAcc_36 + -OwnMemAcc_35 + -Own... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-7.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 8 will run for 13 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Bus <= -3)
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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-8.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 9 will run for 14 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Queue_50 + -Queue_49 + -Queue_48 + -Queue_47 + -Queue_46 + -Queue_45 + -Queue_44 + -Queue_43 + -Queue_42 + -Queue_41 + -Queue_40 + -Queue_39 + -Queue_38 + -Queue_37 + -Queue_36 + -Queue_35 + -Queue_34 + -Queue_33 + -Queue_32 + -Queue_31 + -Queue_30 + -Queue_29 + -Queue_28 + -Queue_27 + -Queue_26 + -Queue_25 + -Queue_24 + -Queue_23 + -Queue_22 + -Queue_21 + -Queue_20 + -Queue_19 + -Queue_18 + ... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 16 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Active_1 + -Active_2 + -Active_4 + -Active_5 + -Active_6 + -Active_7 + -Active_10 + -Active_11 + -Active_12 + -Active_13 + -Active_14 + -Active_15 + -Active_16 + -Active_17 + -Active_21 + -Active_22 + -Active_23 + -Active_24 + -Active_25 + -Active_26 + -Active_27 + -Active_28 + -Active_29 + -Active_30 + -Active_31 + -Active_33 + -Active_34 + -Active_35 + -Active_36 + -Active_37 + -Active_38 ... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-10.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 11 will run for 18 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Memory_50 + -Memory_49 + -Memory_48 + -Memory_47 + -Memory_46 + -Memory_45 + -Memory_44 + -Memory_43 + -Memory_42 + -Memory_41 + -Memory_40 + -Memory_39 + -Memory_38 + -Memory_37 + -Memory_36 + -Memory_35 + -Memory_34 + -Memory_33 + -Memory_32 + -Memory_31 + -Memory_30 + -Memory_29 + -Memory_28 + -Memory_27 + -Memory_26 + -Memory_25 + -Memory_24 + -Memory_23 + -Memory_22 + -Memory_21 + -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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 20 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((Memory_50 + Memory_49 + Memory_48 + Memory_47 + Memory_46 + Memory_45 + Memory_44 + Memory_43 + Memory_42 + Memory_41 + Memory_40 + Memory_39 + Memory_38 + Memory_37 + Memory_36 + Memory_35 + Memory_34 + Memory_33 + Memory_32 + Memory_31 + Memory_30 + Memory_29 + Memory_28 + Memory_27 + Memory_26 + Memory_25 + Memory_24 + Memory_23 + Memory_22 + Memory_21 + Memory_20 + Memory_19 + Memory_18 ... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-12.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 13 will run for 24 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-Ext_Bus <= -3 AND Ext_Mem_Acc_42_9 + Ext_Mem_Acc_42_8 + Ext_Mem_Acc_42_7 + Ext_Mem_Acc_42_6 + Ext_Mem_Acc_42_5 + Ext_Mem_Acc_42_4 + Ext_Mem_Acc_42_3 + Ext_Mem_Acc_42_2 + Ext_Mem_Acc_42_1 + Ext_Mem_Acc_19_9 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_44_50 + Ext_Mem_Acc_44_49 + Ext_Mem_Acc_44_48 + Ext_Mem_Acc_44_47 + Ext_Mem_Acc_44_46 + Ext_Mem_Acc_44_45 + Ext_Mem_Acc_44_43 + Ext_Mem_Acc_44_42 + Ext_Me... (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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 14 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 36 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SharedMemory-COL-000050-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 73 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Ext_Mem_Acc_42_9 + -Ext_Mem_Acc_42_8 + -Ext_Mem_Acc_42_7 + -Ext_Mem_Acc_42_6 + -Ext_Mem_Acc_42_5 + -Ext_Mem_Acc_42_4 + -Ext_Mem_Acc_42_3 + -Ext_Mem_Acc_42_2 + -Ext_Mem_Acc_42_1 + -Ext_Mem_Acc_19_9 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_44_50 + -Ext_Mem_Acc_44_49 + -Ext_Mem_Acc_44_48 + -Ext_Mem_Acc_44_47 + -Ext_Mem_Acc_44_46 + -Ext_Mem_Acc_44_45 + -Ext_Mem_Acc_44_43 + -Ext_Mem_Acc_44_42 + -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 320 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to SharedMemory-COL-000050-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000050-ReachabilityCardinality-15.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: RESULT
lola: summary: no no yes yes yes yes no yes no yes no yes yes yes no no

BK_STOP 1463796235782

--------------------
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-000050"
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-000050.tgz
mv SharedMemory-PT-000050 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is SharedMemory-PT-000050, 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-146373288900385"
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 ;