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 DatabaseWithMutex-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014kn-qhx2-146347846400178
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463503691801

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ DatabaseWithMutex-PT-04
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-04-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: 268/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 140 places, 128 transitions, 112 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 176 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-COL-04-ReachabilityCardinality.task
lola: read: EF (2 <= MesBuffReply_3_4 + MesBuffReply_2_2 + MesBuffReply_2_4 + MesBuffReply_3_2 + MesBuffReply_4_2 + MesBuffReply_1_4 + MesBuffReply_4_3 + MesBuffReply_2_1 + MesBuffReply_3_3 + MesBuffReply_1_1 + MesBuffReply_2_3 + MesBuffReply_3_1 + MesBuffReply_1_3 + MesBuffReply_4_1 + MesBuffReply_1_2 + MesBuffReply_4_4) : AG ((RecBuff_4_1 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_1_3 + RecBuff_4_4 + RecBuff_1_1... (shortened)
lola: formula length: 16239
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 (-MesBuffReply_4_4 + -MesBuffReply_4_3 + -MesBuffReply_4_2 + -MesBuffReply_4_1 + -MesBuffReply_3_4 + -MesBuffReply_3_3 + -MesBuffReply_3_2 + -MesBuffReply_3_1 + -MesBuffReply_2_4 + -MesBuffReply_2_3 + -MesBuffReply_2_2 + -MesBuffReply_2_1 + -MesBuffReply_1_4 + -MesBuffReply_1_3 + -MesBuffReply_1_2 + -MesBuffReply_1_1 <= -2)
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 448 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 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((RecBuff_2_4 + RecBuff_2_3 + RecBuff_2_2 + RecBuff_2_1 + RecBuff_1_4 + RecBuff_1_3 + RecBuff_1_2 + RecBuff_1_1 + -all_active_1 + -all_active_2 + -all_active_3 + -all_active_4 + RecBuff_4_4 + RecBuff_4_3 + RecBuff_4_2 + RecBuff_4_1 + RecBuff_3_4 + RecBuff_3_3 + RecBuff_3_2 + RecBuff_3_1 <= 0 AND Active_1_4 + Active_1_3 + Active_1_2 + Active_1_1 + -Message_4_4 + -Message_4_3 + -Message_4_2 + -Me... (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 448 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 2 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Active_1_4 + -Active_1_3 + -Active_1_2 + -Active_1_1 + Acknowledge_4_4 + Acknowledge_4_3 + Acknowledge_4_2 + Acknowledge_4_1 + Acknowledge_3_4 + Acknowledge_3_3 + Acknowledge_3_2 + Acknowledge_3_1 + Acknowledge_2_4 + Acknowledge_2_3 + Acknowledge_2_2 + Acknowledge_2_1 + Acknowledge_1_4 + Acknowledge_1_3 + Acknowledge_1_2 + Acknowledge_1_1 + -Active_4_4 + -Active_4_3 + -Active_4_2 + -Active_4_... (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 448 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 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Acknowledge_4_4 + -Acknowledge_4_3 + -Acknowledge_4_2 + -Acknowledge_4_1 + -Acknowledge_3_4 + -Acknowledge_3_3 + -Acknowledge_3_2 + -Acknowledge_3_1 + -Acknowledge_2_4 + -Acknowledge_2_3 + -Acknowledge_2_2 + -Acknowledge_2_1 + -Acknowledge_1_4 + -Acknowledge_1_3 + -Acknowledge_1_2 + -Acknowledge_1_1 <= -3 OR Acknowledge_4_4 + Acknowledge_4_3 + Acknowledge_4_2 + Acknowledge_4_1 + Acknowledge_... (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 448 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 2 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Acknowledge_4_4 + WaitMutex_4_4 + WaitMutex_4_1 + WaitMutex_4_2 + WaitMutex_4_3 + -Acknowledge_4_3 + -Acknowledge_4_2 + -Acknowledge_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + -Acknowledge_3_4 + -Acknowledge_3_3 + -Acknowledge_3_2 + -Acknowledge_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + -Acknowledge_2_4 + -Acknowledge_2_3 + -Acknowledge_... (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 448 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 4 literals
lola: write sara problem file to DatabaseWithMutex-COL-04-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-04-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-RecBuff_2_4 + -RecBuff_2_3 + -RecBuff_2_2 + -RecBuff_2_1 + -RecBuff_1_4 + -RecBuff_1_3 + -RecBuff_1_2 + -RecBuff_1_1 + all_passive_4 + all_passive_3 + all_passive_2 + all_passive_1 + -RecBuff_4_4 + -RecBuff_4_3 + -RecBuff_4_2 + -RecBuff_4_1 + -RecBuff_3_4 + -RecBuff_3_3 + -RecBuff_3_2 + -RecBuff_3_1 <= 0)
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 448 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 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Acknowledge_4_4 + -Acknowledge_4_3 + -Acknowledge_4_2 + -Acknowledge_4_1 + -Acknowledge_3_4 + -Acknowledge_3_3 + -Acknowledge_3_2 + -Acknowledge_3_1 + -Acknowledge_2_4 + -Acknowledge_2_3 + -Acknowledge_2_2 + -Acknowledge_2_1 + -Acknowledge_1_4 + -Acknowledge_1_3 + -Acknowledge_1_2 + -Acknowledge_1_1 + all_passive_4 + all_passive_3 + all_passive_2 + all_passive_1 <= 0)
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 448 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 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-04-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 > -1 AND (-Modify_4_4 + -Modify_4_3 + -Modify_4_2 + -Modify_4_1 + -Modify_3_4 + -Modify_3_3 + -Modify_3_2 + -Modify_3_1 + -Modify_2_4 + -Modify_2_3 + -Modify_2_2 + -Modify_2_1 + -Modify_1_4 + -Modify_1_3 + -Modify_1_2 + -Modify_1_1 > -2 AND (-Acknowledge_4_4 + -Acknowledge_4_3 + -Acknowledge_4_2 + -Acknowledge_4_1 + -Acknowledge_3_4 + -Acknowledge_3_3... (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 448 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 9 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-WaitMutex_4_4 + -WaitMutex_4_1 + -WaitMutex_4_2 + -WaitMutex_4_3 + -WaitMutex_3_4 + -WaitMutex_3_3 + -WaitMutex_3_2 + -WaitMutex_3_1 + -WaitMutex_2_4 + -WaitMutex_2_3 + -WaitMutex_2_2 + -WaitMutex_2_1 + -WaitMutex_1_4 + -WaitMutex_1_3 + -WaitMutex_1_2 + -WaitMutex_1_1 <= -1 OR Acknowledge_4_4 + Acknowledge_4_3 + Acknowledge_4_2 + Acknowledge_4_1 + Acknowledge_3_4 + Acknowledge_3_3 + Acknowle... (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 448 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 2 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-all_passive_4 + -all_passive_3 + -all_passive_2 + -all_passive_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 448 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 1 literals
lola: write sara problem file to DatabaseWithMutex-COL-04-ReachabilityCardinality-9.sara
lola: calling and running 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: EF ((-Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 + Modify_4_4 + Modify_4_3 + Modify_4_2 + Modify_4_1 + Modify_3_4 + Modify_3_3 + Modify_3_2 + Modify_3_1 + Modify_2_4 + Modify_2_3 + Modify_2_2 + Modify_2_1 + Modify_1_4 + Modify_1_3 + Modify_1_2 + Modify_1_1 > 0 AND (-Acknowledge_4_4 + all_active_1 + all_active_2 + all_active_3 + all_active_4 + -Acknowledge_4_3 + -Acknowledge_4_2 + -Acknowledge_4_1 + ... (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 448 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 7 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-all_passive_4 + -all_passive_3 + -all_passive_2 + -all_passive_1 <= -2 OR (RecBuff_2_4 + RecBuff_2_3 + RecBuff_2_2 + RecBuff_2_1 + -Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 + RecBuff_1_4 + RecBuff_1_3 + RecBuff_1_2 + RecBuff_1_1 + RecBuff_4_4 + RecBuff_4_3 + RecBuff_4_2 + RecBuff_4_1 + RecBuff_3_4 + RecBuff_3_3 + RecBuff_3_2 + RecBuff_3_1 <= 0 OR updating_4_4 + updating_4_3 + updating_4_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 448 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 6 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 <= -2 OR ((updating_4_4 + updating_4_3 + updating_4_2 + updating_4_1 + updating_3_4 + updating_1_4 + -WaitMutex_4_4 + updating_2_4 + -WaitMutex_4_1 + updating_2_3 + updating_2_2 + updating_2_1 + -WaitMutex_4_2 + -WaitMutex_4_3 + updating_3_1 + updating_3_2 + -WaitMutex_3_4 + -WaitMutex_3_3 + -WaitMutex_3_2 + -WaitMutex_3_1 + updating_3_3 + updating_1_... (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 448 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 6 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((WaitMutex_4_4 + WaitMutex_4_1 + WaitMutex_4_2 + WaitMutex_4_3 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1 + -Message_4_4 + -Message_4_3 + -Message_4_2 + -Message_4_1 + -Message_3_4 + -Message_3_3 + -Message_3_2 + -Message_3_1 + -Message_2_4 + -Mes... (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 448 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 4 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 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 DatabaseWithMutex-COL-04-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-all_passive_4 + -all_passive_3 + -all_passive_2 + -all_passive_1 <= -2 OR -updating_4_4 + -updating_4_3 + -updating_4_2 + -updating_4_1 + -updating_3_4 + -updating_1_4 + -updating_2_4 + -updating_2_3 + -updating_2_2 + -updating_2_1 + -updating_3_1 + -updating_3_2 + -updating_3_3 + -updating_1_3 + -updating_1_2 + -updating_1_1 <= -3) AND (-Mutex_4 + -Mutex_3 + -Mutex_2 + -Mutex_1 + all_acti... (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 448 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 18 literals
lola: write sara problem file to DatabaseWithMutex-COL-04-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-04-ReachabilityCardinality-15.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: RESULT
lola: summary: yes no no no yes yes yes yes no no yes no no no yes yes

BK_STOP 1463503692533

--------------------
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="DatabaseWithMutex-PT-04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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/DatabaseWithMutex-PT-04.tgz
mv DatabaseWithMutex-PT-04 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 DatabaseWithMutex-PT-04, 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 r014kn-qhx2-146347846400178"
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 ;