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-V80P50N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126400552
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494619629736


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-PT-V80P50N10 @ 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: 2296/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: NOT(E (F (A (G ((2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))))) : (((A (X ((3 <= CHOIX_1 + CHOIX_2))) AND ((3 <= ATTENTE_B) AND (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= VIDANGE_1 + VIDANGE_2) AND (2 <= SORTI_A))) AND (A (X ((1 <= CHOIX_1 + CHOIX_2))) OR (1 <= SORTI_A))) OR E (F (A (G ((ROUTE_B <= SUR_PONT_A)))))) : E (F ((2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))) : E (G ((A (F ((1 <= ROUTE_B))) 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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80 <= ROUTE_B)))) : E (F (NOT(A (F ((3 <= CONTROLEUR_1 + CONTROLEUR_2)))))) : A (G ((A (F ((3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))) OR (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))) : ((A (G (((3 <= VIDANGE_1 + VIDANGE_2) AND (SUR_PONT_A <= 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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80)))) OR (((SUR_PONT_A <= CHOIX_1 + CHOIX_2) OR (VIDANGE_1 + VIDANGE_2 <= ATTENTE_A)) AND (SORTI_B <= 0) AND (ROUTE_A + 1 <= ATTENTE_A))) OR NOT(E (G ((COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= 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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80))))) : (A (F (A (F ((1 <= VIDANGE_1 + VIDANGE_2))))) AND (E (F (((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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80) OR (3 <= SORTI_B)))) AND ((((CHOIX_1 + CHOIX_2 <= ROUTE_B) AND (2 <= ATTENTE_A)) OR (SORTI_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2)) OR E (F ((3 <= CONTROLEUR_1 + CONTROLEUR_2)))))) : E ((A (X ((3 <= ROUTE_B))) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))) : A (F ((A (F ((1 <= CONTROLEUR_1 + CONTROLEUR_2))) OR (3 <= SORTI_B)))) : NOT(E ((((SUR_PONT_B <= VIDANGE_1 + VIDANGE_2) OR (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_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + 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)) U ((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 (2 <= CONTROLEUR_1 + CONTROLEUR_2))))) : E (G (A ((TRUE U (2 <= CAPACITE))))) : A (X ((A (F ((3 <= SUR_PONT_A))) AND (SUR_PONT_B <= 0)))) : A (F (A (F (((3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) AND (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_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + 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)))))) : NOT(NOT((A (F ((CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2))) OR ((SORTI_A + 1 <= SORTI_B) AND ((ROUTE_B <= ATTENTE_A) OR (1 <= SORTI_A)))))) : A (F ((3 <= SUR_PONT_A)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G ((2 <= 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 liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= 1)))))
lola: processed formula length: 178
lola: 7 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 424418 markings, 1134839 edges, 3689348869717491712 markings/sec, 0 secs
lola: 821568 markings, 2288264 edges, 79430 markings/sec, 5 secs
lola: 1196814 markings, 3526706 edges, 75049 markings/sec, 10 secs
lola: 1595096 markings, 4837065 edges, 79656 markings/sec, 15 secs
lola: 1986318 markings, 6130550 edges, 78244 markings/sec, 20 secs
lola: 2379913 markings, 7428354 edges, 78719 markings/sec, 25 secs
lola: 2777549 markings, 8742809 edges, 79527 markings/sec, 30 secs
lola: 3156449 markings, 10001557 edges, 75780 markings/sec, 35 secs
lola: 3547131 markings, 11286252 edges, 78136 markings/sec, 40 secs
lola: 3901007 markings, 12460866 edges, 70775 markings/sec, 45 secs
lola: 4252130 markings, 13623318 edges, 70225 markings/sec, 50 secs
lola: 4623582 markings, 14850069 edges, 74290 markings/sec, 55 secs
lola: 4980276 markings, 16034517 edges, 71339 markings/sec, 60 secs
lola: 5327214 markings, 17188026 edges, 69388 markings/sec, 65 secs
lola: 5700481 markings, 18418724 edges, 74653 markings/sec, 70 secs
lola: 6063663 markings, 19624387 edges, 72636 markings/sec, 75 secs
lola: 6420816 markings, 20812901 edges, 71431 markings/sec, 80 secs
lola: 6810103 markings, 22098959 edges, 77857 markings/sec, 85 secs
lola: 7195489 markings, 23377179 edges, 77077 markings/sec, 90 secs
lola: 7548189 markings, 24549500 edges, 70540 markings/sec, 95 secs
lola: 7910531 markings, 25756815 edges, 72468 markings/sec, 100 secs
lola: 8298007 markings, 27035767 edges, 77495 markings/sec, 105 secs
lola: 8653535 markings, 28216581 edges, 71106 markings/sec, 110 secs
lola: 9000712 markings, 29371735 edges, 69435 markings/sec, 115 secs
lola: 9343479 markings, 30513404 edges, 68553 markings/sec, 120 secs
lola: 9699782 markings, 31690465 edges, 71261 markings/sec, 125 secs
lola: 10059588 markings, 32884735 edges, 71961 markings/sec, 130 secs
lola: 10409274 markings, 34047103 edges, 69937 markings/sec, 135 secs
lola: 10751766 markings, 35188819 edges, 68498 markings/sec, 140 secs
lola: 11097235 markings, 36339651 edges, 69094 markings/sec, 145 secs
lola: 11465266 markings, 37573467 edges, 73606 markings/sec, 150 secs
lola: 11838544 markings, 38817362 edges, 74656 markings/sec, 155 secs
lola: 12221624 markings, 40086759 edges, 76616 markings/sec, 160 secs
lola: 12590908 markings, 41315723 edges, 73857 markings/sec, 165 secs
lola: 12951272 markings, 42515432 edges, 72073 markings/sec, 170 secs
lola: 13310390 markings, 43712804 edges, 71824 markings/sec, 175 secs
lola: 13674909 markings, 44920510 edges, 72904 markings/sec, 180 secs
lola: 14056627 markings, 46186628 edges, 76344 markings/sec, 185 secs
lola: 14422446 markings, 47402982 edges, 73164 markings/sec, 190 secs
lola: 14779023 markings, 48592010 edges, 71315 markings/sec, 195 secs
lola: 15132113 markings, 49768217 edges, 70618 markings/sec, 200 secs
lola: 15478916 markings, 50926517 edges, 69361 markings/sec, 205 secs
lola: 15846554 markings, 52141402 edges, 73528 markings/sec, 210 secs
lola: 16212277 markings, 53357281 edges, 73145 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 (X ((3 <= CHOIX_1 + CHOIX_2))) AND ((3 <= ATTENTE_B) AND (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= VIDANGE_1 + VIDANGE_2) AND (2 <= SORTI_A))) AND (A (X ((1 <= CHOIX_1 + CHOIX_2))) OR (1 <= SORTI_A))) OR E (F (A (G ((ROUTE_B <= SUR_PONT_A))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= CHOIX_1 + CHOIX_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= CHOIX_1 + CHOIX_2))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((ROUTE_B <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (SUR_PONT_A + 1 <= ROUTE_B))))
lola: processed formula length: 52
lola: 4 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 724 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-V80P50N10-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((1 <= ROUTE_B))) 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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (1 <= ROUTE_B))) AND (ROUTE_B + 1 <= 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_A... (shortened)
lola: processed formula length: 1513
lola: 4 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 417155 markings, 1112149 edges, 3689320832170983424 markings/sec, 0 secs
lola: 808024 markings, 2237481 edges, 78174 markings/sec, 5 secs
lola: 1166368 markings, 3417514 edges, 71669 markings/sec, 10 secs
lola: 1528318 markings, 4606445 edges, 72390 markings/sec, 15 secs
lola: 1886944 markings, 5788225 edges, 71725 markings/sec, 20 secs
lola: 2251896 markings, 6994236 edges, 72990 markings/sec, 25 secs
lola: 2647617 markings, 8293242 edges, 79144 markings/sec, 30 secs
lola: 3010838 markings, 9496804 edges, 72644 markings/sec, 35 secs
lola: 3399938 markings, 10774625 edges, 77820 markings/sec, 40 secs
lola: 3770696 markings, 12000520 edges, 74152 markings/sec, 45 secs
lola: 4127899 markings, 13186377 edges, 71441 markings/sec, 50 secs
lola: 4519643 markings, 14472722 edges, 78349 markings/sec, 55 secs
lola: 4893938 markings, 15712048 edges, 74859 markings/sec, 60 secs
lola: 5265009 markings, 16944731 edges, 74214 markings/sec, 65 secs
lola: 5654340 markings, 18223577 edges, 77866 markings/sec, 70 secs
lola: 6023653 markings, 19447365 edges, 73863 markings/sec, 75 secs
lola: 6382684 markings, 20640269 edges, 71806 markings/sec, 80 secs
lola: 6760503 markings, 21883911 edges, 75564 markings/sec, 85 secs
lola: 7145010 markings, 23156167 edges, 76901 markings/sec, 90 secs
lola: 7517465 markings, 24393044 edges, 74491 markings/sec, 95 secs
lola: 7878950 markings, 25595596 edges, 72297 markings/sec, 100 secs
lola: 8273068 markings, 26889968 edges, 78824 markings/sec, 105 secs
lola: 8649456 markings, 28137873 edges, 75278 markings/sec, 110 secs
lola: 9009459 markings, 29333556 edges, 72001 markings/sec, 115 secs
lola: 9358935 markings, 30497042 edges, 69895 markings/sec, 120 secs
lola: 9731746 markings, 31721799 edges, 74562 markings/sec, 125 secs
lola: 10099481 markings, 32940445 edges, 73547 markings/sec, 130 secs
lola: 10463961 markings, 34150362 edges, 72896 markings/sec, 135 secs
lola: 10817699 markings, 35328316 edges, 70748 markings/sec, 140 secs
lola: 11178132 markings, 36524670 edges, 72087 markings/sec, 145 secs
lola: 11546435 markings, 37764769 edges, 73661 markings/sec, 150 secs
lola: 11925104 markings, 39010749 edges, 75734 markings/sec, 155 secs
lola: 12291128 markings, 40223640 edges, 73205 markings/sec, 160 secs
lola: 12647456 markings, 41407355 edges, 71266 markings/sec, 165 secs
lola: 13003533 markings, 42591799 edges, 71215 markings/sec, 170 secs
lola: 13348179 markings, 43739204 edges, 68929 markings/sec, 175 secs
lola: 13708728 markings, 44925048 edges, 72110 markings/sec, 180 secs
lola: 14081026 markings, 46158614 edges, 74460 markings/sec, 185 secs
lola: 14445638 markings, 47370245 edges, 72922 markings/sec, 190 secs
lola: 14804383 markings, 48563075 edges, 71749 markings/sec, 195 secs
lola: 15155680 markings, 49733024 edges, 70259 markings/sec, 200 secs
lola: 15499071 markings, 50871051 edges, 68678 markings/sec, 205 secs
lola: 15876553 markings, 52116892 edges, 75496 markings/sec, 210 secs
lola: 16243292 markings, 53335212 edges, 73348 markings/sec, 215 secs
lola: 16604671 markings, 54537493 edges, 72276 markings/sec, 220 secs
lola: 16960476 markings, 55722435 edges, 71161 markings/sec, 225 secs
lola: 17314046 markings, 56900961 edges, 70714 markings/sec, 230 secs
lola: 17662313 markings, 58053721 edges, 69653 markings/sec, 235 secs
lola: 18042259 markings, 59308997 edges, 75989 markings/sec, 240 secs
lola: 18410881 markings, 60534236 edges, 73724 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (F ((3 <= CONTROLEUR_1 + CONTROLEUR_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (3 <= CONTROLEUR_1 + CONTROLEUR_2))))
lola: processed formula length: 59
lola: 6 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))) OR (2 <= 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 CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))) AND (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= 1))))
lola: processed formula length: 333
lola: 4 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((3 <= VIDANGE_1 + VIDANGE_2) AND (SUR_PONT_A <= 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= VIDANGE_1 + VIDANGE_2) AND (SUR_PONT_A <= 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_... (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 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((SUR_PONT_A <= CHOIX_1 + CHOIX_2) OR (VIDANGE_1 + VIDANGE_2 <= ATTENTE_A)) AND (SORTI_B <= 0) AND (ROUTE_A + 1 <= ATTENTE_A))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((SUR_PONT_A <= CHOIX_1 + CHOIX_2) OR (VIDANGE_1 + VIDANGE_2 <= ATTENTE_A)) AND (SORTI_B <= 0) AND (ROUTE_A + 1 <= ATTENTE_A))
lola: processed formula length: 128
lola: 4 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (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_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (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_A... (shortened)
lola: processed formula length: 1606
lola: 5 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((1 <= VIDANGE_1 + VIDANGE_2))))) AND (E (F (((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_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= VIDANGE_1 + VIDANGE_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= VIDANGE_1 + VIDANGE_2))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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 + N... (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 724 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-V80P50N10-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((CHOIX_1 + CHOIX_2 <= ROUTE_B) AND (2 <= ATTENTE_A)) OR (SORTI_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((CHOIX_1 + CHOIX_2 <= ROUTE_B) AND (2 <= ATTENTE_A)) OR (SORTI_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: processed formula length: 104
lola: 1 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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 724 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-V80P50N10-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-CTLCardinality-10.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((3 <= ROUTE_B))) U (2 <= 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 CTL
lola: processed formula: E(AX((3 <= ROUTE_B)) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))
lola: processed formula length: 172
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 277192 markings, 722479 edges, 3689348869717491712 markings/sec, 0 secs
lola: 551998 markings, 1455286 edges, 54961 markings/sec, 5 secs
lola: 817824 markings, 2168173 edges, 53165 markings/sec, 10 secs
lola: 1086258 markings, 2890991 edges, 53687 markings/sec, 15 secs
lola: 1357367 markings, 3621808 edges, 54222 markings/sec, 20 secs
lola: 1621882 markings, 4336925 edges, 52903 markings/sec, 25 secs
lola: 1887649 markings, 5055040 edges, 53153 markings/sec, 30 secs
lola: 2148580 markings, 5760106 edges, 52186 markings/sec, 35 secs
lola: 2409270 markings, 6466631 edges, 52138 markings/sec, 40 secs
lola: 2647371 markings, 7187576 edges, 47620 markings/sec, 45 secs
lola: 2862256 markings, 7926691 edges, 42977 markings/sec, 50 secs
lola: 3076885 markings, 8675988 edges, 42926 markings/sec, 55 secs
lola: 3293892 markings, 9444324 edges, 43401 markings/sec, 60 secs
lola: 3507589 markings, 10200834 edges, 42739 markings/sec, 65 secs
lola: 3720421 markings, 10959425 edges, 42566 markings/sec, 70 secs
lola: 3934160 markings, 11724129 edges, 42748 markings/sec, 75 secs
lola: 4141173 markings, 12465958 edges, 41403 markings/sec, 80 secs
lola: 4349866 markings, 13212847 edges, 41739 markings/sec, 85 secs
lola: 4559025 markings, 13963939 edges, 41832 markings/sec, 90 secs
lola: 4768001 markings, 14717086 edges, 41795 markings/sec, 95 secs
lola: 4982174 markings, 15489250 edges, 42835 markings/sec, 100 secs
lola: 5195501 markings, 16257490 edges, 42665 markings/sec, 105 secs
lola: 5410102 markings, 16990050 edges, 42920 markings/sec, 110 secs
lola: 5620630 markings, 17709923 edges, 42106 markings/sec, 115 secs
lola: 5828829 markings, 18433052 edges, 41640 markings/sec, 120 secs
lola: 6037877 markings, 19167866 edges, 41810 markings/sec, 125 secs
lola: 6246901 markings, 19906130 edges, 41805 markings/sec, 130 secs
lola: 6457657 markings, 20657112 edges, 42151 markings/sec, 135 secs
lola: 6669138 markings, 21409411 edges, 42296 markings/sec, 140 secs
lola: 6882078 markings, 22167121 edges, 42588 markings/sec, 145 secs
lola: 7097541 markings, 22943347 edges, 43093 markings/sec, 150 secs
lola: 7309563 markings, 23700529 edges, 42404 markings/sec, 155 secs
lola: 7518057 markings, 24450453 edges, 41699 markings/sec, 160 secs
lola: 7726009 markings, 25199663 edges, 41590 markings/sec, 165 secs
lola: 7930107 markings, 25935525 edges, 40820 markings/sec, 170 secs
lola: 8130199 markings, 26652427 edges, 40018 markings/sec, 175 secs
lola: 8322859 markings, 27347631 edges, 38532 markings/sec, 180 secs
lola: 8522124 markings, 27998248 edges, 39853 markings/sec, 185 secs
lola: 8722225 markings, 28685398 edges, 40020 markings/sec, 190 secs
lola: 8921934 markings, 29381527 edges, 39942 markings/sec, 195 secs
lola: 9122967 markings, 30088249 edges, 40207 markings/sec, 200 secs
lola: 9326397 markings, 30803540 edges, 40686 markings/sec, 205 secs
lola: 9541767 markings, 31569678 edges, 43074 markings/sec, 210 secs
lola: 9753785 markings, 32321821 edges, 42404 markings/sec, 215 secs
lola: 9956027 markings, 33044764 edges, 40448 markings/sec, 220 secs
lola: 10156072 markings, 33758421 edges, 40009 markings/sec, 225 secs
lola: 10361775 markings, 34492534 edges, 41141 markings/sec, 230 secs
lola: 10578338 markings, 35269702 edges, 43313 markings/sec, 235 secs
lola: 10793658 markings, 36042105 edges, 43064 markings/sec, 240 secs
lola: 11010375 markings, 36822519 edges, 43343 markings/sec, 245 secs
lola: 11224983 markings, 37596613 edges, 42922 markings/sec, 250 secs
lola: 11435414 markings, 38352786 edges, 42086 markings/sec, 255 secs
lola: 11648597 markings, 39108081 edges, 42637 markings/sec, 260 secs
lola: 11855644 markings, 39787870 edges, 41409 markings/sec, 265 secs
lola: 12066248 markings, 40511715 edges, 42121 markings/sec, 270 secs
lola: 12268214 markings, 41214063 edges, 40393 markings/sec, 275 secs
lola: 12467392 markings, 41912447 edges, 39836 markings/sec, 280 secs
lola: 12669744 markings, 42626260 edges, 40470 markings/sec, 285 secs
lola: 12886041 markings, 43390670 edges, 43259 markings/sec, 290 secs
lola: 13102386 markings, 44156929 edges, 43269 markings/sec, 295 secs
lola: 13315340 markings, 44919665 edges, 42591 markings/sec, 300 secs
lola: 13525538 markings, 45668700 edges, 42040 markings/sec, 305 secs
lola: 13733694 markings, 46412334 edges, 41631 markings/sec, 310 secs
lola: 13943699 markings, 47163331 edges, 42001 markings/sec, 315 secs
lola: 14156945 markings, 47929228 edges, 42649 markings/sec, 320 secs
lola: 14363423 markings, 48670727 edges, 41296 markings/sec, 325 secs
lola: 14568445 markings, 49402995 edges, 41004 markings/sec, 330 secs
lola: 14774962 markings, 50152449 edges, 41303 markings/sec, 335 secs
lola: 14977906 markings, 50876760 edges, 40589 markings/sec, 340 secs
lola: 15192459 markings, 51652929 edges, 42911 markings/sec, 345 secs
lola: 15397764 markings, 52320937 edges, 41061 markings/sec, 350 secs
lola: 15602634 markings, 53017747 edges, 40974 markings/sec, 355 secs
lola: 15811113 markings, 53739973 edges, 41696 markings/sec, 360 secs
lola: 16023317 markings, 54481636 edges, 42441 markings/sec, 365 secs
lola: 16239057 markings, 55241247 edges, 43148 markings/sec, 370 secs
lola: 16450551 markings, 55988475 edges, 42299 markings/sec, 375 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 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((1 <= CONTROLEUR_1 + CONTROLEUR_2))) OR (3 <= SORTI_B))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (1 <= CONTROLEUR_1 + CONTROLEUR_2)) OR (3 <= SORTI_B)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((SUR_PONT_B <= VIDANGE_1 + VIDANGE_2) OR (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 + N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((SUR_PONT_B <= VIDANGE_1 + VIDANGE_2) OR (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_... (shortened)
lola: processed formula length: 1702
lola: 7 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 483110 markings, 1087579 edges, 2948995463933591552 markings/sec, 0 secs
lola: 922915 markings, 2112051 edges, 87961 markings/sec, 5 secs
lola: 1403418 markings, 3213526 edges, 96101 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: ========================================
subprocess 11 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A ((TRUE U (2 <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (2 <= CAPACITE)))))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (F ((3 <= SUR_PONT_A))) AND (SUR_PONT_B <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((3 <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (3 <= SUR_PONT_A)))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================lola:
subprocess 13 will run for 886 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F (((3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) AND (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) AND (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... (shortened)
lola: processed formula length: 1617
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((A (F ((CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2))) OR ((SORTI_A + 1 <= SORTI_B) AND ((ROUTE_B <= ATTENTE_A) OR (1 <= SORTI_A))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: processed formula length: 60
lola: 11 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 15 will run for 2657 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: A (F ((3 <= SUR_PONT_A)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= SUR_PONT_A))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: unknown yes no unknown yes no no no unknown yes yes yes no no yes no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494620512164

--------------------
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-V80P50N10"
export BK_EXAMINATION="CTLCardinality"
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-V80P50N10.tgz
mv BridgeAndVehicles-PT-V80P50N10 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-V80P50N10, examination is CTLCardinality"
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-149436126400552"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;