About the Execution of M4M.full for BridgeAndVehicles-COL-V50P50N20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5367.110 | 1258689.00 | 1234823.00 | 504.80 | TF?FFFFFF??TTFF? | normal |
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.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 19K 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 3.9K 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 42K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-COL-V50P50N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312200199
=====================================================================
--------------------
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-V50P50N20-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527009657952
BK_STOP 1527010916641
--------------------
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-V50P50N20 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': 2439272, 'Memory': 15952.79, 'Tool': 'lola'}, {'Time': 2510036, 'Memory': 15952.55, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V50P50N20...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V50P50N20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V50P50N20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-COL-V50P50N20 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2486/65536 symbol table entries, 22 collisions
lola: preprocessing...
lola: finding significant places
lola: 138 places, 2348 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: (E (((p52 <= p83) U (1 <= p135))) AND (A (F ((p59 + p60 + 1 <= p56))) OR E (G (((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR (p136 + p137 <= p83)))))) : (NOT(((((3 <= p83) OR (3 <= p83)) AND (p58 <= 0)) AND E (G ((p53 <= p54 + p55))))) AND (E (((3 <= p82) U (2 <= p54 + p55))) OR (E (G ((2 <= p52))) OR (p135 + 1 <= p54 + p55)))) : E (G ((p58 <= p51))) : NOT((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p135) AND ((p58 + 1 <= p136 + p137) OR (p136 + p137 + 1 <= p57))) OR (E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p82))) OR E (F ((3 <= p136 + p137)))))) : A (F ((E (X ((p83 <= p51))) AND (p57 + 1 <= p83)))) : (A (F (((p58 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) AND (p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))) OR (p82 <= 2)) : (A (G (((p135 <= p82) AND (3 <= p83) AND (2 <= p57)))) OR A (X (E (X ((2 <= p52)))))) : A (F ((2 <= p59 + p60))) : A (((2 <= p82) U (p82 + 1 <= p83))) : E (((2 <= p83) U ((p82 + 1 <= p136 + p137) AND (p58 <= 0)))) : A ((E (G ((p83 <= p57))) U A (F ((p57 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))) : E (G (E (((1 <= p59 + p60) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))) : E (F (((((p52 <= p51) AND (p135 <= p51)) OR (1 <= p56)) AND (3 <= p135)))) : A (F (E (X ((p82 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))) : (((A (F ((p52 <= p58))) AND ((p52 <= 2) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p56))) OR (E (X ((p53 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81))) AND E (F ((3 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81))))) AND A ((((1 <= p58) OR (2 <= p83)) U (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 <= 1)))) : (NOT(((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p135) OR A (G ((1 <= p82))))) AND E (F ((p82 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))
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 (((p52 <= p83) U (1 <= p135))) AND (A (F ((p59 + p60 + 1 <= p56))) OR E (G (((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR (p136 + p137 <=... (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: E (((p52 <= p83) U (1 <= p135)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p52 <= p83) U (1 <= p135))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: 2434 markings, 2604 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p59 + p60 + 1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p59 + p60 + 1 <= p56)))
lola: processed formula: A (F ((p59 + p60 + 1 <= p56)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 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: 25722 markings, 34592 edges, 5144 markings/sec, 0 secs
lola: 42275 markings, 59592 edges, 3311 markings/sec, 5 secs
lola: 57605 markings, 82833 edges, 3066 markings/sec, 10 secs
lola: 71462 markings, 104013 edges, 2771 markings/sec, 15 secs
lola: 96692 markings, 140990 edges, 5046 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 120119 markings, 174853 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((((3 <= p83) OR (3 <= p83)) AND (p58 <= 0)) AND E (G ((p53 <= p54 + p55))))) AND (E (((3 <= p82) U (2 <= p54 + p55))) OR (E (G ((2 <= p52))) OR (p135 + 1 <= p54 + p55))))
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: (((p83 <= 2) AND (p83 <= 2)) OR (1 <= p58))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p83 <= 2) AND (p83 <= 2)) OR (1 <= p58))
lola: processed formula length: 44
lola: 5 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: processed formula with 3 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 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p54 + p55 + 1 <= p53)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p54 + p55 + 1 <= p53)))
lola: processed formula: A (F ((p54 + p55 + 1 <= p53)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 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: 475 markings, 475 edges
lola: ========================================
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: E (G ((p58 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p51 + 1 <= p58)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: 309882 markings, 949778 edges, 3689329903141912576 markings/sec, 0 secs
lola: 586597 markings, 1898859 edges, 55343 markings/sec, 5 secs
lola: 858167 markings, 2851214 edges, 54314 markings/sec, 10 secs
lola: 1119378 markings, 3844785 edges, 52242 markings/sec, 15 secs
lola: 1401532 markings, 4779673 edges, 56431 markings/sec, 20 secs
lola: 1726533 markings, 5751124 edges, 65000 markings/sec, 25 secs
lola: 2024316 markings, 6638538 edges, 59557 markings/sec, 30 secs
lola: 2334633 markings, 7591177 edges, 62063 markings/sec, 35 secs
lola: 2641463 markings, 8543734 edges, 61366 markings/sec, 40 secs
lola: 2928726 markings, 9424266 edges, 57453 markings/sec, 45 secs
lola: 3232054 markings, 10380847 edges, 60666 markings/sec, 50 secs
lola: 3521936 markings, 11294709 edges, 57976 markings/sec, 55 secs
lola: 3787243 markings, 12117646 edges, 53061 markings/sec, 60 secs
lola: 4069629 markings, 13021582 edges, 56477 markings/sec, 65 secs
lola: 4354788 markings, 13936912 edges, 57032 markings/sec, 70 secs
lola: 4638485 markings, 14854255 edges, 56739 markings/sec, 75 secs
lola: 4919481 markings, 15768930 edges, 56199 markings/sec, 80 secs
lola: 5181926 markings, 16595891 edges, 52489 markings/sec, 85 secs
lola: 5436240 markings, 17411695 edges, 50863 markings/sec, 90 secs
lola: 5709987 markings, 18301343 edges, 54749 markings/sec, 95 secs
lola: 5980668 markings, 19193162 edges, 54136 markings/sec, 100 secs
lola: 6252156 markings, 20084827 edges, 54298 markings/sec, 105 secs
lola: 6521621 markings, 20972979 edges, 53893 markings/sec, 110 secs
lola: 6797604 markings, 21889635 edges, 55197 markings/sec, 115 secs
lola: 7048753 markings, 22681204 edges, 50230 markings/sec, 120 secs
lola: 7307033 markings, 23527573 edges, 51656 markings/sec, 125 secs
lola: 7572712 markings, 24407265 edges, 53136 markings/sec, 130 secs
lola: 7834124 markings, 25290031 edges, 52282 markings/sec, 135 secs
lola: 8110581 markings, 26205342 edges, 55291 markings/sec, 140 secs
lola: 8379094 markings, 27107233 edges, 53703 markings/sec, 145 secs
lola: 8648350 markings, 28013246 edges, 53851 markings/sec, 150 secs
lola: 8920369 markings, 28927055 edges, 54404 markings/sec, 155 secs
lola: 9194398 markings, 29846119 edges, 54806 markings/sec, 160 secs
lola: 9427063 markings, 30563343 edges, 46533 markings/sec, 165 secs
lola: 9690664 markings, 31464083 edges, 52720 markings/sec, 170 secs
lola: 9955564 markings, 32364867 edges, 52980 markings/sec, 175 secs
lola: 10224052 markings, 33276482 edges, 53698 markings/sec, 180 secs
lola: 10489667 markings, 34177321 edges, 53123 markings/sec, 185 secs
lola: 10749373 markings, 35057660 edges, 51941 markings/sec, 190 secs
lola: 11007317 markings, 35927975 edges, 51589 markings/sec, 195 secs
lola: 11256881 markings, 36783821 edges, 49913 markings/sec, 200 secs
lola: 11501175 markings, 37613734 edges, 48859 markings/sec, 205 secs
lola: 11761497 markings, 38485648 edges, 52064 markings/sec, 210 secs
lola: 12009680 markings, 39347672 edges, 49637 markings/sec, 215 secs
lola: 12235995 markings, 40065751 edges, 45263 markings/sec, 220 secs
lola: 12475547 markings, 40877218 edges, 47910 markings/sec, 225 secs
lola: 12727308 markings, 41735591 edges, 50352 markings/sec, 230 secs
lola: 12977964 markings, 42604068 edges, 50131 markings/sec, 235 secs
lola: 13226356 markings, 43458077 edges, 49678 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: NOT((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p135) AND ((p58 + 1 <= p136 + p137) OR (p136 + p137 + 1 <= p57))) OR (E (G ((p100 + p101 + p102... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p135 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR ((p136 + p137 <= p58) AND (p57 <= p136 + p137)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p135 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR ((p136 + p137 <= p58) AND (p57 <= p136 + p137)))
lola: processed formula length: 361
lola: 9 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: processed formula with 3 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: A (F ((p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))
lola: processed formula: A (F ((p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))
lola: processed formula length: 359
lola: 9 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 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: 425 markings, 425 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((p83 <= p51))) AND (p57 + 1 <= p83))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((p83 <= p51)) AND (p57 + 1 <= p83)))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 425 markings, 424 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((p58 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) AND (p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p58 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) AND (p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p58 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) AND (p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))
lola: processed formula: A (F (((p58 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) AND (p82 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110... (shortened)
lola: processed formula length: 668
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 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: 425 markings, 425 edges
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p82 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p82 <= 2)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p135 <= p82) AND (3 <= p83) AND (2 <= p57)))) OR A (X (E (X ((2 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p135 <= p82) AND (3 <= p83) AND (2 <= p57))))
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 524 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 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N20-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N20-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 49 markings, 48 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((2 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((2 <= p52)))
lola: processed formula length: 18
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p59 + p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p59 + p60)))
lola: processed formula: A (F ((2 <= p59 + p60)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 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: 425 markings, 425 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p82) U (p82 + 1 <= p83)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p82) U (p82 + 1 <= p83)))
lola: processed formula: A (((2 <= p82) U (p82 + 1 <= p83)))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 425 markings, 425 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p83) U ((p82 + 1 <= p136 + p137) AND (p58 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= p83) U ((p82 + 1 <= p136 + p137) AND (p58 <= 0)))
lola: processed formula length: 57
lola: 1 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: 327197 markings, 610528 edges, 3689329903141912576 markings/sec, 0 secs
lola: 618615 markings, 1158559 edges, 58284 markings/sec, 5 secs
lola: 899148 markings, 1688760 edges, 56107 markings/sec, 10 secs
lola: 1319654 markings, 2493829 edges, 84101 markings/sec, 15 secs
lola: 1746746 markings, 3310995 edges, 85418 markings/sec, 20 secs
lola: 2186500 markings, 4148983 edges, 87951 markings/sec, 25 secs
lola: 2551272 markings, 4958992 edges, 72954 markings/sec, 30 secs
lola: 2841342 markings, 5707989 edges, 58014 markings/sec, 35 secs
lola: 3115215 markings, 6415835 edges, 54775 markings/sec, 40 secs
lola: 3374752 markings, 7084470 edges, 51907 markings/sec, 45 secs
lola: 3621833 markings, 7809323 edges, 49416 markings/sec, 50 secs
lola: 3848291 markings, 8672055 edges, 45292 markings/sec, 55 secs
lola: 4085575 markings, 9572358 edges, 47457 markings/sec, 60 secs
lola: 4332349 markings, 10467332 edges, 49355 markings/sec, 65 secs
lola: 4609474 markings, 11246622 edges, 55425 markings/sec, 70 secs
lola: 4865457 markings, 11973136 edges, 51197 markings/sec, 75 secs
lola: 5113614 markings, 12682014 edges, 49631 markings/sec, 80 secs
lola: 5357594 markings, 13377841 edges, 48796 markings/sec, 85 secs
lola: 5594815 markings, 14059862 edges, 47444 markings/sec, 90 secs
lola: 5834015 markings, 14759387 edges, 47840 markings/sec, 95 secs
lola: 6059909 markings, 15619160 edges, 45179 markings/sec, 100 secs
lola: 6293122 markings, 16504858 edges, 46643 markings/sec, 105 secs
lola: 6532402 markings, 17413010 edges, 47856 markings/sec, 110 secs
lola: 6793176 markings, 18189358 edges, 52155 markings/sec, 115 secs
lola: 7039444 markings, 18928137 edges, 49254 markings/sec, 120 secs
lola: 7279408 markings, 19650257 edges, 47993 markings/sec, 125 secs
lola: 7505984 markings, 20339030 edges, 45315 markings/sec, 130 secs
lola: 7728833 markings, 21014762 edges, 44570 markings/sec, 135 secs
lola: 7950277 markings, 21686624 edges, 44289 markings/sec, 140 secs
lola: 8174845 markings, 22366302 edges, 44914 markings/sec, 145 secs
lola: 8400820 markings, 23053591 edges, 45195 markings/sec, 150 secs
lola: 8635682 markings, 23904113 edges, 46972 markings/sec, 155 secs
lola: 8865374 markings, 24778410 edges, 45938 markings/sec, 160 secs
lola: 9102802 markings, 25680482 edges, 47486 markings/sec, 165 secs
lola: 9356730 markings, 26489744 edges, 50786 markings/sec, 170 secs
lola: 9603086 markings, 27252262 edges, 49271 markings/sec, 175 secs
lola: 9832340 markings, 27974006 edges, 45851 markings/sec, 180 secs
lola: 10060424 markings, 28679994 edges, 45617 markings/sec, 185 secs
lola: 10277344 markings, 29360445 edges, 43384 markings/sec, 190 secs
lola: 10486392 markings, 30025171 edges, 41810 markings/sec, 195 secs
lola: 10699413 markings, 30691536 edges, 42604 markings/sec, 200 secs
lola: 10910870 markings, 31357471 edges, 42291 markings/sec, 205 secs
lola: 11113367 markings, 31995397 edges, 40499 markings/sec, 210 secs
lola: 11320690 markings, 32654129 edges, 41465 markings/sec, 215 secs
lola: 11534544 markings, 33360077 edges, 42771 markings/sec, 220 secs
lola: 11750738 markings, 34183832 edges, 43239 markings/sec, 225 secs
lola: 11976821 markings, 35043256 edges, 45217 markings/sec, 230 secs
lola: 12207580 markings, 35911640 edges, 46152 markings/sec, 235 secs
lola: 12466994 markings, 36690907 edges, 51883 markings/sec, 240 secs
lola: 12698888 markings, 37433212 edges, 46379 markings/sec, 245 secs
lola: 12921118 markings, 38143015 edges, 44446 markings/sec, 250 secs
lola: 13134980 markings, 38827461 edges, 42772 markings/sec, 255 secs
lola: 13335243 markings, 39479507 edges, 40053 markings/sec, 260 secs
lola: 13543426 markings, 40145058 edges, 41637 markings/sec, 265 secs
lola: 13739999 markings, 40783961 edges, 39315 markings/sec, 270 secs
lola: 13948776 markings, 41449372 edges, 41755 markings/sec, 275 secs
lola: 14146406 markings, 42092056 edges, 39526 markings/sec, 280 secs
lola: 14349800 markings, 42753608 edges, 40679 markings/sec, 285 secs
lola: 14555943 markings, 43424131 edges, 41229 markings/sec, 290 secs
lola: 14760743 markings, 44088978 edges, 40960 markings/sec, 295 secs
lola: 14969529 markings, 44792807 edges, 41757 markings/sec, 300 secs
lola: 15185636 markings, 45616841 edges, 43221 markings/sec, 305 secs
lola: 15409619 markings, 46469368 edges, 44797 markings/sec, 310 secs
lola: 15640907 markings, 47334358 edges, 46258 markings/sec, 315 secs
lola: 15899596 markings, 48115964 edges, 51738 markings/sec, 320 secs
lola: 16140881 markings, 48894469 edges, 48257 markings/sec, 325 secs
lola: 16369399 markings, 49641074 edges, 45704 markings/sec, 330 secs
lola: 16593851 markings, 50372023 edges, 44890 markings/sec, 335 secs
lola: 16809623 markings, 51086912 edges, 43154 markings/sec, 340 secs
lola: 17028161 markings, 51796304 edges, 43708 markings/sec, 345 secs
lola: 17235855 markings, 52484769 edges, 41539 markings/sec, 350 secs
lola: 17452482 markings, 53189084 edges, 43325 markings/sec, 355 secs
lola: 17659915 markings, 53871925 edges, 41487 markings/sec, 360 secs
lola: 17867265 markings, 54557246 edges, 41470 markings/sec, 365 secs
lola: 18074162 markings, 55241936 edges, 41379 markings/sec, 370 secs
lola: 18279071 markings, 55919732 edges, 40982 markings/sec, 375 secs
lola: 18483833 markings, 56594766 edges, 40952 markings/sec, 380 secs
lola: 18685849 markings, 57266678 edges, 40403 markings/sec, 385 secs
lola: 18907532 markings, 58068316 edges, 44337 markings/sec, 390 secs
lola: 19128899 markings, 58914042 edges, 44273 markings/sec, 395 secs
lola: 19352806 markings, 59766757 edges, 44781 markings/sec, 400 secs
lola: 19590155 markings, 60584899 edges, 47470 markings/sec, 405 secs
lola: 19847840 markings, 61368594 edges, 51537 markings/sec, 410 secs
lola: 20077634 markings, 62126906 edges, 45959 markings/sec, 415 secs
lola: 20301253 markings, 62867150 edges, 44724 markings/sec, 420 secs
lola: 20513290 markings, 63576199 edges, 42407 markings/sec, 425 secs
lola: 20731851 markings, 64291978 edges, 43712 markings/sec, 430 secs
lola: 20940295 markings, 64991256 edges, 41689 markings/sec, 435 secs
lola: 21147332 markings, 65685442 edges, 41407 markings/sec, 440 secs
lola: 21353254 markings, 66375345 edges, 41184 markings/sec, 445 secs
lola: 21566214 markings, 67075791 edges, 42592 markings/sec, 450 secs
lola: 21771182 markings, 67760174 edges, 40994 markings/sec, 455 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((p83 <= p57))) U A (F ((p57 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p57 + 1 <= p83))) U A(TRUE U (p57 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))
lola: processed formula length: 349
lola: 4 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: 325025 markings, 791347 edges, 3225752436249460736 markings/sec, 0 secs
lola: 649005 markings, 1677532 edges, 64796 markings/sec, 5 secs
lola: 947984 markings, 2404855 edges, 59796 markings/sec, 10 secs
lola: 1213718 markings, 3377191 edges, 53147 markings/sec, 15 secs
lola: 1479647 markings, 4361344 edges, 53186 markings/sec, 20 secs
lola: 1740172 markings, 5192099 edges, 52105 markings/sec, 25 secs
lola: 1994188 markings, 5935763 edges, 50803 markings/sec, 30 secs
lola: 2253445 markings, 6862149 edges, 51851 markings/sec, 35 secs
lola: 2519380 markings, 7548276 edges, 53187 markings/sec, 40 secs
lola: 2776183 markings, 8368945 edges, 51361 markings/sec, 45 secs
lola: 3035666 markings, 9293378 edges, 51897 markings/sec, 50 secs
lola: 3302783 markings, 9916292 edges, 53423 markings/sec, 55 secs
lola: 3557861 markings, 10704828 edges, 51016 markings/sec, 60 secs
lola: 3815037 markings, 11614443 edges, 51435 markings/sec, 65 secs
lola: 4082022 markings, 12267437 edges, 53397 markings/sec, 70 secs
lola: 4338126 markings, 12933740 edges, 51221 markings/sec, 75 secs
lola: 4591265 markings, 13821933 edges, 50628 markings/sec, 80 secs
lola: 4853136 markings, 14586415 edges, 52374 markings/sec, 85 secs
lola: 5113563 markings, 15164299 edges, 52085 markings/sec, 90 secs
lola: 5367372 markings, 15935159 edges, 50762 markings/sec, 95 secs
lola: 5620563 markings, 16806314 edges, 50638 markings/sec, 100 secs
lola: 5883742 markings, 17461574 edges, 52636 markings/sec, 105 secs
lola: 6136570 markings, 18025018 edges, 50566 markings/sec, 110 secs
lola: 6385269 markings, 18774298 edges, 49740 markings/sec, 115 secs
lola: 6637995 markings, 19628764 edges, 50545 markings/sec, 120 secs
lola: 6898706 markings, 20280780 edges, 52142 markings/sec, 125 secs
lola: 7148109 markings, 20837135 edges, 49881 markings/sec, 130 secs
lola: 7395258 markings, 21474291 edges, 49430 markings/sec, 135 secs
lola: 7647167 markings, 22309543 edges, 50382 markings/sec, 140 secs
lola: 7906831 markings, 23055663 edges, 51933 markings/sec, 145 secs
lola: 8164223 markings, 23630437 edges, 51478 markings/sec, 150 secs
lola: 8407140 markings, 24176444 edges, 48583 markings/sec, 155 secs
lola: 8656413 markings, 24890992 edges, 49855 markings/sec, 160 secs
lola: 8913797 markings, 25729152 edges, 51477 markings/sec, 165 secs
lola: 9170617 markings, 26496369 edges, 51364 markings/sec, 170 secs
lola: 9433000 markings, 27273550 edges, 52477 markings/sec, 175 secs
lola: 9695456 markings, 27997892 edges, 52491 markings/sec, 180 secs
lola: 9964142 markings, 28632127 edges, 53737 markings/sec, 185 secs
lola: 10232240 markings, 29325358 edges, 53620 markings/sec, 190 secs
lola: 10498070 markings, 30004799 edges, 53166 markings/sec, 195 secs
lola: 10765278 markings, 30706369 edges, 53442 markings/sec, 200 secs
lola: 11024040 markings, 31402247 edges, 51752 markings/sec, 205 secs
lola: 11290850 markings, 32079177 edges, 53362 markings/sec, 210 secs
lola: 11554851 markings, 32728920 edges, 52800 markings/sec, 215 secs
lola: 11818215 markings, 33398212 edges, 52673 markings/sec, 220 secs
lola: 12081567 markings, 34064090 edges, 52670 markings/sec, 225 secs
lola: 12344156 markings, 34735173 edges, 52518 markings/sec, 230 secs
lola: 12604763 markings, 35412187 edges, 52121 markings/sec, 235 secs
lola: 12869124 markings, 36114147 edges, 52872 markings/sec, 240 secs
lola: 13131688 markings, 36775383 edges, 52513 markings/sec, 245 secs
lola: 13386451 markings, 37427656 edges, 50953 markings/sec, 250 secs
lola: 13647232 markings, 38093423 edges, 52156 markings/sec, 255 secs
lola: 13908028 markings, 38746777 edges, 52159 markings/sec, 260 secs
lola: 14169109 markings, 39397195 edges, 52216 markings/sec, 265 secs
lola: 14431947 markings, 40075309 edges, 52568 markings/sec, 270 secs
lola: 14689175 markings, 40754630 edges, 51446 markings/sec, 275 secs
lola: 14947680 markings, 41422267 edges, 51701 markings/sec, 280 secs
lola: 15198339 markings, 42078872 edges, 50132 markings/sec, 285 secs
lola: 15449682 markings, 42745521 edges, 50269 markings/sec, 290 secs
lola: 15705883 markings, 43402998 edges, 51240 markings/sec, 295 secs
lola: 15962561 markings, 44036950 edges, 51336 markings/sec, 300 secs
lola: 16215454 markings, 44660144 edges, 50579 markings/sec, 305 secs
lola: 16467123 markings, 45294465 edges, 50334 markings/sec, 310 secs
lola: 16720749 markings, 45966346 edges, 50725 markings/sec, 315 secs
lola: 16979596 markings, 46638711 edges, 51769 markings/sec, 320 secs
lola: 17232474 markings, 47310417 edges, 50576 markings/sec, 325 secs
lola: 17478563 markings, 47980021 edges, 49218 markings/sec, 330 secs
lola: 17725429 markings, 48643887 edges, 49373 markings/sec, 335 secs
lola: 17970353 markings, 49317715 edges, 48985 markings/sec, 340 secs
lola: 18232858 markings, 49951474 edges, 52501 markings/sec, 345 secs
lola: 18492171 markings, 50581887 edges, 51863 markings/sec, 350 secs
lola: 18746944 markings, 51209855 edges, 50955 markings/sec, 355 secs
lola: 19001684 markings, 51843152 edges, 50948 markings/sec, 360 secs
lola: 19252410 markings, 52515898 edges, 50145 markings/sec, 365 secs
lola: 19495955 markings, 53175465 edges, 48709 markings/sec, 370 secs
lola: 19732893 markings, 53824927 edges, 47388 markings/sec, 375 secs
lola: 19961518 markings, 54456355 edges, 45725 markings/sec, 380 secs
lola: 20195369 markings, 55100800 edges, 46770 markings/sec, 385 secs
lola: 20437720 markings, 55772828 edges, 48470 markings/sec, 390 secs
lola: 20680023 markings, 56454846 edges, 48461 markings/sec, 395 secs
lola: 20934786 markings, 57065353 edges, 50953 markings/sec, 400 secs
lola: 21188786 markings, 57675568 edges, 50800 markings/sec, 405 secs
lola: 21441548 markings, 58285304 edges, 50552 markings/sec, 410 secs
lola: 21687039 markings, 58886400 edges, 49098 markings/sec, 415 secs
lola: 21945678 markings, 59578508 edges, 51728 markings/sec, 420 secs
lola: 22197375 markings, 60265455 edges, 50339 markings/sec, 425 secs
lola: 22448080 markings, 60960755 edges, 50141 markings/sec, 430 secs
lola: 22692267 markings, 61641121 edges, 48837 markings/sec, 435 secs
lola: 22936755 markings, 62331948 edges, 48898 markings/sec, 440 secs
lola: 23175313 markings, 63007021 edges, 47712 markings/sec, 445 secs
lola: 23413523 markings, 63682428 edges, 47642 markings/sec, 450 secs
lola: 23650387 markings, 64356284 edges, 47373 markings/sec, 455 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((1 <= p59 + p60) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((1 <= p59 + p60) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))))
lola: processed formula length: 387
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: 425 markings, 849 edges
lola: ========================================
lola: subprocess 12 will run for 581 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((p52 <= p51) AND (p135 <= p51)) OR (1 <= p56)) AND (3 <= p135))))
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 524 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N20-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N20-CTLCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 13 will run for 775 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p82 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p82 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))
lola: processed formula length: 320
lola: 2 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 425 markings, 424 edges
lola: ========================================
lola: subprocess 14 will run for 1163 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (F ((p52 <= p58))) AND ((p52 <= 2) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p56))) OR (E (X ((p53 <= p61 + p62 + p63 + p64 + p65 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1163 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p52 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p52 <= p58)))
lola: processed formula: A (F ((p52 <= p58)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 528 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p52 <= 2) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p56))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p52 <= 2) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p56))
lola: processed formula length: 323
lola: 0 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81)))
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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p135) OR A (G ((1 <= p82))))) AND E (F ((p82 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p135 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p135 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)
lola: processed formula length: 307
lola: 6 rewrites
lola: formula mentions 0 of 138 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N20-CTLCardinality.task
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p82 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p98 + p97 + p96 + p95 + p94 + p93 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))
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 524 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-V50P50N20-CTLCardinality-17.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N20-CTLCardinality-17.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no no no no no no unknown unknown yes yes no no unknown
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N20-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 stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N20"
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-V50P50N20.tgz
mv BridgeAndVehicles-COL-V50P50N20 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-V50P50N20, 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-152646312200199"
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 '
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 ;