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)
.....................
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 477K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 100K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 261K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 593K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BridgeAndVehicles-PT-V80P50N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308500390
=====================================================================

--------------------
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-PT-V80P50N50-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526774029479


BK_STOP 1526775365358

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V80P50N50 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 94116, 'Memory': 462.8, 'Tool': 'lola'}, {'Time': 95265, 'Memory': 457.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-PT-V80P50N50...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V80P50N50: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V80P50N50 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 8816/65536 symbol table entries, 2413 collisions
lola: preprocessing...
lola: finding significant places
lola: 228 places, 8588 transitions, 221 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9173 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.task
lola: A (G (((SORTI_B + 1 <= ROUTE_B) OR (SUR_PONT_B + 1 <= CHOIX_1 + CHOIX_2)))) : A (G ((((ROUTE_A + 1 <= ROUTE_B) AND (SORTI_B + 1 <= CAPACITE)) OR (CAPACITE <= ROUTE_B)))) : A (G (((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 <= CONTROLEUR_1 + CONTROLEUR_2) OR (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SUR_PONT_A) OR (ATTENTE_B <= SUR_PONT_B) OR (SUR_PONT_A <= SUR_PONT_B)))) : A (G (TRUE)) : A (G (((SORTI_A + 1 <= SORTI_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 <= 2) OR (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 <= 0) OR ((CONTROLEUR_1 + CONTROLEUR_2 <= VIDANGE_1 + VIDANGE_2) AND (3 <= ATTENTE_B))))) : E (F ((2 <= CHOIX_1 + CHOIX_2))) : E (F (((2 <= ATTENTE_A) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2) AND (2 <= SORTI_B) AND (2 <= ROUTE_A)))) : E (F ((ROUTE_A <= 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 (((NB_ATTENTE_B_70 + 1 <= NB_ATTENTE_A_32) AND (NB_ATTENTE_A_28 + 1 <= NB_ATTENTE_A_37) AND (NB_ATTENTE_B_11 <= 2)))) : E (F ((COMPTEUR_50 + 1 <= NB_ATTENTE_A_56))) : E (F (((NB_ATTENTE_A_33 + 1 <= NB_ATTENTE_B_68) AND (NB_ATTENTE_B_28 + 1 <= NB_ATTENTE_B_32) AND (NB_ATTENTE_B_20 <= NB_ATTENTE_A_51)))) : E (F (((NB_ATTENTE_B_17 <= 2) AND (NB_ATTENTE_B_14 <= COMPTEUR_32) AND (3 <= NB_ATTENTE_B_62)))) : E (F ((1 <= NB_ATTENTE_B_70))) : E (F ((((NB_ATTENTE_A_59 <= COMPTEUR_43) OR (1 <= NB_ATTENTE_B_61) OR ((1 <= COMPTEUR_14) AND (NB_ATTENTE_B_42 <= NB_ATTENTE_B_70))) AND (NB_ATTENTE_A_36 + 1 <= NB_ATTENTE_A_68)))) : A (G ((NB_ATTENTE_B_57 <= NB_ATTENTE_A_57))) : A (G (((1 <= NB_ATTENTE_B_13) OR (2 <= NB_ATTENTE_A_53) OR (3 <= COMPTEUR_15) OR (NB_ATTENTE_A_63 <= NB_ATTENTE_B_57))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SORTI_B + 1 <= ROUTE_B) OR (SUR_PONT_B + 1 <= CHOIX_1 + CHOIX_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 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-PT-V80P50N50-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 82 markings, 81 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((ROUTE_A + 1 <= ROUTE_B) AND (SORTI_B + 1 <= CAPACITE)) OR (CAPACITE <= ROUTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 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-PT-V80P50N50-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((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 invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 570 markings, 569 edges, 114 markings/sec, 0 secs
lola: sara is running 5 secs || 894 markings, 1181 edges, 65 markings/sec, 5 secs
lola: sara is running 10 secs || 1157 markings, 1769 edges, 53 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1394 markings, 2312 edges, 47 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 228 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SORTI_A + 1 <= SORTI_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_... (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 884 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 319 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 884 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-PT-V80P50N50-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 775 markings, 898 edges, 155 markings/sec, 0 secs
lola: sara is running 5 secs || 1109 markings, 1645 edges, 67 markings/sec, 5 secs
lola: sara is running 10 secs || 1484 markings, 2467 edges, 75 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1804 markings, 3212 edges, 64 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= ATTENTE_A) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2) AND (2 <= SORTI_B) AND (2 <= ROUTE_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 884 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 1243 markings, 1270 edges, 249 markings/sec, 0 secs
lola: sara is running 5 secs || 1912 markings, 2283 edges, 134 markings/sec, 5 secs
lola: sara is running 10 secs || 2459 markings, 3208 edges, 109 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 3062 markings, 4236 edges, 121 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_A <= 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_A... (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 884 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-PT-V80P50N50-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_B_70 + 1 <= NB_ATTENTE_A_32) AND (NB_ATTENTE_A_28 + 1 <= NB_ATTENTE_A_37) AND (NB_ATTENTE_B_11 <= 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 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 1908 markings, 2397 edges, 382 markings/sec, 0 secs
lola: sara is running 5 secs || 6823 markings, 10479 edges, 983 markings/sec, 5 secs
lola: sara is running 10 secs || 11783 markings, 18749 edges, 992 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 16729 markings, 27110 edges, 989 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((COMPTEUR_50 + 1 <= NB_ATTENTE_A_56)))
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 884 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: ========================================
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-PT-V80P50N50-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 708 markings, 707 edges, 142 markings/sec, 0 secs
lola: sara is running 5 secs || 1057 markings, 1401 edges, 70 markings/sec, 5 secs
lola: sara is running 10 secs || 1367 markings, 2112 edges, 62 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1681 markings, 2803 edges, 63 markings/sec, 15 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_A_33 + 1 <= NB_ATTENTE_B_68) AND (NB_ATTENTE_B_28 + 1 <= NB_ATTENTE_B_32) AND (NB_ATTENTE_B_20 <= NB_ATTENTE_A_51))))
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 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 355 markings, 364 edges, 71 markings/sec, 0 secs
lola: sara is running 5 secs || 826 markings, 1018 edges, 94 markings/sec, 5 secs
lola: sara is running 10 secs || 1234 markings, 1697 edges, 82 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1642 markings, 2377 edges, 82 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 681 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_B_17 <= 2) AND (NB_ATTENTE_B_14 <= COMPTEUR_32) AND (3 <= NB_ATTENTE_B_62))))
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 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 481 markings, 496 edges, 96 markings/sec, 0 secs
lola: sara is running 5 secs || 920 markings, 1191 edges, 88 markings/sec, 5 secs
lola: sara is running 10 secs || 1340 markings, 1891 edges, 84 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1760 markings, 2591 edges, 84 markings/sec, 15 secs
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 846 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= NB_ATTENTE_B_70)))
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 884 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-PT-V80P50N50-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 75 markings, 74 edges
lola: ========================================
lola: subprocess 13 will run for 1127 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NB_ATTENTE_A_59 <= COMPTEUR_43) OR (1 <= NB_ATTENTE_B_61) OR ((1 <= COMPTEUR_14) AND (NB_ATTENTE_B_42 <= NB_ATTENTE_B_70))) AND (NB_ATTENTE_A_36 + 1 <= NB_ATTENTE_A_68))))
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 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 426 markings, 498 edges, 85 markings/sec, 0 secs
lola: sara is running 5 secs || 686 markings, 888 edges, 52 markings/sec, 5 secs
lola: sara is running 10 secs || 948 markings, 1281 edges, 52 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 1350 markings, 1984 edges, 80 markings/sec, 15 secs
lola: sara is running 20 secs || 1598 markings, 2604 edges, 50 markings/sec, 20 secs
lola: sara is running 25 secs || 1848 markings, 3229 edges, 50 markings/sec, 25 secs
lola: sara is running 30 secs || 2107 markings, 3883 edges, 52 markings/sec, 30 secs
lola: sara is running 35 secs || 6338 markings, 10166 edges, 846 markings/sec, 35 secs
lola: sara is running 40 secs || 11757 markings, 19214 edges, 1084 markings/sec, 40 secs
lola: sara is running 45 secs || 17182 markings, 28340 edges, 1085 markings/sec, 45 secs
lola: sara is running 50 secs || 22607 markings, 37480 edges, 1085 markings/sec, 50 secs
lola: sara is running 55 secs || 28022 markings, 45919 edges, 1083 markings/sec, 55 secs
lola: sara is running 60 secs || 33453 markings, 54830 edges, 1086 markings/sec, 60 secs
lola: sara is running 65 secs || 38886 markings, 63853 edges, 1087 markings/sec, 65 secs
lola: sara is running 70 secs || 44315 markings, 72888 edges, 1086 markings/sec, 70 secs
lola: sara is running 75 secs || 49733 markings, 82020 edges, 1084 markings/sec, 75 secs
lola: sara is running 80 secs || 55128 markings, 91196 edges, 1079 markings/sec, 80 secs
lola: sara is running 85 secs || 60419 markings, 100063 edges, 1058 markings/sec, 85 secs
lola: sara is running 90 secs || 65838 markings, 109345 edges, 1084 markings/sec, 90 secs
lola: sara is running 95 secs || 71253 markings, 118401 edges, 1083 markings/sec, 95 secs
lola: sara is running 100 secs || 76665 markings, 127661 edges, 1082 markings/sec, 100 secs
lola: sara is running 105 secs || 82086 markings, 136931 edges, 1084 markings/sec, 105 secs
lola: sara is running 110 secs || 87504 markings, 146190 edges, 1084 markings/sec, 110 secs
lola: sara is running 115 secs || 92904 markings, 155414 edges, 1080 markings/sec, 115 secs
lola: sara is running 120 secs || 98326 markings, 164673 edges, 1084 markings/sec, 120 secs
lola: sara is running 125 secs || 103746 markings, 173924 edges, 1084 markings/sec, 125 secs
lola: sara is running 130 secs || 109175 markings, 183186 edges, 1086 markings/sec, 130 secs
lola: sara is running 135 secs || 114624 markings, 192480 edges, 1090 markings/sec, 135 secs
lola: sara is running 140 secs || 120055 markings, 201738 edges, 1086 markings/sec, 140 secs
lola: sara is running 145 secs || 125502 markings, 211021 edges, 1089 markings/sec, 145 secs
lola: sara is running 150 secs || 130950 markings, 220491 edges, 1090 markings/sec, 150 secs
lola: sara is running 155 secs || 136404 markings, 229845 edges, 1091 markings/sec, 155 secs
lola: sara is running 160 secs || 141859 markings, 239133 edges, 1091 markings/sec, 160 secs
lola: sara is running 165 secs || 147316 markings, 248421 edges, 1091 markings/sec, 165 secs
lola: sara is running 170 secs || 152762 markings, 257847 edges, 1089 markings/sec, 170 secs
lola: sara is running 175 secs || 158206 markings, 267213 edges, 1089 markings/sec, 175 secs
lola: sara is running 180 secs || 163516 markings, 276235 edges, 1062 markings/sec, 180 secs
lola: sara is running 185 secs || 168965 markings, 285551 edges, 1090 markings/sec, 185 secs
lola: sara is running 190 secs || 174344 markings, 294910 edges, 1076 markings/sec, 190 secs
lola: sara is running 195 secs || 179732 markings, 304061 edges, 1078 markings/sec, 195 secs
lola: sara is running 200 secs || 185074 markings, 313410 edges, 1068 markings/sec, 200 secs
lola: sara is running 205 secs || 190464 markings, 322560 edges, 1078 markings/sec, 205 secs
lola: sara is running 210 secs || 195896 markings, 331780 edges, 1086 markings/sec, 210 secs
lola: sara is running 215 secs || 201278 markings, 341199 edges, 1076 markings/sec, 215 secs
lola: sara is running 220 secs || 206748 markings, 350481 edges, 1094 markings/sec, 220 secs
lola: sara is running 225 secs || 212218 markings, 360054 edges, 1094 markings/sec, 225 secs
lola: sara is running 230 secs || 217687 markings, 369330 edges, 1094 markings/sec, 230 secs
lola: sara is running 235 secs || 223019 markings, 378588 edges, 1066 markings/sec, 235 secs
lola: sara is running 240 secs || 228481 markings, 387921 edges, 1092 markings/sec, 240 secs
lola: sara is running 245 secs || 233886 markings, 397047 edges, 1081 markings/sec, 245 secs
lola: sara is running 250 secs || 239332 markings, 406609 edges, 1089 markings/sec, 250 secs
lola: sara is running 255 secs || 244799 markings, 415870 edges, 1093 markings/sec, 255 secs
lola: sara is running 260 secs || 250244 markings, 425399 edges, 1089 markings/sec, 260 secs
lola: sara is running 265 secs || 255709 markings, 434652 edges, 1093 markings/sec, 265 secs
lola: sara is running 270 secs || 261091 markings, 444071 edges, 1076 markings/sec, 270 secs
lola: sara is running 275 secs || 266559 markings, 453326 edges, 1094 markings/sec, 275 secs
lola: sara is running 280 secs || 272014 markings, 462873 edges, 1091 markings/sec, 280 secs
lola: sara is running 285 secs || 277489 markings, 472015 edges, 1095 markings/sec, 285 secs
lola: sara is running 290 secs || 282958 markings, 478271 edges, 1094 markings/sec, 290 secs
lola: sara is running 295 secs || 286996 markings, 486248 edges, 808 markings/sec, 295 secs
lola: sara is running 300 secs || 287702 markings, 487307 edges, 141 markings/sec, 300 secs
lola: sara is running 305 secs || 288304 markings, 488210 edges, 120 markings/sec, 305 secs
lola: sara is running 310 secs || 291581 markings, 492915 edges, 655 markings/sec, 310 secs
lola: sara is running 315 secs || 297023 markings, 501967 edges, 1088 markings/sec, 315 secs
lola: sara is running 320 secs || 302307 markings, 510796 edges, 1057 markings/sec, 320 secs
lola: sara is running 325 secs || 307656 markings, 519807 edges, 1070 markings/sec, 325 secs
lola: sara is running 330 secs || 313054 markings, 528187 edges, 1080 markings/sec, 330 secs
lola: sara is running 335 secs || 318546 markings, 537206 edges, 1098 markings/sec, 335 secs
lola: sara is running 340 secs || 323951 markings, 546178 edges, 1081 markings/sec, 340 secs
lola: sara is running 345 secs || 329428 markings, 555419 edges, 1095 markings/sec, 345 secs
lola: sara is running 350 secs || 334832 markings, 564516 edges, 1081 markings/sec, 350 secs
lola: sara is running 355 secs || 340225 markings, 573577 edges, 1079 markings/sec, 355 secs
lola: sara is running 360 secs || 345700 markings, 582965 edges, 1095 markings/sec, 360 secs
lola: sara is running 365 secs || 351175 markings, 592146 edges, 1095 markings/sec, 365 secs
lola: sara is running 370 secs || 356640 markings, 601504 edges, 1093 markings/sec, 370 secs
lola: sara is running 375 secs || 362070 markings, 610797 edges, 1086 markings/sec, 375 secs
lola: sara is running 380 secs || 367476 markings, 619876 edges, 1081 markings/sec, 380 secs
lola: sara is running 385 secs || 372758 markings, 628847 edges, 1056 markings/sec, 385 secs
lola: sara is running 390 secs || 378169 markings, 638089 edges, 1082 markings/sec, 390 secs
lola: sara is running 395 secs || 383577 markings, 647323 edges, 1082 markings/sec, 395 secs
lola: sara is running 400 secs || 388983 markings, 656550 edges, 1081 markings/sec, 400 secs
lola: sara is running 405 secs || 394402 markings, 665796 edges, 1084 markings/sec, 405 secs
lola: sara is running 410 secs || 399834 markings, 675253 edges, 1086 markings/sec, 410 secs
lola: sara is running 415 secs || 405185 markings, 684423 edges, 1070 markings/sec, 415 secs
lola: sara is running 420 secs || 410597 markings, 693648 edges, 1082 markings/sec, 420 secs
lola: sara is running 425 secs || 416063 markings, 702964 edges, 1093 markings/sec, 425 secs
lola: sara is running 430 secs || 421540 markings, 712295 edges, 1095 markings/sec, 430 secs
lola: sara is running 435 secs || 427018 markings, 721689 edges, 1096 markings/sec, 435 secs
lola: sara is running 440 secs || 432458 markings, 731144 edges, 1088 markings/sec, 440 secs
lola: sara is running 445 secs || 437900 markings, 740405 edges, 1088 markings/sec, 445 secs
lola: sara is running 450 secs || 443356 markings, 749687 edges, 1091 markings/sec, 450 secs
lola: sara is running 455 secs || 448774 markings, 759169 edges, 1084 markings/sec, 455 secs
lola: sara is running 460 secs || 454169 markings, 768339 edges, 1079 markings/sec, 460 secs
lola: sara is running 465 secs || 459564 markings, 777507 edges, 1079 markings/sec, 465 secs
lola: sara is running 470 secs || 464971 markings, 786969 edges, 1081 markings/sec, 470 secs
lola: sara is running 475 secs || 470402 markings, 796196 edges, 1086 markings/sec, 475 secs
lola: sara is running 480 secs || 475827 markings, 805407 edges, 1085 markings/sec, 480 secs
lola: sara is running 485 secs || 481248 markings, 814894 edges, 1084 markings/sec, 485 secs
lola: sara is running 490 secs || 486658 markings, 824076 edges, 1082 markings/sec, 490 secs
lola: sara is running 495 secs || 492087 markings, 833576 edges, 1086 markings/sec, 495 secs
lola: sara is running 500 secs || 497522 markings, 842798 edges, 1087 markings/sec, 500 secs
lola: sara is running 505 secs || 502953 markings, 852251 edges, 1086 markings/sec, 505 secs
lola: sara is running 510 secs || 508346 markings, 861446 edges, 1079 markings/sec, 510 secs
lola: sara is running 515 secs || 513733 markings, 870574 edges, 1077 markings/sec, 515 secs
lola: sara is running 520 secs || 519148 markings, 880051 edges, 1083 markings/sec, 520 secs
lola: sara is running 525 secs || 524557 markings, 889214 edges, 1082 markings/sec, 525 secs
lola: sara is running 530 secs || 529971 markings, 898689 edges, 1083 markings/sec, 530 secs
lola: sara is running 535 secs || 535402 markings, 907888 edges, 1086 markings/sec, 535 secs
lola: sara is running 540 secs || 540823 markings, 917374 edges, 1084 markings/sec, 540 secs
lola: sara is running 545 secs || 546221 markings, 926510 edges, 1080 markings/sec, 545 secs
lola: sara is running 550 secs || 551628 markings, 935973 edges, 1081 markings/sec, 550 secs
lola: sara is running 555 secs || 557058 markings, 944623 edges, 1086 markings/sec, 555 secs
lola: sara is running 560 secs || 562483 markings, 951411 edges, 1085 markings/sec, 560 secs
lola: sara is running 565 secs || 565986 markings, 958264 edges, 701 markings/sec, 565 secs
lola: sara is running 570 secs || 566678 markings, 959302 edges, 138 markings/sec, 570 secs
lola: sara is running 575 secs || 567296 markings, 960229 edges, 124 markings/sec, 575 secs
lola: sara is running 580 secs || 571414 markings, 966340 edges, 824 markings/sec, 580 secs
lola: sara is running 585 secs || 576804 markings, 975318 edges, 1078 markings/sec, 585 secs
lola: sara is running 590 secs || 582265 markings, 984506 edges, 1092 markings/sec, 590 secs
lola: sara is running 595 secs || 587674 markings, 993122 edges, 1082 markings/sec, 595 secs
lola: sara is running 600 secs || 593088 markings, 1001845 edges, 1083 markings/sec, 600 secs
lola: sara is running 605 secs || 598590 markings, 1010947 edges, 1100 markings/sec, 605 secs
lola: sara is running 610 secs || 604080 markings, 1020226 edges, 1098 markings/sec, 610 secs
lola: sara is running 615 secs || 609577 markings, 1029444 edges, 1099 markings/sec, 615 secs
lola: sara is running 620 secs || 615072 markings, 1038758 edges, 1099 markings/sec, 620 secs
lola: sara is running 625 secs || 620546 markings, 1047962 edges, 1095 markings/sec, 625 secs
lola: sara is running 630 secs || 626010 markings, 1057225 edges, 1093 markings/sec, 630 secs
lola: sara is running 635 secs || 631469 markings, 1066482 edges, 1092 markings/sec, 635 secs
lola: sara is running 640 secs || 636911 markings, 1075800 edges, 1088 markings/sec, 640 secs
lola: sara is running 645 secs || 642379 markings, 1085159 edges, 1094 markings/sec, 645 secs
lola: sara is running 650 secs || 647836 markings, 1094286 edges, 1091 markings/sec, 650 secs
lola: sara is running 655 secs || 653312 markings, 1103638 edges, 1095 markings/sec, 655 secs
lola: sara is running 660 secs || 658749 markings, 1112926 edges, 1087 markings/sec, 660 secs
lola: sara is running 665 secs || 664203 markings, 1122241 edges, 1091 markings/sec, 665 secs
lola: sara is running 670 secs || 669654 markings, 1131547 edges, 1090 markings/sec, 670 secs
lola: sara is running 675 secs || 675102 markings, 1140858 edges, 1090 markings/sec, 675 secs
lola: sara is running 680 secs || 680510 markings, 1150307 edges, 1082 markings/sec, 680 secs
lola: sara is running 685 secs || 685944 markings, 1159574 edges, 1087 markings/sec, 685 secs
lola: sara is running 690 secs || 691382 markings, 1168845 edges, 1088 markings/sec, 690 secs
lola: sara is running 695 secs || 696826 markings, 1178122 edges, 1089 markings/sec, 695 secs
lola: sara is running 700 secs || 702255 markings, 1187368 edges, 1086 markings/sec, 700 secs
lola: sara is running 705 secs || 707690 markings, 1196880 edges, 1087 markings/sec, 705 secs
lola: sara is running 710 secs || 713131 markings, 1206143 edges, 1088 markings/sec, 710 secs
lola: sara is running 715 secs || 718578 markings, 1215414 edges, 1089 markings/sec, 715 secs
lola: sara is running 720 secs || 724022 markings, 1224675 edges, 1089 markings/sec, 720 secs
lola: sara is running 725 secs || 729455 markings, 1234182 edges, 1087 markings/sec, 725 secs
lola: sara is running 730 secs || 734912 markings, 1243462 edges, 1091 markings/sec, 730 secs
lola: sara is running 735 secs || 740370 markings, 1252740 edges, 1092 markings/sec, 735 secs
lola: sara is running 740 secs || 745818 markings, 1262274 edges, 1090 markings/sec, 740 secs
lola: sara is running 745 secs || 751272 markings, 1271540 edges, 1091 markings/sec, 745 secs
lola: sara is running 750 secs || 756698 markings, 1281036 edges, 1085 markings/sec, 750 secs
lola: sara is running 755 secs || 762142 markings, 1290281 edges, 1089 markings/sec, 755 secs
lola: sara is running 760 secs || 767611 markings, 1299565 edges, 1094 markings/sec, 760 secs
lola: sara is running 765 secs || 773062 markings, 1309105 edges, 1090 markings/sec, 765 secs
lola: sara is running 770 secs || 778546 markings, 1318412 edges, 1097 markings/sec, 770 secs
lola: sara is running 775 secs || 784018 markings, 1327988 edges, 1094 markings/sec, 775 secs
lola: sara is running 780 secs || 789493 markings, 1337276 edges, 1095 markings/sec, 780 secs
lola: sara is running 785 secs || 794975 markings, 1346868 edges, 1096 markings/sec, 785 secs
lola: sara is running 790 secs || 800450 markings, 1356152 edges, 1095 markings/sec, 790 secs
lola: sara is running 795 secs || 805936 markings, 1365666 edges, 1097 markings/sec, 795 secs
lola: sara is running 800 secs || 811388 markings, 1374991 edges, 1090 markings/sec, 800 secs
lola: sara is running 805 secs || 816851 markings, 1384368 edges, 1093 markings/sec, 805 secs
lola: sara is running 810 secs || 822306 markings, 1393792 edges, 1091 markings/sec, 810 secs
lola: sara is running 815 secs || 827785 markings, 1403224 edges, 1096 markings/sec, 815 secs
lola: sara is running 820 secs || 833311 markings, 1409336 edges, 1105 markings/sec, 820 secs
lola: sara is running 825 secs || 837460 markings, 1417540 edges, 830 markings/sec, 825 secs
lola: sara is running 830 secs || 838172 markings, 1418608 edges, 142 markings/sec, 830 secs
lola: sara is running 835 secs || 838804 markings, 1419556 edges, 126 markings/sec, 835 secs
lola: sara is running 840 secs || 842161 markings, 1424407 edges, 671 markings/sec, 840 secs
lola: sara is running 845 secs || 847620 markings, 1433499 edges, 1092 markings/sec, 845 secs
lola: sara is running 850 secs || 853081 markings, 1442607 edges, 1092 markings/sec, 850 secs
lola: sara is running 855 secs || 858547 markings, 1451212 edges, 1093 markings/sec, 855 secs
lola: sara is running 860 secs || 864036 markings, 1460233 edges, 1098 markings/sec, 860 secs
lola: sara is running 865 secs || 869516 markings, 1469292 edges, 1096 markings/sec, 865 secs
lola: sara is running 870 secs || 874987 markings, 1478491 edges, 1094 markings/sec, 870 secs
lola: sara is running 875 secs || 880461 markings, 1487726 edges, 1095 markings/sec, 875 secs
lola: sara is running 880 secs || 885924 markings, 1496927 edges, 1093 markings/sec, 880 secs
lola: sara is running 885 secs || 891395 markings, 1506142 edges, 1094 markings/sec, 885 secs
lola: sara is running 890 secs || 896862 markings, 1515499 edges, 1093 markings/sec, 890 secs
lola: sara is running 895 secs || 902338 markings, 1524855 edges, 1095 markings/sec, 895 secs
lola: sara is running 900 secs || 907801 markings, 1534035 edges, 1093 markings/sec, 900 secs
lola: sara is running 905 secs || 913269 markings, 1543394 edges, 1094 markings/sec, 905 secs
lola: sara is running 910 secs || 918737 markings, 1552749 edges, 1094 markings/sec, 910 secs
lola: sara is running 915 secs || 924208 markings, 1562106 edges, 1094 markings/sec, 915 secs
lola: sara is running 920 secs || 929678 markings, 1571457 edges, 1094 markings/sec, 920 secs
lola: sara is running 925 secs || 935151 markings, 1580808 edges, 1095 markings/sec, 925 secs
lola: sara is running 930 secs || 940632 markings, 1590170 edges, 1096 markings/sec, 930 secs
lola: sara is running 935 secs || 946120 markings, 1599540 edges, 1098 markings/sec, 935 secs
lola: sara is running 940 secs || 951608 markings, 1608906 edges, 1098 markings/sec, 940 secs
lola: sara is running 945 secs || 957097 markings, 1618269 edges, 1098 markings/sec, 945 secs
lola: sara is running 950 secs || 962570 markings, 1627602 edges, 1095 markings/sec, 950 secs
lola: sara is running 955 secs || 968049 markings, 1637068 edges, 1096 markings/sec, 955 secs
lola: sara is running 960 secs || 973521 markings, 1646517 edges, 1094 markings/sec, 960 secs
lola: sara is running 965 secs || 979005 markings, 1655858 edges, 1097 markings/sec, 965 secs
lola: sara is running 970 secs || 984424 markings, 1665084 edges, 1084 markings/sec, 970 secs
lola: sara is running 975 secs || 989874 markings, 1674553 edges, 1090 markings/sec, 975 secs
lola: sara is running 980 secs || 995351 markings, 1683944 edges, 1095 markings/sec, 980 secs
lola: sara is running 985 secs || 1000831 markings, 1693268 edges, 1096 markings/sec, 985 secs
lola: sara is running 990 secs || 1006299 markings, 1702620 edges, 1094 markings/sec, 990 secs
lola: sara is running 995 secs || 1011758 markings, 1712121 edges, 1092 markings/sec, 995 secs
lola: sara is running 1000 secs || 1017232 markings, 1721426 edges, 1095 markings/sec, 1000 secs
lola: sara is running 1005 secs || 1022701 markings, 1730996 edges, 1094 markings/sec, 1005 secs
lola: sara is running 1010 secs || 1028166 markings, 1740283 edges, 1093 markings/sec, 1010 secs
lola: sara is running 1015 secs || 1033643 markings, 1749585 edges, 1095 markings/sec, 1015 secs
lola: sara is running 1020 secs || 1039108 markings, 1759149 edges, 1093 markings/sec, 1020 secs
lola: sara is running 1025 secs || 1044574 markings, 1768429 edges, 1093 markings/sec, 1025 secs
lola: sara is running 1030 secs || 1050002 markings, 1777928 edges, 1086 markings/sec, 1030 secs
lola: sara is running 1035 secs || 1055372 markings, 1787035 edges, 1074 markings/sec, 1035 secs
lola: sara is running 1040 secs || 1060749 markings, 1796344 edges, 1075 markings/sec, 1040 secs
lola: sara is running 1045 secs || 1066135 markings, 1805576 edges, 1077 markings/sec, 1045 secs
lola: sara is running 1050 secs || 1071531 markings, 1814712 edges, 1079 markings/sec, 1050 secs
lola: sara is running 1055 secs || 1076906 markings, 1824128 edges, 1075 markings/sec, 1055 secs
lola: sara is running 1060 secs || 1082290 markings, 1833248 edges, 1077 markings/sec, 1060 secs
lola: sara is running 1065 secs || 1087666 markings, 1842656 edges, 1075 markings/sec, 1065 secs
lola: sara is running 1070 secs || 1093094 markings, 1851471 edges, 1086 markings/sec, 1070 secs
lola: sara is running 1075 secs || 1098446 markings, 1858020 edges, 1070 markings/sec, 1075 secs
lola: sara is running 1080 secs || 1101992 markings, 1864963 edges, 709 markings/sec, 1080 secs
lola: sara is running 1085 secs || 1102676 markings, 1865989 edges, 137 markings/sec, 1085 secs
lola: sara is running 1090 secs || 1103282 markings, 1866898 edges, 121 markings/sec, 1090 secs
lola: sara is running 1095 secs || 1107213 markings, 1872718 edges, 786 markings/sec, 1095 secs
lola: sara is running 1100 secs || 1112675 markings, 1881786 edges, 1092 markings/sec, 1100 secs
lola: sara is running 1105 secs || 1118138 markings, 1890979 edges, 1093 markings/sec, 1105 secs
lola: sara is running 1110 secs || 1123618 markings, 1899476 edges, 1096 markings/sec, 1110 secs
lola: sara is running 1115 secs || 1129114 markings, 1908534 edges, 1099 markings/sec, 1115 secs
lola: sara is running 1120 secs || 1134608 markings, 1917686 edges, 1099 markings/sec, 1120 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1127 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NB_ATTENTE_B_57 <= NB_ATTENTE_A_57)))
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 884 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-PT-V80P50N50-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 15 will run for 2253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= NB_ATTENTE_B_13) OR (2 <= NB_ATTENTE_A_53) OR (3 <= COMPTEUR_15) OR (NB_ATTENTE_A_63 <= NB_ATTENTE_B_57))))
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 884 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 339 markings, 338 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no yes no yes no no yes unknown no no
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P50N50"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N50.tgz
mv BridgeAndVehicles-PT-V80P50N50 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is BridgeAndVehicles-PT-V80P50N50, 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 r030-ebro-152646308500390"
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 ;