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 BridgeAndVehicles-PT-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126300475
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494614437632


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N10 @ 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: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.task
lola: E (F (((3 <= VIDANGE_1 + VIDANGE_2) AND (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) AND (2 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50) AND ((2 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9) OR (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SORTI_B) OR (ROUTE_B <= 0))))) : A (G (((2 <= CAPACITE) OR (3 <= ROUTE_A) OR (VIDANGE_1 + VIDANGE_2 + 1 <= SORTI_A)))) : A (G ((((CHOIX_1 + CHOIX_2 <= 1) AND (ATTENTE_B <= 1)) OR (((3 <= SUR_PONT_A) OR (SUR_PONT_A <= ROUTE_A)) AND ((CAPACITE <= SUR_PONT_B) OR (SUR_PONT_A <= CAPACITE)))))) : A (G (((((ROUTE_B <= ATTENTE_B) AND (CONTROLEUR_1 + CONTROLEUR_2 <= VIDANGE_1 + VIDANGE_2)) OR (VIDANGE_1 + VIDANGE_2 <= ROUTE_A)) AND ((SORTI_B <= 0) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2))))) : A (G ((((1 <= VIDANGE_1 + VIDANGE_2) AND (3 <= SORTI_B)) OR ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50) AND (SUR_PONT_A <= SORTI_A)) OR (SUR_PONT_A <= VIDANGE_1 + VIDANGE_2) OR (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SUR_PONT_A) OR (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + 1 <= CHOIX_1 + CHOIX_2)))) : A (G ((((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= ATTENTE_A) AND (CHOIX_1 + CHOIX_2 <= SORTI_A)) OR (SUR_PONT_A <= ROUTE_B)))) : A (G ((((2 <= ATTENTE_A) OR (1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) AND (3 <= ATTENTE_A))) AND (((2 <= SORTI_A) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= SUR_PONT_B)) OR (1 <= CAPACITE))))) : A (G (((CHOIX_1 + CHOIX_2 <= 2) OR ((2 <= ROUTE_A) AND (SUR_PONT_B <= ATTENTE_B))))) : A (G ((2 <= CAPACITE))) : E (F ((((ROUTE_A <= 2) AND (CHOIX_1 + CHOIX_2 <= 0)) OR (((VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) OR (3 <= ROUTE_B)) AND (2 <= CHOIX_1 + CHOIX_2))))) : A (G ((COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= ROUTE_B))) : E (F (((2 <= SUR_PONT_B) AND (CAPACITE + 1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))) : A (G ((1 <= ROUTE_A))) : E (F (((ROUTE_B <= SUR_PONT_B) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2)))) : A (G ((((SUR_PONT_B + 1 <= CAPACITE) OR (SORTI_A <= 0)) AND ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= VIDANGE_1 + VIDANGE_2) OR (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 <= 1))))) : E (F (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 <= 0) OR (ROUTE_B <= 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: E (F (((3 <= VIDANGE_1 + VIDANGE_2) AND (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) AND (2 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 ... (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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= CAPACITE) OR (3 <= ROUTE_A) OR (VIDANGE_1 + VIDANGE_2 + 1 <= SORTI_A))))
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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 36134 markings, 76203 edges, 7227 markings/sec, 0 secs
lola: sara is running 5 secs || 75909 markings, 161472 edges, 7955 markings/sec, 5 secs
lola: sara is running 10 secs || 116186 markings, 248170 edges, 8055 markings/sec, 10 secs
lola: sara is running 15 secs || 156467 markings, 335021 edges, 8056 markings/sec, 15 secs
lola: sara is running 20 secs || 196885 markings, 421940 edges, 8084 markings/sec, 20 secs
lola: sara is running 25 secs || 237313 markings, 515983 edges, 8086 markings/sec, 25 secs
lola: sara is running 30 secs || 275792 markings, 608301 edges, 7696 markings/sec, 30 secs
lola: sara is running 35 secs || 313258 markings, 697935 edges, 7493 markings/sec, 35 secs
lola: sara is running 40 secs || 351759 markings, 793939 edges, 7700 markings/sec, 40 secs
lola: sara is running 45 secs || 391048 markings, 890634 edges, 7858 markings/sec, 45 secs
lola: sara is running 50 secs || 430159 markings, 987646 edges, 7822 markings/sec, 50 secs
lola: sara is running 55 secs || 468018 markings, 1080814 edges, 7572 markings/sec, 55 secs
lola: sara is running 60 secs || 504943 markings, 1170974 edges, 7385 markings/sec, 60 secs
lola: sara is running 65 secs || 542273 markings, 1262179 edges, 7466 markings/sec, 65 secs
lola: sara is running 70 secs || 579037 markings, 1352612 edges, 7353 markings/sec, 70 secs
lola: sara is running 75 secs || 615620 markings, 1442615 edges, 7317 markings/sec, 75 secs
lola: sara is running 80 secs || 653084 markings, 1534003 edges, 7493 markings/sec, 80 secs
lola: sara is running 85 secs || 692608 markings, 1633832 edges, 7905 markings/sec, 85 secs
lola: sara is running 90 secs || 733123 markings, 1735597 edges, 8103 markings/sec, 90 secs
lola: sara is running 95 secs || 773746 markings, 1837127 edges, 8125 markings/sec, 95 secs
lola: sara is running 100 secs || 814105 markings, 1938059 edges, 8072 markings/sec, 100 secs
lola: sara is running 105 secs || 852908 markings, 2034737 edges, 7761 markings/sec, 105 secs
lola: sara is running 110 secs || 890242 markings, 2129056 edges, 7467 markings/sec, 110 secs
lola: sara is running 115 secs || 926634 markings, 2213398 edges, 7278 markings/sec, 115 secs
lola: sara is running 120 secs || 962949 markings, 2304661 edges, 7263 markings/sec, 120 secs
lola: sara is running 125 secs || 999033 markings, 2389424 edges, 7217 markings/sec, 125 secs
lola: sara is running 130 secs || 1035583 markings, 2477829 edges, 7310 markings/sec, 130 secs
lola: sara is running 135 secs || 1074771 markings, 2575765 edges, 7838 markings/sec, 135 secs
lola: sara is running 140 secs || 1113084 markings, 2666069 edges, 7663 markings/sec, 140 secs
lola: sara is running 145 secs || 1152992 markings, 2764099 edges, 7982 markings/sec, 145 secs
lola: sara is running 150 secs || 1193451 markings, 2857909 edges, 8092 markings/sec, 150 secs
lola: sara is running 155 secs || 1233486 markings, 2958707 edges, 8007 markings/sec, 155 secs
lola: sara is running 160 secs || 1271274 markings, 3048500 edges, 7558 markings/sec, 160 secs
lola: sara is running 165 secs || 1307415 markings, 3135629 edges, 7228 markings/sec, 165 secs
lola: sara is running 170 secs || 1343911 markings, 3226712 edges, 7299 markings/sec, 170 secs
lola: sara is running 175 secs || 1382236 markings, 3314225 edges, 7665 markings/sec, 175 secs
lola: sara is running 180 secs || 1419890 markings, 3408705 edges, 7531 markings/sec, 180 secs
lola: sara is running 185 secs || 1457567 markings, 3501396 edges, 7535 markings/sec, 185 secs
lola: sara is running 190 secs || 1494814 markings, 3589195 edges, 7449 markings/sec, 190 secs
lola: sara is running 195 secs || 1532818 markings, 3683890 edges, 7601 markings/sec, 195 secs
lola: sara is running 200 secs || 1570277 markings, 3771549 edges, 7492 markings/sec, 200 secs
lola: sara is running 205 secs || 1607543 markings, 3861989 edges, 7453 markings/sec, 205 secs
lola: sara is running 210 secs || 1645180 markings, 3955881 edges, 7527 markings/sec, 210 secs
lola: sara is running 215 secs || 1682690 markings, 4041284 edges, 7502 markings/sec, 215 secs
lola: sara is running 220 secs || 1720816 markings, 4135722 edges, 7625 markings/sec, 220 secs
lola: sara is running 225 secs || 1757783 markings, 4229195 edges, 7393 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((CHOIX_1 + CHOIX_2 <= 1) AND (ATTENTE_B <= 1)) OR (((3 <= SUR_PONT_A) OR (SUR_PONT_A <= ROUTE_A)) AND ((CAPACITE <= SUR_PONT_B) OR (SUR_PONT_A <= CAPACITE))))))
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 484 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 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((ROUTE_B <= ATTENTE_B) AND (CONTROLEUR_1 + CONTROLEUR_2 <= VIDANGE_1 + VIDANGE_2)) OR (VIDANGE_1 + VIDANGE_2 <= ROUTE_A)) AND ((SORTI_B <= 0) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= VIDANGE_1 + VIDANGE_2) AND (3 <= SORTI_B)) OR ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + ... (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 484 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTEN... (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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-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 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= ATTENTE_A) OR (1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) AND (3 <= ATTENTE_A))) AND (((2 <= SORTI_A) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTE... (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 484 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 35306 markings, 81433 edges, 7061 markings/sec, 0 secs
lola: sara is running 5 secs || 70975 markings, 174865 edges, 7134 markings/sec, 5 secs
lola: sara is running 10 secs || 106842 markings, 271661 edges, 7173 markings/sec, 10 secs
lola: sara is running 15 secs || 142774 markings, 370443 edges, 7186 markings/sec, 15 secs
lola: sara is running 20 secs || 179656 markings, 469654 edges, 7376 markings/sec, 20 secs
lola: sara is running 25 secs || 212764 markings, 562190 edges, 6622 markings/sec, 25 secs
lola: sara is running 30 secs || 247118 markings, 654054 edges, 6871 markings/sec, 30 secs
lola: sara is running 35 secs || 281041 markings, 751007 edges, 6785 markings/sec, 35 secs
lola: sara is running 40 secs || 316761 markings, 845570 edges, 7144 markings/sec, 40 secs
lola: sara is running 45 secs || 352312 markings, 947719 edges, 7110 markings/sec, 45 secs
lola: sara is running 50 secs || 387735 markings, 1040933 edges, 7085 markings/sec, 50 secs
lola: sara is running 55 secs || 420844 markings, 1134632 edges, 6622 markings/sec, 55 secs
lola: sara is running 60 secs || 455149 markings, 1226423 edges, 6861 markings/sec, 60 secs
lola: sara is running 65 secs || 491224 markings, 1327721 edges, 7215 markings/sec, 65 secs
lola: sara is running 70 secs || 527246 markings, 1429134 edges, 7204 markings/sec, 70 secs
lola: sara is running 75 secs || 563741 markings, 1527238 edges, 7299 markings/sec, 75 secs
lola: sara is running 80 secs || 599523 markings, 1629409 edges, 7156 markings/sec, 80 secs
lola: sara is running 85 secs || 636517 markings, 1729236 edges, 7399 markings/sec, 85 secs
lola: sara is running 90 secs || 672668 markings, 1830482 edges, 7230 markings/sec, 90 secs
lola: sara is running 95 secs || 708557 markings, 1934289 edges, 7178 markings/sec, 95 secs
lola: sara is running 100 secs || 745300 markings, 2030756 edges, 7349 markings/sec, 100 secs
lola: sara is running 105 secs || 781327 markings, 2132647 edges, 7205 markings/sec, 105 secs
lola: sara is running 110 secs || 818190 markings, 2239293 edges, 7373 markings/sec, 110 secs
lola: sara is running 115 secs || 855457 markings, 2337834 edges, 7453 markings/sec, 115 secs
lola: sara is running 120 secs || 890579 markings, 2435339 edges, 7024 markings/sec, 120 secs
lola: sara is running 125 secs || 925290 markings, 2535236 edges, 6942 markings/sec, 125 secs
lola: sara is running 130 secs || 962374 markings, 2638796 edges, 7417 markings/sec, 130 secs
lola: sara is running 135 secs || 997895 markings, 2733925 edges, 7104 markings/sec, 135 secs
lola: sara is running 140 secs || 1032779 markings, 2833211 edges, 6977 markings/sec, 140 secs
lola: sara is running 145 secs || 1066403 markings, 2932277 edges, 6725 markings/sec, 145 secs
lola: sara is running 150 secs || 1100316 markings, 3027614 edges, 6783 markings/sec, 150 secs
lola: sara is running 155 secs || 1134297 markings, 3123827 edges, 6796 markings/sec, 155 secs
lola: sara is running 160 secs || 1168480 markings, 3222575 edges, 6837 markings/sec, 160 secs
lola: sara is running 165 secs || 1203069 markings, 3323836 edges, 6918 markings/sec, 165 secs
lola: sara is running 170 secs || 1236688 markings, 3421393 edges, 6724 markings/sec, 170 secs
lola: sara is running 175 secs || 1269479 markings, 3517598 edges, 6558 markings/sec, 175 secs
lola: sara is running 180 secs || 1302305 markings, 3614045 edges, 6565 markings/sec, 180 secs
lola: sara is running 185 secs || 1336995 markings, 3716290 edges, 6938 markings/sec, 185 secs
lola: sara is running 190 secs || 1372451 markings, 3820984 edges, 7091 markings/sec, 190 secs
lola: sara is running 195 secs || 1408469 markings, 3923506 edges, 7204 markings/sec, 195 secs
lola: sara is running 200 secs || 1445560 markings, 4027686 edges, 7418 markings/sec, 200 secs
lola: sara is running 205 secs || 1481845 markings, 4132282 edges, 7257 markings/sec, 205 secs
lola: sara is running 210 secs || 1517860 markings, 4237201 edges, 7203 markings/sec, 210 secs
lola: sara is running 215 secs || 1553870 markings, 4342931 edges, 7202 markings/sec, 215 secs
lola: sara is running 220 secs || 1590867 markings, 4451638 edges, 7399 markings/sec, 220 secs
lola: sara is running 225 secs || 1627845 markings, 4560078 edges, 7396 markings/sec, 225 secs
lola: sara is running 230 secs || 1664494 markings, 4667919 edges, 7330 markings/sec, 230 secs
lola: sara is running 235 secs || 1701449 markings, 4775706 edges, 7391 markings/sec, 235 secs
lola: sara is running 240 secs || 1737774 markings, 4880247 edges, 7265 markings/sec, 240 secs
lola: sara is running 245 secs || 1772324 markings, 4980655 edges, 6910 markings/sec, 245 secs
lola: sara is running 250 secs || 1809098 markings, 5086894 edges, 7355 markings/sec, 250 secs
lola: sara is running 255 secs || 1844875 markings, 5191413 edges, 7155 markings/sec, 255 secs
lola: sara is running 260 secs || 1881103 markings, 5297070 edges, 7246 markings/sec, 260 secs
lola: sara is running 265 secs || 1916252 markings, 5400679 edges, 7030 markings/sec, 265 secs
lola: sara is running 270 secs || 1949671 markings, 5498952 edges, 6684 markings/sec, 270 secs
lola: sara is running 275 secs || 1981984 markings, 5595201 edges, 6463 markings/sec, 275 secs
lola: sara is running 280 secs || 2015337 markings, 5693873 edges, 6671 markings/sec, 280 secs
lola: sara is running 285 secs || 2050717 markings, 5798043 edges, 7076 markings/sec, 285 secs
lola: sara is running 290 secs || 2085362 markings, 5901406 edges, 6929 markings/sec, 290 secs
lola: sara is running 295 secs || 2123455 markings, 6011629 edges, 7619 markings/sec, 295 secs
lola: sara is running 300 secs || 2158374 markings, 6114304 edges, 6984 markings/sec, 300 secs
lola: sara is running 305 secs || 2196463 markings, 6224488 edges, 7618 markings/sec, 305 secs
lola: sara is running 310 secs || 2234133 markings, 6334818 edges, 7534 markings/sec, 310 secs
lola: sara is running 315 secs || 2271193 markings, 6444703 edges, 7412 markings/sec, 315 secs
lola: sara is running 320 secs || 2307621 markings, 6552838 edges, 7286 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CHOIX_1 + CHOIX_2 <= 2) OR ((2 <= ROUTE_A) AND (SUR_PONT_B <= ATTENTE_B)))))
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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7.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 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= CAPACITE)))
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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 7)
lola: sara is running 0 secs || 28275 markings, 69305 edges, 5655 markings/sec, 0 secs
lola: sara is running 5 secs || 55317 markings, 141359 edges, 5408 markings/sec, 5 secs
lola: sara is running 10 secs || 82007 markings, 213538 edges, 5338 markings/sec, 10 secs
lola: sara is running 15 secs || 108205 markings, 285324 edges, 5240 markings/sec, 15 secs
lola: sara is running 20 secs || 135023 markings, 358621 edges, 5364 markings/sec, 20 secs
lola: sara is running 25 secs || 162528 markings, 433655 edges, 5501 markings/sec, 25 secs
lola: sara is running 30 secs || 189055 markings, 508031 edges, 5305 markings/sec, 30 secs
lola: sara is running 35 secs || 215472 markings, 579574 edges, 5283 markings/sec, 35 secs
lola: sara is running 40 secs || 240488 markings, 651541 edges, 5003 markings/sec, 40 secs
lola: sara is running 45 secs || 266897 markings, 725190 edges, 5282 markings/sec, 45 secs
lola: sara is running 50 secs || 294121 markings, 802082 edges, 5445 markings/sec, 50 secs
lola: sara is running 55 secs || 321777 markings, 881559 edges, 5531 markings/sec, 55 secs
lola: sara is running 60 secs || 351292 markings, 963771 edges, 5903 markings/sec, 60 secs
lola: sara is running 65 secs || 377817 markings, 1039058 edges, 5305 markings/sec, 65 secs
lola: sara is running 70 secs || 402553 markings, 1110587 edges, 4947 markings/sec, 70 secs
lola: sara is running 75 secs || 427984 markings, 1182076 edges, 5086 markings/sec, 75 secs
lola: sara is running 80 secs || 453955 markings, 1255316 edges, 5194 markings/sec, 80 secs
lola: sara is running 85 secs || 478685 markings, 1326749 edges, 4946 markings/sec, 85 secs
lola: sara is running 90 secs || 504658 markings, 1403638 edges, 5195 markings/sec, 90 secs
lola: sara is running 95 secs || 532836 markings, 1480056 edges, 5636 markings/sec, 95 secs
lola: sara is running 100 secs || 558622 markings, 1554835 edges, 5157 markings/sec, 100 secs
lola: sara is running 105 secs || 583318 markings, 1625867 edges, 4939 markings/sec, 105 secs
lola: sara is running 110 secs || 608958 markings, 1701797 edges, 5128 markings/sec, 110 secs
lola: sara is running 115 secs || 635695 markings, 1774297 edges, 5347 markings/sec, 115 secs
lola: sara is running 120 secs || 662410 markings, 1850378 edges, 5343 markings/sec, 120 secs
lola: sara is running 125 secs || 688374 markings, 1925516 edges, 5193 markings/sec, 125 secs
lola: sara is running 130 secs || 713878 markings, 2000726 edges, 5101 markings/sec, 130 secs
lola: sara is running 135 secs || 740603 markings, 2074627 edges, 5345 markings/sec, 135 secs
lola: sara is running 140 secs || 767086 markings, 2149482 edges, 5297 markings/sec, 140 secs
lola: sara is running 145 secs || 792270 markings, 2221204 edges, 5037 markings/sec, 145 secs
lola: sara is running 150 secs || 816957 markings, 2295095 edges, 4937 markings/sec, 150 secs
lola: sara is running 155 secs || 841482 markings, 2367693 edges, 4905 markings/sec, 155 secs
lola: sara is running 160 secs || 868314 markings, 2439921 edges, 5366 markings/sec, 160 secs
lola: sara is running 165 secs || 894289 markings, 2514193 edges, 5195 markings/sec, 165 secs
lola: sara is running 170 secs || 919728 markings, 2586538 edges, 5088 markings/sec, 170 secs
lola: sara is running 175 secs || 944449 markings, 2659990 edges, 4944 markings/sec, 175 secs
lola: sara is running 180 secs || 969002 markings, 2732783 edges, 4911 markings/sec, 180 secs
lola: sara is running 185 secs || 995129 markings, 2804507 edges, 5225 markings/sec, 185 secs
lola: sara is running 190 secs || 1021694 markings, 2879579 edges, 5313 markings/sec, 190 secs
lola: sara is running 195 secs || 1047434 markings, 2954167 edges, 5148 markings/sec, 195 secs
lola: sara is running 200 secs || 1073134 markings, 3028565 edges, 5140 markings/sec, 200 secs
lola: sara is running 205 secs || 1098404 markings, 3103095 edges, 5054 markings/sec, 205 secs
lola: sara is running 210 secs || 1123634 markings, 3177172 edges, 5046 markings/sec, 210 secs
lola: sara is running 215 secs || 1150444 markings, 3249374 edges, 5362 markings/sec, 215 secs
lola: sara is running 220 secs || 1176738 markings, 3324818 edges, 5259 markings/sec, 220 secs
lola: sara is running 225 secs || 1201879 markings, 3397906 edges, 5028 markings/sec, 225 secs
lola: sara is running 230 secs || 1227683 markings, 3471333 edges, 5161 markings/sec, 230 secs
lola: sara is running 235 secs || 1253338 markings, 3546451 edges, 5131 markings/sec, 235 secs
lola: sara is running 240 secs || 1278708 markings, 3623171 edges, 5074 markings/sec, 240 secs
lola: sara is running 245 secs || 1305589 markings, 3696060 edges, 5376 markings/sec, 245 secs
lola: sara is running 250 secs || 1332777 markings, 3769749 edges, 5438 markings/sec, 250 secs
lola: sara is running 255 secs || 1358854 markings, 3845619 edges, 5215 markings/sec, 255 secs
lola: sara is running 260 secs || 1383784 markings, 3917597 edges, 4986 markings/sec, 260 secs
lola: sara is running 265 secs || 1408931 markings, 3990456 edges, 5029 markings/sec, 265 secs
lola: sara is running 270 secs || 1434346 markings, 4064904 edges, 5083 markings/sec, 270 secs
lola: sara is running 275 secs || 1459561 markings, 4139039 edges, 5043 markings/sec, 275 secs
lola: sara is running 280 secs || 1483782 markings, 4209783 edges, 4844 markings/sec, 280 secs
lola: sara is running 285 secs || 1508827 markings, 4283632 edges, 5009 markings/sec, 285 secs
lola: sara is running 290 secs || 1534088 markings, 4354783 edges, 5052 markings/sec, 290 secs
lola: sara is running 295 secs || 1559861 markings, 4432033 edges, 5155 markings/sec, 295 secs
lola: sara is running 300 secs || 1584144 markings, 4504365 edges, 4857 markings/sec, 300 secs
lola: sara is running 305 secs || 1610429 markings, 4577172 edges, 5257 markings/sec, 305 secs
lola: sara is running 310 secs || 1637072 markings, 4650519 edges, 5329 markings/sec, 310 secs
lola: sara is running 315 secs || 1663268 markings, 4719932 edges, 5239 markings/sec, 315 secs
lola: sara is running 320 secs || 1688665 markings, 4791426 edges, 5079 markings/sec, 320 secs
lola: sara is running 325 secs || 1713579 markings, 4863834 edges, 4983 markings/sec, 325 secs
lola: sara is running 330 secs || 1738752 markings, 4935982 edges, 5035 markings/sec, 330 secs
lola: sara is running 335 secs || 1764436 markings, 5011103 edges, 5137 markings/sec, 335 secs
lola: sara is running 340 secs || 1789807 markings, 5083342 edges, 5074 markings/sec, 340 secs
lola: sara is running 345 secs || 1816045 markings, 5158199 edges, 5248 markings/sec, 345 secs
lola: sara is running 350 secs || 1841912 markings, 5233941 edges, 5173 markings/sec, 350 secs
lola: sara is running 355 secs || 1866679 markings, 5306410 edges, 4953 markings/sec, 355 secs
lola: sara is running 360 secs || 1893241 markings, 5380214 edges, 5312 markings/sec, 360 secs
lola: sara is running 365 secs || 1919817 markings, 5458843 edges, 5315 markings/sec, 365 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((ROUTE_A <= 2) AND (CHOIX_1 + CHOIX_2 <= 0)) OR (((VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) OR (3 <= ROUTE_B)) AND (2 <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= ROUTE_B)))
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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-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 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= SUR_PONT_B) AND (CAPACITE + 1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 37691 markings, 79461 edges, 7538 markings/sec, 0 secs
lola: sara is running 5 secs || 74312 markings, 167136 edges, 7324 markings/sec, 5 secs
lola: sara is running 10 secs || 112615 markings, 254419 edges, 7661 markings/sec, 10 secs
lola: sara is running 15 secs || 149091 markings, 338507 edges, 7295 markings/sec, 15 secs
lola: sara is running 20 secs || 186783 markings, 426915 edges, 7538 markings/sec, 20 secs
lola: sara is running 25 secs || 224939 markings, 515228 edges, 7631 markings/sec, 25 secs
lola: sara is running 30 secs || 261905 markings, 601258 edges, 7393 markings/sec, 30 secs
lola: sara is running 35 secs || 300058 markings, 688862 edges, 7631 markings/sec, 35 secs
lola: sara is running 40 secs || 338928 markings, 771230 edges, 7774 markings/sec, 40 secs
lola: sara is running 45 secs || 377140 markings, 851766 edges, 7642 markings/sec, 45 secs
lola: sara is running 50 secs || 412684 markings, 935820 edges, 7109 markings/sec, 50 secs
lola: sara is running 55 secs || 448012 markings, 1019035 edges, 7066 markings/sec, 55 secs
lola: sara is running 60 secs || 482849 markings, 1100922 edges, 6967 markings/sec, 60 secs
lola: sara is running 65 secs || 517821 markings, 1183574 edges, 6994 markings/sec, 65 secs
lola: sara is running 70 secs || 553126 markings, 1267216 edges, 7061 markings/sec, 70 secs
lola: sara is running 75 secs || 588748 markings, 1352033 edges, 7124 markings/sec, 75 secs
lola: sara is running 80 secs || 624511 markings, 1437557 edges, 7153 markings/sec, 80 secs
lola: sara is running 85 secs || 660039 markings, 1522720 edges, 7106 markings/sec, 85 secs
lola: sara is running 90 secs || 695432 markings, 1606022 edges, 7079 markings/sec, 90 secs
lola: sara is running 95 secs || 730431 markings, 1689305 edges, 7000 markings/sec, 95 secs
lola: sara is running 100 secs || 761084 markings, 1759474 edges, 6131 markings/sec, 100 secs
lola: sara is running 105 secs || 795119 markings, 1838899 edges, 6807 markings/sec, 105 secs
lola: sara is running 110 secs || 828363 markings, 1921388 edges, 6649 markings/sec, 110 secs
lola: sara is running 115 secs || 863698 markings, 2007302 edges, 7067 markings/sec, 115 secs
lola: sara is running 120 secs || 896075 markings, 2086023 edges, 6475 markings/sec, 120 secs
lola: sara is running 125 secs || 932068 markings, 2173681 edges, 7199 markings/sec, 125 secs
lola: sara is running 130 secs || 967211 markings, 2259600 edges, 7029 markings/sec, 130 secs
lola: sara is running 135 secs || 1000254 markings, 2340169 edges, 6609 markings/sec, 135 secs
lola: sara is running 140 secs || 1034695 markings, 2423497 edges, 6888 markings/sec, 140 secs
lola: sara is running 145 secs || 1069201 markings, 2508296 edges, 6901 markings/sec, 145 secs
lola: sara is running 150 secs || 1105153 markings, 2595912 edges, 7190 markings/sec, 150 secs
lola: sara is running 155 secs || 1138775 markings, 2678708 edges, 6724 markings/sec, 155 secs
lola: sara is running 160 secs || 1172795 markings, 2761054 edges, 6804 markings/sec, 160 secs
lola: sara is running 165 secs || 1206424 markings, 2842713 edges, 6726 markings/sec, 165 secs
lola: sara is running 170 secs || 1240766 markings, 2926307 edges, 6868 markings/sec, 170 secs
lola: sara is running 175 secs || 1272883 markings, 3003509 edges, 6423 markings/sec, 175 secs
lola: sara is running 180 secs || 1303359 markings, 3075657 edges, 6095 markings/sec, 180 secs
lola: sara is running 185 secs || 1336502 markings, 3157846 edges, 6629 markings/sec, 185 secs
lola: sara is running 190 secs || 1370909 markings, 3242117 edges, 6881 markings/sec, 190 secs
lola: sara is running 195 secs || 1406485 markings, 3330967 edges, 7115 markings/sec, 195 secs
lola: sara is running 200 secs || 1440366 markings, 3414306 edges, 6776 markings/sec, 200 secs
lola: sara is running 205 secs || 1474688 markings, 3500449 edges, 6864 markings/sec, 205 secs
lola: sara is running 210 secs || 1508842 markings, 3584065 edges, 6831 markings/sec, 210 secs
lola: sara is running 215 secs || 1544685 markings, 3671948 edges, 7169 markings/sec, 215 secs
lola: sara is running 220 secs || 1577986 markings, 3754712 edges, 6660 markings/sec, 220 secs
lola: sara is running 225 secs || 1613311 markings, 3842977 edges, 7065 markings/sec, 225 secs
lola: sara is running 230 secs || 1645687 markings, 3922899 edges, 6475 markings/sec, 230 secs
lola: sara is running 235 secs || 1681957 markings, 4012287 edges, 7254 markings/sec, 235 secs
lola: sara is running 240 secs || 1716278 markings, 4097580 edges, 6864 markings/sec, 240 secs
lola: sara is running 245 secs || 1749592 markings, 4180516 edges, 6663 markings/sec, 245 secs
lola: sara is running 250 secs || 1784156 markings, 4265832 edges, 6913 markings/sec, 250 secs
lola: sara is running 255 secs || 1818452 markings, 4350830 edges, 6859 markings/sec, 255 secs
lola: sara is running 260 secs || 1851393 markings, 4433013 edges, 6588 markings/sec, 260 secs
lola: sara is running 265 secs || 1886993 markings, 4521213 edges, 7120 markings/sec, 265 secs
lola: sara is running 270 secs || 1914569 markings, 4589739 edges, 5515 markings/sec, 270 secs
lola: sara is running 275 secs || 1946450 markings, 4667465 edges, 6376 markings/sec, 275 secs
lola: sara is running 280 secs || 1976116 markings, 4740003 edges, 5933 markings/sec, 280 secs
lola: sara is running 285 secs || 2006074 markings, 4812696 edges, 5992 markings/sec, 285 secs
lola: sara is running 290 secs || 2041652 markings, 4902551 edges, 7116 markings/sec, 290 secs
lola: sara is running 295 secs || 2074735 markings, 4986409 edges, 6617 markings/sec, 295 secs
lola: sara is running 300 secs || 2110033 markings, 5074893 edges, 7060 markings/sec, 300 secs
lola: sara is running 305 secs || 2142231 markings, 5155674 edges, 6440 markings/sec, 305 secs
lola: sara is running 310 secs || 2176519 markings, 5240730 edges, 6858 markings/sec, 310 secs
lola: sara is running 315 secs || 2212392 markings, 5330833 edges, 7175 markings/sec, 315 secs
lola: sara is running 320 secs || 2245185 markings, 5412311 edges, 6559 markings/sec, 320 secs
lola: sara is running 325 secs || 2279151 markings, 5497711 edges, 6793 markings/sec, 325 secs
lola: sara is running 330 secs || 2313203 markings, 5583869 edges, 6810 markings/sec, 330 secs
lola: sara is running 335 secs || 2347168 markings, 5669572 edges, 6793 markings/sec, 335 secs
lola: sara is running 340 secs || 2381208 markings, 5753665 edges, 6808 markings/sec, 340 secs
lola: sara is running 345 secs || 2414565 markings, 5838016 edges, 6671 markings/sec, 345 secs
lola: sara is running 350 secs || 2447789 markings, 5920208 edges, 6645 markings/sec, 350 secs
lola: sara is running 355 secs || 2481458 markings, 6006160 edges, 6734 markings/sec, 355 secs
lola: sara is running 360 secs || 2514567 markings, 6088045 edges, 6622 markings/sec, 360 secs
lola: sara is running 365 secs || 2547776 markings, 6172403 edges, 6642 markings/sec, 365 secs
lola: sara is running 370 secs || 2581074 markings, 6255459 edges, 6660 markings/sec, 370 secs
lola: sara is running 375 secs || 2613164 markings, 6337047 edges, 6418 markings/sec, 375 secs
lola: sara is running 380 secs || 2647102 markings, 6421585 edges, 6788 markings/sec, 380 secs
lola: sara is running 385 secs || 2682753 markings, 6508953 edges, 7130 markings/sec, 385 secs
lola: sara is running 390 secs || 2712078 markings, 6584131 edges, 5865 markings/sec, 390 secs
lola: sara is running 395 secs || 2738781 markings, 6653027 edges, 5341 markings/sec, 395 secs
lola: sara is running 400 secs || 2769635 markings, 6729762 edges, 6171 markings/sec, 400 secs
lola: sara is running 405 secs || 2797355 markings, 6800915 edges, 5544 markings/sec, 405 secs
lola: sara is running 410 secs || 2827817 markings, 6876818 edges, 6092 markings/sec, 410 secs
lola: sara is running 415 secs || 2856888 markings, 6948970 edges, 5814 markings/sec, 415 secs
lola: sara is running 420 secs || 2889550 markings, 7032444 edges, 6532 markings/sec, 420 secs
lola: sara is running 425 secs || 2923285 markings, 7118124 edges, 6747 markings/sec, 425 secs
lola: sara is running 430 secs || 2957694 markings, 7203401 edges, 6882 markings/sec, 430 secs
lola: sara is running 435 secs || 2990737 markings, 7288583 edges, 6609 markings/sec, 435 secs
lola: sara is running 440 secs || 3023666 markings, 7372070 edges, 6586 markings/sec, 440 secs
lola: sara is running 445 secs || 3057909 markings, 7457165 edges, 6849 markings/sec, 445 secs
lola: sara is running 450 secs || 3089998 markings, 7540397 edges, 6418 markings/sec, 450 secs
lola: sara is running 455 secs || 3123268 markings, 7622300 edges, 6654 markings/sec, 455 secs
lola: sara is running 460 secs || 3156366 markings, 7706483 edges, 6620 markings/sec, 460 secs
lola: sara is running 465 secs || 3191117 markings, 7793423 edges, 6950 markings/sec, 465 secs
lola: sara is running 470 secs || 3225592 markings, 7881637 edges, 6895 markings/sec, 470 secs
lola: sara is running 475 secs || 3259377 markings, 7966934 edges, 6757 markings/sec, 475 secs
lola: sara is running 480 secs || 3293461 markings, 8054248 edges, 6817 markings/sec, 480 secs
lola: sara is running 485 secs || 3326777 markings, 8137540 edges, 6663 markings/sec, 485 secs
lola: sara is running 490 secs || 3359701 markings, 8221413 edges, 6585 markings/sec, 490 secs
lola: sara is running 495 secs || 3394321 markings, 8308743 edges, 6924 markings/sec, 495 secs
lola: sara is running 500 secs || 3428127 markings, 8395117 edges, 6761 markings/sec, 500 secs
lola: sara is running 505 secs || 3460269 markings, 8477617 edges, 6428 markings/sec, 505 secs
lola: sara is running 510 secs || 3493125 markings, 8559602 edges, 6571 markings/sec, 510 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ROUTE_A)))
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 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-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 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_B <= SUR_PONT_B) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13.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 14 will run for 1041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((SUR_PONT_B + 1 <= CAPACITE) OR (SORTI_A <= 0)) AND ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= VIDANGE_1 + VIDANGE_2) OR (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATT... (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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no yes no unknown yes unknown yes no unknown no no no yes
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494615895563

--------------------
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="BridgeAndVehicles-PT-V50P20N10"
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/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 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 BridgeAndVehicles-PT-V50P20N10, 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 r008-csrt-149436126300475"
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 ;