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

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

=== Now, execution of the tool begins

BK_START 1496451559322


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


checking for too many tokens
===========================================================================================
S_SimpleLoadBal-PT-15: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_SimpleLoadBal-PT-15 @ 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: 1429/65536 symbol table entries, 126 collisions
lola: preprocessing...
lola: finding significant places
lola: 149 places, 1280 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2081 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-COL-15-ReachabilityCardinality.task
lola: A (G (((P-server_waiting_1 + P-server_waiting_2 <= P-client_waiting_9 + P-client_waiting_8 + P-client_waiting_7 + P-client_waiting_6 + P-client_waiting_5 + P-client_waiting_4 + P-client_waiting_3 + P-client_waiting_2 + P-client_waiting_1 + P-client_waiting_15 + P-client_waiting_14 + P-client_waiting_13 + P-client_waiting_12 + P-client_waiting_11 + P-client_waiting_10) OR (P-client_ack_1 + P-client_ack_2 + P-client_ack_3 + P-client_ack_4 + P-client_ack_5 + P-client_ack_6 + P-client_ack_7 + P-client_ack_8 + P-client_ack_9 + P-client_ack_10 + P-client_ack_11 + P-client_ack_12 + P-client_ack_13 + P-client_ack_14 + P-client_ack_15 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR ((P-server_waiting_1 + P-server_waiting_2 <= P-lb_routing_1_1 + P-lb_routing_1_2 + P-lb_routing_1_3 + P-lb_routing_1_4 + P-lb_routing_1_5 + P-lb_routing_1_6 + P-lb_routing_1_7 + P-lb_routing_1_8 + P-lb_routing_1_9 + P-lb_routing_1_10 + P-lb_routing_1_11 + P-lb_routing_1_12 + P-lb_routing_1_13 + P-lb_routing_1_14 + P-lb_routing_1_15) AND (P-client_waiting_9 + P-client_waiting_8 + P-client_waiting_7 + P-client_waiting_6 + P-client_waiting_5 + P-client_waiting_4 + P-client_waiting_3 + P-client_waiting_2 + P-client_waiting_1 + P-client_waiting_15 + P-client_waiting_14 + P-client_waiting_13 + P-client_waiting_12 + P-client_waiting_11 + P-client_waiting_10 <= P-client_request_14 + P-client_request_13 + P-client_request_12 + P-client_request_11 + P-client_request_10 + P-client_request_9 + P-client_request_8 + P-client_request_1 + P-client_request_2 + P-client_request_3 + P-client_request_4 + P-client_request_5 + P-client_request_6 + P-client_request_7 + P-client_request_15)) OR ((P-client_idle_1 + P-client_idle_2 + P-client_idle_3 + P-client_idle_4 + P-client_idle_5 + P-client_idle_6 + P-client_idle_7 + P-client_idle_8 + P-client_idle_9 + P-client_idle_10 + P-client_idle_11 + P-client_idle_12 + P-client_idle_13 + P-client_idle_14 + P-client_idle_15 <= P-lb_balancing_1) AND (P-client_idle_1 + P-client_idle_2 + P-client_idle_3 + P-client_idle_4 + P-client_idle_5 + P-client_idle_6 + P-client_idle_7 + P-client_idle_8 + P-client_idle_9 + P-client_idle_10 + P-client_idle_11 + P-client_idle_12 + P-client_idle_13 + P-client_idle_14 + P-client_idle_15 <= P-lb_routing_1_1 + P-lb_routing_1_2 + P-lb_routing_1_3 + P-lb_routing_1_4 + P-lb_routing_1_5 + P-lb_routing_1_6 + P-lb_routing_1_7 + P-lb_routing_1_8 + P-lb_routing_1_9 + P-lb_routing_1_10 + P-lb_routing_1_11 + P-lb_routing_1_12 + P-lb_routing_1_13 + P-lb_routing_1_14 + P-lb_routing_1_15) AND (P-lb_balancing_1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2) AND (1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2))))) : A (G (())) : A (G (((P-server_idle_1 + P-server_idle_2 + 1 <= P-server_waiting_1 + P-server_waiting_2) OR (P-server_idle_1 + P-server_idle_2 + 1 <= P-lb_idle_1) OR (P-lb_balancing_1 <= P-lb_idle_1) OR (P-server_waiting_1 + P-server_waiting_2 <= P-lb_load_2_10 + P-lb_load_2_11 + P-lb_load_2_12 + P-lb_load_2_13 + P-lb_load_2_14 + P-lb_load_2_15 + P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_2 + P-lb_load_1_3 + P-lb_load_1_4 + P-lb_load_1_5 + P-lb_load_1_6 + P-lb_load_1_7 + P-lb_load_1_8 + P-lb_load_1_9 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_2_3 + P-lb_load_2_4 + P-lb_load_2_5 + P-lb_load_2_6 + P-lb_load_2_7 + P-lb_load_2_8 + P-lb_load_1_10 + P-lb_load_1_11 + P-lb_load_1_12 + P-lb_load_1_13 + P-lb_load_1_14 + P-lb_load_1_15 + P-lb_load_2_9) OR (P-server_processed_1 + P-server_processed_2 <= P-client_ack_1 + P-client_ack_2 + P-client_ack_3 + P-client_ack_4 + P-client_ack_5 + P-client_ack_6 + P-client_ack_7 + P-client_ack_8 + P-client_ack_9 + P-client_ack_10 + P-client_ack_11 + P-client_ack_12 + P-client_ack_13 + P-client_ack_14 + P-client_ack_15) OR (2 <= P-lb_load_2_10 + P-lb_load_2_11 + P-lb_load_2_12 + P-lb_load_2_13 + P-lb_load_2_14 + P-lb_load_2_15 + P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_2 + P-lb_load_1_3 + P-lb_load_1_4 + P-lb_load_1_5 + P-lb_load_1_6 + P-lb_load_1_7 + P-lb_load_1_8 + P-lb_load_1_9 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_2_3 + P-lb_load_2_4 + P-lb_load_2_5 + P-lb_load_2_6 + P-lb_load_2_7 + P-lb_load_2_8 + P-lb_load_1_10 + P-lb_load_1_11 + P-lb_load_1_12 + P-lb_load_1_13 + P-lb_load_1_14 + P-lb_load_1_15 + P-lb_load_2_9)))) : E (F ((P-lb_balancing_1 + 1 <= P-client_ack_1 + P-client_ack_2 + P-client_ack_3 + P-client_ack_4 + P-client_ack_5 + P-client_ack_6 + P-client_ack_7 + P-client_ack_8 + P-client_ack_9 + P-client_ack_10 + P-client_ack_11 + P-client_ack_12 + P-client_ack_13 + P-client_ack_14 + P-client_ack_15))) : A (G ((P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2 <= P-lb_idle_1))) : E (F (((3 <= P-client_request_14 + P-client_request_13 + P-client_request_12 + P-client_request_11 + P-client_request_10 + P-client_request_9 + P-client_request_8 + P-client_request_1 + P-client_request_2 + P-client_request_3 + P-client_request_4 + P-client_request_5 + P-client_request_6 + P-client_request_7 + P-client_request_15) AND (P-lb_balancing_1 <= P-server_notification_1 + P-server_notification_2) AND (2 <= P-server_notification_1 + P-server_notification_2) AND ((P-server_processed_1 + P-server_processed_2 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2) OR (1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2) OR (P-lb_balancing_1 + 1 <= P-server_notification_ack_1 + P-server_notification_ack_2))))) : E (F ((3 <= P-lb_load_2_10 + P-lb_load_2_11 + P-lb_load_2_12 + P-lb_load_2_13 + P-lb_load_2_14 + P-lb_load_2_15 + P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_2 + P-lb_load_1_3 + P-lb_load_1_4 + P-lb_load_1_5 + P-lb_load_1_6 + P-lb_load_1_7 + P-lb_load_1_8 + P-lb_load_1_9 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_2_3 + P-lb_load_2_4 + P-lb_load_2_5 + P-lb_load_2_6 + P-lb_load_2_7 + P-lb_load_2_8 + P-lb_load_1_10 + P-lb_load_1_11 + P-lb_load_1_12 + P-lb_load_1_13 + P-lb_load_1_14 + P-lb_load_1_15 + P-lb_load_2_9))) : E (F ((3 <= P-server_idle_1 + P-server_idle_2))) : A (G ((((P-server_idle_1 + P-server_idle_2 + 1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2) AND (P-server_processed_1 + P-server_processed_2 + 1 <= P-server_waiting_1 + P-server_waiting_2)) OR (P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2 <= 2)))) : A (G ((P-lb_balancing_1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2))) : A (G ((((P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2 <= P-server_waiting_1 + P-server_waiting_2) OR (1 <= P-client_idle_1 + P-client_idle_2 + P-client_idle_3 + P-client_idle_4 + P-client_idle_5 + P-client_idle_6 + P-client_idle_7 + P-client_idle_8 + P-client_idle_9 + P-client_idle_10 + P-client_idle_11 + P-client_idle_12 + P-client_idle_13 + P-client_idle_14 + P-client_idle_15) OR ((3 <= P-server_notification_1 + P-server_notification_2) AND (P-server_idle_1 + P-server_idle_2 <= P-server_notification_1 + P-server_notification_2))) AND (P-lb_balancing_1 <= 1)))) : A (G ((P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2 <= P-client_waiting_9 + P-client_waiting_8 + P-client_waiting_7 + P-client_waiting_6 + P-client_waiting_5 + P-client_waiting_4 + P-client_waiting_3 + P-client_waiting_2 + P-client_waiting_1 + P-client_waiting_15 + P-client_waiting_14 + P-client_waiting_13 + P-client_waiting_12 + P-client_waiting_11 + P-client_waiting_10))) : A (G (((P-client_request_14 + P-client_request_13 + P-client_request_12 + P-client_request_11 + P-client_request_10 + P-client_request_9 + P-client_request_8 + P-client_request_1 + P-client_request_2 + P-client_request_3 + P-client_request_4 + P-client_request_5 + P-client_request_6 + P-client_request_7 + P-client_request_15 <= 0) OR ((P-server_waiting_1 + P-server_waiting_2 <= 2) AND (P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2 <= 1))))) : A (G ((P-server_notification_1 + P-server_notification_2 <= 1))) : E (F ((((3 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2) OR (1 <= P-client_request_14 + P-client_request_13 + P-client_request_12 + P-client_request_11 + P-client_request_10 + P-client_request_9 + P-client_request_8 + P-client_request_1 + P-client_request_2 + P-client_request_3 + P-client_request_4 + P-client_request_5 + P-client_request_6 + P-client_request_7 + P-client_request_15) OR (P-lb_idle_1 <= 2)) AND ((P-server_notification_ack_1 + P-server_notification_ack_2 + 1 <= P-lb_balancing_1) OR (P-client_ack_1 + P-client_ack_2 + P-client_ack_3 + P-client_ack_4 + P-client_ack_5 + P-client_ack_6 + P-client_ack_7 + P-client_ack_8 + P-client_ack_9 + P-client_ack_10 + P-client_ack_11 + P-client_ack_12 + P-client_ack_13 + P-client_ack_14 + P-client_ack_15 + 1 <= P-lb_balancing_1))))) : A (G (((P-client_ack_1 + P-client_ack_2 + P-client_ack_3 + P-client_ack_4 + P-client_ack_5 + P-client_ack_6 + P-client_ack_7 + P-client_ack_8 + P-client_ack_9 + P-client_ack_10 + P-client_ack_11 + P-client_ack_12 + P-client_ack_13 + P-client_ack_14 + P-client_ack_15 <= P-client_waiting_9 + P-client_waiting_8 + P-client_waiting_7 + P-client_waiting_6 + P-client_waiting_5 + P-client_waiting_4 + P-client_waiting_3 + P-client_waiting_2 + P-client_waiting_1 + P-client_waiting_15 + P-client_waiting_14 + P-client_waiting_13 + P-client_waiting_12 + P-client_waiting_11 + P-client_waiting_10) OR ((P-lb_load_2_10 + P-lb_load_2_11 + P-lb_load_2_12 + P-lb_load_2_13 + P-lb_load_2_14 + P-lb_load_2_15 + P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_2 + P-lb_load_1_3 + P-lb_load_1_4 + P-lb_load_1_5 + P-lb_load_1_6 + P-lb_load_1_7 + P-lb_load_1_8 + P-lb_load_1_9 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_2_3 + P-lb_load_2_4 + P-lb_load_2_5 + P-lb_load_2_6 + P-lb_load_2_7 + P-lb_load_2_8 + P-lb_load_1_10 + P-lb_load_1_11 + P-lb_load_1_12 + P-lb_load_1_13 + P-lb_load_1_14 + P-lb_load_1_15 + P-lb_load_2_9 <= 2) AND (P-client_waiting_9 + P-client_waiting_8 + P-client_waiting_7 + P-client_waiting_6 + P-client_waiting_5 + P-client_waiting_4 + P-client_waiting_3 + P-client_waiting_2 + P-client_waiting_1 + P-client_waiting_15 + P-client_waiting_14 + P-client_waiting_13 + P-client_waiting_12 + P-client_waiting_11 + P-client_waiting_10 + 1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_request_7_2 + P-server_request_3_1 + P-server_request_3_2 + P-server_request_4_1 + P-server_request_4_2 + P-server_request_5_1 + P-server_request_5_2 + P-server_request_6_1 + P-server_request_6_2 + P-server_request_7_1 + P-server_request_8_2 + P-server_request_9_2 + P-server_request_13_1 + P-server_request_13_2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-server_waiting_1 + P-server_waiting_2 <= P-client_waiting_9 + P-client_waiting_8 + P-client_waiting_7 + P-client_waiting_6 + P-client_waiting_5 + P-client_waiting_4 + P-client_waiting_3 + P-client_waiting_2 + P-client_waiting_1 + P-client_waiting_15 + P-client_waiting_14 + P-client_waiting_13 + P-client_waiting_12 + P-client_waiting_11 + P-client_waiting_10) OR (P-client_ack_1 + P-clien... (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 440 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 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-COL-15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 47069 markings, 81606 edges, 9414 markings/sec, 0 secs
lola: sara is running 5 secs || 94632 markings, 181126 edges, 9513 markings/sec, 5 secs
lola: sara is running 10 secs || 141589 markings, 286124 edges, 9391 markings/sec, 10 secs
lola: sara is running 15 secs || 187438 markings, 396373 edges, 9170 markings/sec, 15 secs
lola: sara is running 20 secs || 233669 markings, 520341 edges, 9246 markings/sec, 20 secs
lola: sara is running 25 secs || 281676 markings, 641456 edges, 9601 markings/sec, 25 secs
lola: sara is running 30 secs || 331431 markings, 765645 edges, 9951 markings/sec, 30 secs
lola: sara is running 35 secs || 379977 markings, 886851 edges, 9709 markings/sec, 35 secs
lola: sara is running 40 secs || 422805 markings, 1001108 edges, 8566 markings/sec, 40 secs
lola: sara is running 45 secs || 464675 markings, 1123544 edges, 8374 markings/sec, 45 secs
lola: sara is running 50 secs || 507292 markings, 1252962 edges, 8523 markings/sec, 50 secs
lola: sara is running 55 secs || 550117 markings, 1367425 edges, 8565 markings/sec, 55 secs
lola: sara is running 60 secs || 592330 markings, 1495506 edges, 8443 markings/sec, 60 secs
lola: sara is running 65 secs || 634056 markings, 1623099 edges, 8345 markings/sec, 65 secs
lola: sara is running 70 secs || 677198 markings, 1748035 edges, 8628 markings/sec, 70 secs
lola: sara is running 75 secs || 720098 markings, 1881785 edges, 8580 markings/sec, 75 secs
lola: sara is running 80 secs || 761916 markings, 2014181 edges, 8364 markings/sec, 80 secs
lola: sara is running 85 secs || 805930 markings, 2136511 edges, 8803 markings/sec, 85 secs
lola: sara is running 90 secs || 848571 markings, 2277941 edges, 8528 markings/sec, 90 secs
lola: sara is running 95 secs || 891873 markings, 2419673 edges, 8660 markings/sec, 95 secs
lola: sara is running 100 secs || 934530 markings, 2561340 edges, 8531 markings/sec, 100 secs
lola: sara is running 105 secs || 979367 markings, 2688767 edges, 8967 markings/sec, 105 secs
lola: sara is running 110 secs || 1026989 markings, 2791908 edges, 9524 markings/sec, 110 secs
lola: sara is running 115 secs || 1069210 markings, 2930272 edges, 8444 markings/sec, 115 secs
lola: sara is running 120 secs || 1112089 markings, 3061161 edges, 8576 markings/sec, 120 secs
lola: sara is running 125 secs || 1158335 markings, 3189098 edges, 9249 markings/sec, 125 secs
lola: sara is running 130 secs || 1202639 markings, 3337772 edges, 8861 markings/sec, 130 secs
lola: sara is running 135 secs || 1247322 markings, 3489515 edges, 8937 markings/sec, 135 secs
lola: sara is running 140 secs || 1289849 markings, 3633189 edges, 8505 markings/sec, 140 secs
lola: sara is running 145 secs || 1331273 markings, 3773699 edges, 8285 markings/sec, 145 secs
lola: sara is running 150 secs || 1373382 markings, 3921272 edges, 8422 markings/sec, 150 secs
lola: sara is running 155 secs || 1415623 markings, 4068775 edges, 8448 markings/sec, 155 secs
lola: sara is running 160 secs || 1456225 markings, 4209186 edges, 8120 markings/sec, 160 secs
lola: sara is running 165 secs || 1497424 markings, 4354433 edges, 8240 markings/sec, 165 secs
lola: sara is running 170 secs || 1539882 markings, 4502506 edges, 8492 markings/sec, 170 secs
lola: sara is running 175 secs || 1584148 markings, 4656375 edges, 8853 markings/sec, 175 secs
lola: sara is running 180 secs || 1625845 markings, 4807394 edges, 8339 markings/sec, 180 secs
lola: sara is running 185 secs || 1668940 markings, 4960965 edges, 8619 markings/sec, 185 secs
lola: sara is running 190 secs || 1714660 markings, 5088899 edges, 9144 markings/sec, 190 secs
lola: sara is running 195 secs || 1760669 markings, 5209573 edges, 9202 markings/sec, 195 secs
lola: sara is running 200 secs || 1804158 markings, 5365249 edges, 8698 markings/sec, 200 secs
lola: sara is running 205 secs || 1848105 markings, 5520000 edges, 8789 markings/sec, 205 secs
lola: sara is running 210 secs || 1891750 markings, 5674998 edges, 8729 markings/sec, 210 secs
lola: sara is running 215 secs || 1935073 markings, 5830945 edges, 8665 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 149 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-15-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-server_idle_1 + P-server_idle_2 + 1 <= P-server_waiting_1 + P-server_waiting_2) OR (P-server_idle_1 + P-server_idle_2 + 1 <= P-lb_idle_1) OR (P-lb_balancing_1 <= P-lb_idle_1) OR (P-server_waiting_1 + P-server_waiting_2 <= P-lb_load_2_10 + P-lb_load_2_11 + P-lb_load_2_12 + P-lb_load_2_13 + P-lb_load_2_14 + P-lb_load_2_15 + P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_2 + P-lb_load_1_3 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 440 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 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-COL-15-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality-2.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 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P-lb_balancing_1 + 1 <= P-client_ack_1 + P-client_ack_2 + P-client_ack_3 + P-client_ack_4 + P-client_ack_5 + P-client_ack_6 + P-client_ack_7 + P-client_ack_8 + P-client_ack_9 + P-client_ack_10 + P-client_ack_11 + P-client_ack_12 + P-client_ack_13 + P-client_ack_14 + P-client_ack_15)))
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 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_reques... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= P-client_request_14 + P-client_request_13 + P-client_request_12 + P-client_request_11 + P-client_request_10 + P-client_request_9 + P-client_request_8 + P-client_request_1 + P-client_request_2 + P-client_request_3 + P-client_request_4 + P-client_request_5 + P-client_request_6 + P-client_request_7 + P-client_request_15) AND (P-lb_balancing_1 <= P-server_notification_1 + P-server_notific... (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 440 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: state equation: write sara problem file to SimpleLoadBal-COL-15-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P-lb_load_2_10 + P-lb_load_2_11 + P-lb_load_2_12 + P-lb_load_2_13 + P-lb_load_2_14 + P-lb_load_2_15 + P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_1_2 + P-lb_load_1_3 + P-lb_load_1_4 + P-lb_load_1_5 + P-lb_load_1_6 + P-lb_load_1_7 + P-lb_load_1_8 + P-lb_load_1_9 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_2_3 + P-lb_load_2_4 + P-lb_load_2_5 + P-lb_load_2_6 + P-lb_load_2_7 ... (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 440 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to SimpleLoadBal-COL-15-ReachabilityCardinality-6.sara
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P-server_idle_1 + P-server_idle_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality-6.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
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 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P-server_idle_1 + P-server_idle_2 + 1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9... (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 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-8.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-lb_balancing_1 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8... (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 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_requ... (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 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server_reques... (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 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-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 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-client_request_14 + P-client_request_13 + P-client_request_12 + P-client_request_11 + P-client_request_10 + P-client_request_9 + P-client_request_8 + P-client_request_1 + P-client_request_2 + P-client_request_3 + P-client_request_4 + P-client_request_5 + P-client_request_6 + P-client_request_7 + P-client_request_15 <= 0) OR ((P-server_waiting_1 + P-server_waiting_2 <= 2) AND (P-server_r... (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 440 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 SimpleLoadBal-COL-15-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 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-server_notification_1 + P-server_notification_2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= P-server_request_14_1 + P-server_request_14_2 + P-server_request_15_1 + P-server_request_15_2 + P-server_request_12_2 + P-server_request_12_1 + P-server_request_11_2 + P-server_request_11_1 + P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_1 + P-server_request_2_2 + P-server_request_10_2 + P-server_request_10_1 + P-server_request_9_1 + P-server_request_8_1 + P-server... (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 440 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 6 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-COL-15-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 3318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-client_ack_1 + P-client_ack_2 + P-client_ack_3 + P-client_ack_4 + P-client_ack_5 + P-client_ack_6 + P-client_ack_7 + P-client_ack_8 + P-client_ack_9 + P-client_ack_10 + P-client_ack_11 + P-client_ack_12 + P-client_ack_13 + P-client_ack_14 + P-client_ack_15 <= P-client_waiting_9 + P-client_waiting_8 + P-client_waiting_7 + P-client_waiting_6 + P-client_waiting_5 + P-client_waiting_4 + P-cl... (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 440 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 SimpleLoadBal-COL-15-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: unknown yes yes yes no yes no no no no no yes no no yes yes
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-15-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496451781932

--------------------
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_SimpleLoadBal-PT-15"
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_SimpleLoadBal-PT-15.tgz
mv S_SimpleLoadBal-PT-15 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_SimpleLoadBal-PT-15, 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-149443433200385"
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 ;