About the Execution of Irma.struct for BridgeAndVehicles-PT-V80P20N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5487.190 | 729309.00 | 740670.00 | 347.00 | ???????????????? | normal |
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 4.7M
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 252K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 728K 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 6.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 124K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 353K 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 47K 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 195K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 568K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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 2.3M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-PT-V80P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309400353
=====================================================================
--------------------
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-V80P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526831942843
BK_STOP 1526832672152
--------------------
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-V80P20N10 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 2655856, 'Memory': 15952.48, 'Tool': 'lola'}, {'Time': 2687312, 'Memory': 15952.86, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V80P20N10...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-PT-V80P20N10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V80P20N10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-PT-V80P20N10 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2296/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: E (G ((E (G ((ATTENTE_B <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80))) OR ((SORTI_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= 2))))) : A (X (A (F (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_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_B) AND (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)))))) : NOT((((1 <= ROUTE_B) OR (2 <= SUR_PONT_A)) AND NOT(E (G ((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 <= CAPACITE)))))) : (((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A))) AND (((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0)) AND A ((TRUE U (3 <= ATTENTE_B))))) : (NOT(E (F (((SORTI_B <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))) OR NOT(A (G ((CHOIX_1 + CHOIX_2 <= 1))))) : E (G (E (((SORTI_B <= 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) U (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_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 <= ATTENTE_A))))) : NOT(((E (G ((SORTI_B <= ROUTE_A))) OR E (X ((2 <= SORTI_B)))) AND ((CONTROLEUR_1 + CONTROLEUR_2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR (1 <= ATTENTE_A)))) : NOT(E (F (((2 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9) AND (3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80) AND (ROUTE_B <= SUR_PONT_B))))) : NOT(A (F (E (X ((2 <= NB_ATTENTE_A_22)))))) : A (X (NOT(E (G ((COMPTEUR_1 <= ROUTE_A)))))) : (A (G (A (X ((2 <= NB_ATTENTE_B_78))))) OR (E (G ((NB_ATTENTE_A_11 <= NB_ATTENTE_B_60))) AND E (G ((NB_ATTENTE_B_5 <= 0))))) : A (X (NOT(E (G ((NB_ATTENTE_B_12 <= NB_ATTENTE_B_61)))))) : E (G ((A (F ((2 <= NB_ATTENTE_A_42))) OR ((NB_ATTENTE_B_68 <= NB_ATTENTE_B_9) AND (1 <= NB_ATTENTE_B_9) AND ((2 <= NB_ATTENTE_B_62) OR (NB_ATTENTE_B_63 <= NB_ATTENTE_A_24)))))) : A ((((3 <= NB_ATTENTE_A_53) AND (3 <= NB_ATTENTE_A_21) AND ((2 <= NB_ATTENTE_B_44) OR (NB_ATTENTE_B_45 <= NB_ATTENTE_A_38))) U A (F ((2 <= NB_ATTENTE_B_52))))) : ((E (((1 <= NB_ATTENTE_A_13) U (NB_ATTENTE_B_15 <= NB_ATTENTE_B_29))) AND ((NB_ATTENTE_A_41 + 1 <= NB_ATTENTE_A_69) AND (NB_ATTENTE_A_48 <= 1) AND ((NB_ATTENTE_A_67 <= 2) OR (NB_ATTENTE_A_11 + 1 <= NB_ATTENTE_B_53)))) OR A (F ((2 <= NB_ATTENTE_B_1)))) : A (G ((NB_ATTENTE_A_30 <= NB_ATTENTE_B_21)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((ATTENTE_B <= 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_AT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A(TRUE U (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTEN... (shortened)
lola: processed formula length: 1557
lola: 6 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2885 markings, 6852 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + ... (shortened)
lola: processed formula length: 2934
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 278404 markings, 1021402 edges, 3689329903141912576 markings/sec, 0 secs
lola: 550966 markings, 2031326 edges, 54512 markings/sec, 5 secs
lola: 854843 markings, 3004359 edges, 60775 markings/sec, 10 secs
lola: 1193096 markings, 3909338 edges, 67651 markings/sec, 15 secs
lola: 1456516 markings, 4752688 edges, 52684 markings/sec, 20 secs
lola: 1723147 markings, 5725818 edges, 53326 markings/sec, 25 secs
lola: 1989968 markings, 6690852 edges, 53364 markings/sec, 30 secs
lola: 2254051 markings, 7650720 edges, 52817 markings/sec, 35 secs
lola: 2506785 markings, 8535653 edges, 50547 markings/sec, 40 secs
lola: 2767492 markings, 9453293 edges, 52141 markings/sec, 45 secs
lola: 3037656 markings, 10388595 edges, 54033 markings/sec, 50 secs
lola: 3307646 markings, 11308550 edges, 53998 markings/sec, 55 secs
lola: 3568355 markings, 12203251 edges, 52142 markings/sec, 60 secs
lola: 3859300 markings, 13141062 edges, 58189 markings/sec, 65 secs
lola: 4140855 markings, 14072104 edges, 56311 markings/sec, 70 secs
lola: 4440037 markings, 14994873 edges, 59836 markings/sec, 75 secs
lola: 4739904 markings, 15921640 edges, 59973 markings/sec, 80 secs
lola: 5053080 markings, 16836863 edges, 62635 markings/sec, 85 secs
lola: 5375341 markings, 17752569 edges, 64452 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5568617 markings, 18255536 edges
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((1 <= ROUTE_B) OR (2 <= SUR_PONT_A)) AND NOT(E (G ((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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ROUTE_B <= 0) AND (SUR_PONT_A <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ROUTE_B <= 0) AND (SUR_PONT_A <= 1))
lola: processed formula length: 38
lola: 8 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (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... (shortened)
lola: processed formula length: 1478
lola: 10 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 674 markings, 673 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A))) AND (((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0)) AND A ((TRUE U (3 <= ATTENTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (ROUTE_B + 1 <= VIDANGE_1 + VIDANGE_2) OR ((SUR_PONT_B <= 2) AND (SUR_PONT_A <= 1)) OR ((2 <= ROUTE_B) AND (ROUTE_A <= SORTI_A)))
lola: processed formula length: 171
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((VIDANGE_1 + VIDANGE_2 <= 1) OR (CHOIX_1 + CHOIX_2 <= 0) OR ((SORTI_B <= ATTENTE_B) AND (3 <= VIDANGE_1 + VIDANGE_2)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 0))
lola: processed formula length: 160
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= ATTENTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 728 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 890 markings, 890 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((SORTI_B <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))) OR NOT(A (G ((CHOIX_1 + CHOIX_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= SORTI_B))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CHOIX_1 + CHOIX_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P20N10-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P20N10-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((SORTI_B <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((SORTI_B <= 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 + N... (shortened)
lola: processed formula length: 2944
lola: 2 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 255892 markings, 864153 edges, 2977822184912715776 markings/sec, 0 secs
lola: 503922 markings, 1717758 edges, 49606 markings/sec, 5 secs
lola: 748513 markings, 2565124 edges, 48918 markings/sec, 10 secs
lola: 988107 markings, 3396742 edges, 47919 markings/sec, 15 secs
lola: 1226645 markings, 4224778 edges, 47708 markings/sec, 20 secs
lola: 1452203 markings, 5107868 edges, 45112 markings/sec, 25 secs
lola: 1667651 markings, 6043883 edges, 43090 markings/sec, 30 secs
lola: 1876912 markings, 6959877 edges, 41852 markings/sec, 35 secs
lola: 2090171 markings, 7895150 edges, 42652 markings/sec, 40 secs
lola: 2302893 markings, 8831215 edges, 42544 markings/sec, 45 secs
lola: 2506673 markings, 9728295 edges, 40756 markings/sec, 50 secs
lola: 2716459 markings, 10638778 edges, 41957 markings/sec, 55 secs
lola: 2930317 markings, 11566203 edges, 42772 markings/sec, 60 secs
lola: 3143326 markings, 12498058 edges, 42602 markings/sec, 65 secs
lola: 3356396 markings, 13433186 edges, 42614 markings/sec, 70 secs
lola: 3569360 markings, 14372457 edges, 42593 markings/sec, 75 secs
lola: 3777396 markings, 15289015 edges, 41607 markings/sec, 80 secs
lola: 3978473 markings, 16169315 edges, 40215 markings/sec, 85 secs
lola: 4187088 markings, 17071346 edges, 41723 markings/sec, 90 secs
lola: 4400562 markings, 18005675 edges, 42695 markings/sec, 95 secs
lola: 4613877 markings, 18941205 edges, 42663 markings/sec, 100 secs
lola: 4826296 markings, 19876360 edges, 42484 markings/sec, 105 secs
lola: 5037340 markings, 20807583 edges, 42209 markings/sec, 110 secs
lola: 5247193 markings, 21735843 edges, 41971 markings/sec, 115 secs
lola: 5461861 markings, 22661105 edges, 42934 markings/sec, 120 secs
lola: 5675139 markings, 23595003 edges, 42656 markings/sec, 125 secs
lola: 5888115 markings, 24531671 edges, 42595 markings/sec, 130 secs
lola: 6099972 markings, 25465838 edges, 42371 markings/sec, 135 secs
lola: 6310298 markings, 26394219 edges, 42065 markings/sec, 140 secs
lola: 6517535 markings, 27309735 edges, 41447 markings/sec, 145 secs
lola: 6729306 markings, 28226809 edges, 42354 markings/sec, 150 secs
lola: 6939903 markings, 29149949 edges, 42119 markings/sec, 155 secs
lola: 7150124 markings, 30075718 edges, 42044 markings/sec, 160 secs
lola: 7358696 markings, 30995739 edges, 41714 markings/sec, 165 secs
lola: 7567684 markings, 31918278 edges, 41798 markings/sec, 170 secs
lola: 7774573 markings, 32834298 edges, 41378 markings/sec, 175 secs
lola: 7985672 markings, 33751885 edges, 42220 markings/sec, 180 secs
lola: 8192397 markings, 34659511 edges, 41345 markings/sec, 185 secs
lola: 8402426 markings, 35584459 edges, 42006 markings/sec, 190 secs
lola: 8613211 markings, 36514689 edges, 42157 markings/sec, 195 secs
lola: 8823384 markings, 37444144 edges, 42035 markings/sec, 200 secs
lola: 9024978 markings, 38336059 edges, 40319 markings/sec, 205 secs
lola: 9232512 markings, 39243484 edges, 41507 markings/sec, 210 secs
lola: 9445224 markings, 40177673 edges, 42542 markings/sec, 215 secs
lola: 9657044 markings, 41111309 edges, 42364 markings/sec, 220 secs
lola: 9867558 markings, 42041100 edges, 42103 markings/sec, 225 secs
lola: 10078016 markings, 42972801 edges, 42092 markings/sec, 230 secs
lola: 10286418 markings, 43895747 edges, 41680 markings/sec, 235 secs
lola: 10498579 markings, 44826488 edges, 42432 markings/sec, 240 secs
lola: 10712518 markings, 45767564 edges, 42788 markings/sec, 245 secs
lola: 10925331 markings, 46706443 edges, 42563 markings/sec, 250 secs
lola: 11136796 markings, 47642439 edges, 42293 markings/sec, 255 secs
lola: 11347949 markings, 48578082 edges, 42231 markings/sec, 260 secs
lola: 11557720 markings, 49508179 edges, 41954 markings/sec, 265 secs
lola: 11770156 markings, 50441821 edges, 42487 markings/sec, 270 secs
lola: 11983795 markings, 51382614 edges, 42728 markings/sec, 275 secs
lola: 12196780 markings, 52324849 edges, 42597 markings/sec, 280 secs
lola: 12405179 markings, 53248130 edges, 41680 markings/sec, 285 secs
lola: 12616008 markings, 54183021 edges, 42166 markings/sec, 290 secs
lola: 12825655 markings, 55113605 edges, 41929 markings/sec, 295 secs
lola: 13039403 markings, 56034597 edges, 42750 markings/sec, 300 secs
lola: 13253610 markings, 56961958 edges, 42841 markings/sec, 305 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 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((SORTI_B <= ROUTE_A))) OR E (X ((2 <= SORTI_B)))) AND ((CONTROLEUR_1 + CONTROLEUR_2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR (1 <= ATTENTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ROUTE_A + 1 <= SORTI_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ROUTE_A + 1 <= SORTI_B)))
lola: processed formula: A (F ((ROUTE_A + 1 <= SORTI_B)))
lola: processed formula length: 32
lola: 9 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 728 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 5451 markings, 8048 edges, 1090 markings/sec, 0 secs
lola: 16310 markings, 34489 edges, 2172 markings/sec, 5 secs
lola: 26795 markings, 62987 edges, 2097 markings/sec, 10 secs
lola: 37013 markings, 92400 edges, 2044 markings/sec, 15 secs
lola: 46779 markings, 121512 edges, 1953 markings/sec, 20 secs
lola: 56139 markings, 149982 edges, 1872 markings/sec, 25 secs
lola: 65185 markings, 177841 edges, 1809 markings/sec, 30 secs
lola: 73986 markings, 205172 edges, 1760 markings/sec, 35 secs
lola: 82626 markings, 232263 edges, 1728 markings/sec, 40 secs
lola: 91380 markings, 260097 edges, 1751 markings/sec, 45 secs
lola: 100907 markings, 284100 edges, 1905 markings/sec, 50 secs
lola: 112882 markings, 311115 edges, 2395 markings/sec, 55 secs
lola: 128088 markings, 330808 edges, 3041 markings/sec, 60 secs
lola: 144815 markings, 352005 edges, 3345 markings/sec, 65 secs
lola: 158103 markings, 374052 edges, 2658 markings/sec, 70 secs
lola: 167605 markings, 401451 edges, 1900 markings/sec, 75 secs
lola: 181019 markings, 427976 edges, 2683 markings/sec, 80 secs
lola: 196243 markings, 448622 edges, 3045 markings/sec, 85 secs
lola: 212087 markings, 470141 edges, 3169 markings/sec, 90 secs
lola: 223358 markings, 495671 edges, 2254 markings/sec, 95 secs
lola: 234994 markings, 523188 edges, 2327 markings/sec, 100 secs
lola: 247551 markings, 549772 edges, 2511 markings/sec, 105 secs
lola: 259191 markings, 577703 edges, 2328 markings/sec, 110 secs
lola: 268764 markings, 605938 edges, 1915 markings/sec, 115 secs
lola: 284276 markings, 631163 edges, 3102 markings/sec, 120 secs
lola: 300033 markings, 652579 edges, 3151 markings/sec, 125 secs
lola: 314053 markings, 675137 edges, 2804 markings/sec, 130 secs
lola: 325606 markings, 702395 edges, 2311 markings/sec, 135 secs
lola: 337301 markings, 730208 edges, 2339 markings/sec, 140 secs
lola: 351509 markings, 757678 edges, 2842 markings/sec, 145 secs
lola: 362516 markings, 786316 edges, 2201 markings/sec, 150 secs
lola: 373835 markings, 815566 edges, 2264 markings/sec, 155 secs
lola: 385839 markings, 844828 edges, 2401 markings/sec, 160 secs
lola: 399504 markings, 876733 edges, 2733 markings/sec, 165 secs
lola: 408908 markings, 905092 edges, 1881 markings/sec, 170 secs
lola: 421013 markings, 934969 edges, 2421 markings/sec, 175 secs
lola: 436626 markings, 956203 edges, 3123 markings/sec, 180 secs
lola: 452581 markings, 977831 edges, 3191 markings/sec, 185 secs
lola: 464493 markings, 1003180 edges, 2382 markings/sec, 190 secs
lola: 476033 markings, 1030432 edges, 2308 markings/sec, 195 secs
lola: 488662 markings, 1057428 edges, 2526 markings/sec, 200 secs
lola: 501852 markings, 1087143 edges, 2638 markings/sec, 205 secs
lola: 512814 markings, 1115632 edges, 2192 markings/sec, 210 secs
lola: 523902 markings, 1144177 edges, 2218 markings/sec, 215 secs
lola: 539626 markings, 1179325 edges, 3145 markings/sec, 220 secs
lola: 550051 markings, 1207440 edges, 2085 markings/sec, 225 secs
lola: 560726 markings, 1236914 edges, 2135 markings/sec, 230 secs
lola: 571409 markings, 1266463 edges, 2137 markings/sec, 235 secs
lola: 583668 markings, 1297962 edges, 2452 markings/sec, 240 secs
lola: 598392 markings, 1333454 edges, 2945 markings/sec, 245 secs
lola: 607656 markings, 1361742 edges, 1853 markings/sec, 250 secs
lola: 618240 markings, 1393420 edges, 2117 markings/sec, 255 secs
lola: 633375 markings, 1415531 edges, 3027 markings/sec, 260 secs
lola: 649514 markings, 1437527 edges, 3228 markings/sec, 265 secs
lola: 662844 markings, 1462609 edges, 2666 markings/sec, 270 secs
lola: 673943 markings, 1488621 edges, 2220 markings/sec, 275 secs
lola: 686253 markings, 1516145 edges, 2462 markings/sec, 280 secs
lola: 700127 markings, 1546111 edges, 2775 markings/sec, 285 secs
lola: 711264 markings, 1574855 edges, 2227 markings/sec, 290 secs
lola: 722258 markings, 1603456 edges, 2199 markings/sec, 295 secs
lola: 736072 markings, 1635522 edges, 2763 markings/sec, 300 secs
lola: 748443 markings, 1666776 edges, 2474 markings/sec, 305 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
Aborted (core dumped)
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-15 CANNOT_COMPUTE 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-V80P20N10"
export BK_EXAMINATION="CTLCardinality"
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-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 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-V80P20N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r031-ebro-152646309400353"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;