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.0M
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 58K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 178K 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 3.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 106K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 311K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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.1M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-PT-V20P20N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312400297
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527026017646


BK_STOP 1527026455429

--------------------
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-V20P20N20 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': 198216, 'Memory': 1977.62, 'Tool': 'lola'}, {'Time': 207068, 'Memory': 1972.73, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V20P20N20...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V20P20N20: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-PT-V20P20N20 @ 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: 1046/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 78 places, 968 transitions, 71 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1133 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: 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_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))) : (A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE)))) AND (NOT(A (F ((1 <= CONTROLEUR_1 + CONTROLEUR_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_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 + 1 <= ATTENTE_A) AND (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B)))) : ((ROUTE_B <= SORTI_A) OR E (G (E (F ((2 <= ATTENTE_B)))))) : A (((SORTI_B <= CONTROLEUR_1 + CONTROLEUR_2) U A (F ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20))))) : A (F ((2 <= VIDANGE_1 + VIDANGE_2))) : E (F ((CAPACITE <= SUR_PONT_B))) : E ((E (X ((1 <= CAPACITE))) U (((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) OR (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_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 (SORTI_A + 1 <= CAPACITE)))) : 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 <= SUR_PONT_A) OR (2 <= ROUTE_B)) AND (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE)) AND E (X ((3 <= ROUTE_B)))))) : A (X (A (G ((NB_ATTENTE_A_12 + 1 <= ROUTE_B))))) : A (F ((2 <= COMPTEUR_15))) : A (X ((E (G ((COMPTEUR_19 <= NB_ATTENTE_A_3))) OR (((3 <= SORTI_B) AND (NB_ATTENTE_B_7 <= NB_ATTENTE_A_9)) OR (1 <= NB_ATTENTE_B_9))))) : E (((NB_ATTENTE_B_8 <= COMPTEUR_12) U E (G ((COMPTEUR_6 <= COMPTEUR_15))))) : (E (F (((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B)))) AND E (G (E (X ((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1)))))) : A (G (A (F (((NB_ATTENTE_A_7 <= SORTI_B) AND (2 <= NB_ATTENTE_A_6)))))) : ((((COMPTEUR_16 <= COMPTEUR_2) AND (NB_ATTENTE_A_16 <= ROUTE_B) AND (COMPTEUR_2 + 1 <= NB_ATTENTE_B_20) AND (2 <= COMPTEUR_20)) OR A (((NB_ATTENTE_A_10 <= COMPTEUR_2) U (1 <= ROUTE_B)))) AND (((2 <= COMPTEUR_20) OR ((NB_ATTENTE_A_12 <= NB_ATTENTE_A_2) AND (3 <= COMPTEUR_7) AND ((1 <= COMPTEUR_16) OR (NB_ATTENTE_A_10 <= ROUTE_B)))) OR A (F ((2 <= NB_ATTENTE_B_6))))) : (E (G (((COMPTEUR_2 <= 0) OR (NB_ATTENTE_A_6 <= 0)))) OR ((CHOIX_2 + 1 <= NB_ATTENTE_A_7) OR NOT(E (X ((NB_ATTENTE_A_3 <= COMPTEUR_16))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (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_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)))
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 284 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-V20P20N20-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE)))) AND (NOT(A (F ((1 <= CONTROLEUR_1 + CONTROLEUR_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_0 + NB_ATTEN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE))))
lola: processed formula: A ((((ATTENTE_B <= ROUTE_A) AND (1 <= SUR_PONT_A)) U ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) OR (ROUTE_A <= CAPACITE))))
lola: processed formula length: 117
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CONTROLEUR_1 + CONTROLEUR_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: processed formula length: 49
lola: 5 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 882 markings, 1281 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((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_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 + 1 <= ATTENTE_A) AND (CONTROLEU... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((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_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 + 1 <= ATTENTE_A) AND (CONTROLEU... (shortened)
lola: processed formula length: 434
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ROUTE_B <= SORTI_A) OR E (G (E (F ((2 <= ATTENTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (ROUTE_B <= SORTI_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ROUTE_B <= SORTI_A)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= ATTENTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= ATTENTE_B)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 327206 markings, 1106607 edges, 65428 markings/sec, 0 secs
lola: 639029 markings, 2175413 edges, 62365 markings/sec, 5 secs
lola: 946695 markings, 3233784 edges, 61533 markings/sec, 10 secs
lola: 1264102 markings, 4322936 edges, 63481 markings/sec, 15 secs
lola: 1578180 markings, 5398021 edges, 62816 markings/sec, 20 secs
lola: 1899839 markings, 6495584 edges, 64332 markings/sec, 25 secs
lola: 2226839 markings, 7612289 edges, 65400 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2233266 markings, 7636230 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((SORTI_B <= CONTROLEUR_1 + CONTROLEUR_2) U A (F ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((SORTI_B <= CONTROLEUR_1 + CONTROLEUR_2) U A(TRUE U (3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTEN... (shortened)
lola: processed formula length: 428
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 166 markings, 420 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= VIDANGE_1 + VIDANGE_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= VIDANGE_1 + VIDANGE_2)))
lola: processed formula: A (F ((2 <= VIDANGE_1 + VIDANGE_2)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 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: 166 markings, 166 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((CAPACITE <= SUR_PONT_B)))
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 284 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-V20P20N20-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= CAPACITE))) U (((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((1 <= CAPACITE)) U (((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) O... (shortened)
lola: processed formula length: 808
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 306253 markings, 997470 edges, 3689329903141912576 markings/sec, 0 secs
lola: 604628 markings, 1996931 edges, 59675 markings/sec, 5 secs
lola: 903972 markings, 3009639 edges, 59869 markings/sec, 10 secs
lola: 1198626 markings, 4014264 edges, 58931 markings/sec, 15 secs
lola: 1492053 markings, 5023219 edges, 58685 markings/sec, 20 secs
lola: 1775540 markings, 6000512 edges, 56697 markings/sec, 25 secs
lola: 2057430 markings, 6976842 edges, 56378 markings/sec, 30 secs
lola: 2340086 markings, 7957906 edges, 56531 markings/sec, 35 secs
lola: 2622718 markings, 8942748 edges, 56526 markings/sec, 40 secs
lola: 2898244 markings, 9910673 edges, 55105 markings/sec, 45 secs
lola: 3173994 markings, 10863609 edges, 55150 markings/sec, 50 secs
lola: 3444494 markings, 11803690 edges, 54100 markings/sec, 55 secs
lola: 3707779 markings, 12723442 edges, 52657 markings/sec, 60 secs
lola: 3981083 markings, 13677447 edges, 54661 markings/sec, 65 secs
lola: 4257290 markings, 14645298 edges, 55241 markings/sec, 70 secs
lola: 4530648 markings, 15609636 edges, 54672 markings/sec, 75 secs
lola: 4804671 markings, 16562840 edges, 54805 markings/sec, 80 secs
lola: 5072262 markings, 17517732 edges, 53518 markings/sec, 85 secs
lola: 5343938 markings, 18462636 edges, 54335 markings/sec, 90 secs
lola: 5615185 markings, 19425969 edges, 54249 markings/sec, 95 secs
lola: 5884801 markings, 20390801 edges, 53923 markings/sec, 100 secs
lola: 6159543 markings, 21347433 edges, 54948 markings/sec, 105 secs
lola: 6421067 markings, 22276375 edges, 52305 markings/sec, 110 secs
lola: 6685494 markings, 23235300 edges, 52885 markings/sec, 115 secs
lola: 6961378 markings, 24195093 edges, 55177 markings/sec, 120 secs
lola: 7237613 markings, 25180574 edges, 55247 markings/sec, 125 secs
lola: 7509655 markings, 26160810 edges, 54408 markings/sec, 130 secs
lola: 7783696 markings, 27128092 edges, 54808 markings/sec, 135 secs
lola: 8061877 markings, 28120753 edges, 55636 markings/sec, 140 secs
lola: 8323183 markings, 29059143 edges, 52261 markings/sec, 145 secs
lola: 8594789 markings, 30049515 edges, 54321 markings/sec, 150 secs
lola: 8865029 markings, 30995309 edges, 54048 markings/sec, 155 secs
lola: 9129169 markings, 31943508 edges, 52828 markings/sec, 160 secs
lola: 9405010 markings, 32941090 edges, 55168 markings/sec, 165 secs
lola: 9675679 markings, 33923389 edges, 54134 markings/sec, 170 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9783606 markings, 34320762 edges
lola: ========================================
lola: subprocess 7 will run for 369 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 <= SUR_PONT_A) OR (2 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 369 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 <= SUR_PONT_A) OR (2 <= ... (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 284 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N20-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((NB_ATTENTE_A_12 + 1 <= ROUTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((NB_ATTENTE_A_12 + 1 <= ROUTE_B)))))
lola: processed formula: A (X (A (G ((NB_ATTENTE_A_12 + 1 <= ROUTE_B)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 166 markings, 166 edges
lola: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= COMPTEUR_15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= COMPTEUR_15)))
lola: processed formula: A (F ((2 <= COMPTEUR_15)))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 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: 166 markings, 166 edges
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G ((COMPTEUR_19 <= NB_ATTENTE_A_3))) OR (((3 <= SORTI_B) AND (NB_ATTENTE_B_7 <= NB_ATTENTE_A_9)) OR (1 <= NB_ATTENTE_B_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((NOT(A(TRUE U (NB_ATTENTE_A_3 + 1 <= COMPTEUR_19))) OR (((3 <= SORTI_B) AND (NB_ATTENTE_B_7 <= NB_ATTENTE_A_9)) OR (1 <= NB_ATTENTE_B_9))))
lola: processed formula length: 143
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12753 markings, 41656 edges
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NB_ATTENTE_B_8 <= COMPTEUR_12) U E (G ((COMPTEUR_6 <= COMPTEUR_15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NB_ATTENTE_B_8 <= COMPTEUR_12) U NOT(A(TRUE U (COMPTEUR_15 + 1 <= COMPTEUR_6))))
lola: processed formula length: 83
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 44165 markings, 96659 edges
lola: ========================================
lola: subprocess 12 will run for 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B)))) AND E (G (E (X ((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((COMPTEUR_9 <= 0) OR (COMPTEUR_1 <= ROUTE_B))))
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 284 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1108 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((NB_ATTENTE_B_14 <= NB_ATTENTE_B_1)))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 302063 markings, 982835 edges, 60412 markings/sec, 0 secs
lola: 598838 markings, 1975494 edges, 59355 markings/sec, 5 secs
lola: 892860 markings, 2970688 edges, 58804 markings/sec, 10 secs
lola: 1182734 markings, 3957521 edges, 57975 markings/sec, 15 secs
lola: 1471276 markings, 4946995 edges, 57708 markings/sec, 20 secs
lola: 1751829 markings, 5916251 edges, 56111 markings/sec, 25 secs
lola: 2027743 markings, 6869760 edges, 55183 markings/sec, 30 secs
lola: 2302166 markings, 7822815 edges, 54885 markings/sec, 35 secs
lola: 2573253 markings, 8765790 edges, 54217 markings/sec, 40 secs
lola: 2841204 markings, 9709978 edges, 53590 markings/sec, 45 secs
lola: 3112987 markings, 10642514 edges, 54357 markings/sec, 50 secs
lola: 3376487 markings, 11570592 edges, 52700 markings/sec, 55 secs
lola: 3648332 markings, 12507736 edges, 54369 markings/sec, 60 secs
lola: 3911459 markings, 13438639 edges, 52625 markings/sec, 65 secs
lola: 4183394 markings, 14376547 edges, 54387 markings/sec, 70 secs
lola: 4444878 markings, 15307762 edges, 52297 markings/sec, 75 secs
lola: 4714644 markings, 16227065 edges, 53953 markings/sec, 80 secs
lola: 4972333 markings, 17114380 edges, 51538 markings/sec, 85 secs
lola: 5241277 markings, 18037660 edges, 53789 markings/sec, 90 secs
lola: 5512085 markings, 18988976 edges, 54162 markings/sec, 95 secs
lola: 5777698 markings, 19941035 edges, 53123 markings/sec, 100 secs
lola: 6048655 markings, 20886372 edges, 54191 markings/sec, 105 secs
lola: 6318323 markings, 21840740 edges, 53934 markings/sec, 110 secs
lola: 6584599 markings, 22800204 edges, 53255 markings/sec, 115 secs
lola: 6851888 markings, 23739182 edges, 53458 markings/sec, 120 secs
lola: 7123824 markings, 24701204 edges, 54387 markings/sec, 125 secs
lola: 7394086 markings, 25671173 edges, 54052 markings/sec, 130 secs
lola: 7661356 markings, 26633893 edges, 53454 markings/sec, 135 secs
lola: 7933925 markings, 27589168 edges, 54514 markings/sec, 140 secs
lola: 8188464 markings, 28498290 edges, 50908 markings/sec, 145 secs
lola: 8452501 markings, 29454329 edges, 52807 markings/sec, 150 secs
lola: 8720851 markings, 30412746 edges, 53670 markings/sec, 155 secs
lola: 8993577 markings, 31377737 edges, 54545 markings/sec, 160 secs
lola: 9265224 markings, 32351832 edges, 54329 markings/sec, 165 secs
lola: 9529200 markings, 33308188 edges, 52795 markings/sec, 170 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9783606 markings, 34241999 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((NB_ATTENTE_A_7 <= SORTI_B) AND (2 <= NB_ATTENTE_A_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((NB_ATTENTE_A_7 <= SORTI_B) AND (2 <= NB_ATTENTE_A_6))))))
lola: processed formula length: 85
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 166 markings, 166 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((COMPTEUR_16 <= COMPTEUR_2) AND (NB_ATTENTE_A_16 <= ROUTE_B) AND (COMPTEUR_2 + 1 <= NB_ATTENTE_B_20) AND (2 <= COMPTEUR_20)) OR A (((NB_ATTENTE_A_10 <= COMPTEUR_2) U (1 <= ROUTE_B)))) AND (((2 <= COMPTEUR_20) OR ((NB_ATTENTE_A_12 <= NB_ATTENTE_A_2) AND (3 <= COMPTEUR_7) AND ((1 <= COMPTEUR_16) OR (NB_ATTENTE_A_10 <= ROUTE_B)))) OR A (F ((2 <= NB_ATTENTE_B_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((COMPTEUR_16 <= COMPTEUR_2) AND (NB_ATTENTE_A_16 <= ROUTE_B) AND (COMPTEUR_2 + 1 <= NB_ATTENTE_B_20) AND (2 <= COMPTEUR_20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((COMPTEUR_16 <= COMPTEUR_2) AND (NB_ATTENTE_A_16 <= ROUTE_B) AND (COMPTEUR_2 + 1 <= NB_ATTENTE_B_20) AND (2 <= COMPTEUR_20))
lola: processed formula length: 125
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: processed formula with 4 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 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NB_ATTENTE_A_10 <= COMPTEUR_2) U (1 <= ROUTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((NB_ATTENTE_A_10 <= COMPTEUR_2) U (1 <= ROUTE_B)))
lola: processed formula: A (((NB_ATTENTE_A_10 <= COMPTEUR_2) U (1 <= ROUTE_B)))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 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: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= NB_ATTENTE_B_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= NB_ATTENTE_B_6)))
lola: processed formula: A (F ((2 <= NB_ATTENTE_B_6)))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 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: 166 markings, 166 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((COMPTEUR_2 <= 0) OR (NB_ATTENTE_A_6 <= 0)))) OR ((CHOIX_2 + 1 <= NB_ATTENTE_A_7) OR NOT(E (X ((NB_ATTENTE_A_3 <= COMPTEUR_16))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((COMPTEUR_2 <= 0) OR (NB_ATTENTE_A_6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= COMPTEUR_2) AND (1 <= NB_ATTENTE_A_6))))
lola: processed formula length: 60
lola: 5 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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: 166 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no yes yes no no unknown yes
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-15 TRUE 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-V20P20N20"
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-V20P20N20.tgz
mv BridgeAndVehicles-PT-V20P20N20 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-V20P20N20, 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-152646312400297"
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 ;