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 2.3M
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 205K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 72K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K 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 1.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-PT-V50P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312400311
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527028723855


BK_STOP 1527029323300

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V50P20N10 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': 2060437, 'Memory': 14463.34, 'Tool': 'lola'}, {'Time': 2062503, 'Memory': 13843.29, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V50P20N10...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V50P20N10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V50P20N10 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: NOT(E (((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) U ((3 <= SORTI_B) AND (2 <= SUR_PONT_A))))) : (A (F ((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_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 <= SUR_PONT_B))) OR (2 <= VIDANGE_1 + VIDANGE_2)) : E (X ((A (F ((1 <= SORTI_B))) OR E (X ((2 <= SUR_PONT_A)))))) : NOT((A (G (((3 <= SUR_PONT_A) OR (CONTROLEUR_1 + CONTROLEUR_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_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 A (((SORTI_A <= ROUTE_A) U (ATTENTE_B <= SUR_PONT_A))))) : E (G (A (((1 <= ROUTE_B) U (ATTENTE_A <= SUR_PONT_A))))) : A (F (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_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 <= 2))))) : A (F (((CAPACITE + 1 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_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 (ATTENTE_A <= 2)))) : NOT(((((3 <= ROUTE_B) OR (SUR_PONT_A <= VIDANGE_1 + VIDANGE_2) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2)) AND (SORTI_B + 1 <= ATTENTE_A)) OR E (F (((1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (1 <= VIDANGE_1 + VIDANGE_2)))))) : E (F (NOT(A (F ((NB_ATTENTE_A_23 <= NB_ATTENTE_B_6)))))) : A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39)))))) : ((3 <= ATTENTE_B) OR (E (F (((NB_ATTENTE_B_1 <= COMPTEUR_7) AND (1 <= NB_ATTENTE_A_42)))) OR ((NB_ATTENTE_B_8 + 1 <= NB_ATTENTE_B_0) AND (ROUTE_B + 1 <= NB_ATTENTE_A_23) AND ((NB_ATTENTE_B_42 <= NB_ATTENTE_B_46) OR (3 <= NB_ATTENTE_A_25) OR ((3 <= NB_ATTENTE_B_8) AND (3 <= NB_ATTENTE_A_35)))))) : E (F (((1 <= NB_ATTENTE_A_45) OR ((NB_ATTENTE_A_1 <= 0) AND (NB_ATTENTE_B_35 + 1 <= NB_ATTENTE_A_41))))) : (A (G (((NB_ATTENTE_A_21 <= NB_ATTENTE_B_1) OR (ROUTE_A <= NB_ATTENTE_A_43) OR ((2 <= NB_ATTENTE_A_23) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_B_36))))) OR ((((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26))) AND E (G ((NB_ATTENTE_A_39 <= NB_ATTENTE_A_42)))) OR E (G ((NB_ATTENTE_B_38 <= NB_ATTENTE_A_50))))) : NOT(E (F (((VIDANGE_1 <= 1) AND (NB_ATTENTE_A_23 + 1 <= NB_ATTENTE_A_18))))) : (((E (G ((CHOIX_1 <= NB_ATTENTE_B_11))) AND ((2 <= NB_ATTENTE_B_24) OR (2 <= NB_ATTENTE_B_21) OR (NB_ATTENTE_A_20 <= NB_ATTENTE_A_35))) AND A (F (((3 <= NB_ATTENTE_A_0) AND (1 <= NB_ATTENTE_B_32))))) OR NOT(E (G ((NB_ATTENTE_A_36 + 1 <= COMPTEUR_0))))) : (E (X (E (X ((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40))))) AND A (F (((NB_ATTENTE_A_30 <= NB_ATTENTE_B_5) AND (NB_ATTENTE_A_13 <= NB_ATTENTE_B_33) AND (COMPTEUR_0 <= NB_ATTENTE_A_8)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) U ((3 <= SORTI_B) AND (2 <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((CHOIX_1 + CHOIX_2 <= ATTENTE_A) R ((SORTI_B <= 2) OR (SUR_PONT_A <= 1))))
lola: processed formula: A (((CHOIX_1 + CHOIX_2 <= ATTENTE_A) R ((SORTI_B <= 2) OR (SUR_PONT_A <= 1))))
lola: processed formula length: 79
lola: 4 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 153 markings, 152 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((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_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((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 LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((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_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 <= SUR_PONT_B)))
lola: processed formula: A (F ((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: processed formula length: 929
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 26227 markings, 38407 edges, 5245 markings/sec, 0 secs
lola: 45136 markings, 67321 edges, 3782 markings/sec, 5 secs
lola: 57083 markings, 85631 edges, 2389 markings/sec, 10 secs
lola: 68987 markings, 103876 edges, 2381 markings/sec, 15 secs
lola: 83056 markings, 125427 edges, 2814 markings/sec, 20 secs
lola: 95840 markings, 145117 edges, 2557 markings/sec, 25 secs
lola: 114256 markings, 173109 edges, 3683 markings/sec, 30 secs
lola: 132329 markings, 199920 edges, 3615 markings/sec, 35 secs
lola: 144747 markings, 219169 edges, 2484 markings/sec, 40 secs
lola: 154034 markings, 233561 edges, 1857 markings/sec, 45 secs
lola: 164370 markings, 249691 edges, 2067 markings/sec, 50 secs
lola: 186576 markings, 283440 edges, 4441 markings/sec, 55 secs
lola: 206166 markings, 313178 edges, 3918 markings/sec, 60 secs
lola: 221788 markings, 336772 edges, 3124 markings/sec, 65 secs
lola: 231688 markings, 352193 edges, 1980 markings/sec, 70 secs
lola: 245872 markings, 374020 edges, 2837 markings/sec, 75 secs
lola: 259075 markings, 394050 edges, 2641 markings/sec, 80 secs
lola: 271761 markings, 413712 edges, 2537 markings/sec, 85 secs
lola: 287280 markings, 437365 edges, 3104 markings/sec, 90 secs
lola: 313309 markings, 476809 edges, 5206 markings/sec, 95 secs
lola: 346353 markings, 526556 edges, 6609 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 347337 markings, 528104 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F ((1 <= SORTI_B))) OR E (X ((2 <= SUR_PONT_A))))))
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: E (X (A (F ((1 <= SORTI_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (1 <= SORTI_B)))
lola: processed formula length: 28
lola: 3 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: 450055 markings, 1317590 edges, 2474375052007571456 markings/sec, 0 secs
lola: 940461 markings, 2374555 edges, 98081 markings/sec, 5 secs
lola: 1435967 markings, 3357310 edges, 99101 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1797730 markings, 4009207 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (((3 <= SUR_PONT_A) OR (CONTROLEUR_1 + CONTROLEUR_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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SUR_PONT_A <= 2) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE... (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 484 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-V50P20N10-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((ROUTE_A + 1 <= SORTI_A) R (SUR_PONT_A + 1 <= ATTENTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((SORTI_A <= ROUTE_A) U (ATTENTE_B <= SUR_PONT_A)))
lola: processed formula length: 56
lola: 11 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((1 <= ROUTE_B) U (ATTENTE_A <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((1 <= ROUTE_B) U (ATTENTE_A <= SUR_PONT_A)))))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 101141 markings, 115270 edges
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (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_ATTENT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (3 <= 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... (shortened)
lola: processed formula length: 937
lola: 3 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: 422 markings, 422 edges
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((CAPACITE + 1 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((CAPACITE + 1 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_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 (ATTENTE_A <= 2))))
lola: processed formula: A (F (((CAPACITE + 1 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 ... (shortened)
lola: processed formula length: 954
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 422 markings, 422 edges
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((3 <= ROUTE_B) OR (SUR_PONT_A <= VIDANGE_1 + VIDANGE_2) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2)) AND (SORTI_B + 1 <= ATTENTE_A)) OR E (F (((1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (1 <= VIDANGE_1 + VIDANGE_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ROUTE_B <= 2) AND (VIDANGE_1 + VIDANGE_2 + 1 <= SUR_PONT_A) AND (3 <= CONTROLEUR_1 + CONTROLEUR_2)) OR (ATTENTE_A <= SORTI_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((ROUTE_B <= 2) AND (VIDANGE_1 + VIDANGE_2 + 1 <= SUR_PONT_A) AND (3 <= CONTROLEUR_1 + CONTROLEUR_2)) OR (ATTENTE_A <= SORTI_B))
lola: processed formula length: 130
lola: 5 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: processed formula with 4 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 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CONTROLEUR_1 + CONTROLEUR_2 <= 0) OR (VIDANGE_1 + VIDANGE_2 <= 0))))
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 484 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-V50P20N10-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (F ((NB_ATTENTE_A_23 <= NB_ATTENTE_B_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (NB_ATTENTE_A_23 <= NB_ATTENTE_B_6))))
lola: processed formula length: 60
lola: 6 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: 328454 markings, 1000447 edges, 3096159597753270272 markings/sec, 0 secs
lola: 637688 markings, 2015714 edges, 61847 markings/sec, 5 secs
lola: 942923 markings, 3018037 edges, 61047 markings/sec, 10 secs
lola: 1260484 markings, 4064860 edges, 63512 markings/sec, 15 secs
lola: 1574450 markings, 5102677 edges, 62793 markings/sec, 20 secs
lola: 1886082 markings, 6133303 edges, 62326 markings/sec, 25 secs
lola: 2195725 markings, 7154647 edges, 61929 markings/sec, 30 secs
lola: 2503470 markings, 8173148 edges, 61549 markings/sec, 35 secs
lola: 2807334 markings, 9176446 edges, 60773 markings/sec, 40 secs
lola: 3112601 markings, 10187185 edges, 61053 markings/sec, 45 secs
lola: 3415059 markings, 11185009 edges, 60492 markings/sec, 50 secs
lola: 3706170 markings, 12150158 edges, 58222 markings/sec, 55 secs
lola: 3995431 markings, 13105800 edges, 57852 markings/sec, 60 secs
lola: 4291528 markings, 14088558 edges, 59219 markings/sec, 65 secs
lola: 4589835 markings, 15074562 edges, 59661 markings/sec, 70 secs
lola: 4887766 markings, 16065737 edges, 59586 markings/sec, 75 secs
lola: 5187181 markings, 17054651 edges, 59883 markings/sec, 80 secs
lola: 5487765 markings, 18055039 edges, 60117 markings/sec, 85 secs
lola: 5785122 markings, 19039186 edges, 59471 markings/sec, 90 secs
lola: 6080403 markings, 20020295 edges, 59056 markings/sec, 95 secs
lola: 6372004 markings, 20989352 edges, 58320 markings/sec, 100 secs
lola: 6669178 markings, 21975600 edges, 59435 markings/sec, 105 secs
lola: 6963814 markings, 22958122 edges, 58927 markings/sec, 110 secs
lola: 7258660 markings, 23935200 edges, 58969 markings/sec, 115 secs
lola: 7556705 markings, 24926293 edges, 59609 markings/sec, 120 secs
lola: 7853450 markings, 25915218 edges, 59349 markings/sec, 125 secs
lola: 8142456 markings, 26871566 edges, 57801 markings/sec, 130 secs
lola: 8436759 markings, 27851208 edges, 58861 markings/sec, 135 secs
lola: 8728838 markings, 28825761 edges, 58416 markings/sec, 140 secs
lola: 9018188 markings, 29783792 edges, 57870 markings/sec, 145 secs
lola: 9306559 markings, 30739059 edges, 57674 markings/sec, 150 secs
lola: 9600994 markings, 31718467 edges, 58887 markings/sec, 155 secs
lola: 9892640 markings, 32690088 edges, 58329 markings/sec, 160 secs
lola: 10177681 markings, 33635838 edges, 57008 markings/sec, 165 secs
lola: 10468031 markings, 34602778 edges, 58070 markings/sec, 170 secs
lola: 10761049 markings, 35579051 edges, 58604 markings/sec, 175 secs
lola: 11052673 markings, 36551181 edges, 58325 markings/sec, 180 secs
lola: 11336383 markings, 37495816 edges, 56742 markings/sec, 185 secs
lola: 11627527 markings, 38478191 edges, 58229 markings/sec, 190 secs
lola: 11916149 markings, 39454693 edges, 57724 markings/sec, 195 secs
lola: 12201289 markings, 40411831 edges, 57028 markings/sec, 200 secs
lola: 12486459 markings, 41371469 edges, 57034 markings/sec, 205 secs
lola: 12772874 markings, 42345366 edges, 57283 markings/sec, 210 secs
lola: 13056444 markings, 43309892 edges, 56714 markings/sec, 215 secs
lola: 13338780 markings, 44260113 edges, 56467 markings/sec, 220 secs
lola: 13626697 markings, 45232598 edges, 57583 markings/sec, 225 secs
lola: 13914021 markings, 46209386 edges, 57465 markings/sec, 230 secs
lola: 14198876 markings, 47180330 edges, 56971 markings/sec, 235 secs
lola: 14480064 markings, 48126581 edges, 56238 markings/sec, 240 secs
lola: 14764139 markings, 49087102 edges, 56815 markings/sec, 245 secs
lola: 15049645 markings, 50057420 edges, 57101 markings/sec, 250 secs
lola: 15331845 markings, 51019095 edges, 56440 markings/sec, 255 secs
lola: 15612771 markings, 51968569 edges, 56185 markings/sec, 260 secs
lola: 15896799 markings, 52929294 edges, 56806 markings/sec, 265 secs
lola: 16186098 markings, 53912998 edges, 57860 markings/sec, 270 secs
lola: 16473343 markings, 54892068 edges, 57449 markings/sec, 275 secs
lola: 16759353 markings, 55860927 edges, 57202 markings/sec, 280 secs
lola: 17035555 markings, 56795401 edges, 55240 markings/sec, 285 secs
lola: 17322846 markings, 57772526 edges, 57458 markings/sec, 290 secs
lola: 17608722 markings, 58744547 edges, 57175 markings/sec, 295 secs
lola: 17891255 markings, 59709269 edges, 56507 markings/sec, 300 secs
lola: 18165510 markings, 60634327 edges, 54851 markings/sec, 305 secs
lola: 18441930 markings, 61574045 edges, 55284 markings/sec, 310 secs
lola: 18725902 markings, 62538834 edges, 56794 markings/sec, 315 secs
lola: 19006264 markings, 63493864 edges, 56072 markings/sec, 320 secs
lola: 19287180 markings, 64449889 edges, 56183 markings/sec, 325 secs
lola: 19562814 markings, 65383830 edges, 55127 markings/sec, 330 secs
lola: 19845934 markings, 66337759 edges, 56624 markings/sec, 335 secs
lola: 20121670 markings, 67275131 edges, 55147 markings/sec, 340 secs
lola: 20402024 markings, 68230761 edges, 56071 markings/sec, 345 secs
lola: 20685637 markings, 69198018 edges, 56723 markings/sec, 350 secs
lola: 20970466 markings, 70171322 edges, 56966 markings/sec, 355 secs
lola: 21253466 markings, 71128213 edges, 56600 markings/sec, 360 secs
lola: 21528262 markings, 72061994 edges, 54959 markings/sec, 365 secs
lola: 21808089 markings, 73017139 edges, 55965 markings/sec, 370 secs
lola: 22091041 markings, 73983463 edges, 56590 markings/sec, 375 secs
lola: 22377758 markings, 74962449 edges, 57343 markings/sec, 380 secs
lola: 22663290 markings, 75928864 edges, 57106 markings/sec, 385 secs
lola: 22935013 markings, 76852374 edges, 54345 markings/sec, 390 secs
lola: 23213887 markings, 77804129 edges, 55775 markings/sec, 395 secs
lola: 23495052 markings, 78764495 edges, 56233 markings/sec, 400 secs
lola: 23778148 markings, 79730879 edges, 56619 markings/sec, 405 secs
lola: 24064328 markings, 80702312 edges, 57236 markings/sec, 410 secs
lola: 24337242 markings, 81627847 edges, 54583 markings/sec, 415 secs
lola: 24615510 markings, 82575896 edges, 55654 markings/sec, 420 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39))))))
lola: processed formula: A (F (A (G (((ROUTE_B <= NB_ATTENTE_A_13) AND (3 <= NB_ATTENTE_A_39))))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 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: 424 markings, 425 edges
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= ATTENTE_B) OR (E (F (((NB_ATTENTE_B_1 <= COMPTEUR_7) AND (1 <= NB_ATTENTE_A_42)))) OR ((NB_ATTENTE_B_8 + 1 <= NB_ATTENTE_B_0) AND (ROUTE_B + 1 <= NB_ATTENTE_A_23) AND ((NB_ATTENTE_B_42 <= NB_ATTENTE_B_46) OR (3 <= NB_ATTENTE_A_25) OR ((3 <= NB_ATTENTE_B_8) AND (3 <= NB_ATTENTE_A_35))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= ATTENTE_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ATTENTE_B)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: processed formula with 1 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 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_B_1 <= COMPTEUR_7) AND (1 <= NB_ATTENTE_A_42))))
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 484 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-V50P20N10-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= NB_ATTENTE_A_45) OR ((NB_ATTENTE_A_1 <= 0) AND (NB_ATTENTE_B_35 + 1 <= NB_ATTENTE_A_41)))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 143 markings, 142 edges
lola: ========================================
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((NB_ATTENTE_A_21 <= NB_ATTENTE_B_1) OR (ROUTE_A <= NB_ATTENTE_A_43) OR ((2 <= NB_ATTENTE_A_23) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_B_36))))) OR ((((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26))) AND E (G ((NB_ATTENTE_A_39 <= NB_ATTENTE_A_42)))) OR E (G ((NB_ATTENTE_B_38 <= NB_ATTENTE_A_50)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_21 <= NB_ATTENTE_B_1) OR (ROUTE_A <= NB_ATTENTE_A_43) OR ((2 <= NB_ATTENTE_A_23) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_B_36)))))
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 484 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 290 markings, 289 edges
lola: ========================================
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NB_ATTENTE_B_45 <= CHOIX_1) AND (NB_ATTENTE_A_43 <= NB_ATTENTE_B_34) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_8 <= NB_ATTENTE_B_26)))
lola: processed formula length: 139
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: processed formula with 4 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 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NB_ATTENTE_A_39 <= NB_ATTENTE_A_42)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_A_42 + 1 <= NB_ATTENTE_A_39)))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: 510 markings, 509 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((VIDANGE_1 <= 1) AND (NB_ATTENTE_A_23 + 1 <= NB_ATTENTE_A_18)))))
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 484 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-V50P20N10-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((CHOIX_1 <= NB_ATTENTE_B_11))) AND ((2 <= NB_ATTENTE_B_24) OR (2 <= NB_ATTENTE_B_21) OR (NB_ATTENTE_A_20 <= NB_ATTENTE_A_35))) AND A (F (((3 <= NB_ATTENTE_A_0) AND (1 <= NB_ATTENTE_B_32))))) OR NOT(E (G ((NB_ATTENTE_A_36 + 1 <= COMPTEUR_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CHOIX_1 <= NB_ATTENTE_B_11)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_B_11 + 1 <= CHOIX_1)))
lola: processed formula length: 47
lola: 6 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2987 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((COMPTEUR_0 <= NB_ATTENTE_A_36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((COMPTEUR_0 <= NB_ATTENTE_A_36)))
lola: processed formula: A (F ((COMPTEUR_0 <= NB_ATTENTE_A_36)))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3723 markings, 5472 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2985 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (X ((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40))))) AND A (F (((NB_ATTENTE_A_30 <= NB_ATTENTE_B_5) AND (NB_ATTENTE_A_13 <= NB_ATTENTE_B_33) AND (COMPTEUR_0 <= NB_ATTENTE_A_8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2985 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((NB_ATTENTE_A_13 <= NB_ATTENTE_B_40)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes no yes unknown no yes yes yes no yes unknown
----- Kill lola and sara stderr -----
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P20N10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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-V50P20N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 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 mcc4mcc-full"
echo " Input is BridgeAndVehicles-PT-V50P20N10, 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 r034-ebro-152646312400311"
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 '' CTLCardinality.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 ;