Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_BridgeAndVehicles-PT-V80P50N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074600552
=====================================================================

--------------------
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 1496354168667


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


checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-PT-V80P50N10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_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: 436757 markings, 1167902 edges, 3689348869717491712 markings/sec, 0 secs
lola: 825345 markings, 2300247 edges, 77718 markings/sec, 5 secs
lola: 1181792 markings, 3477464 edges, 71289 markings/sec, 10 secs
lola: 1528504 markings, 4618182 edges, 69342 markings/sec, 15 secs
lola: 1905564 markings, 5862624 edges, 75412 markings/sec, 20 secs
lola: 2271307 markings, 7073112 edges, 73149 markings/sec, 25 secs
lola: 2658701 markings, 8348891 edges, 77479 markings/sec, 30 secs
lola: 3009858 markings, 9514002 edges, 70231 markings/sec, 35 secs
lola: 3389623 markings, 10765261 edges, 75953 markings/sec, 40 secs
lola: 3762552 markings, 12000247 edges, 74586 markings/sec, 45 secs
lola: 4127816 markings, 13214563 edges, 73053 markings/sec, 50 secs
lola: 4516978 markings, 14497058 edges, 77832 markings/sec, 55 secs
lola: 4892809 markings, 15743744 edges, 75166 markings/sec, 60 secs
lola: 5242448 markings, 16906623 edges, 69928 markings/sec, 65 secs
lola: 5613916 markings, 18131848 edges, 74294 markings/sec, 70 secs
lola: 5967081 markings, 19303534 edges, 70633 markings/sec, 75 secs
lola: 6312051 markings, 20450799 edges, 68994 markings/sec, 80 secs
lola: 6667090 markings, 21626804 edges, 71008 markings/sec, 85 secs
lola: 7031780 markings, 22833662 edges, 72938 markings/sec, 90 secs
lola: 7381728 markings, 23996632 edges, 69990 markings/sec, 95 secs
lola: 7730029 markings, 25155755 edges, 69660 markings/sec, 100 secs
lola: 8097806 markings, 26373088 edges, 73555 markings/sec, 105 secs
lola: 8473390 markings, 27617982 edges, 75117 markings/sec, 110 secs
lola: 8821506 markings, 28774696 edges, 69623 markings/sec, 115 secs
lola: 9163814 markings, 29914754 edges, 68462 markings/sec, 120 secs
lola: 9503914 markings, 31043876 edges, 68020 markings/sec, 125 secs
lola: 9860763 markings, 32223985 edges, 71370 markings/sec, 130 secs
lola: 10210735 markings, 33387221 edges, 69994 markings/sec, 135 secs
lola: 10571902 markings, 34589282 edges, 72233 markings/sec, 140 secs
lola: 10929298 markings, 35779279 edges, 71479 markings/sec, 145 secs
lola: 11296586 markings, 37004774 edges, 73458 markings/sec, 150 secs
lola: 11664888 markings, 38246605 edges, 73660 markings/sec, 155 secs
lola: 12049435 markings, 39515697 edges, 76909 markings/sec, 160 secs
lola: 12424086 markings, 40759792 edges, 74930 markings/sec, 165 secs
lola: 12790404 markings, 41979873 edges, 73264 markings/sec, 170 secs
lola: 13150314 markings, 43179087 edges, 71982 markings/sec, 175 secs
lola: 13504758 markings, 44360753 edges, 70889 markings/sec, 180 secs
lola: 13856649 markings, 45522329 edges, 70378 markings/sec, 185 secs
lola: 14210947 markings, 46700265 edges, 70860 markings/sec, 190 secs
lola: 14564190 markings, 47875560 edges, 70649 markings/sec, 195 secs
lola: 14919036 markings, 49058797 edges, 70969 markings/sec, 200 secs
lola: 15260443 markings, 50196593 edges, 68281 markings/sec, 205 secs
lola: 15596731 markings, 51314922 edges, 67258 markings/sec, 210 secs
lola: 15956273 markings, 52506218 edges, 71908 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2.sara
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: state equation: calling and running sara
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
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2.sara.
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).
sara: place or transition ordering is non-deterministic

