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 S_SafeBus-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443433000250
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496445969504


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


checking for too many tokens
===========================================================================================
S_SafeBus-PT-10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_SafeBus-PT-10 @ 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: 1947/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 316 places, 1631 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 983 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-10-ReachabilityCardinality.task
lola: A (G ((T_out <= 1))) : A (G (((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9) OR (PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= 2)))) : E (F (((wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9 + 1 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10) AND (cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10 <= 0) AND ((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + 1 <= MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9) OR (Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 + 1 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10))))) : A (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9))) : E (F ((((msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + msgl_10 <= S_tout) OR (2 <= S_tout) OR (FMCb + 1 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)) AND (1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10)))) : A (G (((1 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9) AND ((1 <= R_tout) OR (3 <= S_tout))))) : A (G (((ACK <= 2) AND (R_tout <= 1) AND (wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9 + 1 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))) : E (F ((((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10 <= ACK) OR (1 <= MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9) OR (1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10)) AND (2 <= FMCb)))) : E (F ((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + 1 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))) : A (G (((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 <= 1) OR (wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9 + 1 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1) OR (T_out <= 1)))) : E (F ((1 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9))) : A (G ((T_out + 1 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10))) : A (G ((FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 <= T_out))) : E (F ((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10))) : E (F (((3 <= wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9) AND ((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + 1 <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10) OR (AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10 + 1 <= T_out))))) : A (G (((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= 1) OR ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10 + 1 <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10) AND (wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10 <= 1)))))
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 ((T_out <= 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 1044 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-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9) OR (PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_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 1044 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-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9 + 1 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10) AND (cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_... (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 1044 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-10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-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 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)))
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 1044 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is invariant.
lola: state equation: write sara problem file to SafeBus-COL-10-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + msgl_10 <= S_tout) OR (2 <= S_tout) OR (FMCb + 1 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)) AND (1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AM... (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 1044 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 3 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-10-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9) AND ((1 <= R_tout) OR (3 <= S_tout)))))
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 1044 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-10-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ACK <= 2) AND (R_tout <= 1) AND (wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9 + 1 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10))))
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 1044 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 3 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-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 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + 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 1044 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 3 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 14553 markings, 17895 edges, 2911 markings/sec, 0 secs
lola: sara is running 5 secs || 31364 markings, 41562 edges, 3362 markings/sec, 5 secs
lola: sara is running 10 secs || 47834 markings, 67332 edges, 3294 markings/sec, 10 secs
lola: sara is running 15 secs || 64334 markings, 92486 edges, 3300 markings/sec, 15 secs
lola: sara is running 20 secs || 80707 markings, 119444 edges, 3275 markings/sec, 20 secs
lola: sara is running 25 secs || 96638 markings, 144294 edges, 3186 markings/sec, 25 secs
lola: sara is running 30 secs || 111526 markings, 168986 edges, 2978 markings/sec, 30 secs
lola: sara is running 35 secs || 126276 markings, 193440 edges, 2950 markings/sec, 35 secs
lola: sara is running 40 secs || 142423 markings, 219903 edges, 3229 markings/sec, 40 secs
lola: sara is running 45 secs || 158155 markings, 246214 edges, 3146 markings/sec, 45 secs
lola: sara is running 50 secs || 174178 markings, 273092 edges, 3205 markings/sec, 50 secs
lola: sara is running 55 secs || 189995 markings, 299723 edges, 3163 markings/sec, 55 secs
lola: sara is running 60 secs || 205899 markings, 327011 edges, 3181 markings/sec, 60 secs
lola: sara is running 65 secs || 221568 markings, 354919 edges, 3134 markings/sec, 65 secs
lola: sara is running 70 secs || 237132 markings, 381713 edges, 3113 markings/sec, 70 secs
lola: sara is running 75 secs || 253607 markings, 411812 edges, 3295 markings/sec, 75 secs
lola: sara is running 80 secs || 269742 markings, 441017 edges, 3227 markings/sec, 80 secs
lola: sara is running 85 secs || 286518 markings, 471505 edges, 3355 markings/sec, 85 secs
lola: sara is running 90 secs || 303523 markings, 502585 edges, 3401 markings/sec, 90 secs
lola: sara is running 95 secs || 319962 markings, 532489 edges, 3288 markings/sec, 95 secs
lola: sara is running 100 secs || 336878 markings, 563954 edges, 3383 markings/sec, 100 secs
lola: sara is running 105 secs || 353330 markings, 594368 edges, 3290 markings/sec, 105 secs
lola: sara is running 110 secs || 368535 markings, 619040 edges, 3041 markings/sec, 110 secs
lola: sara is running 115 secs || 384488 markings, 644466 edges, 3191 markings/sec, 115 secs
lola: sara is running 120 secs || 401232 markings, 675317 edges, 3349 markings/sec, 120 secs
lola: sara is running 125 secs || 417834 markings, 706049 edges, 3320 markings/sec, 125 secs
lola: sara is running 130 secs || 434748 markings, 738404 edges, 3383 markings/sec, 130 secs
lola: sara is running 135 secs || 451098 markings, 768949 edges, 3270 markings/sec, 135 secs
lola: sara is running 140 secs || 467188 markings, 799115 edges, 3218 markings/sec, 140 secs
lola: sara is running 145 secs || 482627 markings, 828603 edges, 3088 markings/sec, 145 secs
lola: sara is running 150 secs || 498784 markings, 857740 edges, 3231 markings/sec, 150 secs
lola: sara is running 155 secs || 515408 markings, 889999 edges, 3325 markings/sec, 155 secs
lola: sara is running 160 secs || 532135 markings, 922436 edges, 3345 markings/sec, 160 secs
lola: sara is running 165 secs || 548401 markings, 951183 edges, 3253 markings/sec, 165 secs
lola: sara is running 170 secs || 564388 markings, 981894 edges, 3197 markings/sec, 170 secs
lola: sara is running 175 secs || 580285 markings, 1011723 edges, 3179 markings/sec, 175 secs
lola: sara is running 180 secs || 596604 markings, 1043116 edges, 3264 markings/sec, 180 secs
lola: sara is running 185 secs || 612883 markings, 1074406 edges, 3256 markings/sec, 185 secs
lola: sara is running 190 secs || 628923 markings, 1105395 edges, 3208 markings/sec, 190 secs
lola: sara is running 195 secs || 645076 markings, 1137365 edges, 3231 markings/sec, 195 secs
lola: sara is running 200 secs || 661479 markings, 1169056 edges, 3281 markings/sec, 200 secs
lola: sara is running 205 secs || 678290 markings, 1203890 edges, 3362 markings/sec, 205 secs
lola: sara is running 210 secs || 695383 markings, 1237622 edges, 3419 markings/sec, 210 secs
lola: sara is running 215 secs || 711748 markings, 1269746 edges, 3273 markings/sec, 215 secs
lola: sara is running 220 secs || 727967 markings, 1300749 edges, 3244 markings/sec, 220 secs
lola: sara is running 225 secs || 744210 markings, 1332312 edges, 3249 markings/sec, 225 secs
lola: sara is running 230 secs || 760845 markings, 1366272 edges, 3327 markings/sec, 230 secs
lola: sara is running 235 secs || 776732 markings, 1397847 edges, 3177 markings/sec, 235 secs
lola: sara is running 240 secs || 792315 markings, 1426444 edges, 3117 markings/sec, 240 secs
lola: sara is running 245 secs || 808498 markings, 1459020 edges, 3237 markings/sec, 245 secs
lola: sara is running 250 secs || 824475 markings, 1488557 edges, 3195 markings/sec, 250 secs
lola: sara is running 255 secs || 841002 markings, 1520593 edges, 3305 markings/sec, 255 secs
lola: sara is running 260 secs || 857040 markings, 1552582 edges, 3208 markings/sec, 260 secs
lola: sara is running 265 secs || 872926 markings, 1583011 edges, 3177 markings/sec, 265 secs
lola: sara is running 270 secs || 889347 markings, 1616061 edges, 3284 markings/sec, 270 secs
lola: sara is running 275 secs || 905302 markings, 1647689 edges, 3191 markings/sec, 275 secs
lola: sara is running 280 secs || 922017 markings, 1681903 edges, 3343 markings/sec, 280 secs
lola: sara is running 285 secs || 938540 markings, 1716149 edges, 3305 markings/sec, 285 secs
lola: sara is running 290 secs || 955048 markings, 1750302 edges, 3302 markings/sec, 290 secs
lola: sara is running 295 secs || 970637 markings, 1779502 edges, 3118 markings/sec, 295 secs
lola: sara is running 300 secs || 986484 markings, 1809191 edges, 3169 markings/sec, 300 secs
lola: sara is running 305 secs || 1002382 markings, 1840990 edges, 3180 markings/sec, 305 secs
lola: sara is running 310 secs || 1018729 markings, 1872930 edges, 3269 markings/sec, 310 secs
lola: sara is running 315 secs || 1034600 markings, 1903768 edges, 3174 markings/sec, 315 secs
lola: sara is running 320 secs || 1050749 markings, 1935735 edges, 3230 markings/sec, 320 secs
lola: sara is running 325 secs || 1066658 markings, 1966609 edges, 3182 markings/sec, 325 secs
lola: sara is running 330 secs || 1082915 markings, 1999562 edges, 3251 markings/sec, 330 secs
lola: sara is running 335 secs || 1098605 markings, 2028488 edges, 3138 markings/sec, 335 secs
lola: sara is running 340 secs || 1114641 markings, 2061018 edges, 3207 markings/sec, 340 secs
lola: sara is running 345 secs || 1130785 markings, 2094441 edges, 3229 markings/sec, 345 secs
lola: sara is running 350 secs || 1146985 markings, 2127582 edges, 3240 markings/sec, 350 secs
lola: sara is running 355 secs || 1162709 markings, 2157121 edges, 3145 markings/sec, 355 secs
lola: sara is running 360 secs || 1179260 markings, 2191513 edges, 3310 markings/sec, 360 secs
lola: sara is running 365 secs || 1195658 markings, 2225940 edges, 3280 markings/sec, 365 secs
lola: sara is running 370 secs || 1212109 markings, 2260016 edges, 3290 markings/sec, 370 secs
lola: sara is running 375 secs || 1228404 markings, 2293478 edges, 3259 markings/sec, 375 secs
lola: sara is running 380 secs || 1245032 markings, 2327183 edges, 3326 markings/sec, 380 secs
lola: sara is running 385 secs || 1261072 markings, 2359634 edges, 3208 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + 1 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_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 1044 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-10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 448 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 <= 1) OR (wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9 + 1 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1) OR (T_out <= 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 1044 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-10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 14022 markings, 17189 edges, 2804 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 522 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)))
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 1044 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-10-ReachabilityCardinality-10.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 627 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((T_out + 1 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))
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 1044 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-10-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 783 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 <= T_out)))
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 1044 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-10-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 1045 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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-10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 14 will run for 1567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9) AND ((listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + 1 <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + ... (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 1044 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-10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3135 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= 1) OR ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + 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 1044 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-10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: RESULT
========================================
lola:
SUMMARY: yes yes no yes yes no no unknown yes yes yes no no yes yes no
FORMULA SafeBus-COL-10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496446374440

--------------------
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_SafeBus-PT-10"
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_SafeBus-PT-10.tgz
mv S_SafeBus-PT-10 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 S_SafeBus-PT-10, 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 r148-csrt-149443433000250"
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 ;