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-full
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 r030-ebro-152646308500383
=====================================================================

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


BK_STOP 1526773647705

--------------------
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-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 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 || 4833 markings, 7466 edges, 967 markings/sec, 0 secs
lola: sara is running 5 secs || 7657 markings, 13689 edges, 565 markings/sec, 5 secs
lola: sara is running 10 secs || 12232 markings, 21976 edges, 915 markings/sec, 10 secs
lola: sara is running 15 secs || 15843 markings, 29412 edges, 722 markings/sec, 15 secs
lola: sara is running 20 secs || 18081 markings, 35875 edges, 448 markings/sec, 20 secs
lola: sara is running 25 secs || 19705 markings, 40530 edges, 325 markings/sec, 25 secs
lola: sara is running 30 secs || 23463 markings, 48082 edges, 752 markings/sec, 30 secs
lola: sara is running 35 secs || 27326 markings, 55993 edges, 773 markings/sec, 35 secs
lola: sara is running 40 secs || 31674 markings, 64781 edges, 870 markings/sec, 40 secs
lola: sara is running 45 secs || 36343 markings, 72257 edges, 934 markings/sec, 45 secs
lola: sara is running 50 secs || 38652 markings, 79338 edges, 462 markings/sec, 50 secs
lola: sara is running 55 secs || 40197 markings, 84017 edges, 309 markings/sec, 55 secs
lola: sara is running 60 secs || 41777 markings, 88782 edges, 316 markings/sec, 60 secs
lola: sara is running 65 secs || 45359 markings, 96299 edges, 716 markings/sec, 65 secs
lola: sara is running 70 secs || 48690 markings, 103633 edges, 666 markings/sec, 70 secs
lola: sara is running 75 secs || 51759 markings, 110350 edges, 614 markings/sec, 75 secs
lola: sara is running 80 secs || 56124 markings, 119726 edges, 873 markings/sec, 80 secs
lola: sara is running 85 secs || 60576 markings, 128397 edges, 890 markings/sec, 85 secs
lola: sara is running 90 secs || 65145 markings, 136647 edges, 914 markings/sec, 90 secs
lola: sara is running 95 secs || 69901 markings, 145908 edges, 951 markings/sec, 95 secs
lola: sara is running 100 secs || 72744 markings, 153239 edges, 569 markings/sec, 100 secs
lola: sara is running 105 secs || 74418 markings, 157882 edges, 335 markings/sec, 105 secs
lola: sara is running 110 secs || 75871 markings, 162461 edges, 291 markings/sec, 110 secs
lola: sara is running 115 secs || 77434 markings, 167276 edges, 313 markings/sec, 115 secs
lola: sara is running 120 secs || 79623 markings, 172690 edges, 438 markings/sec, 120 secs
lola: sara is running 125 secs || 83134 markings, 180658 edges, 702 markings/sec, 125 secs
lola: sara is running 130 secs || 86397 markings, 188172 edges, 653 markings/sec, 130 secs
lola: sara is running 135 secs || 89291 markings, 194890 edges, 579 markings/sec, 135 secs
lola: sara is running 140 secs || 92063 markings, 201382 edges, 554 markings/sec, 140 secs
lola: sara is running 145 secs || 96235 markings, 210942 edges, 834 markings/sec, 145 secs
lola: sara is running 150 secs || 100085 markings, 219731 edges, 770 markings/sec, 150 secs
lola: sara is running 155 secs || 105062 markings, 228726 edges, 995 markings/sec, 155 secs
lola: sara is running 160 secs || 109726 markings, 237621 edges, 933 markings/sec, 160 secs
lola: sara is running 165 secs || 113489 markings, 245575 edges, 753 markings/sec, 165 secs
lola: sara is running 170 secs || 117039 markings, 253137 edges, 710 markings/sec, 170 secs
lola: sara is running 175 secs || 121086 markings, 261685 edges, 809 markings/sec, 175 secs
lola: sara is running 180 secs || 125533 markings, 270941 edges, 889 markings/sec, 180 secs
lola: sara is running 185 secs || 128159 markings, 276777 edges, 525 markings/sec, 185 secs
lola: sara is running 190 secs || 130405 markings, 283791 edges, 449 markings/sec, 190 secs
lola: sara is running 195 secs || 131969 markings, 288452 edges, 313 markings/sec, 195 secs
lola: sara is running 200 secs || 133530 markings, 293410 edges, 312 markings/sec, 200 secs
lola: sara is running 205 secs || 134995 markings, 298044 edges, 293 markings/sec, 205 secs
lola: sara is running 210 secs || 137472 markings, 303935 edges, 495 markings/sec, 210 secs
lola: sara is running 215 secs || 140876 markings, 311861 edges, 681 markings/sec, 215 secs
lola: sara is running 220 secs || 143971 markings, 319209 edges, 619 markings/sec, 220 secs
lola: sara is running 225 secs || 146919 markings, 326456 edges, 590 markings/sec, 225 secs
lola: sara is running 230 secs || 149801 markings, 333315 edges, 576 markings/sec, 230 secs
lola: sara is running 235 secs || 152345 markings, 339560 edges, 509 markings/sec, 235 secs
lola: sara is running 240 secs || 155030 markings, 345879 edges, 537 markings/sec, 240 secs
lola: sara is running 245 secs || 159237 markings, 355954 edges, 841 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 || 1947 markings, 3596 edges, 389 markings/sec, 0 secs
lola: sara is running 5 secs || 3619 markings, 7446 edges, 334 markings/sec, 5 secs
lola: sara is running 10 secs || 5661 markings, 11513 edges, 408 markings/sec, 10 secs
lola: sara is running 15 secs || 7536 markings, 15379 edges, 375 markings/sec, 15 secs
lola: sara is running 20 secs || 9416 markings, 19277 edges, 376 markings/sec, 20 secs
lola: sara is running 25 secs || 11286 markings, 23132 edges, 374 markings/sec, 25 secs
lola: sara is running 30 secs || 13108 markings, 27009 edges, 364 markings/sec, 30 secs
lola: sara is running 35 secs || 14878 markings, 30805 edges, 354 markings/sec, 35 secs
lola: sara is running 40 secs || 16665 markings, 34606 edges, 357 markings/sec, 40 secs
lola: sara is running 45 secs || 18479 markings, 38459 edges, 363 markings/sec, 45 secs
lola: sara is running 50 secs || 20146 markings, 42263 edges, 333 markings/sec, 50 secs
lola: sara is running 55 secs || 21960 markings, 46099 edges, 363 markings/sec, 55 secs
lola: sara is running 60 secs || 23706 markings, 49939 edges, 349 markings/sec, 60 secs
lola: sara is running 65 secs || 25413 markings, 53728 edges, 341 markings/sec, 65 secs
lola: sara is running 70 secs || 27263 markings, 57821 edges, 370 markings/sec, 70 secs
lola: sara is running 75 secs || 28921 markings, 63227 edges, 332 markings/sec, 75 secs
lola: sara is running 80 secs || 30822 markings, 68916 edges, 380 markings/sec, 80 secs
lola: sara is running 85 secs || 34688 markings, 78060 edges, 773 markings/sec, 85 secs
lola: sara is running 90 secs || 37270 markings, 84468 edges, 516 markings/sec, 90 secs
lola: sara is running 95 secs || 39362 markings, 89855 edges, 418 markings/sec, 95 secs
lola: sara is running 100 secs || 41651 markings, 95754 edges, 458 markings/sec, 100 secs
lola: sara is running 105 secs || 43716 markings, 100956 edges, 413 markings/sec, 105 secs
lola: sara is running 110 secs || 45746 markings, 106273 edges, 406 markings/sec, 110 secs
lola: sara is running 115 secs || 47481 markings, 110833 edges, 347 markings/sec, 115 secs
lola: sara is running 120 secs || 49522 markings, 115659 edges, 408 markings/sec, 120 secs
lola: sara is running 125 secs || 51561 markings, 121286 edges, 408 markings/sec, 125 secs
lola: sara is running 130 secs || 53266 markings, 125669 edges, 341 markings/sec, 130 secs
lola: sara is running 135 secs || 55279 markings, 130975 edges, 403 markings/sec, 135 secs
lola: sara is running 140 secs || 57010 markings, 135425 edges, 346 markings/sec, 140 secs
lola: sara is running 145 secs || 59036 markings, 140928 edges, 405 markings/sec, 145 secs
lola: sara is running 150 secs || 60745 markings, 144887 edges, 342 markings/sec, 150 secs
lola: sara is running 155 secs || 62398 markings, 150234 edges, 331 markings/sec, 155 secs
lola: sara is running 160 secs || 64383 markings, 154889 edges, 397 markings/sec, 160 secs
lola: sara is running 165 secs || 66105 markings, 159293 edges, 344 markings/sec, 165 secs
lola: sara is running 170 secs || 67973 markings, 164945 edges, 374 markings/sec, 170 secs
lola: sara is running 175 secs || 69786 markings, 169191 edges, 363 markings/sec, 175 secs
lola: sara is running 180 secs || 71503 markings, 173454 edges, 343 markings/sec, 180 secs
lola: sara is running 185 secs || 73158 markings, 178872 edges, 331 markings/sec, 185 secs
lola: sara is running 190 secs || 75150 markings, 183712 edges, 398 markings/sec, 190 secs
lola: sara is running 195 secs || 76791 markings, 187591 edges, 328 markings/sec, 195 secs
lola: sara is running 200 secs || 78564 markings, 192634 edges, 355 markings/sec, 200 secs
lola: sara is running 205 secs || 80195 markings, 197974 edges, 326 markings/sec, 205 secs
lola: sara is running 210 secs || 82159 markings, 203597 edges, 393 markings/sec, 210 secs
lola: sara is running 215 secs || 83771 markings, 208959 edges, 322 markings/sec, 215 secs
lola: sara is running 220 secs || 86687 markings, 216331 edges, 583 markings/sec, 220 secs
lola: sara is running 225 secs || 89211 markings, 223132 edges, 505 markings/sec, 225 secs
lola: sara is running 230 secs || 92169 markings, 231061 edges, 592 markings/sec, 230 secs
lola: sara is running 235 secs || 94852 markings, 238148 edges, 537 markings/sec, 235 secs
lola: sara is running 240 secs || 97573 markings, 245696 edges, 544 markings/sec, 240 secs
lola: sara is running 245 secs || 100130 markings, 252707 edges, 511 markings/sec, 245 secs
lola: sara is running 250 secs || 102668 markings, 259446 edges, 508 markings/sec, 250 secs
lola: sara is running 255 secs || 105137 markings, 266253 edges, 494 markings/sec, 255 secs
lola: sara is running 260 secs || 107699 markings, 273318 edges, 512 markings/sec, 260 secs
lola: sara is running 265 secs || 109885 markings, 279432 edges, 437 markings/sec, 265 secs
lola: sara is running 270 secs || 112549 markings, 286794 edges, 533 markings/sec, 270 secs
lola: sara is running 275 secs || 114754 markings, 292934 edges, 441 markings/sec, 275 secs
lola: sara is running 280 secs || 117307 markings, 300051 edges, 511 markings/sec, 280 secs
lola: sara is running 285 secs || 119307 markings, 305887 edges, 400 markings/sec, 285 secs
lola: sara is running 290 secs || 121984 markings, 313102 edges, 535 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 || 2140 markings, 3970 edges, 428 markings/sec, 0 secs
lola: sara is running 5 secs || 4263 markings, 9182 edges, 425 markings/sec, 5 secs
lola: sara is running 10 secs || 6390 markings, 14668 edges, 425 markings/sec, 10 secs
lola: sara is running 15 secs || 8342 markings, 19997 edges, 390 markings/sec, 15 secs
lola: sara is running 20 secs || 10074 markings, 24463 edges, 346 markings/sec, 20 secs
lola: sara is running 25 secs || 12502 markings, 30810 edges, 486 markings/sec, 25 secs
lola: sara is running 30 secs || 14028 markings, 35068 edges, 305 markings/sec, 30 secs
lola: sara is running 35 secs || 16459 markings, 41407 edges, 486 markings/sec, 35 secs
lola: sara is running 40 secs || 17973 markings, 45662 edges, 303 markings/sec, 40 secs
lola: sara is running 45 secs || 20588 markings, 52474 edges, 523 markings/sec, 45 secs
lola: sara is running 50 secs || 22053 markings, 56634 edges, 293 markings/sec, 50 secs
lola: sara is running 55 secs || 24470 markings, 63288 edges, 483 markings/sec, 55 secs
lola: sara is running 60 secs || 26351 markings, 68174 edges, 376 markings/sec, 60 secs
lola: sara is running 65 secs || 27907 markings, 72578 edges, 311 markings/sec, 65 secs
lola: sara is running 70 secs || 30774 markings, 80118 edges, 573 markings/sec, 70 secs
lola: sara is running 75 secs || 32338 markings, 84488 edges, 313 markings/sec, 75 secs
lola: sara is running 80 secs || 33821 markings, 88710 edges, 297 markings/sec, 80 secs
lola: sara is running 85 secs || 36752 markings, 96477 edges, 586 markings/sec, 85 secs
lola: sara is running 90 secs || 38340 markings, 100723 edges, 318 markings/sec, 90 secs
lola: sara is running 95 secs || 39914 markings, 105131 edges, 315 markings/sec, 95 secs
lola: sara is running 100 secs || 42379 markings, 111854 edges, 493 markings/sec, 100 secs
lola: sara is running 105 secs || 44705 markings, 117797 edges, 465 markings/sec, 105 secs
lola: sara is running 110 secs || 46243 markings, 122155 edges, 308 markings/sec, 110 secs
lola: sara is running 115 secs || 47961 markings, 126962 edges, 344 markings/sec, 115 secs
lola: sara is running 120 secs || 50957 markings, 134828 edges, 599 markings/sec, 120 secs
lola: sara is running 125 secs || 52655 markings, 139348 edges, 340 markings/sec, 125 secs
lola: sara is running 130 secs || 54085 markings, 143412 edges, 286 markings/sec, 130 secs
lola: sara is running 135 secs || 56004 markings, 148798 edges, 384 markings/sec, 135 secs
lola: sara is running 140 secs || 58925 markings, 156462 edges, 584 markings/sec, 140 secs
lola: sara is running 145 secs || 60677 markings, 161100 edges, 350 markings/sec, 145 secs
lola: sara is running 150 secs || 62208 markings, 165464 edges, 306 markings/sec, 150 secs
lola: sara is running 155 secs || 63600 markings, 169399 edges, 278 markings/sec, 155 secs
lola: sara is running 160 secs || 66355 markings, 176921 edges, 551 markings/sec, 160 secs
lola: sara is running 165 secs || 68841 markings, 183241 edges, 497 markings/sec, 165 secs
lola: sara is running 170 secs || 70378 markings, 187595 edges, 307 markings/sec, 170 secs
lola: sara is running 175 secs || 71839 markings, 191754 edges, 292 markings/sec, 175 secs
lola: sara is running 180 secs || 73857 markings, 197446 edges, 404 markings/sec, 180 secs
lola: sara is running 185 secs || 76572 markings, 204536 edges, 543 markings/sec, 185 secs
lola: sara is running 190 secs || 78779 markings, 210348 edges, 441 markings/sec, 190 secs
lola: sara is running 195 secs || 80182 markings, 214372 edges, 281 markings/sec, 195 secs
lola: sara is running 200 secs || 81661 markings, 218584 edges, 296 markings/sec, 200 secs
lola: sara is running 205 secs || 83572 markings, 224000 edges, 382 markings/sec, 205 secs
lola: sara is running 210 secs || 86306 markings, 231147 edges, 547 markings/sec, 210 secs
lola: sara is running 215 secs || 88669 markings, 237395 edges, 473 markings/sec, 215 secs
lola: sara is running 220 secs || 90116 markings, 241484 edges, 289 markings/sec, 220 secs
lola: sara is running 225 secs || 91629 markings, 245791 edges, 303 markings/sec, 225 secs
lola: sara is running 230 secs || 93073 markings, 249906 edges, 289 markings/sec, 230 secs
lola: sara is running 235 secs || 95535 markings, 256804 edges, 492 markings/sec, 235 secs
lola: sara is running 240 secs || 98268 markings, 263941 edges, 547 markings/sec, 240 secs
lola: sara is running 245 secs || 100342 markings, 269370 edges, 415 markings/sec, 245 secs
lola: sara is running 250 secs || 101771 markings, 273452 edges, 286 markings/sec, 250 secs
lola: sara is running 255 secs || 103167 markings, 277469 edges, 279 markings/sec, 255 secs
lola: sara is running 260 secs || 104618 markings, 281603 edges, 290 markings/sec, 260 secs
lola: sara is running 265 secs || 107127 markings, 288629 edges, 502 markings/sec, 265 secs
lola: sara is running 270 secs || 109779 markings, 295541 edges, 530 markings/sec, 270 secs
lola: sara is running 275 secs || 112022 markings, 301419 edges, 449 markings/sec, 275 secs
lola: sara is running 280 secs || 113506 markings, 305651 edges, 297 markings/sec, 280 secs
lola: sara is running 285 secs || 115042 markings, 310062 edges, 307 markings/sec, 285 secs
lola: sara is running 290 secs || 116442 markings, 314054 edges, 280 markings/sec, 290 secs
lola: sara is running 295 secs || 118667 markings, 320345 edges, 445 markings/sec, 295 secs
lola: sara is running 300 secs || 121417 markings, 327847 edges, 550 markings/sec, 300 secs
lola: sara is running 305 secs || 124748 markings, 337165 edges, 666 markings/sec, 305 secs
lola: sara is running 310 secs || 127672 markings, 345500 edges, 585 markings/sec, 310 secs
lola: sara is running 315 secs || 130563 markings, 352865 edges, 578 markings/sec, 315 secs
lola: sara is running 320 secs || 133327 markings, 360466 edges, 553 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: ========================================
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: 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 || 2299 markings, 4255 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 875 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: subprocess 14 will run for 1312 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: ========================================
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 || 3826 markings, 7374 edges, 765 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 2620 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 stdout -----
----- Kill lola and sara stderr -----
----- 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-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-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-full"
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 r030-ebro-152646308500383"
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 ;