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 3.6M
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 295K 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 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 155K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 102K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 298K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 2.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BridgeAndVehicles-PT-V20P20N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308400304
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526763361655


BK_STOP 1526764501163

--------------------
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-V20P20N50 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': 582845, 'Memory': 1913.45, 'Tool': 'lola'}, {'Time': 588539, 'Memory': 1917.88, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V20P20N50...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V20P20N50: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 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: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: NOT((((SORTI_A <= CHOIX_1 + CHOIX_2) OR (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= 2)) AND NOT(E (G ((2 <= ROUTE_A)))))) : (E (F (((ATTENTE_A <= SUR_PONT_A) AND (3 <= CHOIX_1 + CHOIX_2)))) AND ((E (G ((ATTENTE_A <= SUR_PONT_A))) AND E (G ((2 <= CAPACITE)))) AND A (X ((ATTENTE_B <= 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 (F (A (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_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))))) : E (G ((A (G ((3 <= VIDANGE_1 + VIDANGE_2))) OR TRUE))) : (((2 <= SORTI_B) OR A (G ((SUR_PONT_A <= ROUTE_A)))) OR (A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A))) AND A (G ((ROUTE_A <= 0))))) : A (G (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_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= CAPACITE))))) : NOT(A (F (E (G ((SUR_PONT_B <= VIDANGE_1 + VIDANGE_2)))))) : NOT((E (G ((SUR_PONT_A <= ROUTE_A))) OR (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))) : E (G ((((NB_ATTENTE_B_17 <= ATTENTE_B) OR (ATTENTE_B <= COMPTEUR_2) OR ((2 <= COMPTEUR_42) AND (3 <= COMPTEUR_17))) OR E (G ((CONTROLEUR_1 <= COMPTEUR_7)))))) : NOT(A (F (A (G ((2 <= COMPTEUR_9)))))) : A (G (E (F (((3 <= NB_ATTENTE_A_8) AND (1 <= NB_ATTENTE_A_6)))))) : A (F (E (F ((COMPTEUR_7 + 1 <= NB_ATTENTE_B_17))))) : (E (F ((2 <= COMPTEUR_45))) AND (COMPTEUR_23 <= NB_ATTENTE_A_11)) : E (F ((1 <= COMPTEUR_10))) : E (G ((COMPTEUR_44 <= COMPTEUR_8))) : A (X (((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11) AND E (F ((3 <= NB_ATTENTE_A_13))))))
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((((SORTI_A <= CHOIX_1 + CHOIX_2) OR (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A) AND (3 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A) AND (3 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMP... (shortened)
lola: processed formula length: 749
lola: 8 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (ROUTE_A <= 1)))
lola: processed formula length: 29
lola: 10 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 304346 markings, 629802 edges, 3689348869717491712 markings/sec, 0 secs
lola: 594686 markings, 1252695 edges, 58068 markings/sec, 5 secs
lola: 880424 markings, 1871126 edges, 57148 markings/sec, 10 secs
lola: 1165858 markings, 2487948 edges, 57087 markings/sec, 15 secs
lola: 1457115 markings, 3116169 edges, 58251 markings/sec, 20 secs
lola: 1746667 markings, 3740348 edges, 57910 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1899579 markings, 4078065 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((ATTENTE_A <= SUR_PONT_A) AND (3 <= CHOIX_1 + CHOIX_2)))) AND ((E (G ((ATTENTE_A <= SUR_PONT_A))) AND E (G ((2 <= CAPACITE)))) AND A (X ((ATTENTE_B <= 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_ATTENT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATTENTE_A <= SUR_PONT_A) AND (3 <= CHOIX_1 + CHOIX_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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-V20P20N50-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (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_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)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (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_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)))))
lola: processed formula: A (F (A (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_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)))))
lola: processed formula length: 388
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: 16064 markings, 24921 edges, 3213 markings/sec, 0 secs
lola: 29593 markings, 47667 edges, 2706 markings/sec, 5 secs
lola: 42322 markings, 69251 edges, 2546 markings/sec, 10 secs
lola: 54759 markings, 90358 edges, 2487 markings/sec, 15 secs
lola: 66730 markings, 110770 edges, 2394 markings/sec, 20 secs
lola: 78938 markings, 131898 edges, 2442 markings/sec, 25 secs
lola: 89896 markings, 150364 edges, 2192 markings/sec, 30 secs
lola: 101168 markings, 169974 edges, 2254 markings/sec, 35 secs
lola: 111985 markings, 188230 edges, 2163 markings/sec, 40 secs
lola: 122578 markings, 206568 edges, 2119 markings/sec, 45 secs
lola: 132772 markings, 223913 edges, 2039 markings/sec, 50 secs
lola: 142642 markings, 240771 edges, 1974 markings/sec, 55 secs
lola: 152774 markings, 258662 edges, 2026 markings/sec, 60 secs
lola: 162342 markings, 274630 edges, 1914 markings/sec, 65 secs
lola: 171784 markings, 290726 edges, 1888 markings/sec, 70 secs
lola: 181206 markings, 307103 edges, 1884 markings/sec, 75 secs
lola: 190610 markings, 323813 edges, 1881 markings/sec, 80 secs
lola: 198709 markings, 336874 edges, 1620 markings/sec, 85 secs
lola: 207766 markings, 352399 edges, 1811 markings/sec, 90 secs
lola: 216675 markings, 367909 edges, 1782 markings/sec, 95 secs
lola: 225102 markings, 382519 edges, 1685 markings/sec, 100 secs
lola: 233332 markings, 396305 edges, 1646 markings/sec, 105 secs
lola: 241991 markings, 411063 edges, 1732 markings/sec, 110 secs
lola: 250348 markings, 425539 edges, 1671 markings/sec, 115 secs
lola: 258203 markings, 439011 edges, 1571 markings/sec, 120 secs
lola: 267003 markings, 454371 edges, 1760 markings/sec, 125 secs
lola: 274935 markings, 467552 edges, 1586 markings/sec, 130 secs
lola: 282908 markings, 480995 edges, 1595 markings/sec, 135 secs
lola: 290865 markings, 494646 edges, 1591 markings/sec, 140 secs
lola: 299318 markings, 509419 edges, 1691 markings/sec, 145 secs
lola: 307798 markings, 524176 edges, 1696 markings/sec, 150 secs
lola: 315256 markings, 537215 edges, 1492 markings/sec, 155 secs
lola: 323448 markings, 550521 edges, 1638 markings/sec, 160 secs
lola: 331542 markings, 564386 edges, 1619 markings/sec, 165 secs
lola: 338915 markings, 576806 edges, 1475 markings/sec, 170 secs
lola: 346892 markings, 590553 edges, 1595 markings/sec, 175 secs
lola: 354854 markings, 604531 edges, 1592 markings/sec, 180 secs
lola: 362449 markings, 617698 edges, 1519 markings/sec, 185 secs
lola: 369845 markings, 629978 edges, 1479 markings/sec, 190 secs
lola: 377999 markings, 643623 edges, 1631 markings/sec, 195 secs
lola: 385459 markings, 656292 edges, 1492 markings/sec, 200 secs
lola: 392948 markings, 669125 edges, 1498 markings/sec, 205 secs
lola: 400425 markings, 681987 edges, 1495 markings/sec, 210 secs
lola: 408089 markings, 695281 edges, 1533 markings/sec, 215 secs
lola: 415992 markings, 709079 edges, 1581 markings/sec, 220 secs
lola: 422673 markings, 720392 edges, 1336 markings/sec, 225 secs
lola: 431215 markings, 734503 edges, 1708 markings/sec, 230 secs
lola: 438786 markings, 747271 edges, 1514 markings/sec, 235 secs
lola: 446671 markings, 760813 edges, 1577 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((3 <= VIDANGE_1 + VIDANGE_2))) OR TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= SORTI_B) OR A (G ((SUR_PONT_A <= ROUTE_A)))) OR (A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A))) AND A (G ((ROUTE_A <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= SORTI_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SORTI_B)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-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 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SUR_PONT_A <= ROUTE_A)))
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 404 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-V20P20N50-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A)))
lola: processed formula: A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A)))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 165 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (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_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (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 <= CAPA... (shortened)
lola: processed formula length: 409
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 207618 markings, 877676 edges, 3689320832170983424 markings/sec, 0 secs
lola: 414857 markings, 1773845 edges, 41448 markings/sec, 5 secs
lola: 615926 markings, 2650776 edges, 40214 markings/sec, 10 secs
lola: 810524 markings, 3504484 edges, 38920 markings/sec, 15 secs
lola: 1005239 markings, 4357150 edges, 38943 markings/sec, 20 secs
lola: 1195657 markings, 5198193 edges, 38084 markings/sec, 25 secs
lola: 1385351 markings, 6041997 edges, 37939 markings/sec, 30 secs
lola: 1575719 markings, 6888892 edges, 38074 markings/sec, 35 secs
lola: 1765320 markings, 7732497 edges, 37920 markings/sec, 40 secs
lola: 1951775 markings, 8559794 edges, 37291 markings/sec, 45 secs
lola: 2134879 markings, 9384898 edges, 36621 markings/sec, 50 secs
lola: 2320268 markings, 10209726 edges, 37078 markings/sec, 55 secs
lola: 2499155 markings, 11020705 edges, 35777 markings/sec, 60 secs
lola: 2685634 markings, 11849495 edges, 37296 markings/sec, 65 secs
lola: 2862413 markings, 12653288 edges, 35356 markings/sec, 70 secs
lola: 3049927 markings, 13475964 edges, 37503 markings/sec, 75 secs
lola: 3229697 markings, 14288739 edges, 35954 markings/sec, 80 secs
lola: 3410144 markings, 15096445 edges, 36089 markings/sec, 85 secs
lola: 3595049 markings, 15919776 edges, 36981 markings/sec, 90 secs
lola: 3774565 markings, 16730283 edges, 35903 markings/sec, 95 secs
lola: 3955628 markings, 17546052 edges, 36213 markings/sec, 100 secs
lola: 4141317 markings, 18374897 edges, 37138 markings/sec, 105 secs
lola: 4317611 markings, 19174545 edges, 35259 markings/sec, 110 secs
lola: 4496984 markings, 19994769 edges, 35875 markings/sec, 115 secs
lola: 4686633 markings, 20833305 edges, 37930 markings/sec, 120 secs
lola: 4869799 markings, 21662260 edges, 36633 markings/sec, 125 secs
lola: 5048373 markings, 22480012 edges, 35715 markings/sec, 130 secs
lola: 5233173 markings, 23310334 edges, 36960 markings/sec, 135 secs
lola: 5421848 markings, 24158270 edges, 37735 markings/sec, 140 secs
lola: 5600576 markings, 24968363 edges, 35746 markings/sec, 145 secs
lola: 5779500 markings, 25792942 edges, 35785 markings/sec, 150 secs
lola: 5961614 markings, 26614154 edges, 36423 markings/sec, 155 secs
lola: 6150270 markings, 27463540 edges, 37731 markings/sec, 160 secs
lola: 6330990 markings, 28285065 edges, 36144 markings/sec, 165 secs
lola: 6512851 markings, 29115959 edges, 36372 markings/sec, 170 secs
lola: 6691965 markings, 29948016 edges, 35823 markings/sec, 175 secs
lola: 6883751 markings, 30802814 edges, 38357 markings/sec, 180 secs
lola: 7071999 markings, 31657811 edges, 37650 markings/sec, 185 secs
lola: 7257222 markings, 32507723 edges, 37045 markings/sec, 190 secs
lola: 7440535 markings, 33349448 edges, 36663 markings/sec, 195 secs
lola: 7623203 markings, 34191778 edges, 36534 markings/sec, 200 secs
lola: 7814692 markings, 35052533 edges, 38298 markings/sec, 205 secs
lola: 8004498 markings, 35917364 edges, 37961 markings/sec, 210 secs
lola: 8187233 markings, 36755988 edges, 36547 markings/sec, 215 secs
lola: 8368459 markings, 37592154 edges, 36245 markings/sec, 220 secs
lola: 8549966 markings, 38427394 edges, 36301 markings/sec, 225 secs
lola: 8734796 markings, 39268793 edges, 36966 markings/sec, 230 secs
lola: 8925806 markings, 40135422 edges, 38202 markings/sec, 235 secs
lola: 9107345 markings, 40965026 edges, 36308 markings/sec, 240 secs
lola: 9287598 markings, 41797702 edges, 36051 markings/sec, 245 secs
lola: 9458488 markings, 42590939 edges, 34178 markings/sec, 250 secs
lola: 9634028 markings, 43403852 edges, 35108 markings/sec, 255 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9792342 markings, 44141586 edges
lola: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (G ((SUR_PONT_B <= VIDANGE_1 + VIDANGE_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (VIDANGE_1 + VIDANGE_2 + 1 <= SUR_PONT_B)))))
lola: processed formula length: 71
lola: 7 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 179437 markings, 773993 edges, 2316351866474070016 markings/sec, 0 secs
lola: 344056 markings, 1584814 edges, 32924 markings/sec, 5 secs
lola: 505183 markings, 2386115 edges, 32225 markings/sec, 10 secs
lola: 666391 markings, 3188897 edges, 32242 markings/sec, 15 secs
lola: 823521 markings, 3980589 edges, 31426 markings/sec, 20 secs
lola: 982666 markings, 4773504 edges, 31829 markings/sec, 25 secs
lola: 1141708 markings, 5574643 edges, 31808 markings/sec, 30 secs
lola: 1298579 markings, 6365016 edges, 31374 markings/sec, 35 secs
lola: 1454916 markings, 7154566 edges, 31267 markings/sec, 40 secs
lola: 1610141 markings, 7939479 edges, 31045 markings/sec, 45 secs
lola: 1755680 markings, 8680400 edges, 29108 markings/sec, 50 secs
lola: 1903009 markings, 9439071 edges, 29466 markings/sec, 55 secs
lola: 2053153 markings, 10207323 edges, 30029 markings/sec, 60 secs
lola: 2199424 markings, 10960167 edges, 29254 markings/sec, 65 secs
lola: 2349150 markings, 11724854 edges, 29945 markings/sec, 70 secs
lola: 2499013 markings, 12493717 edges, 29973 markings/sec, 75 secs
lola: 2649556 markings, 13269381 edges, 30109 markings/sec, 80 secs
lola: 2802930 markings, 14052985 edges, 30675 markings/sec, 85 secs
lola: 2954549 markings, 14834132 edges, 30324 markings/sec, 90 secs
lola: 3109631 markings, 15621865 edges, 31016 markings/sec, 95 secs
lola: 3263345 markings, 16415475 edges, 30743 markings/sec, 100 secs
lola: 3416261 markings, 17205412 edges, 30583 markings/sec, 105 secs
lola: 3572439 markings, 17998059 edges, 31236 markings/sec, 110 secs
lola: 3729249 markings, 18795959 edges, 31362 markings/sec, 115 secs
lola: 3883802 markings, 19599753 edges, 30911 markings/sec, 120 secs
lola: 4040906 markings, 20399659 edges, 31421 markings/sec, 125 secs
lola: 4199445 markings, 21208179 edges, 31708 markings/sec, 130 secs
lola: 4358112 markings, 22022814 edges, 31733 markings/sec, 135 secs
lola: 4514696 markings, 22831710 edges, 31317 markings/sec, 140 secs
lola: 4676475 markings, 23645458 edges, 32356 markings/sec, 145 secs
lola: 4837880 markings, 24467130 edges, 32281 markings/sec, 150 secs
lola: 4997767 markings, 25292057 edges, 31977 markings/sec, 155 secs
lola: 5156839 markings, 26110863 edges, 31814 markings/sec, 160 secs
lola: 5318347 markings, 26931582 edges, 32302 markings/sec, 165 secs
lola: 5479952 markings, 27752984 edges, 32321 markings/sec, 170 secs
lola: 5642894 markings, 28581836 edges, 32588 markings/sec, 175 secs
lola: 5800873 markings, 29402908 edges, 31596 markings/sec, 180 secs
lola: 5959168 markings, 30213067 edges, 31659 markings/sec, 185 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6008780 markings, 30480276 edges
lola: ========================================
lola: subprocess 7 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((SUR_PONT_A <= ROUTE_A))) OR (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ROUTE_A + 1 <= SUR_PONT_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ROUTE_A + 1 <= SUR_PONT_A)))
lola: processed formula: A (F ((ROUTE_A + 1 <= SUR_PONT_A)))
lola: processed formula length: 35
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 8548 markings, 14715 edges, 1710 markings/sec, 0 secs
lola: 21046 markings, 39053 edges, 2500 markings/sec, 5 secs
lola: 33704 markings, 64432 edges, 2532 markings/sec, 10 secs
lola: 47027 markings, 91840 edges, 2665 markings/sec, 15 secs
lola: 59894 markings, 119235 edges, 2573 markings/sec, 20 secs
lola: 74815 markings, 151089 edges, 2984 markings/sec, 25 secs
lola: 90375 markings, 184589 edges, 3112 markings/sec, 30 secs
lola: 104917 markings, 217343 edges, 2908 markings/sec, 35 secs
lola: 122015 markings, 255148 edges, 3420 markings/sec, 40 secs
lola: 137120 markings, 290060 edges, 3021 markings/sec, 45 secs
lola: 154985 markings, 330245 edges, 3573 markings/sec, 50 secs
lola: 171025 markings, 368047 edges, 3208 markings/sec, 55 secs
lola: 187842 markings, 408354 edges, 3363 markings/sec, 60 secs
lola: 206247 markings, 450310 edges, 3681 markings/sec, 65 secs
lola: 222842 markings, 490824 edges, 3319 markings/sec, 70 secs
lola: 241790 markings, 535292 edges, 3790 markings/sec, 75 secs
lola: 261552 markings, 584430 edges, 3952 markings/sec, 80 secs
lola: 277718 markings, 623662 edges, 3233 markings/sec, 85 secs
lola: 296797 markings, 670321 edges, 3816 markings/sec, 90 secs
lola: 317860 markings, 721529 edges, 4213 markings/sec, 95 secs
lola: 335660 markings, 766659 edges, 3560 markings/sec, 100 secs
lola: 352264 markings, 808604 edges, 3321 markings/sec, 105 secs
lola: 375645 markings, 865863 edges, 4676 markings/sec, 110 secs
lola: 395598 markings, 917669 edges, 3991 markings/sec, 115 secs
lola: 414525 markings, 967442 edges, 3785 markings/sec, 120 secs
lola: 430662 markings, 1007340 edges, 3227 markings/sec, 125 secs
lola: 454798 markings, 1067949 edges, 4827 markings/sec, 130 secs
lola: 474810 markings, 1119536 edges, 4002 markings/sec, 135 secs
lola: 493683 markings, 1168796 edges, 3775 markings/sec, 140 secs
lola: 514828 markings, 1226542 edges, 4229 markings/sec, 145 secs
lola: 535343 markings, 1277713 edges, 4103 markings/sec, 150 secs
lola: 556370 markings, 1330809 edges, 4205 markings/sec, 155 secs
lola: 576477 markings, 1384502 edges, 4021 markings/sec, 160 secs
lola: 599374 markings, 1449073 edges, 4579 markings/sec, 165 secs
lola: 617370 markings, 1495454 edges, 3599 markings/sec, 170 secs
lola: 640590 markings, 1555141 edges, 4644 markings/sec, 175 secs
lola: 662603 markings, 1612436 edges, 4403 markings/sec, 180 secs
lola: 685021 markings, 1673768 edges, 4484 markings/sec, 185 secs
lola: 705019 markings, 1728136 edges, 4000 markings/sec, 190 secs
lola: 727082 markings, 1792115 edges, 4413 markings/sec, 195 secs
lola: 748049 markings, 1850758 edges, 4193 markings/sec, 200 secs
lola: 771689 markings, 1907073 edges, 4728 markings/sec, 205 secs
lola: 794980 markings, 1970787 edges, 4658 markings/sec, 210 secs
lola: 814775 markings, 2023924 edges, 3959 markings/sec, 215 secs
lola: 837939 markings, 2091747 edges, 4633 markings/sec, 220 secs
lola: 859716 markings, 2153968 edges, 4355 markings/sec, 225 secs
lola: 880415 markings, 2212069 edges, 4140 markings/sec, 230 secs
lola: 903417 markings, 2265603 edges, 4600 markings/sec, 235 secs
lola: 926984 markings, 2330760 edges, 4713 markings/sec, 240 secs
lola: 950431 markings, 2397234 edges, 4689 markings/sec, 245 secs
lola: 969270 markings, 2449554 edges, 3768 markings/sec, 250 secs
lola: 990186 markings, 2508209 edges, 4183 markings/sec, 255 secs
lola: 1012255 markings, 2571262 edges, 4414 markings/sec, 260 secs
lola: 1037011 markings, 2641649 edges, 4951 markings/sec, 265 secs
lola: 1063530 markings, 2710289 edges, 5304 markings/sec, 270 secs
lola: 1087751 markings, 2780458 edges, 4844 markings/sec, 275 secs
lola: 1108958 markings, 2839063 edges, 4241 markings/sec, 280 secs
lola: 1129616 markings, 2897784 edges, 4132 markings/sec, 285 secs
lola: 1152264 markings, 2963041 edges, 4530 markings/sec, 290 secs
lola: 1176846 markings, 3034752 edges, 4916 markings/sec, 295 secs
lola: 1200140 markings, 3106309 edges, 4659 markings/sec, 300 secs
lola: 1212069 markings, 3128981 edges, 2386 markings/sec, 305 secs
lola: local time limit reached - abortinglola:
local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLAlola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((NB_ATTENTE_B_17 <= ATTENTE_B) OR (ATTENTE_B <= COMPTEUR_2) OR ((2 <= COMPTEUR_42) AND (3 <= COMPTEUR_17))) OR E (G ((CONTROLEUR_1 <= COMPTEUR_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((ATTENTE_B + 1 <= NB_ATTENTE_B_17) AND (COMPTEUR_2 + 1 <= ATTENTE_B) AND ((COMPTEUR_42 <= 1) OR (COMPTEUR_17 <= 2))) AND A(TRUE U (COMPTEUR_7 + 1 <= CONTROLEUR_1)))))
lola: processed formula length: 182
lola: 6 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 165 markings, 164 edges
lola: ========================================
lola: subprocess 9 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((2 <= COMPTEUR_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (COMPTEUR_9 <= 1)))))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 165 markings, 329 edges
lola: ========================================
lola: subprocess 10 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= NB_ATTENTE_A_8) AND (1 <= NB_ATTENTE_A_6))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((3 <= NB_ATTENTE_A_8) AND (1 <= NB_ATTENTE_A_6))))))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 277843 markings, 607904 edges, 2474372852984315904 markings/sec, 0 secs
lola: 547191 markings, 1206084 edges, 53870 markings/sec, 5 secs
lola: 811868 markings, 1800910 edges, 52935 markings/sec, 10 secs
lola: 1077014 markings, 2400783 edges, 53029 markings/sec, 15 secs
lola: 1344516 markings, 3008095 edges, 53500 markings/sec, 20 secs
lola: 1612403 markings, 3614553 edges, 53577 markings/sec, 25 secs
lola: 1880471 markings, 4223286 edges, 53614 markings/sec, 30 secs
lola: 2148281 markings, 4832766 edges, 53562 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2233602 markings, 5028399 edges
lola: ========================================
lola: subprocess 11 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((COMPTEUR_7 + 1 <= NB_ATTENTE_B_17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (COMPTEUR_7 + 1 <= NB_ATTENTE_B_17)))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 12 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= COMPTEUR_45))) AND (COMPTEUR_23 <= NB_ATTENTE_A_11))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= COMPTEUR_45)))
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 404 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-V20P20N50-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= COMPTEUR_10)))
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 404 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-V20P20N50-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 14 will run for 1222 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((COMPTEUR_44 <= COMPTEUR_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (COMPTEUR_8 + 1 <= COMPTEUR_44)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 165 markings, 164 edges
lola: ========================================
lola: subprocess 15 will run for 2445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11) AND E (F ((3 <= NB_ATTENTE_A_13))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11)))
lola: processed formula: A (X ((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11)))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 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: no no unknown yes no yes no unknown yes yes no yes no yes yes unknown
----- Kill lola and sara stderr -----
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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-V20P20N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is BridgeAndVehicles-PT-V20P20N50, 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 r030-ebro-152646308400304"
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 ;