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-3254
Executing tool lola
Input is SafeBus-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963300241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494807625814


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ SafeBus-PT-03 @ 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: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 57 places, 91 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 108 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-03-ReachabilityCardinality.task
lola: A (G ((((PMC_3 + PMC_2 + PMC_1 <= Cpt1_2 + Cpt1_1 + Cpt1_3) AND (3 <= FMCb)) OR (S_tout <= 1)))) : E (F (((2 <= MSG_1 + MSG_2 + MSG_3) OR (3 <= MSG_1 + MSG_2 + MSG_3) OR ((2 <= PMC_3 + PMC_2 + PMC_1) AND (1 <= cable_free)) OR ((3 <= wait_msg_1 + wait_msg_2 + wait_msg_3) AND (3 <= wait_cable_1 + wait_cable_2 + wait_cable_3) AND (RMC_1 + RMC_2 + RMC_3 + 1 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2))))) : E (F (((1 <= wait_msg_1 + wait_msg_2 + wait_msg_3) AND (3 <= FMCb)))) : A (G ((FMCb <= 2))) : A (G ((Cpt2_1 + Cpt2_2 + Cpt2_3 <= 1))) : A (G (((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3) OR ((T_out <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3)) OR (PMC_3 + PMC_2 + PMC_1 <= wait_msg_1 + wait_msg_2 + wait_msg_3)))) : A (G ((((listen_3 + listen_2 + listen_1 + 1 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3) OR (2 <= msgl_1 + msgl_2 + msgl_3)) AND ((AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3 <= listen_3 + listen_2 + listen_1) OR (loop_em_1 + loop_em_2 + loop_em_3 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR ((2 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3) AND (1 <= loop_em_1 + loop_em_2 + loop_em_3)))))) : E (F (((3 <= T_out) AND (cable_free <= R_tout) AND (3 <= Cpt1_2 + Cpt1_1 + Cpt1_3) AND ((3 <= PMC_3 + PMC_2 + PMC_1) OR (1 <= cable_free) OR (wait_cable_1 + wait_cable_2 + wait_cable_3 <= loop_em_1 + loop_em_2 + loop_em_3))))) : E (F (())) : E (F ((((3 <= S_tout) AND ((wait_msg_1 + wait_msg_2 + wait_msg_3 <= S_tout) OR (Cpt1_2 + Cpt1_1 + Cpt1_3 <= T_out))) OR ((2 <= FMCb) AND (3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3) AND (2 <= loop_em_1 + loop_em_2 + loop_em_3))))) : A (G (((wait_msg_1 + wait_msg_2 + wait_msg_3 <= 1) OR (FMCb <= 1) OR (S_tout <= FMC_1 + FMC_2 + FMC_3)))) : A (G ((S_tout <= 2))) : E (F ((((2 <= loop_em_1 + loop_em_2 + loop_em_3) OR (S_tout <= cable_free)) AND (3 <= FMC_1 + FMC_2 + FMC_3) AND (PMC_3 + PMC_2 + PMC_1 <= Cpt2_1 + Cpt2_2 + Cpt2_3)))) : E (F (((2 <= Cpt2_1 + Cpt2_2 + Cpt2_3) AND (loop_em_1 + loop_em_2 + loop_em_3 <= FMC_1 + FMC_2 + FMC_3) AND ((2 <= wait_cable_1 + wait_cable_2 + wait_cable_3) OR (S_tout <= ACK)) AND (3 <= FMCb)))) : A (G ((((2 <= T_out) OR (3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3) OR (1 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (1 <= T_out)) AND (wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= msgl_1 + msgl_2 + msgl_3)))) : E (F (((AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3 + 1 <= R_tout) AND (wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= 2) AND (Cpt1_2 + Cpt1_1 + Cpt1_3 <= S_tout))))
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 ((((PMC_3 + PMC_2 + PMC_1 <= Cpt1_2 + Cpt1_1 + Cpt1_3) AND (3 <= FMCb)) OR (S_tout <= 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 148 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= MSG_1 + MSG_2 + MSG_3) OR (3 <= MSG_1 + MSG_2 + MSG_3) OR ((2 <= PMC_3 + PMC_2 + PMC_1) AND (1 <= cable_free)) OR ((3 <= wait_msg_1 + wait_msg_2 + wait_msg_3) AND (3 <= wait_cable_1 + wait_cable_2 + wait_cable_3) AND (RMC_1 + RMC_2 + RMC_3 + 1 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_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 148 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 7 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= wait_msg_1 + wait_msg_2 + wait_msg_3) AND (3 <= FMCb))))
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 148 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 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FMCb <= 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 148 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 SafeBus-COL-03-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Cpt2_1 + Cpt2_2 + Cpt2_3 <= 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 148 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 invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3) OR ((T_out <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3)) OR (PMC_3 + PMC_2 + PMC_1 <= wait_msg_1 + wait_msg_2 + wait_msg_3))))
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 148 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((listen_3 + listen_2 + listen_1 + 1 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3) OR (2 <= msgl_1 + msgl_2 + msgl_3)) AND ((AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3 <= listen_3 + listen_2 + listen_1) OR (loop_em_1 + loop_em_2 + loop_em_3 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR ((2 <= AMC_1_1 + AMC_1_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 148 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 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= T_out) AND (cable_free <= R_tout) AND (3 <= Cpt1_2 + Cpt1_1 + Cpt1_3) AND ((3 <= PMC_3 + PMC_2 + PMC_1) OR (1 <= cable_free) OR (wait_cable_1 + wait_cable_2 + wait_cable_3 <= loop_em_1 + loop_em_2 + loop_em_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 148 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 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-7.sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= S_tout) AND ((wait_msg_1 + wait_msg_2 + wait_msg_3 <= S_tout) OR (Cpt1_2 + Cpt1_1 + Cpt1_3 <= T_out))) OR ((2 <= FMCb) AND (3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3) AND (2 <= loop_em_1 + loop_em_2 + loop_em_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 148 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((wait_msg_1 + wait_msg_2 + wait_msg_3 <= 1) OR (FMCb <= 1) OR (S_tout <= FMC_1 + FMC_2 + FMC_3))))
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 148 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((S_tout <= 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 148 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 SafeBus-COL-03-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= loop_em_1 + loop_em_2 + loop_em_3) OR (S_tout <= cable_free)) AND (3 <= FMC_1 + FMC_2 + FMC_3) AND (PMC_3 + PMC_2 + PMC_1 <= Cpt2_1 + Cpt2_2 + Cpt2_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 148 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Cpt2_1 + Cpt2_2 + Cpt2_3) AND (loop_em_1 + loop_em_2 + loop_em_3 <= FMC_1 + FMC_2 + FMC_3) AND ((2 <= wait_cable_1 + wait_cable_2 + wait_cable_3) OR (S_tout <= ACK)) AND (3 <= FMCb))))
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 148 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 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= T_out) OR (3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3) OR (1 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (1 <= T_out)) AND (wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= msgl_1 + msgl_2 + msgl_3))))
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 148 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3 + 1 <= R_tout) AND (wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= 2) AND (Cpt1_2 + Cpt1_1 + Cpt1_3 <= S_tout))))
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 148 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no no no no yes yes no no yes no
FORMULA SafeBus-COL-03-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494807626157

--------------------
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="SafeBus-PT-03"
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/SafeBus-PT-03.tgz
mv SafeBus-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is SafeBus-PT-03, 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 r068-csrt-149440963300241"
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 ;