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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074600556
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496354264658


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 ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ 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-ReachabilityCardinality.task
lola: E (F (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + 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) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_A) AND (2 <= ATTENTE_B) AND ((ATTENTE_B <= 0) OR (CAPACITE <= SORTI_B))))) : E (F (((ROUTE_A + 1 <= SUR_PONT_B) AND (SORTI_A <= 1)))) : E (F ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + 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))) : E (F ((((2 <= ROUTE_A) OR (CHOIX_1 + CHOIX_2 <= SORTI_B) OR (CHOIX_1 + CHOIX_2 + 1 <= ATTENTE_B)) AND (ROUTE_B <= ATTENTE_B)))) : A (G ((1 <= 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))) : E (F ((CAPACITE <= SUR_PONT_B))) : E (F (((CAPACITE <= CHOIX_1 + CHOIX_2) AND ((ROUTE_A <= 0) OR (VIDANGE_1 + VIDANGE_2 <= 2))))) : E (F (((ROUTE_A <= SORTI_A) AND (1 <= CAPACITE)))) : A (G (((1 <= 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) OR (2 <= ATTENTE_B) OR ((CONTROLEUR_1 + CONTROLEUR_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) AND (CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((CONTROLEUR_1 + CONTROLEUR_2 <= 1) AND ((CHOIX_1 + CHOIX_2 <= SORTI_B) OR (ATTENTE_A <= SORTI_A)))))) : E (F (((SUR_PONT_A + 1 <= ATTENTE_A) AND (ROUTE_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (ATTENTE_A <= 2) AND (CONTROLEUR_1 + CONTROLEUR_2 <= 0)))) : E (F ((ROUTE_A <= SORTI_A))) : E (F ((2 <= CONTROLEUR_1 + CONTROLEUR_2))) : E (F ((2 <= CHOIX_1 + CHOIX_2))) : E (F ((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))) : E (F (((SUR_PONT_B <= SORTI_B) AND (3 <= SORTI_A) AND ((2 <= ROUTE_A) OR (1 <= SUR_PONT_A)) AND (3 <= CONTROLEUR_1 + CONTROLEUR_2)))) : A (G ((((VIDANGE_1 + VIDANGE_2 <= 0) AND (SORTI_B <= 2)) OR (SORTI_B <= ROUTE_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: E (F (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_A + 1 <= SUR_PONT_B) AND (SORTI_A <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 6)
lola: sara is running 0 secs || 13729 markings, 23973 edges, 2746 markings/sec, 0 secs
lola: sara is running 5 secs || 27562 markings, 47044 edges, 2767 markings/sec, 5 secs
lola: sara is running 10 secs || 42158 markings, 71340 edges, 2919 markings/sec, 10 secs
lola: sara is running 15 secs || 55928 markings, 94173 edges, 2754 markings/sec, 15 secs
lola: sara is running 20 secs || 69366 markings, 116562 edges, 2688 markings/sec, 20 secs
lola: sara is running 25 secs || 83689 markings, 141528 edges, 2865 markings/sec, 25 secs
lola: sara is running 30 secs || 99036 markings, 168787 edges, 3069 markings/sec, 30 secs
lola: sara is running 35 secs || 113851 markings, 195027 edges, 2963 markings/sec, 35 secs
lola: sara is running 40 secs || 128501 markings, 221081 edges, 2930 markings/sec, 40 secs
lola: sara is running 45 secs || 143849 markings, 248257 edges, 3070 markings/sec, 45 secs
lola: sara is running 50 secs || 159308 markings, 275681 edges, 3092 markings/sec, 50 secs
lola: sara is running 55 secs || 174592 markings, 302732 edges, 3057 markings/sec, 55 secs
lola: sara is running 60 secs || 189204 markings, 328766 edges, 2922 markings/sec, 60 secs
lola: sara is running 65 secs || 203588 markings, 354362 edges, 2877 markings/sec, 65 secs
lola: sara is running 70 secs || 217887 markings, 379601 edges, 2860 markings/sec, 70 secs
lola: sara is running 75 secs || 232136 markings, 404969 edges, 2850 markings/sec, 75 secs
lola: sara is running 80 secs || 245821 markings, 429163 edges, 2737 markings/sec, 80 secs
lola: sara is running 85 secs || 259295 markings, 453053 edges, 2695 markings/sec, 85 secs
lola: sara is running 90 secs || 272726 markings, 476865 edges, 2686 markings/sec, 90 secs
lola: sara is running 95 secs || 285697 markings, 499921 edges, 2594 markings/sec, 95 secs
lola: sara is running 100 secs || 298021 markings, 521904 edges, 2465 markings/sec, 100 secs
lola: sara is running 105 secs || 310048 markings, 543119 edges, 2405 markings/sec, 105 secs
lola: sara is running 110 secs || 322419 markings, 565090 edges, 2474 markings/sec, 110 secs
lola: sara is running 115 secs || 333813 markings, 585254 edges, 2279 markings/sec, 115 secs
lola: sara is running 120 secs || 344931 markings, 605094 edges, 2224 markings/sec, 120 secs
lola: sara is running 125 secs || 355842 markings, 624378 edges, 2182 markings/sec, 125 secs
lola: sara is running 130 secs || 366665 markings, 643617 edges, 2165 markings/sec, 130 secs
lola: sara is running 135 secs || 377229 markings, 662279 edges, 2113 markings/sec, 135 secs
lola: sara is running 140 secs || 388494 markings, 682338 edges, 2253 markings/sec, 140 secs
lola: sara is running 145 secs || 399597 markings, 702079 edges, 2221 markings/sec, 145 secs
lola: sara is running 150 secs || 410323 markings, 721070 edges, 2145 markings/sec, 150 secs
lola: sara is running 155 secs || 420229 markings, 738572 edges, 1981 markings/sec, 155 secs
lola: sara is running 160 secs || 430215 markings, 756356 edges, 1997 markings/sec, 160 secs
lola: sara is running 165 secs || 440271 markings, 774212 edges, 2011 markings/sec, 165 secs
lola: sara is running 170 secs || 450667 markings, 792679 edges, 2079 markings/sec, 170 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 240 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB... (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 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-ReachabilityCardinality-2.sara
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= ROUTE_A) OR (CHOIX_1 + CHOIX_2 <= SORTI_B) OR (CHOIX_1 + CHOIX_2 + 1 <= ATTENTE_B)) AND (ROUTE_B <= ATTENTE_B))))
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 equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= 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... (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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4.sara
lola: The predicate is invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((CAPACITE <= SUR_PONT_B)))
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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4.sara.
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-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 13426 markings, 30295 edges, 2685 markings/sec, 0 secs
lola: sara is running 5 secs || 26132 markings, 63108 edges, 2541 markings/sec, 5 secs
lola: sara is running 10 secs || 38423 markings, 95689 edges, 2458 markings/sec, 10 secs
lola: sara is running 15 secs || 50486 markings, 128023 edges, 2413 markings/sec, 15 secs
lola: sara is running 20 secs || 62775 markings, 161009 edges, 2458 markings/sec, 20 secs
lola: sara is running 25 secs || 74664 markings, 193513 edges, 2378 markings/sec, 25 secs
lola: sara is running 30 secs || 86631 markings, 225601 edges, 2393 markings/sec, 30 secs
lola: sara is running 35 secs || 98630 markings, 258356 edges, 2400 markings/sec, 35 secs
lola: sara is running 40 secs || 110477 markings, 290746 edges, 2369 markings/sec, 40 secs
lola: sara is running 45 secs || 122695 markings, 323979 edges, 2444 markings/sec, 45 secs
lola: sara is running 50 secs || 134586 markings, 356752 edges, 2378 markings/sec, 50 secs
lola: sara is running 55 secs || 146269 markings, 389078 edges, 2337 markings/sec, 55 secs
lola: sara is running 60 secs || 158709 markings, 422781 edges, 2488 markings/sec, 60 secs
lola: sara is running 65 secs || 170679 markings, 455600 edges, 2394 markings/sec, 65 secs
lola: sara is running 70 secs || 182719 markings, 489330 edges, 2408 markings/sec, 70 secs
lola: sara is running 75 secs || 194542 markings, 521487 edges, 2365 markings/sec, 75 secs
lola: sara is running 80 secs || 206835 markings, 554538 edges, 2459 markings/sec, 80 secs
lola: sara is running 85 secs || 218580 markings, 587281 edges, 2349 markings/sec, 85 secs
lola: sara is running 90 secs || 229697 markings, 619773 edges, 2223 markings/sec, 90 secs
lola: sara is running 95 secs || 240802 markings, 651914 edges, 2221 markings/sec, 95 secs
lola: sara is running 100 secs || 252077 markings, 684614 edges, 2255 markings/sec, 100 secs
lola: sara is running 105 secs || 264491 markings, 718161 edges, 2483 markings/sec, 105 secs
lola: sara is running 110 secs || 276861 markings, 752536 edges, 2474 markings/sec, 110 secs
lola: sara is running 115 secs || 288846 markings, 786173 edges, 2397 markings/sec, 115 secs
lola: sara is running 120 secs || 300494 markings, 820025 edges, 2330 markings/sec, 120 secs
lola: sara is running 125 secs || 311879 markings, 853109 edges, 2277 markings/sec, 125 secs
lola: sara is running 130 secs || 322921 markings, 884664 edges, 2208 markings/sec, 130 secs
lola: sara is running 135 secs || 335448 markings, 920324 edges, 2505 markings/sec, 135 secs
lola: sara is running 140 secs || 348247 markings, 954778 edges, 2560 markings/sec, 140 secs
lola: sara is running 145 secs || 360319 markings, 988976 edges, 2414 markings/sec, 145 secs
lola: sara is running 150 secs || 371981 markings, 1022775 edges, 2332 markings/sec, 150 secs
lola: sara is running 155 secs || 383882 markings, 1057157 edges, 2380 markings/sec, 155 secs
lola: sara is running 160 secs || 395031 markings, 1089585 edges, 2230 markings/sec, 160 secs
lola: sara is running 165 secs || 406517 markings, 1122407 edges, 2297 markings/sec, 165 secs
lola: sara is running 170 secs || 418126 markings, 1156107 edges, 2322 markings/sec, 170 secs
lola: sara is running 175 secs || 431087 markings, 1190254 edges, 2592 markings/sec, 175 secs
lola: sara is running 180 secs || 442997 markings, 1224061 edges, 2382 markings/sec, 180 secs
lola: sara is running 185 secs || 455053 markings, 1257730 edges, 2411 markings/sec, 185 secs
lola: sara is running 190 secs || 466912 markings, 1291788 edges, 2372 markings/sec, 190 secs
lola: sara is running 195 secs || 477857 markings, 1324509 edges, 2189 markings/sec, 195 secs
lola: sara is running 200 secs || 488364 markings, 1355454 edges, 2101 markings/sec, 200 secs
lola: sara is running 205 secs || 498953 markings, 1385650 edges, 2118 markings/sec, 205 secs
lola: sara is running 210 secs || 510977 markings, 1420781 edges, 2405 markings/sec, 210 secs
lola: sara is running 215 secs || 524104 markings, 1455713 edges, 2625 markings/sec, 215 secs
lola: sara is running 220 secs || 537122 markings, 1492307 edges, 2604 markings/sec, 220 secs
lola: sara is running 225 secs || 548214 markings, 1524077 edges, 2218 markings/sec, 225 secs
lola: sara is running 230 secs || 558761 markings, 1554786 edges, 2109 markings/sec, 230 secs
lola: sara is running 235 secs || 569697 markings, 1585934 edges, 2187 markings/sec, 235 secs
lola: sara is running 240 secs || 581926 markings, 1620724 edges, 2446 markings/sec, 240 secs
lola: sara is running 245 secs || 594370 markings, 1657681 edges, 2489 markings/sec, 245 secs
lola: sara is running 250 secs || 606308 markings, 1693640 edges, 2388 markings/sec, 250 secs
lola: sara is running 255 secs || 619131 markings, 1729898 edges, 2565 markings/sec, 255 secs
lola: sara is running 260 secs || 632847 markings, 1765658 edges, 2743 markings/sec, 260 secs
lola: sara is running 265 secs || 645568 markings, 1801834 edges, 2544 markings/sec, 265 secs
lola: sara is running 270 secs || 658116 markings, 1837460 edges, 2510 markings/sec, 270 secs
lola: sara is running 275 secs || 670472 markings, 1873377 edges, 2471 markings/sec, 275 secs
lola: sara is running 280 secs || 682543 markings, 1909067 edges, 2414 markings/sec, 280 secs
lola: sara is running 285 secs || 694224 markings, 1942366 edges, 2336 markings/sec, 285 secs
lola: sara is running 290 secs || 706240 markings, 1977844 edges, 2403 markings/sec, 290 secs
lola: sara is running 295 secs || 717749 markings, 2012316 edges, 2302 markings/sec, 295 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CAPACITE <= CHOIX_1 + CHOIX_2) AND ((ROUTE_A <= 0) OR (VIDANGE_1 + VIDANGE_2 <= 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 13818 markings, 31777 edges, 2764 markings/sec, 0 secs
lola: sara is running 5 secs || 26559 markings, 64882 edges, 2548 markings/sec, 5 secs
lola: sara is running 10 secs || 38932 markings, 97765 edges, 2475 markings/sec, 10 secs
lola: sara is running 15 secs || 50973 markings, 130226 edges, 2408 markings/sec, 15 secs
lola: sara is running 20 secs || 63238 markings, 163164 edges, 2453 markings/sec, 20 secs
lola: sara is running 25 secs || 75703 markings, 197549 edges, 2493 markings/sec, 25 secs
lola: sara is running 30 secs || 88113 markings, 230673 edges, 2482 markings/sec, 30 secs
lola: sara is running 35 secs || 100568 markings, 265302 edges, 2491 markings/sec, 35 secs
lola: sara is running 40 secs || 112570 markings, 297538 edges, 2400 markings/sec, 40 secs
lola: sara is running 45 secs || 124479 markings, 330109 edges, 2382 markings/sec, 45 secs
lola: sara is running 50 secs || 136530 markings, 363906 edges, 2410 markings/sec, 50 secs
lola: sara is running 55 secs || 148380 markings, 395891 edges, 2370 markings/sec, 55 secs
lola: sara is running 60 secs || 160553 markings, 429159 edges, 2435 markings/sec, 60 secs
lola: sara is running 65 secs || 173305 markings, 464625 edges, 2550 markings/sec, 65 secs
lola: sara is running 70 secs || 186172 markings, 500271 edges, 2573 markings/sec, 70 secs
lola: sara is running 75 secs || 198639 markings, 533512 edges, 2493 markings/sec, 75 secs
lola: sara is running 80 secs || 210892 markings, 567404 edges, 2451 markings/sec, 80 secs
lola: sara is running 85 secs || 222055 markings, 599736 edges, 2233 markings/sec, 85 secs
lola: sara is running 90 secs || 233666 markings, 632979 edges, 2322 markings/sec, 90 secs
lola: sara is running 95 secs || 245216 markings, 666056 edges, 2310 markings/sec, 95 secs
lola: sara is running 100 secs || 257179 markings, 700920 edges, 2393 markings/sec, 100 secs
lola: sara is running 105 secs || 269773 markings, 734646 edges, 2519 markings/sec, 105 secs
lola: sara is running 110 secs || 281614 markings, 767758 edges, 2368 markings/sec, 110 secs
lola: sara is running 115 secs || 292742 markings, 800284 edges, 2226 markings/sec, 115 secs
lola: sara is running 120 secs || 304342 markings, 833629 edges, 2320 markings/sec, 120 secs
lola: sara is running 125 secs || 316030 markings, 867510 edges, 2338 markings/sec, 125 secs
lola: sara is running 130 secs || 327125 markings, 899898 edges, 2219 markings/sec, 130 secs
lola: sara is running 135 secs || 338411 markings, 930815 edges, 2257 markings/sec, 135 secs
lola: sara is running 140 secs || 351199 markings, 965264 edges, 2558 markings/sec, 140 secs
lola: sara is running 145 secs || 362352 markings, 997753 edges, 2231 markings/sec, 145 secs
lola: sara is running 150 secs || 372871 markings, 1028052 edges, 2104 markings/sec, 150 secs
lola: sara is running 155 secs || 383382 markings, 1058516 edges, 2102 markings/sec, 155 secs
lola: sara is running 160 secs || 394395 markings, 1090129 edges, 2203 markings/sec, 160 secs
lola: sara is running 165 secs || 405780 markings, 1122300 edges, 2277 markings/sec, 165 secs
lola: sara is running 170 secs || 417046 markings, 1156058 edges, 2253 markings/sec, 170 secs
lola: sara is running 175 secs || 428576 markings, 1186602 edges, 2306 markings/sec, 175 secs
lola: sara is running 180 secs || 440716 markings, 1220714 edges, 2428 markings/sec, 180 secs
lola: sara is running 185 secs || 452091 markings, 1253314 edges, 2275 markings/sec, 185 secs
lola: sara is running 190 secs || 462989 markings, 1284825 edges, 2180 markings/sec, 190 secs
lola: sara is running 195 secs || 473671 markings, 1315980 edges, 2136 markings/sec, 195 secs
lola: sara is running 200 secs || 484841 markings, 1347832 edges, 2234 markings/sec, 200 secs
lola: sara is running 205 secs || 495774 markings, 1378693 edges, 2187 markings/sec, 205 secs
lola: sara is running 210 secs || 506073 markings, 1410533 edges, 2060 markings/sec, 210 secs
lola: sara is running 215 secs || 517565 markings, 1441566 edges, 2298 markings/sec, 215 secs
lola: sara is running 220 secs || 529791 markings, 1475123 edges, 2445 markings/sec, 220 secs
lola: sara is running 225 secs || 542045 markings, 1508824 edges, 2451 markings/sec, 225 secs
lola: sara is running 230 secs || 553310 markings, 1540957 edges, 2253 markings/sec, 230 secs
lola: sara is running 235 secs || 564280 markings, 1573077 edges, 2194 markings/sec, 235 secs
lola: sara is running 240 secs || 575461 markings, 1606823 edges, 2236 markings/sec, 240 secs
lola: sara is running 245 secs || 586341 markings, 1638315 edges, 2176 markings/sec, 245 secs
lola: sara is running 250 secs || 597774 markings, 1670468 edges, 2287 markings/sec, 250 secs
lola: sara is running 255 secs || 608668 markings, 1704166 edges, 2179 markings/sec, 255 secs
lola: sara is running 260 secs || 620357 markings, 1736056 edges, 2338 markings/sec, 260 secs
lola: sara is running 265 secs || 632860 markings, 1769411 edges, 2501 markings/sec, 265 secs
lola: sara is running 270 secs || 644377 markings, 1802493 edges, 2303 markings/sec, 270 secs
lola: sara is running 275 secs || 656141 markings, 1836356 edges, 2353 markings/sec, 275 secs
lola: sara is running 280 secs || 667719 markings, 1869970 edges, 2316 markings/sec, 280 secs
lola: sara is running 285 secs || 679138 markings, 1902649 edges, 2284 markings/sec, 285 secs
lola: sara is running 290 secs || 690790 markings, 1934979 edges, 2330 markings/sec, 290 secs
lola: sara is running 295 secs || 702411 markings, 1971320 edges, 2324 markings/sec, 295 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_A <= SORTI_A) AND (1 <= CAPACITE))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= 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_ATTENT... (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: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8.sara
lola: subprocess 9 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SUR_PONT_A + 1 <= ATTENTE_A) AND (ROUTE_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (ATTENTE_A <= 2) AND (CONTROLEUR_1 + CONTROLEUR_2 <= 0))))
lola: ========================================lola: state equation: calling and running sara
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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_A <= SORTI_A)))
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-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CHOIX_1 + CHOIX_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 916 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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... (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 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-ReachabilityCardinality-13.sara
lola: lola: state equation: calling and running saralola:
========================================subprocess 14 will run for 1375 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: E (F (((SUR_PONT_B <= SORTI_B) AND (3 <= SORTI_A) AND ((2 <= ROUTE_A) OR (1 <= SUR_PONT_A)) AND (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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2749 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((VIDANGE_1 + VIDANGE_2 <= 0) AND (SORTI_B <= 2)) OR (SORTI_B <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: yes yes no yes yes unknown unknown yes yes no yes no no no no no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496355055680

--------------------
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="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-149441074600556"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;