Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 477K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 100K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 261K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 593K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-PT-V80P50N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309500390
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526838707560


BK_STOP 1526840045667

--------------------
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-V80P50N50 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 94116, 'Memory': 462.8, 'Tool': 'lola'}, {'Time': 95265, 'Memory': 457.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-PT-V80P50N50...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V80P50N50: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V80P50N50 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 8816/65536 symbol table entries, 2413 collisions
lola: preprocessing...
lola: finding significant places
lola: 228 places, 8588 transitions, 221 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9173 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.task
lola: A (G (((SORTI_B + 1 <= ROUTE_B) OR (SUR_PONT_B + 1 <= CHOIX_1 + CHOIX_2)))) : A (G ((((ROUTE_A + 1 <= ROUTE_B) AND (SORTI_B + 1 <= CAPACITE)) OR (CAPACITE <= ROUTE_B)))) : A (G (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80 <= CONTROLEUR_1 + CONTROLEUR_2) OR (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SUR_PONT_A) OR (ATTENTE_B <= SUR_PONT_B) OR (SUR_PONT_A <= SUR_PONT_B)))) : A (G (TRUE)) : A (G (((SORTI_A + 1 <= SORTI_B) OR (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80 <= 2) OR (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= 0) OR ((CONTROLEUR_1 + CONTROLEUR_2 <= VIDANGE_1 + VIDANGE_2) AND (3 <= ATTENTE_B))))) : E (F ((2 <= CHOIX_1 + CHOIX_2))) : E (F (((2 <= ATTENTE_A) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2) AND (2 <= SORTI_B) AND (2 <= ROUTE_A)))) : E (F ((ROUTE_A <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9))) : E (F (((NB_ATTENTE_B_70 + 1 <= NB_ATTENTE_A_32) AND (NB_ATTENTE_A_28 + 1 <= NB_ATTENTE_A_37) AND (NB_ATTENTE_B_11 <= 2)))) : E (F ((COMPTEUR_50 + 1 <= NB_ATTENTE_A_56))) : E (F (((NB_ATTENTE_A_33 + 1 <= NB_ATTENTE_B_68) AND (NB_ATTENTE_B_28 + 1 <= NB_ATTENTE_B_32) AND (NB_ATTENTE_B_20 <= NB_ATTENTE_A_51)))) : E (F (((NB_ATTENTE_B_17 <= 2) AND (NB_ATTENTE_B_14 <= COMPTEUR_32) AND (3 <= NB_ATTENTE_B_62)))) : E (F ((1 <= NB_ATTENTE_B_70))) : E (F ((((NB_ATTENTE_A_59 <= COMPTEUR_43) OR (1 <= NB_ATTENTE_B_61) OR ((1 <= COMPTEUR_14) AND (NB_ATTENTE_B_42 <= NB_ATTENTE_B_70))) AND (NB_ATTENTE_A_36 + 1 <= NB_ATTENTE_A_68)))) : A (G ((NB_ATTENTE_B_57 <= NB_ATTENTE_A_57))) : A (G (((1 <= NB_ATTENTE_B_13) OR (2 <= NB_ATTENTE_A_53) OR (3 <= COMPTEUR_15) OR (NB_ATTENTE_A_63 <= NB_ATTENTE_B_57))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SORTI_B + 1 <= ROUTE_B) OR (SUR_PONT_B + 1 <= CHOIX_1 + CHOIX_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 82 markings, 81 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((ROUTE_A + 1 <= ROUTE_B) AND (SORTI_B + 1 <= CAPACITE)) OR (CAPACITE <= ROUTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 567 markings, 566 edges, 113 markings/sec, 0 secs
lola: sara is running 5 secs || 891 markings, 1172 edges, 65 markings/sec, 5 secs
lola: sara is running 10 secs || 1154 markings, 1765 edges, 53 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1385 markings, 2284 edges, 46 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 228 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SORTI_A + 1 <= SORTI_B) OR (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CHOIX_1 + CHOIX_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 763 markings, 875 edges, 153 markings/sec, 0 secs
lola: sara is running 5 secs || 1048 markings, 1521 edges, 57 markings/sec, 5 secs
lola: sara is running 10 secs || 1474 markings, 2447 edges, 85 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1793 markings, 3180 edges, 64 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= ATTENTE_A) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2) AND (2 <= SORTI_B) AND (2 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 1241 markings, 1267 edges, 248 markings/sec, 0 secs
lola: sara is running 5 secs || 1909 markings, 2277 edges, 134 markings/sec, 5 secs
lola: sara is running 10 secs || 2455 markings, 3203 edges, 109 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 3040 markings, 4204 edges, 117 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_A <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_B_70 + 1 <= NB_ATTENTE_A_32) AND (NB_ATTENTE_A_28 + 1 <= NB_ATTENTE_A_37) AND (NB_ATTENTE_B_11 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 1855 markings, 2305 edges, 371 markings/sec, 0 secs
lola: sara is running 5 secs || 6747 markings, 10346 edges, 978 markings/sec, 5 secs
lola: sara is running 10 secs || 11627 markings, 18476 edges, 976 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 16534 markings, 26768 edges, 981 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((COMPTEUR_50 + 1 <= NB_ATTENTE_A_56)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 707 markings, 706 edges, 141 markings/sec, 0 secs
lola: sara is running 5 secs || 1057 markings, 1401 edges, 70 markings/sec, 5 secs
lola: sara is running 10 secs || 1365 markings, 2107 edges, 62 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1681 markings, 2803 edges, 63 markings/sec, 15 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_A_33 + 1 <= NB_ATTENTE_B_68) AND (NB_ATTENTE_B_28 + 1 <= NB_ATTENTE_B_32) AND (NB_ATTENTE_B_20 <= NB_ATTENTE_A_51))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 325 markings, 334 edges, 65 markings/sec, 0 secs
lola: sara is running 5 secs || 811 markings, 993 edges, 97 markings/sec, 5 secs
lola: sara is running 10 secs || 1219 markings, 1673 edges, 82 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1630 markings, 2357 edges, 82 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_B_17 <= 2) AND (NB_ATTENTE_B_14 <= COMPTEUR_32) AND (3 <= NB_ATTENTE_B_62))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 462 markings, 477 edges, 92 markings/sec, 0 secs
lola: sara is running 5 secs || 902 markings, 1161 edges, 88 markings/sec, 5 secs
lola: sara is running 10 secs || 1313 markings, 1845 edges, 82 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 15 secs || 1724 markings, 2530 edges, 82 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 845 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= NB_ATTENTE_B_70)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 75 markings, 74 edges
lola: ========================================
lola: subprocess 13 will run for 1126 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NB_ATTENTE_A_59 <= COMPTEUR_43) OR (1 <= NB_ATTENTE_B_61) OR ((1 <= COMPTEUR_14) AND (NB_ATTENTE_B_42 <= NB_ATTENTE_B_70))) AND (NB_ATTENTE_A_36 + 1 <= NB_ATTENTE_A_68))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 426 markings, 498 edges, 85 markings/sec, 0 secs
lola: sara is running 5 secs || 686 markings, 888 edges, 52 markings/sec, 5 secs
lola: sara is running 10 secs || 948 markings, 1281 edges, 52 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 1350 markings, 1984 edges, 80 markings/sec, 15 secs
lola: sara is running 20 secs || 1599 markings, 2605 edges, 50 markings/sec, 20 secs
lola: sara is running 25 secs || 1848 markings, 3229 edges, 50 markings/sec, 25 secs
lola: sara is running 30 secs || 2138 markings, 3975 edges, 58 markings/sec, 30 secs
lola: sara is running 35 secs || 6369 markings, 10217 edges, 846 markings/sec, 35 secs
lola: sara is running 40 secs || 11800 markings, 19290 edges, 1086 markings/sec, 40 secs
lola: sara is running 45 secs || 17232 markings, 28428 edges, 1086 markings/sec, 45 secs
lola: sara is running 50 secs || 22669 markings, 37564 edges, 1087 markings/sec, 50 secs
lola: sara is running 55 secs || 28107 markings, 46067 edges, 1088 markings/sec, 55 secs
lola: sara is running 60 secs || 33554 markings, 55008 edges, 1089 markings/sec, 60 secs
lola: sara is running 65 secs || 38990 markings, 64035 edges, 1087 markings/sec, 65 secs
lola: sara is running 70 secs || 44428 markings, 73044 edges, 1088 markings/sec, 70 secs
lola: sara is running 75 secs || 49852 markings, 82194 edges, 1085 markings/sec, 75 secs
lola: sara is running 80 secs || 55282 markings, 91466 edges, 1086 markings/sec, 80 secs
lola: sara is running 85 secs || 60697 markings, 100549 edges, 1083 markings/sec, 85 secs
lola: sara is running 90 secs || 66112 markings, 109824 edges, 1083 markings/sec, 90 secs
lola: sara is running 95 secs || 71530 markings, 118890 edges, 1084 markings/sec, 95 secs
lola: sara is running 100 secs || 76955 markings, 128169 edges, 1085 markings/sec, 100 secs
lola: sara is running 105 secs || 82372 markings, 137431 edges, 1083 markings/sec, 105 secs
lola: sara is running 110 secs || 87789 markings, 146688 edges, 1083 markings/sec, 110 secs
lola: sara is running 115 secs || 93097 markings, 155751 edges, 1062 markings/sec, 115 secs
lola: sara is running 120 secs || 98468 markings, 164921 edges, 1074 markings/sec, 120 secs
lola: sara is running 125 secs || 103894 markings, 174183 edges, 1085 markings/sec, 125 secs
lola: sara is running 130 secs || 109331 markings, 183459 edges, 1087 markings/sec, 130 secs
lola: sara is running 135 secs || 114798 markings, 192785 edges, 1093 markings/sec, 135 secs
lola: sara is running 140 secs || 120278 markings, 202129 edges, 1096 markings/sec, 140 secs
lola: sara is running 145 secs || 125764 markings, 211479 edges, 1097 markings/sec, 145 secs
lola: sara is running 150 secs || 131241 markings, 220890 edges, 1095 markings/sec, 150 secs
lola: sara is running 155 secs || 136721 markings, 230399 edges, 1096 markings/sec, 155 secs
lola: sara is running 160 secs || 142201 markings, 239731 edges, 1096 markings/sec, 160 secs
lola: sara is running 165 secs || 147684 markings, 249065 edges, 1097 markings/sec, 165 secs
lola: sara is running 170 secs || 153168 markings, 258422 edges, 1097 markings/sec, 170 secs
lola: sara is running 175 secs || 158654 markings, 267997 edges, 1097 markings/sec, 175 secs
lola: sara is running 180 secs || 164146 markings, 277338 edges, 1098 markings/sec, 180 secs
lola: sara is running 185 secs || 169634 markings, 286668 edges, 1098 markings/sec, 185 secs
lola: sara is running 190 secs || 175118 markings, 296265 edges, 1097 markings/sec, 190 secs
lola: sara is running 195 secs || 180610 markings, 305598 edges, 1098 markings/sec, 195 secs
lola: sara is running 200 secs || 186101 markings, 314929 edges, 1098 markings/sec, 200 secs
lola: sara is running 205 secs || 191584 markings, 324520 edges, 1097 markings/sec, 205 secs
lola: sara is running 210 secs || 197076 markings, 333845 edges, 1098 markings/sec, 210 secs
lola: sara is running 215 secs || 202536 markings, 343400 edges, 1092 markings/sec, 215 secs
lola: sara is running 220 secs || 208018 markings, 352704 edges, 1096 markings/sec, 220 secs
lola: sara is running 225 secs || 213501 markings, 362105 edges, 1097 markings/sec, 225 secs
lola: sara is running 230 secs || 218972 markings, 371579 edges, 1094 markings/sec, 230 secs
lola: sara is running 235 secs || 224459 markings, 380883 edges, 1097 markings/sec, 235 secs
lola: sara is running 240 secs || 229934 markings, 390465 edges, 1095 markings/sec, 240 secs
lola: sara is running 245 secs || 235416 markings, 399756 edges, 1096 markings/sec, 245 secs
lola: sara is running 250 secs || 240891 markings, 409337 edges, 1095 markings/sec, 250 secs
lola: sara is running 255 secs || 246373 markings, 418624 edges, 1096 markings/sec, 255 secs
lola: sara is running 260 secs || 251850 markings, 428210 edges, 1095 markings/sec, 260 secs
lola: sara is running 265 secs || 257330 markings, 437490 edges, 1096 markings/sec, 265 secs
lola: sara is running 270 secs || 262806 markings, 447073 edges, 1095 markings/sec, 270 secs
lola: sara is running 275 secs || 268289 markings, 456353 edges, 1097 markings/sec, 275 secs
lola: sara is running 280 secs || 273767 markings, 465940 edges, 1096 markings/sec, 280 secs
lola: sara is running 285 secs || 279223 markings, 473776 edges, 1091 markings/sec, 285 secs
lola: sara is running 290 secs || 284437 markings, 481228 edges, 1043 markings/sec, 290 secs
lola: sara is running 295 secs || 287228 markings, 486596 edges, 558 markings/sec, 295 secs
lola: sara is running 300 secs || 287926 markings, 487643 edges, 140 markings/sec, 300 secs
lola: sara is running 305 secs || 288648 markings, 488700 edges, 144 markings/sec, 305 secs
lola: sara is running 310 secs || 293540 markings, 496160 edges, 978 markings/sec, 310 secs
lola: sara is running 315 secs || 298939 markings, 505152 edges, 1080 markings/sec, 315 secs
lola: sara is running 320 secs || 304337 markings, 514214 edges, 1080 markings/sec, 320 secs
lola: sara is running 325 secs || 309773 markings, 523055 edges, 1087 markings/sec, 325 secs
lola: sara is running 330 secs || 315251 markings, 531743 edges, 1096 markings/sec, 330 secs
lola: sara is running 335 secs || 320710 markings, 540835 edges, 1092 markings/sec, 335 secs
lola: sara is running 340 secs || 326175 markings, 549900 edges, 1093 markings/sec, 340 secs
lola: sara is running 345 secs || 331637 markings, 559106 edges, 1092 markings/sec, 345 secs
lola: sara is running 350 secs || 337112 markings, 568320 edges, 1095 markings/sec, 350 secs
lola: sara is running 355 secs || 342555 markings, 577646 edges, 1089 markings/sec, 355 secs
lola: sara is running 360 secs || 348000 markings, 586792 edges, 1089 markings/sec, 360 secs
lola: sara is running 365 secs || 353444 markings, 596117 edges, 1089 markings/sec, 365 secs
lola: sara is running 370 secs || 358888 markings, 605228 edges, 1089 markings/sec, 370 secs
lola: sara is running 375 secs || 364350 markings, 614573 edges, 1092 markings/sec, 375 secs
lola: sara is running 380 secs || 369825 markings, 623935 edges, 1095 markings/sec, 380 secs
lola: sara is running 385 secs || 375308 markings, 633309 edges, 1097 markings/sec, 385 secs
lola: sara is running 390 secs || 380794 markings, 642684 edges, 1097 markings/sec, 390 secs
lola: sara is running 395 secs || 386252 markings, 652005 edges, 1092 markings/sec, 395 secs
lola: sara is running 400 secs || 391734 markings, 661365 edges, 1096 markings/sec, 400 secs
lola: sara is running 405 secs || 397201 markings, 670693 edges, 1093 markings/sec, 405 secs
lola: sara is running 410 secs || 402668 markings, 680019 edges, 1093 markings/sec, 410 secs
lola: sara is running 415 secs || 408106 markings, 689290 edges, 1088 markings/sec, 415 secs
lola: sara is running 420 secs || 413598 markings, 698651 edges, 1098 markings/sec, 420 secs
lola: sara is running 425 secs || 419088 markings, 708258 edges, 1098 markings/sec, 425 secs
lola: sara is running 430 secs || 424580 markings, 717615 edges, 1098 markings/sec, 430 secs
lola: sara is running 435 secs || 430074 markings, 726972 edges, 1099 markings/sec, 435 secs
lola: sara is running 440 secs || 435511 markings, 736224 edges, 1087 markings/sec, 440 secs
lola: sara is running 445 secs || 440983 markings, 745800 edges, 1094 markings/sec, 445 secs
lola: sara is running 450 secs || 446463 markings, 755124 edges, 1096 markings/sec, 450 secs
lola: sara is running 455 secs || 451946 markings, 764450 edges, 1097 markings/sec, 455 secs
lola: sara is running 460 secs || 457254 markings, 773739 edges, 1062 markings/sec, 460 secs
lola: sara is running 465 secs || 462668 markings, 782939 edges, 1083 markings/sec, 465 secs
lola: sara is running 470 secs || 467949 markings, 791905 edges, 1056 markings/sec, 470 secs
lola: sara is running 475 secs || 473330 markings, 801320 edges, 1076 markings/sec, 475 secs
lola: sara is running 480 secs || 478684 markings, 810407 edges, 1071 markings/sec, 480 secs
lola: sara is running 485 secs || 484055 markings, 819718 edges, 1074 markings/sec, 485 secs
lola: sara is running 490 secs || 489396 markings, 828867 edges, 1068 markings/sec, 490 secs
lola: sara is running 495 secs || 494854 markings, 838129 edges, 1092 markings/sec, 495 secs
lola: sara is running 500 secs || 500306 markings, 847670 edges, 1090 markings/sec, 500 secs
lola: sara is running 505 secs || 505486 markings, 856441 edges, 1036 markings/sec, 505 secs
lola: sara is running 510 secs || 510941 markings, 865986 edges, 1091 markings/sec, 510 secs
lola: sara is running 515 secs || 516401 markings, 875243 edges, 1092 markings/sec, 515 secs
lola: sara is running 520 secs || 521858 markings, 884794 edges, 1091 markings/sec, 520 secs
lola: sara is running 525 secs || 527292 markings, 894001 edges, 1087 markings/sec, 525 secs
lola: sara is running 530 secs || 532715 markings, 903491 edges, 1085 markings/sec, 530 secs
lola: sara is running 535 secs || 538054 markings, 912529 edges, 1068 markings/sec, 535 secs
lola: sara is running 540 secs || 543361 markings, 921815 edges, 1061 markings/sec, 540 secs
lola: sara is running 545 secs || 548701 markings, 930852 edges, 1068 markings/sec, 545 secs
lola: sara is running 550 secs || 553994 markings, 940114 edges, 1059 markings/sec, 550 secs
lola: sara is running 555 secs || 559448 markings, 947050 edges, 1091 markings/sec, 555 secs
lola: sara is running 560 secs || 564299 markings, 955043 edges, 970 markings/sec, 560 secs
lola: sara is running 565 secs || 566284 markings, 958711 edges, 397 markings/sec, 565 secs
lola: sara is running 570 secs || 566938 markings, 959692 edges, 131 markings/sec, 570 secs
lola: sara is running 575 secs || 567986 markings, 961009 edges, 210 markings/sec, 575 secs
lola: sara is running 580 secs || 573383 markings, 969617 edges, 1079 markings/sec, 580 secs
lola: sara is running 585 secs || 578766 markings, 978575 edges, 1077 markings/sec, 585 secs
lola: sara is running 590 secs || 584244 markings, 987814 edges, 1096 markings/sec, 590 secs
lola: sara is running 595 secs || 589731 markings, 996320 edges, 1097 markings/sec, 595 secs
lola: sara is running 600 secs || 595214 markings, 1005351 edges, 1097 markings/sec, 600 secs
lola: sara is running 605 secs || 600688 markings, 1014456 edges, 1095 markings/sec, 605 secs
lola: sara is running 610 secs || 606169 markings, 1023711 edges, 1096 markings/sec, 610 secs
lola: sara is running 615 secs || 611650 markings, 1032952 edges, 1096 markings/sec, 615 secs
lola: sara is running 620 secs || 617139 markings, 1042189 edges, 1098 markings/sec, 620 secs
lola: sara is running 625 secs || 621996 markings, 1050499 edges, 971 markings/sec, 625 secs
lola: sara is running 630 secs || 626746 markings, 1058420 edges, 950 markings/sec, 630 secs
lola: sara is running 635 secs || 631879 markings, 1067200 edges, 1027 markings/sec, 635 secs
lola: sara is running 640 secs || 637314 markings, 1076506 edges, 1087 markings/sec, 640 secs
lola: sara is running 645 secs || 642755 markings, 1085724 edges, 1088 markings/sec, 645 secs
lola: sara is running 650 secs || 648180 markings, 1094879 edges, 1085 markings/sec, 650 secs
lola: sara is running 655 secs || 653601 markings, 1104143 edges, 1084 markings/sec, 655 secs
lola: sara is running 660 secs || 658880 markings, 1113156 edges, 1056 markings/sec, 660 secs
lola: sara is running 665 secs || 664297 markings, 1122405 edges, 1083 markings/sec, 665 secs
lola: sara is running 670 secs || 669720 markings, 1131662 edges, 1085 markings/sec, 670 secs
lola: sara is running 675 secs || 675146 markings, 1140916 edges, 1085 markings/sec, 675 secs
lola: sara is running 680 secs || 680537 markings, 1150353 edges, 1078 markings/sec, 680 secs
lola: sara is running 685 secs || 685940 markings, 1159567 edges, 1081 markings/sec, 685 secs
lola: sara is running 690 secs || 691408 markings, 1168890 edges, 1094 markings/sec, 690 secs
lola: sara is running 695 secs || 696879 markings, 1178214 edges, 1094 markings/sec, 695 secs
lola: sara is running 700 secs || 702350 markings, 1187535 edges, 1094 markings/sec, 700 secs
lola: sara is running 705 secs || 707820 markings, 1197107 edges, 1094 markings/sec, 705 secs
lola: sara is running 710 secs || 713290 markings, 1206422 edges, 1094 markings/sec, 710 secs
lola: sara is running 715 secs || 718768 markings, 1215746 edges, 1096 markings/sec, 715 secs
lola: sara is running 720 secs || 724246 markings, 1225067 edges, 1096 markings/sec, 720 secs
lola: sara is running 725 secs || 729696 markings, 1234604 edges, 1090 markings/sec, 725 secs
lola: sara is running 730 secs || 735164 markings, 1243903 edges, 1094 markings/sec, 730 secs
lola: sara is running 735 secs || 740629 markings, 1253192 edges, 1093 markings/sec, 735 secs
lola: sara is running 740 secs || 746090 markings, 1262750 edges, 1092 markings/sec, 740 secs
lola: sara is running 745 secs || 751564 markings, 1272051 edges, 1095 markings/sec, 745 secs
lola: sara is running 750 secs || 757054 markings, 1281599 edges, 1098 markings/sec, 750 secs
lola: sara is running 755 secs || 762543 markings, 1290982 edges, 1098 markings/sec, 755 secs
lola: sara is running 760 secs || 768042 markings, 1300320 edges, 1100 markings/sec, 760 secs
lola: sara is running 765 secs || 773530 markings, 1309924 edges, 1098 markings/sec, 765 secs
lola: sara is running 770 secs || 779028 markings, 1319255 edges, 1100 markings/sec, 770 secs
lola: sara is running 775 secs || 784521 markings, 1328867 edges, 1099 markings/sec, 775 secs
lola: sara is running 780 secs || 790014 markings, 1338187 edges, 1099 markings/sec, 780 secs
lola: sara is running 785 secs || 795514 markings, 1347747 edges, 1100 markings/sec, 785 secs
lola: sara is running 790 secs || 800992 markings, 1357100 edges, 1096 markings/sec, 790 secs
lola: sara is running 795 secs || 806498 markings, 1366460 edges, 1101 markings/sec, 795 secs
lola: sara is running 800 secs || 811988 markings, 1376041 edges, 1098 markings/sec, 800 secs
lola: sara is running 805 secs || 817491 markings, 1385365 edges, 1101 markings/sec, 805 secs
lola: sara is running 810 secs || 822980 markings, 1394971 edges, 1098 markings/sec, 810 secs
lola: sara is running 815 secs || 828489 markings, 1403969 edges, 1102 markings/sec, 815 secs
lola: sara is running 820 secs || 833965 markings, 1410644 edges, 1095 markings/sec, 820 secs
lola: sara is running 825 secs || 837568 markings, 1417702 edges, 721 markings/sec, 825 secs
lola: sara is running 830 secs || 838260 markings, 1418740 edges, 138 markings/sec, 830 secs
lola: sara is running 835 secs || 838866 markings, 1419649 edges, 121 markings/sec, 835 secs
lola: sara is running 840 secs || 842957 markings, 1425730 edges, 818 markings/sec, 840 secs
lola: sara is running 845 secs || 848441 markings, 1434853 edges, 1097 markings/sec, 845 secs
lola: sara is running 850 secs || 853928 markings, 1444088 edges, 1097 markings/sec, 850 secs
lola: sara is running 855 secs || 859422 markings, 1452609 edges, 1099 markings/sec, 855 secs
lola: sara is running 860 secs || 864928 markings, 1461678 edges, 1101 markings/sec, 860 secs
lola: sara is running 865 secs || 870430 markings, 1470845 edges, 1100 markings/sec, 865 secs
lola: sara is running 870 secs || 875931 markings, 1480143 edges, 1100 markings/sec, 870 secs
lola: sara is running 875 secs || 881429 markings, 1489410 edges, 1100 markings/sec, 875 secs
lola: sara is running 880 secs || 886927 markings, 1498682 edges, 1100 markings/sec, 880 secs
lola: sara is running 885 secs || 892426 markings, 1507930 edges, 1100 markings/sec, 885 secs
lola: sara is running 890 secs || 897921 markings, 1517351 edges, 1099 markings/sec, 890 secs
lola: sara is running 895 secs || 903414 markings, 1526565 edges, 1099 markings/sec, 895 secs
lola: sara is running 900 secs || 908903 markings, 1535964 edges, 1098 markings/sec, 900 secs
lola: sara is running 905 secs || 914394 markings, 1545364 edges, 1098 markings/sec, 905 secs
lola: sara is running 910 secs || 919884 markings, 1554757 edges, 1098 markings/sec, 910 secs
lola: sara is running 915 secs || 925371 markings, 1564141 edges, 1097 markings/sec, 915 secs
lola: sara is running 920 secs || 930860 markings, 1573485 edges, 1098 markings/sec, 920 secs
lola: sara is running 925 secs || 936360 markings, 1582907 edges, 1100 markings/sec, 925 secs
lola: sara is running 930 secs || 941852 markings, 1592305 edges, 1098 markings/sec, 930 secs
lola: sara is running 935 secs || 947344 markings, 1601682 edges, 1098 markings/sec, 935 secs
lola: sara is running 940 secs || 952836 markings, 1611055 edges, 1098 markings/sec, 940 secs
lola: sara is running 945 secs || 958330 markings, 1620428 edges, 1099 markings/sec, 945 secs
lola: sara is running 950 secs || 963823 markings, 1629794 edges, 1099 markings/sec, 950 secs
lola: sara is running 955 secs || 969308 markings, 1639143 edges, 1097 markings/sec, 955 secs
lola: sara is running 960 secs || 974795 markings, 1648745 edges, 1097 markings/sec, 960 secs
lola: sara is running 965 secs || 980285 markings, 1658098 edges, 1098 markings/sec, 965 secs
lola: sara is running 970 secs || 985777 markings, 1667451 edges, 1098 markings/sec, 970 secs
lola: sara is running 975 secs || 991268 markings, 1676799 edges, 1098 markings/sec, 975 secs
lola: sara is running 980 secs || 996758 markings, 1686407 edges, 1098 markings/sec, 980 secs
lola: sara is running 985 secs || 1002250 markings, 1695752 edges, 1098 markings/sec, 985 secs
lola: sara is running 990 secs || 1007747 markings, 1705101 edges, 1099 markings/sec, 990 secs
lola: sara is running 995 secs || 1013236 markings, 1714707 edges, 1098 markings/sec, 995 secs
lola: sara is running 1000 secs || 1018730 markings, 1724048 edges, 1099 markings/sec, 1000 secs
lola: sara is running 1005 secs || 1024230 markings, 1733395 edges, 1100 markings/sec, 1005 secs
lola: sara is running 1010 secs || 1029718 markings, 1742999 edges, 1098 markings/sec, 1010 secs
lola: sara is running 1015 secs || 1035216 markings, 1752338 edges, 1100 markings/sec, 1015 secs
lola: sara is running 1020 secs || 1040702 markings, 1761939 edges, 1097 markings/sec, 1020 secs
lola: sara is running 1025 secs || 1046157 markings, 1771198 edges, 1091 markings/sec, 1025 secs
lola: sara is running 1030 secs || 1051638 markings, 1780501 edges, 1096 markings/sec, 1030 secs
lola: sara is running 1035 secs || 1056950 markings, 1789797 edges, 1062 markings/sec, 1035 secs
lola: sara is running 1040 secs || 1062336 markings, 1798928 edges, 1077 markings/sec, 1040 secs
lola: sara is running 1045 secs || 1067724 markings, 1808357 edges, 1078 markings/sec, 1045 secs
lola: sara is running 1050 secs || 1073122 markings, 1817506 edges, 1080 markings/sec, 1050 secs
lola: sara is running 1055 secs || 1078516 markings, 1826945 edges, 1079 markings/sec, 1055 secs
lola: sara is running 1060 secs || 1083867 markings, 1836007 edges, 1070 markings/sec, 1060 secs
lola: sara is running 1065 secs || 1089308 markings, 1845529 edges, 1088 markings/sec, 1065 secs
lola: sara is running 1070 secs || 1094791 markings, 1853195 edges, 1097 markings/sec, 1070 secs
lola: sara is running 1075 secs || 1099856 markings, 1860840 edges, 1013 markings/sec, 1075 secs
lola: sara is running 1080 secs || 1102218 markings, 1865302 edges, 472 markings/sec, 1080 secs
lola: sara is running 1085 secs || 1102894 markings, 1866316 edges, 135 markings/sec, 1085 secs
lola: sara is running 1090 secs || 1103614 markings, 1867335 edges, 144 markings/sec, 1090 secs
lola: sara is running 1095 secs || 1109036 markings, 1875723 edges, 1084 markings/sec, 1095 secs
lola: sara is running 1100 secs || 1114512 markings, 1884852 edges, 1095 markings/sec, 1100 secs
lola: sara is running 1105 secs || 1119985 markings, 1893622 edges, 1095 markings/sec, 1105 secs
lola: sara is running 1110 secs || 1125480 markings, 1902453 edges, 1099 markings/sec, 1110 secs
lola: sara is running 1115 secs || 1130900 markings, 1911509 edges, 1084 markings/sec, 1115 secs
lola: sara is running 1120 secs || 1136318 markings, 1920517 edges, 1084 markings/sec, 1120 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1126 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NB_ATTENTE_B_57 <= NB_ATTENTE_A_57)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 15 will run for 2251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= NB_ATTENTE_B_13) OR (2 <= NB_ATTENTE_A_53) OR (3 <= COMPTEUR_15) OR (NB_ATTENTE_A_63 <= NB_ATTENTE_B_57))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 339 markings, 338 edges
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no yes no yes no no yes unknown no no
lola: ========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P50N50"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-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-V80P50N50.tgz
mv BridgeAndVehicles-PT-V80P50N50 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is BridgeAndVehicles-PT-V80P50N50, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r031-ebro-152646309500390"
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 ;