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 5.2M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 95K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 278K 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 4.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 150K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K 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 87K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 230K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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 4.1M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-PT-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309500383
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526837350758


BK_STOP 1526838325286

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V80P50N20 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': 2662153, 'Memory': 984.47, 'Tool': 'lola'}, {'Time': 2662602, 'Memory': 980.97, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-PT-V80P50N20...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V80P50N20: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V80P50N20 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 3926/65536 symbol table entries, 230 collisions
lola: preprocessing...
lola: finding significant places
lola: 198 places, 3728 transitions, 191 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4253 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality.task
lola: A (G ((((CHOIX_1 + CHOIX_2 <= CAPACITE) AND (1 <= ROUTE_A)) OR (2 <= ATTENTE_A) OR (((VIDANGE_1 + VIDANGE_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) OR (1 <= CONTROLEUR_1 + CONTROLEUR_2)) AND (CONTROLEUR_1 + CONTROLEUR_2 + 1 <= CHOIX_1 + CHOIX_2))))) : E (F (((2 <= CONTROLEUR_1 + CONTROLEUR_2) AND ((CHOIX_1 + CHOIX_2 <= 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_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= CAPACITE))))) : E (F ((((SORTI_A + 1 <= ROUTE_B) AND (CAPACITE + 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 ((2 <= CHOIX_1 + CHOIX_2))) : 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 <= ROUTE_B))) : E (F (((CAPACITE <= SUR_PONT_B) AND ((ATTENTE_A <= 1) OR ((SORTI_B <= ROUTE_B) AND (3 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))))) : 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 <= SUR_PONT_A) AND (1 <= ROUTE_B) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_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)))) : A (G (((1 <= ROUTE_B) OR (1 <= CAPACITE)))) : A (G (((NB_ATTENTE_B_64 <= NB_ATTENTE_B_5) AND ((NB_ATTENTE_A_6 <= 1) OR (NB_ATTENTE_A_58 + 1 <= NB_ATTENTE_B_14))))) : E (F (((NB_ATTENTE_A_34 <= ATTENTE_A) AND ((3 <= NB_ATTENTE_A_5) OR ((3 <= COMPTEUR_19)))))) : A (G ((NB_ATTENTE_B_65 <= NB_ATTENTE_B_15))) : A (G ((((NB_ATTENTE_B_50 <= 1) OR (NB_ATTENTE_A_61 + 1 <= CAPACITE)) AND ((COMPTEUR_7 + 1 <= COMPTEUR_9) OR (COMPTEUR_3 <= 1))))) : A (G ((((NB_ATTENTE_A_4 + 1 <= NB_ATTENTE_A_22) AND (COMPTEUR_20 + 1 <= COMPTEUR_10)) OR (NB_ATTENTE_A_16 <= COMPTEUR_3)))) : A (G ((NB_ATTENTE_A_44 <= NB_ATTENTE_A_76))) : E (F (((NB_ATTENTE_A_79 + 1 <= NB_ATTENTE_B_62) OR ((3 <= NB_ATTENTE_A_45) AND (3 <= ATTENTE_A) AND (NB_ATTENTE_A_14 + 1 <= NB_ATTENTE_B_75))))) : A (G (((NB_ATTENTE_A_52 <= SUR_PONT_A) OR (NB_ATTENTE_B_38 <= NB_ATTENTE_B_14))))
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 ((((CHOIX_1 + CHOIX_2 <= CAPACITE) AND (1 <= ROUTE_A)) OR (2 <= ATTENTE_A) OR (((VIDANGE_1 + VIDANGE_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 +... (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 764 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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 315 markings, 314 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= CONTROLEUR_1 + CONTROLEUR_2) AND ((CHOIX_1 + CHOIX_2 <= 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_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 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 764 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-V80P50N20-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((SORTI_A + 1 <= ROUTE_B) AND (CAPACITE + 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_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 764 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-V80P50N20-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4089 markings, 6026 edges, 818 markings/sec, 0 secs
lola: sara is running 5 secs || 6627 markings, 11340 edges, 508 markings/sec, 5 secs
lola: sara is running 10 secs || 9492 markings, 17015 edges, 573 markings/sec, 10 secs
lola: sara is running 15 secs || 14499 markings, 26279 edges, 1001 markings/sec, 15 secs
lola: sara is running 20 secs || 17185 markings, 33413 edges, 537 markings/sec, 20 secs
lola: sara is running 25 secs || 18842 markings, 38044 edges, 331 markings/sec, 25 secs
lola: sara is running 30 secs || 21213 markings, 43564 edges, 474 markings/sec, 30 secs
lola: sara is running 35 secs || 25222 markings, 51657 edges, 802 markings/sec, 35 secs
lola: sara is running 40 secs || 29626 markings, 60586 edges, 881 markings/sec, 40 secs
lola: sara is running 45 secs || 35055 markings, 69758 edges, 1086 markings/sec, 45 secs
lola: sara is running 50 secs || 37918 markings, 77211 edges, 573 markings/sec, 50 secs
lola: sara is running 55 secs || 39445 markings, 81711 edges, 305 markings/sec, 55 secs
lola: sara is running 60 secs || 41004 markings, 86390 edges, 312 markings/sec, 60 secs
lola: sara is running 65 secs || 43422 markings, 92158 edges, 484 markings/sec, 65 secs
lola: sara is running 70 secs || 47056 markings, 99988 edges, 727 markings/sec, 70 secs
lola: sara is running 75 secs || 50327 markings, 107233 edges, 654 markings/sec, 75 secs
lola: sara is running 80 secs || 54129 markings, 115488 edges, 760 markings/sec, 80 secs
lola: sara is running 85 secs || 58130 markings, 124259 edges, 800 markings/sec, 85 secs
lola: sara is running 90 secs || 63255 markings, 133206 edges, 1025 markings/sec, 90 secs
lola: sara is running 95 secs || 68205 markings, 142445 edges, 990 markings/sec, 95 secs
lola: sara is running 100 secs || 71525 markings, 149280 edges, 664 markings/sec, 100 secs
lola: sara is running 105 secs || 73776 markings, 156198 edges, 450 markings/sec, 105 secs
lola: sara is running 110 secs || 75420 markings, 161044 edges, 329 markings/sec, 110 secs
lola: sara is running 115 secs || 76938 markings, 165739 edges, 304 markings/sec, 115 secs
lola: sara is running 120 secs || 78489 markings, 170395 edges, 310 markings/sec, 120 secs
lola: sara is running 125 secs || 82174 markings, 178343 edges, 737 markings/sec, 125 secs
lola: sara is running 130 secs || 85447 markings, 185986 edges, 655 markings/sec, 130 secs
lola: sara is running 135 secs || 88571 markings, 193092 edges, 625 markings/sec, 135 secs
lola: sara is running 140 secs || 91403 markings, 199696 edges, 566 markings/sec, 140 secs
lola: sara is running 145 secs || 95080 markings, 208245 edges, 735 markings/sec, 145 secs
lola: sara is running 150 secs || 99091 markings, 217466 edges, 802 markings/sec, 150 secs
lola: sara is running 155 secs || 104121 markings, 226607 edges, 1006 markings/sec, 155 secs
lola: sara is running 160 secs || 108231 markings, 234783 edges, 822 markings/sec, 160 secs
lola: sara is running 165 secs || 112659 markings, 243630 edges, 886 markings/sec, 165 secs
lola: sara is running 170 secs || 115771 markings, 250464 edges, 622 markings/sec, 170 secs
lola: sara is running 175 secs || 119824 markings, 259019 edges, 811 markings/sec, 175 secs
lola: sara is running 180 secs || 124498 markings, 268817 edges, 935 markings/sec, 180 secs
lola: sara is running 185 secs || 127548 markings, 275551 edges, 610 markings/sec, 185 secs
lola: sara is running 190 secs || 130151 markings, 282822 edges, 521 markings/sec, 190 secs
lola: sara is running 195 secs || 131580 markings, 287173 edges, 286 markings/sec, 195 secs
lola: sara is running 200 secs || 133019 markings, 291813 edges, 288 markings/sec, 200 secs
lola: sara is running 205 secs || 134609 markings, 296778 edges, 318 markings/sec, 205 secs
lola: sara is running 210 secs || 136398 markings, 301846 edges, 358 markings/sec, 210 secs
lola: sara is running 215 secs || 139980 markings, 309911 edges, 716 markings/sec, 215 secs
lola: sara is running 220 secs || 143169 markings, 317482 edges, 638 markings/sec, 220 secs
lola: sara is running 225 secs || 146194 markings, 324621 edges, 605 markings/sec, 225 secs
lola: sara is running 230 secs || 148986 markings, 331335 edges, 558 markings/sec, 230 secs
lola: sara is running 235 secs || 151720 markings, 337962 edges, 547 markings/sec, 235 secs
lola: sara is running 240 secs || 154192 markings, 344084 edges, 494 markings/sec, 240 secs
lola: sara is running 245 secs || 158090 markings, 353308 edges, 780 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 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 764 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-V80P50N20-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-3.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 4 will run for 273 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_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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-V80P50N20-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CAPACITE <= SUR_PONT_B) AND ((ATTENTE_A <= 1) OR ((SORTI_B <= ROUTE_B) AND (3 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1945 markings, 3592 edges, 389 markings/sec, 0 secs
lola: sara is running 5 secs || 3617 markings, 7440 edges, 334 markings/sec, 5 secs
lola: sara is running 10 secs || 5630 markings, 11464 edges, 403 markings/sec, 10 secs
lola: sara is running 15 secs || 7524 markings, 15343 edges, 379 markings/sec, 15 secs
lola: sara is running 20 secs || 9389 markings, 19227 edges, 373 markings/sec, 20 secs
lola: sara is running 25 secs || 11226 markings, 23007 edges, 367 markings/sec, 25 secs
lola: sara is running 30 secs || 13025 markings, 26844 edges, 360 markings/sec, 30 secs
lola: sara is running 35 secs || 14834 markings, 30696 edges, 362 markings/sec, 35 secs
lola: sara is running 40 secs || 16642 markings, 34537 edges, 362 markings/sec, 40 secs
lola: sara is running 45 secs || 18423 markings, 38352 edges, 356 markings/sec, 45 secs
lola: sara is running 50 secs || 20088 markings, 42149 edges, 333 markings/sec, 50 secs
lola: sara is running 55 secs || 21941 markings, 46042 edges, 371 markings/sec, 55 secs
lola: sara is running 60 secs || 23689 markings, 49888 edges, 350 markings/sec, 60 secs
lola: sara is running 65 secs || 25374 markings, 53641 edges, 337 markings/sec, 65 secs
lola: sara is running 70 secs || 27239 markings, 57748 edges, 373 markings/sec, 70 secs
lola: sara is running 75 secs || 28907 markings, 63169 edges, 334 markings/sec, 75 secs
lola: sara is running 80 secs || 30719 markings, 68690 edges, 362 markings/sec, 80 secs
lola: sara is running 85 secs || 34657 markings, 77960 edges, 788 markings/sec, 85 secs
lola: sara is running 90 secs || 37214 markings, 84334 edges, 511 markings/sec, 90 secs
lola: sara is running 95 secs || 39345 markings, 89798 edges, 426 markings/sec, 95 secs
lola: sara is running 100 secs || 41600 markings, 95654 edges, 451 markings/sec, 100 secs
lola: sara is running 105 secs || 43708 markings, 100932 edges, 422 markings/sec, 105 secs
lola: sara is running 110 secs || 45726 markings, 106251 edges, 404 markings/sec, 110 secs
lola: sara is running 115 secs || 47464 markings, 110788 edges, 348 markings/sec, 115 secs
lola: sara is running 120 secs || 49516 markings, 115635 edges, 410 markings/sec, 120 secs
lola: sara is running 125 secs || 51553 markings, 121262 edges, 407 markings/sec, 125 secs
lola: sara is running 130 secs || 53257 markings, 125632 edges, 341 markings/sec, 130 secs
lola: sara is running 135 secs || 55267 markings, 130939 edges, 402 markings/sec, 135 secs
lola: sara is running 140 secs || 56996 markings, 135368 edges, 346 markings/sec, 140 secs
lola: sara is running 145 secs || 58986 markings, 140809 edges, 398 markings/sec, 145 secs
lola: sara is running 150 secs || 60687 markings, 144718 edges, 340 markings/sec, 150 secs
lola: sara is running 155 secs || 62358 markings, 150104 edges, 334 markings/sec, 155 secs
lola: sara is running 160 secs || 64345 markings, 154782 edges, 397 markings/sec, 160 secs
lola: sara is running 165 secs || 66077 markings, 159179 edges, 346 markings/sec, 165 secs
lola: sara is running 170 secs || 67870 markings, 164704 edges, 359 markings/sec, 170 secs
lola: sara is running 175 secs || 69752 markings, 169089 edges, 376 markings/sec, 175 secs
lola: sara is running 180 secs || 71466 markings, 173305 edges, 343 markings/sec, 180 secs
lola: sara is running 185 secs || 73107 markings, 178673 edges, 328 markings/sec, 185 secs
lola: sara is running 190 secs || 75100 markings, 183562 edges, 399 markings/sec, 190 secs
lola: sara is running 195 secs || 76740 markings, 187438 edges, 328 markings/sec, 195 secs
lola: sara is running 200 secs || 78418 markings, 192199 edges, 336 markings/sec, 200 secs
lola: sara is running 205 secs || 80098 markings, 197674 edges, 336 markings/sec, 205 secs
lola: sara is running 210 secs || 82002 markings, 203140 edges, 381 markings/sec, 210 secs
lola: sara is running 215 secs || 83716 markings, 208726 edges, 343 markings/sec, 215 secs
lola: sara is running 220 secs || 86557 markings, 216054 edges, 568 markings/sec, 220 secs
lola: sara is running 225 secs || 89066 markings, 222694 edges, 502 markings/sec, 225 secs
lola: sara is running 230 secs || 92032 markings, 230561 edges, 593 markings/sec, 230 secs
lola: sara is running 235 secs || 94639 markings, 237648 edges, 521 markings/sec, 235 secs
lola: sara is running 240 secs || 97437 markings, 245203 edges, 560 markings/sec, 240 secs
lola: sara is running 245 secs || 99961 markings, 252100 edges, 505 markings/sec, 245 secs
lola: sara is running 250 secs || 102178 markings, 258241 edges, 443 markings/sec, 250 secs
lola: sara is running 255 secs || 104909 markings, 265540 edges, 546 markings/sec, 255 secs
lola: sara is running 260 secs || 107355 markings, 272362 edges, 489 markings/sec, 260 secs
lola: sara is running 265 secs || 109488 markings, 278469 edges, 427 markings/sec, 265 secs
lola: sara is running 270 secs || 112233 markings, 285887 edges, 549 markings/sec, 270 secs
lola: sara is running 275 secs || 114228 markings, 291686 edges, 399 markings/sec, 275 secs
lola: sara is running 280 secs || 117007 markings, 299171 edges, 556 markings/sec, 280 secs
lola: sara is running 285 secs || 119078 markings, 305138 edges, 414 markings/sec, 285 secs
lola: sara is running 290 secs || 121669 markings, 312171 edges, 518 markings/sec, 290 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 298 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 764 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-V80P50N20-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-6.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 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= ROUTE_B) OR (1 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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-V80P50N20-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2191 markings, 4097 edges, 438 markings/sec, 0 secs
lola: sara is running 5 secs || 4272 markings, 9200 edges, 416 markings/sec, 5 secs
lola: sara is running 10 secs || 6397 markings, 14682 edges, 425 markings/sec, 10 secs
lola: sara is running 15 secs || 8395 markings, 20112 edges, 400 markings/sec, 15 secs
lola: sara is running 20 secs || 10139 markings, 24641 edges, 349 markings/sec, 20 secs
lola: sara is running 25 secs || 12518 markings, 30842 edges, 476 markings/sec, 25 secs
lola: sara is running 30 secs || 14145 markings, 35390 edges, 325 markings/sec, 30 secs
lola: sara is running 35 secs || 16481 markings, 41473 edges, 467 markings/sec, 35 secs
lola: sara is running 40 secs || 17993 markings, 45722 edges, 302 markings/sec, 40 secs
lola: sara is running 45 secs || 20632 markings, 52606 edges, 528 markings/sec, 45 secs
lola: sara is running 50 secs || 22189 markings, 57012 edges, 311 markings/sec, 50 secs
lola: sara is running 55 secs || 24517 markings, 63429 edges, 466 markings/sec, 55 secs
lola: sara is running 60 secs || 26494 markings, 68576 edges, 395 markings/sec, 60 secs
lola: sara is running 65 secs || 27944 markings, 72689 edges, 290 markings/sec, 65 secs
lola: sara is running 70 secs || 30848 markings, 80266 edges, 581 markings/sec, 70 secs
lola: sara is running 75 secs || 32373 markings, 84591 edges, 305 markings/sec, 75 secs
lola: sara is running 80 secs || 33937 markings, 89038 edges, 313 markings/sec, 80 secs
lola: sara is running 85 secs || 36860 markings, 96738 edges, 585 markings/sec, 85 secs
lola: sara is running 90 secs || 38528 markings, 101255 edges, 334 markings/sec, 90 secs
lola: sara is running 95 secs || 39962 markings, 105271 edges, 287 markings/sec, 95 secs
lola: sara is running 100 secs || 42561 markings, 112385 edges, 520 markings/sec, 100 secs
lola: sara is running 105 secs || 44738 markings, 117894 edges, 435 markings/sec, 105 secs
lola: sara is running 110 secs || 46274 markings, 122223 edges, 307 markings/sec, 110 secs
lola: sara is running 115 secs || 47951 markings, 126939 edges, 335 markings/sec, 115 secs
lola: sara is running 120 secs || 50926 markings, 134751 edges, 595 markings/sec, 120 secs
lola: sara is running 125 secs || 52639 markings, 139301 edges, 343 markings/sec, 125 secs
lola: sara is running 130 secs || 54067 markings, 143359 edges, 286 markings/sec, 130 secs
lola: sara is running 135 secs || 55984 markings, 148753 edges, 383 markings/sec, 135 secs
lola: sara is running 140 secs || 58890 markings, 156370 edges, 581 markings/sec, 140 secs
lola: sara is running 145 secs || 60625 markings, 160944 edges, 347 markings/sec, 145 secs
lola: sara is running 150 secs || 62122 markings, 165207 edges, 299 markings/sec, 150 secs
lola: sara is running 155 secs || 63579 markings, 169338 edges, 291 markings/sec, 155 secs
lola: sara is running 160 secs || 66279 markings, 176766 edges, 540 markings/sec, 160 secs
lola: sara is running 165 secs || 68810 markings, 183161 edges, 506 markings/sec, 165 secs
lola: sara is running 170 secs || 70349 markings, 187507 edges, 308 markings/sec, 170 secs
lola: sara is running 175 secs || 71809 markings, 191667 edges, 292 markings/sec, 175 secs
lola: sara is running 180 secs || 73793 markings, 197272 edges, 397 markings/sec, 180 secs
lola: sara is running 185 secs || 76445 markings, 204195 edges, 530 markings/sec, 185 secs
lola: sara is running 190 secs || 78622 markings, 209912 edges, 435 markings/sec, 190 secs
lola: sara is running 195 secs || 80104 markings, 214143 edges, 296 markings/sec, 195 secs
lola: sara is running 200 secs || 81576 markings, 218335 edges, 294 markings/sec, 200 secs
lola: sara is running 205 secs || 83352 markings, 223374 edges, 355 markings/sec, 205 secs
lola: sara is running 210 secs || 86114 markings, 230632 edges, 552 markings/sec, 210 secs
lola: sara is running 215 secs || 88584 markings, 237166 edges, 494 markings/sec, 215 secs
lola: sara is running 220 secs || 90018 markings, 241195 edges, 287 markings/sec, 220 secs
lola: sara is running 225 secs || 91459 markings, 245321 edges, 288 markings/sec, 225 secs
lola: sara is running 230 secs || 92913 markings, 249462 edges, 291 markings/sec, 230 secs
lola: sara is running 235 secs || 95281 markings, 256129 edges, 474 markings/sec, 235 secs
lola: sara is running 240 secs || 97935 markings, 263020 edges, 531 markings/sec, 240 secs
lola: sara is running 245 secs || 100090 markings, 268668 edges, 431 markings/sec, 245 secs
lola: sara is running 250 secs || 101648 markings, 273127 edges, 312 markings/sec, 250 secs
lola: sara is running 255 secs || 103061 markings, 277154 edges, 283 markings/sec, 255 secs
lola: sara is running 260 secs || 104536 markings, 281359 edges, 295 markings/sec, 260 secs
lola: sara is running 265 secs || 107001 markings, 288294 edges, 493 markings/sec, 265 secs
lola: sara is running 270 secs || 109596 markings, 295032 edges, 519 markings/sec, 270 secs
lola: sara is running 275 secs || 111967 markings, 301269 edges, 474 markings/sec, 275 secs
lola: sara is running 280 secs || 113433 markings, 305436 edges, 293 markings/sec, 280 secs
lola: sara is running 285 secs || 114868 markings, 309562 edges, 287 markings/sec, 285 secs
lola: sara is running 290 secs || 116377 markings, 313862 edges, 302 markings/sec, 290 secs
lola: sara is running 295 secs || 118535 markings, 319985 edges, 432 markings/sec, 295 secs
lola: sara is running 300 secs || 121159 markings, 327103 edges, 525 markings/sec, 300 secs
lola: sara is running 305 secs || 124577 markings, 336657 edges, 684 markings/sec, 305 secs
lola: sara is running 310 secs || 127510 markings, 345058 edges, 587 markings/sec, 310 secs
lola: sara is running 315 secs || 130283 markings, 352118 edges, 555 markings/sec, 315 secs
lola: sara is running 320 secs || 133169 markings, 360038 edges, 577 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_B_64 <= NB_ATTENTE_B_5) AND ((NB_ATTENTE_A_6 <= 1) OR (NB_ATTENTE_A_58 + 1 <= NB_ATTENTE_B_14)))))
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 764 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 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: subprocess 9 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_A_34 <= ATTENTE_A) AND ((3 <= NB_ATTENTE_A_5) OR ((3 <= COMPTEUR_19))))))
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 764 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 2301 markings, 4259 edges, 460 markings/sec, 0 secs
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 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NB_ATTENTE_B_65 <= NB_ATTENTE_B_15)))
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 764 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-V80P50N20-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 526 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NB_ATTENTE_B_50 <= 1) OR (NB_ATTENTE_A_61 + 1 <= CAPACITE)) AND ((COMPTEUR_7 + 1 <= COMPTEUR_9) OR (COMPTEUR_3 <= 1)))))
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 764 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-V80P50N20-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NB_ATTENTE_A_4 + 1 <= NB_ATTENTE_A_22) AND (COMPTEUR_20 + 1 <= COMPTEUR_10)) OR (NB_ATTENTE_A_16 <= COMPTEUR_3))))
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 764 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-V80P50N20-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 874 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NB_ATTENTE_A_44 <= NB_ATTENTE_A_76)))
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 764 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-V80P50N20-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_A_79 + 1 <= NB_ATTENTE_B_62) OR ((3 <= NB_ATTENTE_A_45) AND (3 <= ATTENTE_A) AND (NB_ATTENTE_A_14 + 1 <= NB_ATTENTE_B_75)))))
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 764 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-V80P50N20-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2756 markings, 5337 edges, 551 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2614 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_52 <= SUR_PONT_A) OR (NB_ATTENTE_B_38 <= NB_ATTENTE_B_14))))
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 764 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-V80P50N20-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no unknown no unknown no no no yes no no yes no
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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-V80P50N20.tgz
mv BridgeAndVehicles-PT-V80P50N20 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-structural"
echo " Input is BridgeAndVehicles-PT-V80P50N20, 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 r031-ebro-152646309500383"
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 ;