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 220K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-COL-V20P20N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312200157
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527000502885


BK_STOP 1527001469536

--------------------
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-COL-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': 184774, 'Memory': 1751.99, 'Tool': 'lola'}, {'Time': 300774, 'Memory': 1990.94, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V20P20N20...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V20P20N20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V20P20N20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 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: 1046/65536 symbol table entries, 0 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-COL-V20P20N20-CTLCardinality.task
lola: E (F ((p72 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))) : (A ((((p73 <= p72) AND (1 <= p26)) U ((p24 + p25 <= p50) OR (p72 <= p0)))) AND (NOT(A (F ((1 <= p75 + p74)))) OR ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + 1 <= p23) AND (p75 + p74 <= p48)))) : ((p49 <= p22) OR E (G (E (F ((2 <= p73)))))) : A (((p50 <= p75 + p74) U A (F ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))) : A (F ((2 <= p24 + p25))) : E (F ((p0 <= p48))) : E ((E (X ((1 <= p0))) U (((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47)) AND (p22 + 1 <= p0)))) : A (G (((((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p26) OR (2 <= p49)) AND (p76 + p77 + 1 <= p0)) AND E (X ((3 <= p49)))))) : E ((E (F ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p23))) U E (G ((1 <= p72))))) : E (G ((p22 <= 2))) : ((E (G (((p75 + p74 <= p23)))) AND E (F (((p26 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))))) AND E (G (E (F ((2 <= p23)))))) : A (F (E (X ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 <= p50))))) : A (G ((E (G ((2 <= p49))) OR (3 <= p26)))) : A ((TRUE U E (X ((1 <= p24 + p25))))) : E (F ((E (G ((1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))) AND A (F ((3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47)))))) : (((p50 <= p49) AND (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47) AND (p75 + p74 <= p26) AND ((p75 + p74 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) OR (p26 <= p72) OR ((p24 + p25 <= p23) AND (p75 + p74 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))) AND ((p76 + p77 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (p0 <= 1) OR (3 <= p50))) OR E (F (E (G ((p73 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))))
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 ((p72 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((p73 <= p72) AND (1 <= p26)) U ((p24 + p25 <= p50) OR (p72 <= p0)))) AND (NOT(A (F ((1 <= p75 + p74)))) OR ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + 1 <= p23) AND (p75 + p74 <= p48))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p73 <= p72) AND (1 <= p26)) U ((p24 + p25 <= p50) OR (p72 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p73 <= p72) AND (1 <= p26)) U ((p24 + p25 <= p50) OR (p72 <= p0))))
lola: processed formula: A ((((p73 <= p72) AND (1 <= p26)) U ((p24 + p25 <= p50) OR (p72 <= p0))))
lola: processed formula length: 74
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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 ((p75 + p74 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p75 + p74)))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + 1 <= p23) AND (p75 + p74 <= p48))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + 1 <= p23) AND (p75 + p74 <= p48))
lola: processed formula length: 161
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: ((p49 <= p22) OR E (G (E (F ((2 <= p73))))))
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: (p49 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p49 <= p22)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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 <= p73)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= p73)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 348923 markings, 1436994 edges, 69772 markings/sec, 0 secs
lola: 695995 markings, 3081330 edges, 69414 markings/sec, 5 secs
lola: 1048309 markings, 4706389 edges, 70463 markings/sec, 10 secs
lola: 1397064 markings, 6338376 edges, 69751 markings/sec, 15 secs
lola: 1747406 markings, 7966492 edges, 70068 markings/sec, 20 secs
lola: 2094514 markings, 9567009 edges, 69422 markings/sec, 25 secs
lola: 2415073 markings, 11037229 edges, 64112 markings/sec, 30 secs
lola: 2749872 markings, 12562362 edges, 66960 markings/sec, 35 secs
lola: 3067870 markings, 14082294 edges, 63600 markings/sec, 40 secs
lola: 3394948 markings, 15580004 edges, 65416 markings/sec, 45 secs
lola: 3736997 markings, 17128316 edges, 68410 markings/sec, 50 secs
lola: 4049601 markings, 18628692 edges, 62521 markings/sec, 55 secs
lola: 4373044 markings, 20071892 edges, 64689 markings/sec, 60 secs
lola: 4672158 markings, 21525457 edges, 59823 markings/sec, 65 secs
lola: 5003718 markings, 22998607 edges, 66312 markings/sec, 70 secs
lola: 5309415 markings, 24487020 edges, 61139 markings/sec, 75 secs
lola: 5638223 markings, 26012680 edges, 65762 markings/sec, 80 secs
lola: 5937721 markings, 27395018 edges, 59900 markings/sec, 85 secs
lola: 6251581 markings, 28899294 edges, 62772 markings/sec, 90 secs
lola: 6575029 markings, 30324304 edges, 64690 markings/sec, 95 secs
lola: 6873020 markings, 31790950 edges, 59598 markings/sec, 100 secs
lola: 7192256 markings, 33302629 edges, 63847 markings/sec, 105 secs
lola: 7509474 markings, 34707271 edges, 63444 markings/sec, 110 secs
lola: 7805917 markings, 36164178 edges, 59289 markings/sec, 115 secs
lola: 8122049 markings, 37667854 edges, 63226 markings/sec, 120 secs
lola: 8444963 markings, 39077240 edges, 64583 markings/sec, 125 secs
lola: 8734070 markings, 40502796 edges, 57821 markings/sec, 130 secs
lola: 9046031 markings, 42014533 edges, 62392 markings/sec, 135 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9342965 markings, 43392554 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p50 <= p75 + p74) U A (F ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p50 <= p75 + p74) U A(TRUE U (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))
lola: processed formula length: 155
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 169 markings, 221 edges
lola: ========================================
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p24 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p24 + p25)))
lola: processed formula: A (F ((2 <= p24 + p25)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= p48)))
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-COL-V20P20N20-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p0))) U (((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47)) AND (p22 + 1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((1 <= p0)) U (((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47)) AND (p22 + 1 <= p0)))
lola: processed formula length: 299
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 344434 markings, 1096006 edges, 3225129013156511744 markings/sec, 0 secs
lola: 666026 markings, 2213676 edges, 64318 markings/sec, 5 secs
lola: 986175 markings, 3313828 edges, 64030 markings/sec, 10 secs
lola: 1305993 markings, 4417903 edges, 63964 markings/sec, 15 secs
lola: 1618983 markings, 5497554 edges, 62598 markings/sec, 20 secs
lola: 1930825 markings, 6569191 edges, 62368 markings/sec, 25 secs
lola: 2242421 markings, 7640507 edges, 62319 markings/sec, 30 secs
lola: 2551426 markings, 8701813 edges, 61801 markings/sec, 35 secs
lola: 2854670 markings, 9770260 edges, 60649 markings/sec, 40 secs
lola: 3156655 markings, 10813612 edges, 60397 markings/sec, 45 secs
lola: 3459446 markings, 11848719 edges, 60558 markings/sec, 50 secs
lola: 3751842 markings, 12896442 edges, 58479 markings/sec, 55 secs
lola: 4045747 markings, 13901427 edges, 58781 markings/sec, 60 secs
lola: 4310261 markings, 14850156 edges, 52903 markings/sec, 65 secs
lola: 4604242 markings, 15845560 edges, 58796 markings/sec, 70 secs
lola: 4892146 markings, 16890294 edges, 57581 markings/sec, 75 secs
lola: 5176102 markings, 17884721 edges, 56791 markings/sec, 80 secs
lola: 5449925 markings, 18851214 edges, 54765 markings/sec, 85 secs
lola: 5727187 markings, 19849034 edges, 55452 markings/sec, 90 secs
lola: 6023078 markings, 20842884 edges, 59178 markings/sec, 95 secs
lola: 6300016 markings, 21869923 edges, 55388 markings/sec, 100 secs
lola: 6584053 markings, 22889452 edges, 56807 markings/sec, 105 secs
lola: 6875892 markings, 23868286 edges, 58368 markings/sec, 110 secs
lola: 7149742 markings, 24889446 edges, 54770 markings/sec, 115 secs
lola: 7433207 markings, 25910398 edges, 56693 markings/sec, 120 secs
lola: 7732706 markings, 26902758 edges, 59900 markings/sec, 125 secs
lola: 8000839 markings, 27908716 edges, 53627 markings/sec, 130 secs
lola: 8283956 markings, 28946244 edges, 56623 markings/sec, 135 secs
lola: 8559708 markings, 29941685 edges, 55150 markings/sec, 140 secs
lola: 8853480 markings, 30924772 edges, 58754 markings/sec, 145 secs
lola: 9120659 markings, 31928564 edges, 53436 markings/sec, 150 secs
lola: 9406017 markings, 32968501 edges, 57072 markings/sec, 155 secs
lola: 9674141 markings, 33942070 edges, 53625 markings/sec, 160 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 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p26) OR (2 <= p49)) AND (p76 + p77 + 1 <= p0)) AND E (X ((3 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p26) OR (2 <= p49)) AND (p76 + p77 + 1 <= p0))))
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: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p23))) U E (G ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p23)) U NOT(A(TRUE U (p72 <= 0))))
lola: processed formula length: 164
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 440205 markings, 1323367 edges, 3225752436249460736 markings/sec, 0 secs
lola: 889474 markings, 2721959 edges, 89854 markings/sec, 5 secs
lola: 1337736 markings, 4096239 edges, 89652 markings/sec, 10 secs
lola: 1774228 markings, 5461341 edges, 87298 markings/sec, 15 secs
lola: 2211220 markings, 6814698 edges, 87398 markings/sec, 20 secs
lola: 2642449 markings, 8152040 edges, 86246 markings/sec, 25 secs
lola: 3058323 markings, 9457768 edges, 83175 markings/sec, 30 secs
lola: 3465764 markings, 10734703 edges, 81488 markings/sec, 35 secs
lola: 3873055 markings, 12010010 edges, 81458 markings/sec, 40 secs
lola: 4283948 markings, 13267139 edges, 82179 markings/sec, 45 secs
lola: 4667395 markings, 14532571 edges, 76689 markings/sec, 50 secs
lola: 5064138 markings, 15770332 edges, 79349 markings/sec, 55 secs
lola: 5446889 markings, 17011514 edges, 76550 markings/sec, 60 secs
lola: 5832368 markings, 18226894 edges, 77096 markings/sec, 65 secs
lola: 6210987 markings, 19457966 edges, 75724 markings/sec, 70 secs
lola: 6593356 markings, 20653356 edges, 76474 markings/sec, 75 secs
lola: 6968677 markings, 21897119 edges, 75064 markings/sec, 80 secs
lola: 7355145 markings, 23071945 edges, 77294 markings/sec, 85 secs
lola: 7715122 markings, 24306501 edges, 71995 markings/sec, 90 secs
lola: 8087025 markings, 25496425 edges, 74381 markings/sec, 95 secs
lola: 8457878 markings, 26664254 edges, 74171 markings/sec, 100 secs
lola: 8826310 markings, 27912672 edges, 73686 markings/sec, 105 secs
lola: 9197389 markings, 29078272 edges, 74216 markings/sec, 110 secs
lola: 9214855 markings, 30721736 edges, 3493 markings/sec, 115 secs
lola: 9218765 markings, 32390472 edges, 782 markings/sec, 120 secs
lola: 9222810 markings, 34024054 edges, 809 markings/sec, 125 secs
lola: 9227194 markings, 35652030 edges, 877 markings/sec, 130 secs
lola: 9231656 markings, 37283759 edges, 892 markings/sec, 135 secs
lola: 9236017 markings, 38896079 edges, 872 markings/sec, 140 secs
lola: 9240588 markings, 40516917 edges, 914 markings/sec, 145 secs
lola: 9245545 markings, 42124682 edges, 991 markings/sec, 150 secs
lola: 9249720 markings, 43688937 edges, 835 markings/sec, 155 secs
lola: 9253442 markings, 45276144 edges, 744 markings/sec, 160 secs
lola: 9258949 markings, 46820390 edges, 1101 markings/sec, 165 secs
lola: 9261559 markings, 48364683 edges, 522 markings/sec, 170 secs
lola: 9266930 markings, 49908807 edges, 1074 markings/sec, 175 secs
lola: 9269556 markings, 51457425 edges, 525 markings/sec, 180 secs
lola: 9275259 markings, 52980969 edges, 1141 markings/sec, 185 secs
lola: 9277442 markings, 54550475 edges, 437 markings/sec, 190 secs
lola: 9282984 markings, 56044284 edges, 1108 markings/sec, 195 secs
lola: 9285803 markings, 57559995 edges, 564 markings/sec, 200 secs
lola: 9288536 markings, 59039552 edges, 547 markings/sec, 205 secs
lola: 9294659 markings, 60505605 edges, 1225 markings/sec, 210 secs
lola: 9296238 markings, 62017120 edges, 316 markings/sec, 215 secs
lola: 9299275 markings, 63496938 edges, 607 markings/sec, 220 secs
lola: 9305552 markings, 64950406 edges, 1255 markings/sec, 225 secs
lola: 9307092 markings, 66435196 edges, 308 markings/sec, 230 secs
lola: 9309572 markings, 67949502 edges, 496 markings/sec, 235 secs
lola: 9316809 markings, 69396680 edges, 1447 markings/sec, 240 secs
lola: 9318074 markings, 70829237 edges, 253 markings/sec, 245 secs
lola: 9319962 markings, 72342959 edges, 378 markings/sec, 250 secs
lola: 9323088 markings, 73782760 edges, 625 markings/sec, 255 secs
lola: 9329418 markings, 75222815 edges, 1266 markings/sec, 260 secs
lola: 9331144 markings, 76622359 edges, 345 markings/sec, 265 secs
lola: 9332894 markings, 78148904 edges, 350 markings/sec, 270 secs
lola: 9336030 markings, 79646362 edges, 627 markings/sec, 275 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9342965 markings, 80844451 edges
lola: ========================================
lola: subprocess 9 will run for 420 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p22 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p22)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 466267 markings, 1400868 edges, 3689348869717491712 markings/sec, 0 secs
lola: 911899 markings, 2711016 edges, 89126 markings/sec, 5 secs
lola: 1310669 markings, 3943839 edges, 79754 markings/sec, 10 secs
lola: 1697055 markings, 5137578 edges, 77277 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1889173 markings, 5755204 edges
lola: ========================================
lola: subprocess 10 will run for 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((p75 + p74 <= p23)))) AND E (F (((p26 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))))) AND E (G (E (F ((2 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p75 + p74 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p23 + 1 <= p75 + p74))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 74025 markings, 255954 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 <= p50)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 <= p50)))
lola: processed formula length: 146
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 123244 markings, 399423 edges
lola: ========================================
lola: subprocess 12 will run for 729 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p49))) OR (3 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p49 <= 1)) AND (p26 <= 2))))
lola: processed formula length: 52
lola: 6 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 555361 markings, 1415372 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1044698 markings, 2890155 edges, 97867 markings/sec, 5 secs
lola: 1507237 markings, 4351286 edges, 92508 markings/sec, 10 secs
lola: 1971907 markings, 5768597 edges, 92934 markings/sec, 15 secs
lola: 2414856 markings, 7173486 edges, 88590 markings/sec, 20 secs
lola: 2848985 markings, 8549776 edges, 86826 markings/sec, 25 secs
lola: 3280107 markings, 9904800 edges, 86224 markings/sec, 30 secs
lola: 3713577 markings, 11243583 edges, 86694 markings/sec, 35 secs
lola: 4098645 markings, 12586725 edges, 77014 markings/sec, 40 secs
lola: 4520183 markings, 13915505 edges, 84308 markings/sec, 45 secs
lola: 4918647 markings, 15126607 edges, 79693 markings/sec, 50 secs
lola: 5272650 markings, 16373929 edges, 70801 markings/sec, 55 secs
lola: 5680730 markings, 17588933 edges, 81616 markings/sec, 60 secs
lola: 6029704 markings, 18844163 edges, 69795 markings/sec, 65 secs
lola: 6471787 markings, 20163670 edges, 88417 markings/sec, 70 secs
lola: 6860729 markings, 21568127 edges, 77788 markings/sec, 75 secs
lola: 7296618 markings, 22894475 edges, 87178 markings/sec, 80 secs
lola: 7680376 markings, 24260702 edges, 76752 markings/sec, 85 secs
lola: 8069012 markings, 25616460 edges, 77727 markings/sec, 90 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8143397 markings, 25864705 edges
lola: subprocess 13 will run for 941 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((TRUE U E (X ((1 <= p24 + p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U EX((1 <= p24 + p25)))
lola: processed formula length: 30
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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: 73920 markings, 255620 edges
lola: ========================================
lola: subprocess 14 will run for 1410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))) AND A (F ((3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 <= 0))) AND A(TRUE U (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))))
lola: processed formula length: 302
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 250211 markings, 1769952 edges, 3225129013156511744 markings/sec, 0 secs
lola: 492102 markings, 3564671 edges, 48378 markings/sec, 5 secs
lola: 748411 markings, 5464409 edges, 51262 markings/sec, 10 secs
lola: 1003277 markings, 7347487 edges, 50973 markings/sec, 15 secs
lola: 1255316 markings, 9214547 edges, 50408 markings/sec, 20 secs
lola: 1504483 markings, 11059323 edges, 49833 markings/sec, 25 secs
lola: 1753153 markings, 12893529 edges, 49734 markings/sec, 30 secs
lola: 2000757 markings, 14719274 edges, 49521 markings/sec, 35 secs
lola: 2248071 markings, 16568852 edges, 49463 markings/sec, 40 secs
lola: 2487619 markings, 18336274 edges, 47910 markings/sec, 45 secs
lola: 2736012 markings, 20163475 edges, 49679 markings/sec, 50 secs
lola: 2967275 markings, 21902159 edges, 46253 markings/sec, 55 secs
lola: 3213390 markings, 23705167 edges, 49223 markings/sec, 60 secs
lola: 3439909 markings, 25416532 edges, 45304 markings/sec, 65 secs
lola: 3681874 markings, 27227536 edges, 48393 markings/sec, 70 secs
lola: 3904696 markings, 28881208 edges, 44564 markings/sec, 75 secs
lola: 4138013 markings, 30638607 edges, 46663 markings/sec, 80 secs
lola: 4373815 markings, 32358166 edges, 47160 markings/sec, 85 secs
lola: 4595257 markings, 34044309 edges, 44288 markings/sec, 90 secs
lola: 4829223 markings, 35807677 edges, 46793 markings/sec, 95 secs
lola: 5056737 markings, 37469965 edges, 45503 markings/sec, 100 secs
lola: 5275808 markings, 39141787 edges, 43814 markings/sec, 105 secs
lola: 5505878 markings, 40875931 edges, 46014 markings/sec, 110 secs
lola: 5737051 markings, 42554837 edges, 46235 markings/sec, 115 secs
lola: 5947938 markings, 44176479 edges, 42177 markings/sec, 120 secs
lola: 6174155 markings, 45884877 edges, 45243 markings/sec, 125 secs
lola: 6408749 markings, 47645210 edges, 46919 markings/sec, 130 secs
lola: 6622083 markings, 49211633 edges, 42667 markings/sec, 135 secs
lola: 6832438 markings, 50828800 edges, 42071 markings/sec, 140 secs
lola: 7057571 markings, 52530735 edges, 45027 markings/sec, 145 secs
lola: 7290994 markings, 54279589 edges, 46685 markings/sec, 150 secs
lola: 7500981 markings, 55820816 edges, 41997 markings/sec, 155 secs
lola: 7708322 markings, 57418827 edges, 41468 markings/sec, 160 secs
lola: 7931718 markings, 59108626 edges, 44679 markings/sec, 165 secs
lola: 8154277 markings, 60798098 edges, 44512 markings/sec, 170 secs
lola: 8380584 markings, 62424445 edges, 45261 markings/sec, 175 secs
lola: 8580506 markings, 63971555 edges, 39984 markings/sec, 180 secs
lola: 8788033 markings, 65571390 edges, 41505 markings/sec, 185 secs
lola: 9011464 markings, 67262319 edges, 44686 markings/sec, 190 secs
lola: 9231942 markings, 68935283 edges, 44096 markings/sec, 195 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9342965 markings, 69753799 edges
lola: ========================================
lola: subprocess 15 will run for 2619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p50 <= p49) AND (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47) AND (p75 + p74 <= p26) AND ((p75 + p74 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) OR (p26 <= p72) OR ((p24 + p25 <= p23) AND (p75 + p74 <= p27 + p28 + p29 + p30 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p50 <= p49) AND (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47) AND (p75 + p74 <= p26) AND ((p75 + p74 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) OR (p26 <= p72) OR ((p24 + p25 <= p23) AND (p75 + p74 <= p27 + p28 + p29 + p30 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p50 <= p49) AND (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47) AND (p75 + p74 <= p26) AND ((p75 + p74 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) OR (p26 <= p72) OR ((p24 + p25 <= p23) AND (p75 + p74 <= p27 + p28 + p29 + p30 + p... (shortened)
lola: processed formula length: 671
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 10 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: 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: RESULT
lola:
SUMMARY: yes no no no no yes no no no no no yes no yes no unknown
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-COL-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-COL-V20P20N20.tgz
mv BridgeAndVehicles-COL-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-COL-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-152646312200157"
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 ;