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-3253
Executing tool lola
Input is S_DatabaseWithMutex-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455600178
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496447659734


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DatabaseWithMutex-PT-02: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_DatabaseWithMutex-PT-02: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_DatabaseWithMutex-PT-02 @ 3540 seconds
----- Start make result stdout -----
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: 70/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 38 places, 32 transitions, 28 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 46 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-COL-02-ReachabilityCardinality.task
lola: A (G ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2))) : E (F ((all_passive_1 + all_passive_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2))) : E (F (((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 + 1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2) OR (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 + 1 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) OR (Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= 2) OR (all_active_1 + all_active_2 <= 0)))) : A (G ((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 1))) : A (G ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 + 1 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2))) : E (F (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2) OR (2 <= all_active_1 + all_active_2)))) : A (G (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= Mutex_1 + Mutex_2) OR (((2 <= all_active_1 + all_active_2) OR (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2)) AND ((1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (3 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)))))) : A (G ((2 <= Mutex_1 + Mutex_2))) : A (G (((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2) AND (2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)))) : A (G ((((all_active_1 + all_active_2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) AND (2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2)) OR ((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) AND (1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)) OR ((2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) AND (3 <= all_active_1 + all_active_2) AND (Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2))))) : A (G (())) : E (F (((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) OR ((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND (3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)) OR ((all_passive_1 + all_passive_2 <= 0) AND (Mutex_1 + Mutex_2 <= 1))))) : A (G (((all_passive_1 + all_passive_2 + 1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) OR (Mutex_1 + Mutex_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2) OR ((Mutex_1 + Mutex_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) AND (1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) AND (updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= all_passive_1 + all_passive_2))))) : A (G ((all_active_1 + all_active_2 + 1 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2))) : A (G ((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 + 1 <= Mutex_1 + Mutex_2))) : E (F (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) OR (2 <= all_active_1 + all_active_2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((all_passive_1 + all_passive_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality.sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 + 1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2) OR (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 + 1 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) OR (Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= 2) OR (all_active_1 + all_active_2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: lola: ========================================
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 + 1 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2) OR (2 <= all_active_1 + all_active_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= Mutex_1 + Mutex_2) OR (((2 <= all_active_1 + all_active_2) OR (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2)) AND ((1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (3 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityCardinality.sara.
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Mutex_1 + Mutex_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2) AND (2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2))))
lola: ========================================
lola: SUBTASK
lola: lola: checking invariance
========================================
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: lola: state equation: calling and running sara
using 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((all_active_1 + all_active_2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) AND (2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2)) OR ((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) AND (1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)) OR ((2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) AND (3 <=... (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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityCardinality-7.sara.
produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 36 literals and 12 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) OR ((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND (3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)) OR ((all_passive_1 + all_passive_2 <= 0) AND (Mutex_1 + Mutex_2 <= 1)))))
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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: sara: place or transition ordering is non-deterministic
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((all_passive_1 + all_passive_2 + 1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) OR (Mutex_1 + Mutex_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2) OR ((Mutex_1 + Mutex_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) AND (1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) AND (updating_1_1 + updating_2_1 + updating_2_2 + updati... (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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================

lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================

lola: ...considering subproblem: A (G ((all_active_1 + all_active_2 + 1 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 + 1 <= Mutex_1 + Mutex_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) OR (2 <= all_active_1 + all_active_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityCardinality-15.sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no no no no no yes no no no yes
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496447660130

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_DatabaseWithMutex-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/S_DatabaseWithMutex-PT-02.tgz
mv S_DatabaseWithMutex-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DatabaseWithMutex-PT-02, 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 r098-ebro-149488455600178"
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 ;