lola: 412881 markings, 1100678 edges, 3689320832170983424 markings/sec, 0 secs
lola: 798141 markings, 2205135 edges, 77052 markings/sec, 5 secs
lola: 1152712 markings, 3372927 edges, 70914 markings/sec, 10 secs
lola: 1520190 markings, 4579814 edges, 73496 markings/sec, 15 secs
lola: 1890261 markings, 5798855 edges, 74014 markings/sec, 20 secs
lola: 2241779 markings, 6961995 edges, 70304 markings/sec, 25 secs
lola: 2605760 markings, 8154950 edges, 72796 markings/sec, 30 secs
lola: 2950077 markings, 9295058 edges, 68863 markings/sec, 35 secs
lola: 3302895 markings, 10455641 edges, 70564 markings/sec, 40 secs
lola: 3674645 markings, 11682885 edges, 74350 markings/sec, 45 secs
lola: 4028027 markings, 12854386 edges, 70676 markings/sec, 50 secs
lola: 4408532 markings, 14105575 edges, 76101 markings/sec, 55 secs
lola: 4782622 markings, 15343325 edges, 74818 markings/sec, 60 secs
lola: 5144784 markings, 16545175 edges, 72432 markings/sec, 65 secs
lola: 5524243 markings, 17794129 edges, 75892 markings/sec, 70 secs
lola: 5891445 markings, 19008943 edges, 73440 markings/sec, 75 secs
lola: 6249856 markings, 20198251 edges, 71682 markings/sec, 80 secs
lola: 6617059 markings, 21412046 edges, 73441 markings/sec, 85 secs
lola: 6992009 markings, 22649213 edges, 74990 markings/sec, 90 secs
lola: 7346599 markings, 23825223 edges, 70918 markings/sec, 95 secs
lola: 7690906 markings, 24969890 edges, 68861 markings/sec, 100 secs
lola: 8048043 markings, 26147138 edges, 71427 markings/sec, 105 secs
lola: 8417899 markings, 27369952 edges, 73971 markings/sec, 110 secs
lola: 8767969 markings, 28531346 edges, 70014 markings/sec, 115 secs
lola: 9123381 markings, 29713649 edges, 71082 markings/sec, 120 secs
lola: 9483202 markings, 30902090 edges, 71964 markings/sec, 125 secs
lola: 9845095 markings, 32096502 edges, 72379 markings/sec, 130 secs
lola: 10200256 markings, 33275430 edges, 71032 markings/sec, 135 secs
lola: 10557100 markings, 34460294 edges, 71369 markings/sec, 140 secs
lola: 10907956 markings, 35628434 edges, 70171 markings/sec, 145 secs
lola: 11259434 markings, 36798353 edges, 70296 markings/sec, 150 secs
lola: 11613248 markings, 37985422 edges, 70763 markings/sec, 155 secs
lola: 11981398 markings, 39196860 edges, 73630 markings/sec, 160 secs
lola: 12336134 markings, 40372817 edges, 70947 markings/sec, 165 secs
lola: 12690745 markings, 41551245 edges, 70922 markings/sec, 170 secs
lola: 13038978 markings, 42710107 edges, 69647 markings/sec, 175 secs
lola: 13390785 markings, 43881097 edges, 70361 markings/sec, 180 secs
lola: 13757470 markings, 45085756 edges, 73337 markings/sec, 185 secs
lola: 14122902 markings, 46297717 edges, 73086 markings/sec, 190 secs
lola: 14481260 markings, 47488692 edges, 71672 markings/sec, 195 secs
lola: 14837581 markings, 48674441 edges, 71264 markings/sec, 200 secs
lola: 15185769 markings, 49834286 edges, 69638 markings/sec, 205 secs
lola: 15536459 markings, 50993729 edges, 70138 markings/sec, 210 secs
lola: 15928131 markings, 52288466 edges, 78334 markings/sec, 215 secs
lola: 16300990 markings, 53526583 edges, 74572 markings/sec, 220 secs
lola: 16657844 markings, 54714534 edges, 71371 markings/sec, 225 secs
lola: 17016248 markings, 55907675 edges, 71681 markings/sec, 230 secs
lola: 17360128 markings, 57054587 edges, 68776 markings/sec, 235 secs
lola: 17714567 markings, 58225826 edges, 70888 markings/sec, 240 secs
lola: 18077627 markings, 59426846 edges, 72612 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: The predicate is not invariant.
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: 259277 markings, 675007 edges, 3689348869717491712 markings/sec, 0 secs
lola: 519936 markings, 1369613 edges, 52132 markings/sec, 5 secs
lola: 789160 markings, 2091788 edges, 53845 markings/sec, 10 secs
lola: 1050092 markings, 2794063 edges, 52186 markings/sec, 15 secs
lola: 1294860 markings, 3453537 edges, 48954 markings/sec, 20 secs
lola: 1538297 markings, 4110242 edges, 48687 markings/sec, 25 secs
lola: 1783888 markings, 4773873 edges, 49118 markings/sec, 30 secs
lola: 2036459 markings, 5456742 edges, 50514 markings/sec, 35 secs
lola: 2293458 markings, 6153415 edges, 51400 markings/sec, 40 secs
lola: 2544761 markings, 6847405 edges, 50261 markings/sec, 45 secs
lola: 2751147 markings, 7542210 edges, 41277 markings/sec, 50 secs
lola: 2960505 markings, 8268222 edges, 41872 markings/sec, 55 secs
lola: 3170698 markings, 9007641 edges, 42039 markings/sec, 60 secs
lola: 3383331 markings, 9760780 edges, 42527 markings/sec, 65 secs
lola: 3596210 markings, 10516184 edges, 42576 markings/sec, 70 secs
lola: 3810464 markings, 11280266 edges, 42851 markings/sec, 75 secs
lola: 4021605 markings, 12033744 edges, 42228 markings/sec, 80 secs
lola: 4238838 markings, 12816114 edges, 43447 markings/sec, 85 secs
lola: 4450613 markings, 13573953 edges, 42355 markings/sec, 90 secs
lola: 4663520 markings, 14340604 edges, 42581 markings/sec, 95 secs
lola: 4866899 markings, 15072206 edges, 40676 markings/sec, 100 secs
lola: 5078779 markings, 15835273 edges, 42376 markings/sec, 105 secs
lola: 5295276 markings, 16618726 edges, 43299 markings/sec, 110 secs
lola: 5506182 markings, 17314863 edges, 42181 markings/sec, 115 secs
lola: 5717750 markings, 18047696 edges, 42314 markings/sec, 120 secs
lola: 5932254 markings, 18795416 edges, 42901 markings/sec, 125 secs
lola: 6146590 markings, 19552595 edges, 42867 markings/sec, 130 secs
lola: 6360233 markings, 20306864 edges, 42729 markings/sec, 135 secs
lola: 6574726 markings, 21071547 edges, 42899 markings/sec, 140 secs
lola: 6788694 markings, 21835868 edges, 42794 markings/sec, 145 secs
lola: 7003203 markings, 22603782 edges, 42902 markings/sec, 150 secs
lola: 7213552 markings, 23353911 edges, 42070 markings/sec, 155 secs
lola: 7424775 markings, 24111830 edges, 42245 markings/sec, 160 secs
lola: 7638698 markings, 24882341 edges, 42785 markings/sec, 165 secs
lola: 7853614 markings, 25657328 edges, 42983 markings/sec, 170 secs
lola: 8066431 markings, 26425664 edges, 42563 markings/sec, 175 secs
lola: 8277217 markings, 27185821 edges, 42157 markings/sec, 180 secs
lola: 8487448 markings, 27881570 edges, 42046 markings/sec, 185 secs
lola: 8694222 markings, 28588913 edges, 41355 markings/sec, 190 secs
lola: 8906673 markings, 29326376 edges, 42490 markings/sec, 195 secs
lola: 9116174 markings, 30064175 edges, 41900 markings/sec, 200 secs
lola: 9323995 markings, 30794454 edges, 41564 markings/sec, 205 secs
lola: 9534950 markings, 31543813 edges, 42191 markings/sec, 210 secs
lola: 9750125 markings, 32307964 edges, 43035 markings/sec, 215 secs
lola: 9958283 markings, 33052715 edges, 41632 markings/sec, 220 secs
lola: 10163062 markings, 33780492 edges, 40956 markings/sec, 225 secs
lola: 10375106 markings, 34541756 edges, 42409 markings/sec, 230 secs
lola: 10583980 markings, 35289505 edges, 41775 markings/sec, 235 secs
lola: 10784745 markings, 36008333 edges, 40153 markings/sec, 240 secs
lola: 10988757 markings, 36746409 edges, 40802 markings/sec, 245 secs
lola: 11185922 markings, 37455680 edges, 39433 markings/sec, 250 secs
lola: 11383050 markings, 38160370 edges, 39426 markings/sec, 255 secs
lola: 11591452 markings, 38918672 edges, 41680 markings/sec, 260 secs
lola: 11801724 markings, 39605477 edges, 42054 markings/sec, 265 secs
lola: 12014398 markings, 40333142 edges, 42535 markings/sec, 270 secs
lola: 12230628 markings, 41083123 edges, 43246 markings/sec, 275 secs
lola: 12444914 markings, 41833550 edges, 42857 markings/sec, 280 secs
lola: 12663875 markings, 42606156 edges, 43792 markings/sec, 285 secs
lola: 12871699 markings, 43339294 edges, 41565 markings/sec, 290 secs
lola: 13082968 markings, 44090795 edges, 42254 markings/sec, 295 secs
lola: 13290914 markings, 44830007 edges, 41589 markings/sec, 300 secs
lola: 13506425 markings, 45601164 edges, 43102 markings/sec, 305 secs
lola: 13713695 markings, 46340712 edges, 41454 markings/sec, 310 secs
lola: 13924490 markings, 47094530 edges, 42159 markings/sec, 315 secs
lola: 14136334 markings, 47855870 edges, 42369 markings/sec, 320 secs
lola: 14346097 markings, 48606786 edges, 41953 markings/sec, 325 secs
lola: 14557256 markings, 49367118 edges, 42232 markings/sec, 330 secs
lola: 14766115 markings, 50118872 edges, 41772 markings/sec, 335 secs
lola: 14973044 markings, 50858334 edges, 41386 markings/sec, 340 secs
lola: 15185811 markings, 51631909 edges, 42553 markings/sec, 345 secs
lola: 15388842 markings, 52290735 edges, 40606 markings/sec, 350 secs
lola: 15596952 markings, 52997747 edges, 41622 markings/sec, 355 secs
lola: 15809224 markings, 53734363 edges, 42454 markings/sec, 360 secs
lola: 16022863 markings, 54479881 edges, 42728 markings/sec, 365 secs
lola: 16238723 markings, 55240003 edges, 43172 markings/sec, 370 secs
lola: 16443133 markings, 55961683 edges, 40882 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: 473821 markings, 1067563 edges, 2948995463933591552 markings/sec, 0 secs
lola: 890247 markings, 2036506 edges, 83285 markings/sec, 5 secs
lola: 1361041 markings, 3117209 edges, 94159 markings/sec, 10 secs
lola: 1841704 markings, 4202929 edges, 96133 markings/sec, 15 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: SUBRESULT
lola: lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 885 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 1328 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 1328 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2656 seconds at most (--localtimelimit=-1)
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 1496355052215

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_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/S_BridgeAndVehicles-PT-V80P50N10.tgz
mv S_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 S_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 r088-csrt-149441074600552"
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 ;