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

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

=== Now, execution of the tool begins

BK_START 1463752294278

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ SafeBus-PT-06
FORMULA SafeBus-COL-06-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-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: 595/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: finding significant places
lola: 144 places, 451 transitions, 109 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 375 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-06-ReachabilityCardinality.task
lola: read: AG ((!((PMC_1 + PMC_2 + PMC_3 + PMC_4 + PMC_5 + PMC_6 <= wait_ack_2_1 + wait_ack_3_1 + wait_ack_4_1 + wait_ack_5_1 + wait_ack_6_1 + wait_ack_1_2 + wait_ack_3_2 + wait_ack_4_2 + wait_ack_5_2 + wait_ack_6_2 + wait_ack_1_3 + wait_ack_2_3 + wait_ack_4_3 + wait_ack_5_3 + wait_ack_6_3 + wait_ack_1_4 + wait_ack_2_4 + wait_ack_3_4 + wait_ack_5_4 + wait_ack_6_4 + wait_ack_1_5 + wait_ack_2_5 + wait_ack_3_5 ... (shortened)
lola: formula length: 7528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((PMC_1 + PMC_2 + PMC_3 + PMC_4 + PMC_5 + PMC_6 + -wait_ack_6_5 + -wait_ack_6_4 + -wait_ack_6_3 + -wait_ack_6_2 + -wait_ack_6_1 + -wait_ack_5_6 + -wait_ack_5_4 + -wait_ack_5_3 + -wait_ack_5_2 + -wait_ack_5_1 + -wait_ack_4_6 + -wait_ack_4_5 + -wait_ack_4_3 + -wait_ack_4_2 + -wait_ack_4_1 + -wait_ack_3_6 + -wait_ack_3_5 + -wait_ack_3_4 + -wait_ack_3_2 + -wait_ack_3_1 + -wait_ack_2_6 + -wait_ack_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 436 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 SafeBus-COL-06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality.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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-T_out + S_tout <= 0 AND -msgl_6 + -msgl_5 + -msgl_4 + -msgl_3 + -msgl_2 + -msgl_1 > -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 436 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 unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FMC_6 + FMC_5 + FMC_4 + FMC_3 + FMC_2 + FMC_1 + -Cpt1_6 + -Cpt1_1 + -Cpt1_2 + -Cpt1_3 + -Cpt1_4 + -Cpt1_5 <= 0 OR FMCb + -msgl_6 + -msgl_5 + -msgl_4 + -msgl_3 + -msgl_2 + -msgl_1 <= 0))
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 436 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: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-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 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-msgl_6 + -msgl_5 + -msgl_4 + -msgl_3 + -msgl_2 + -msgl_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 436 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 invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-FMCb + wait_ack_6_5 + wait_ack_6_4 + wait_ack_6_3 + wait_ack_6_2 + wait_ack_6_1 + wait_ack_5_6 + wait_ack_5_4 + wait_ack_5_3 + wait_ack_5_2 + wait_ack_5_1 + wait_ack_4_6 + wait_ack_4_5 + wait_ack_4_3 + wait_ack_4_2 + wait_ack_4_1 + wait_ack_3_6 + wait_ack_3_5 + wait_ack_3_4 + wait_ack_3_2 + wait_ack_3_1 + wait_ack_2_6 + wait_ack_2_5 + wait_ack_2_4 + wait_ack_2_3 + wait_ack_2_1 + wait_ack_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 436 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: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-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 (((Cpt1_6 + Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + -ACK <= 0 OR -cable_free <= -1) AND ((msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1 + -Cpt1_6 + -Cpt1_1 + -Cpt1_2 + -Cpt1_3 + -Cpt1_4 + -Cpt1_5 <= 0 OR -AMC_6_6 + -AMC_6_5 + -AMC_6_4 + -AMC_6_3 + -AMC_6_2 + -AMC_6_1 + -AMC_5_6 + -AMC_5_5 + -AMC_5_4 + -AMC_5_3 + -AMC_5_2 + -AMC_5_1 + -AMC_4_6 + -AMC_4_5 + -AMC_4_4 + -AMC_4_3 + -AMC_4... (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 436 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 22 literals
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
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 (((-cable_free <= -3 OR (-R_tout <= -3 OR (-wait_cable_6 + -wait_cable_5 + -wait_cable_4 + -wait_cable_3 + -wait_cable_2 + -wait_cable_1 + AMC_6_6 + AMC_6_5 + AMC_6_4 + AMC_6_3 + AMC_6_2 + AMC_6_1 + AMC_5_6 + AMC_5_5 + AMC_5_4 + AMC_5_3 + AMC_5_2 + AMC_5_1 + AMC_4_6 + AMC_4_5 + AMC_4_4 + AMC_4_3 + AMC_4_2 + AMC_4_1 + AMC_3_6 + AMC_3_5 + AMC_3_4 + AMC_3_3 + AMC_3_2 + AMC_3_1 + AMC_2_6 + AMC_2_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 436 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 8 literals
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Cpt1_6 + -Cpt1_1 + -Cpt1_2 + -Cpt1_3 + -Cpt1_4 + -Cpt1_5 <= -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 436 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 unreachable.
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: AG ((-FMCb + MSG_6 + MSG_5 + MSG_4 + MSG_3 + MSG_2 + MSG_1 <= 0 OR (-AMC_6_6 + -AMC_6_5 + -AMC_6_4 + -AMC_6_3 + -AMC_6_2 + -AMC_6_1 + -AMC_5_6 + -AMC_5_5 + -AMC_5_4 + -AMC_5_3 + -AMC_5_2 + -AMC_5_1 + -AMC_4_6 + -AMC_4_5 + -AMC_4_4 + -AMC_4_3 + -AMC_4_2 + -AMC_4_1 + -AMC_3_6 + -AMC_3_5 + -AMC_3_4 + -AMC_3_3 + -AMC_3_2 + -AMC_3_1 + -AMC_2_6 + -AMC_2_5 + -AMC_2_4 + -AMC_2_3 + -AMC_2_2 + -AMC_2_1 + -A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: lola: calling and running sara
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 436 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 3 literals
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-7.sara.
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((listen_3 + listen_2 + listen_1 + listen_4 + listen_5 + listen_6 + -loop_em_6 + -loop_em_5 + -loop_em_4 + -loop_em_3 + -loop_em_2 + -loop_em_1 <= 0 AND (Cpt1_6 + Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + -ACK <= 0 AND -wait_msg_6 + -wait_msg_5 + -wait_msg_4 + -wait_msg_3 + -wait_msg_2 + -wait_msg_1 > -3)) OR (-MSG_6 + -MSG_5 + -MSG_4 + -MSG_3 + -MSG_2 + -MSG_1 + RMC_6 + RMC_5 + RMC_4 + RMC... (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 436 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 5 literals
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: lola: result: yes
calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-R_tout <= -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 436 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: sara: Transformation into DNF: expect 1 literalstry reading problem file SafeBus-COL-06-ReachabilityCardinality-9.sara.

lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Cpt1_6 + -Cpt1_1 + -Cpt1_2 + -Cpt1_3 + -Cpt1_4 + -Cpt1_5 <= -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 436 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 unreachable.
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-11.sara
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: AG ((FMC_6 + FMC_5 + FMC_4 + FMC_3 + FMC_2 + FMC_1 + -RMC_6 + -RMC_5 + -RMC_4 + -RMC_3 + -RMC_2 + -RMC_1 <= 0 OR (-Cpt1_6 + -Cpt1_1 + -Cpt1_2 + -Cpt1_3 + -Cpt1_4 + -Cpt1_5 + S_tout <= 0 OR (-msgl_6 + -msgl_5 + -msgl_4 + -msgl_3 + -msgl_2 + -msgl_1 <= -3 OR (-FMC_6 + -FMC_5 + -FMC_4 + -FMC_3 + -FMC_2 + -FMC_1 <= -1 OR -Cpt2_6 + -Cpt2_5 + -Cpt2_4 + -Cpt2_3 + -Cpt2_2 + -Cpt2_1 <= -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 436 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: SUBRESULT
lola: result: yes
lola: Transformation into DNF: expect 5 literals
lola: The predicate is invariant.
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-11.sara.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((MSG_6 + MSG_5 + MSG_4 + MSG_3 + MSG_2 + MSG_1 + -wait_ack_6_5 + -wait_ack_6_4 + -wait_ack_6_3 + -wait_ack_6_2 + -wait_ack_6_1 + -wait_ack_5_6 + -wait_ack_5_4 + -wait_ack_5_3 + -wait_ack_5_2 + -wait_ack_5_1 + -wait_ack_4_6 + -wait_ack_4_5 + -wait_ack_4_3 + -wait_ack_4_2 + -wait_ack_4_1 + -wait_ack_3_6 + -wait_ack_3_5 + -wait_ack_3_4 + -wait_ack_3_2 + -wait_ack_3_1 + -wait_ack_2_6 + -wait_ack_2... (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 436 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 3 literals
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((Cpt2_6 + Cpt2_5 + Cpt2_4 + Cpt2_3 + Cpt2_2 + Cpt2_1 + -wait_ack_6_5 + -wait_ack_6_4 + -wait_ack_6_3 + -wait_ack_6_2 + -wait_ack_6_1 + -wait_ack_5_6 + -wait_ack_5_4 + -wait_ack_5_3 + -wait_ack_5_2 + -wait_ack_5_1 + -wait_ack_4_6 + -wait_ack_4_5 + -wait_ack_4_3 + -wait_ack_4_2 + -wait_ack_4_1 + -wait_ack_3_6 + -wait_ack_3_5 + -wait_ack_3_4 + -wait_ack_3_2 + -wait_ack_3_1 + -wait_ack_2_6 + -wait... (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 436 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: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-AMC_6_6 + -AMC_6_5 + -AMC_6_4 + -AMC_6_3 + -AMC_6_2 + -AMC_6_1 + -AMC_5_6 + -AMC_5_5 + -AMC_5_4 + -AMC_5_3 + -AMC_5_2 + -AMC_5_1 + -AMC_4_6 + -AMC_4_5 + -AMC_4_4 + -AMC_4_3 + -AMC_4_2 + -AMC_4_1 + wait_ack_6_5 + wait_ack_6_4 + wait_ack_6_3 + wait_ack_6_2 + wait_ack_6_1 + -AMC_3_6 + -AMC_3_5 + -AMC_3_4 + -AMC_3_3 + -AMC_3_2 + -AMC_3_1 + wait_ack_5_6 + wait_ack_5_4 + wait_ack_5_3 + wait_ack_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 436 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 12 literals
lola: write sara problem file to SafeBus-COL-06-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file SafeBus-COL-06-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: yes no yes yes yes yes no no yes yes no no yes no yes no

BK_STOP 1463752535515

--------------------
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="SafeBus-PT-06"
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/SafeBus-PT-06.tgz
mv SafeBus-PT-06 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 SafeBus-PT-06, 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-146373288700196"
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 ;