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 irma4mcc-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 r030-ebro-152646308300199
=====================================================================

--------------------
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 1526753292283


BK_STOP 1526754533770

--------------------
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 stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 @ 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: 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 (((p58 <= p1) U (1 <= p135))) AND (A (F ((p136 + p137 + 1 <= p4))) OR E (G (((3 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) OR (p131 + p132 <= p1)))))) : (NOT(((((3 <= p1) OR (3 <= p1)) AND (p133 <= 0)) AND E (G ((p3 <= p5 + p6))))) AND (E (((3 <= p0) U (2 <= p5 + p6))) OR (E (G ((2 <= p58))) OR (p135 + 1 <= p5 + p6)))) : E (G ((p133 <= p2))) : NOT((((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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p135) AND ((p133 + 1 <= p131 + p132) OR (p131 + p132 + 1 <= p134))) OR (E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p0))) OR E (F ((3 <= p131 + p132)))))) : A (F ((E (X ((p1 <= p2))) AND (p134 + 1 <= p1)))) : (A (F (((p133 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) AND (p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))) OR (p0 <= 2)) : (A (G (((p135 <= p0) AND (3 <= p1) AND (2 <= p134)))) OR A (X (E (X ((2 <= p58)))))) : A (F ((2 <= p136 + p137))) : A (((2 <= p0) U (p0 + 1 <= p1))) : E (((2 <= p1) U ((p0 + 1 <= p131 + p132) AND (p133 <= 0)))) : A ((E (G ((p1 <= p134))) U A (F ((p134 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57))))) : E (G (E (((1 <= p136 + p137) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))) : E (F (((((p58 <= p2) AND (p135 <= p2)) OR (1 <= p4)) AND (3 <= p135)))) : A (F (E (X ((p0 + 1 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57))))) : (((A (F ((p58 <= p133))) AND ((p58 <= 2) AND (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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 1 <= p4))) OR (E (X ((p3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))) AND E (F ((3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))) AND A ((((1 <= p133) OR (2 <= p1)) U (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1)))) : (NOT(((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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p135) OR A (G ((1 <= p0))))) AND E (F ((p0 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + 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 (((p58 <= p1) U (1 <= p135))) AND (A (F ((p136 + p137 + 1 <= p4))) OR E (G (((3 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) OR (p131 + ... (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 (((p58 <= p1) U (1 <= p135)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p58 <= p1) U (1 <= p135))
lola: processed formula length: 28
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: 3381 markings, 4480 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p136 + p137 + 1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p136 + p137 + 1 <= p4)))
lola: processed formula: A (F ((p136 + p137 + 1 <= p4)))
lola: processed formula length: 31
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: 120162 markings, 173701 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((((3 <= p1) OR (3 <= p1)) AND (p133 <= 0)) AND E (G ((p3 <= p5 + p6))))) AND (E (((3 <= p0) U (2 <= p5 + p6))) OR (E (G ((2 <= p58))) OR (p135 + 1 <= p5 + p6))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p1 <= 2) AND (p1 <= 2)) OR (1 <= p133))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1 <= 2) AND (p1 <= 2)) OR (1 <= p133))
lola: processed formula length: 43
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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p5 + p6 + 1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p5 + p6 + 1 <= p3)))
lola: processed formula: A (F ((p5 + p6 + 1 <= p3)))
lola: processed formula length: 27
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: 425 markings, 425 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: E (G ((p133 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p2 + 1 <= p133)))
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: 404428 markings, 1274192 edges, 3689320832170983424 markings/sec, 0 secs
lola: 802936 markings, 2650438 edges, 79702 markings/sec, 5 secs
lola: 1218577 markings, 4213880 edges, 83128 markings/sec, 10 secs
lola: 1607681 markings, 5393054 edges, 77821 markings/sec, 15 secs
lola: 2004213 markings, 6534883 edges, 79306 markings/sec, 20 secs
lola: 2357556 markings, 7738519 edges, 70669 markings/sec, 25 secs
lola: 2720510 markings, 8933906 edges, 72591 markings/sec, 30 secs
lola: 3104310 markings, 10087312 edges, 76760 markings/sec, 35 secs
lola: 3451561 markings, 11271982 edges, 69450 markings/sec, 40 secs
lola: 3800740 markings, 12460504 edges, 69836 markings/sec, 45 secs
lola: 4162293 markings, 13650663 edges, 72311 markings/sec, 50 secs
lola: 4543188 markings, 14797346 edges, 76179 markings/sec, 55 secs
lola: 4884968 markings, 15952066 edges, 68356 markings/sec, 60 secs
lola: 5223159 markings, 17127230 edges, 67638 markings/sec, 65 secs
lola: 5569213 markings, 18307627 edges, 69211 markings/sec, 70 secs
lola: 5927037 markings, 19496089 edges, 71565 markings/sec, 75 secs
lola: 6303957 markings, 20669498 edges, 75384 markings/sec, 80 secs
lola: 6651116 markings, 21770072 edges, 69432 markings/sec, 85 secs
lola: 6981828 markings, 22937631 edges, 66142 markings/sec, 90 secs
lola: 7315946 markings, 24106472 edges, 66824 markings/sec, 95 secs
lola: 7655499 markings, 25281117 edges, 67911 markings/sec, 100 secs
lola: 8004841 markings, 26458028 edges, 69868 markings/sec, 105 secs
lola: 8368024 markings, 27651666 edges, 72637 markings/sec, 110 secs
lola: 8732485 markings, 28768040 edges, 72892 markings/sec, 115 secs
lola: 9054596 markings, 29921240 edges, 64422 markings/sec, 120 secs
lola: 9384647 markings, 31088917 edges, 66010 markings/sec, 125 secs
lola: 9724030 markings, 32271030 edges, 67877 markings/sec, 130 secs
lola: 10077844 markings, 33472281 edges, 70763 markings/sec, 135 secs
lola: 10433940 markings, 34671219 edges, 71219 markings/sec, 140 secs
lola: 10773477 markings, 35804098 edges, 67907 markings/sec, 145 secs
lola: 11113317 markings, 36939474 edges, 67968 markings/sec, 150 secs
lola: 11409052 markings, 37886223 edges, 59147 markings/sec, 155 secs
lola: 11746788 markings, 39030327 edges, 67547 markings/sec, 160 secs
lola: 12082733 markings, 40167581 edges, 67189 markings/sec, 165 secs
lola: 12418854 markings, 41296708 edges, 67224 markings/sec, 170 secs
lola: 12748335 markings, 42425593 edges, 65896 markings/sec, 175 secs
lola: 13078724 markings, 43552345 edges, 66078 markings/sec, 180 secs
lola: 13408672 markings, 44674420 edges, 65990 markings/sec, 185 secs
lola: 13737506 markings, 45792806 edges, 65767 markings/sec, 190 secs
lola: 14064404 markings, 46908196 edges, 65380 markings/sec, 195 secs
lola: 14425450 markings, 47925430 edges, 72209 markings/sec, 200 secs
lola: 14723832 markings, 49025237 edges, 59676 markings/sec, 205 secs
lola: 15028723 markings, 50148838 edges, 60978 markings/sec, 210 secs
lola: 15336953 markings, 51274097 edges, 61646 markings/sec, 215 secs
lola: 15647392 markings, 52400678 edges, 62088 markings/sec, 220 secs
lola: 15961212 markings, 53528646 edges, 62764 markings/sec, 225 secs
lola: 16281277 markings, 54667288 edges, 64013 markings/sec, 230 secs
lola: 16605387 markings, 55811037 edges, 64822 markings/sec, 235 secs
lola: 16935766 markings, 56965728 edges, 66076 markings/sec, 240 secs
lola: 17274461 markings, 58135234 edges, 67739 markings/sec, 245 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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p135) AND ((p133 + 1 <= p131 + p132) OR (p131 + p132 + 1 <= p134))) OR (E (G ((p100 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p135 + 1 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) OR ((p131 + p132 <= p133) AND (p134 <= p131 + p132)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p135 + 1 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) OR ((p131 + p132 <= p133) AND (p134 <= p131 + p132)))
lola: processed formula length: 370
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 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + 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 ((p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))
lola: processed formula: A (F ((p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))
lola: processed formula length: 333
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 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((p1 <= p2))) AND (p134 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((p1 <= p2)) AND (p134 + 1 <= p1)))
lola: processed formula length: 47
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 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((p133 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) AND (p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p133 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) AND (p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p133 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) AND (p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))
lola: processed formula: A (F (((p133 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57) AND (p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109... (shortened)
lola: processed formula length: 650
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 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p0 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= 2)
lola: processed formula length: 9
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 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p135 <= p0) AND (3 <= p1) AND (2 <= p134)))) OR A (X (E (X ((2 <= p58))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p135 <= p0) AND (3 <= p1) AND (2 <= p134))))
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 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((2 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((2 <= p58)))
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 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p136 + p137)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p136 + p137)))
lola: processed formula: A (F ((2 <= p136 + p137)))
lola: processed formula length: 26
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 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p0) U (p0 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p0) U (p0 + 1 <= p1)))
lola: processed formula: A (((2 <= p0) U (p0 + 1 <= p1)))
lola: processed formula length: 32
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 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p1) U ((p0 + 1 <= p131 + p132) AND (p133 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= p1) U ((p0 + 1 <= p131 + p132) AND (p133 <= 0)))
lola: processed formula length: 56
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: 397187 markings, 749870 edges, 3689330178019819520 markings/sec, 0 secs
lola: 786322 markings, 1481603 edges, 77827 markings/sec, 5 secs
lola: 1355577 markings, 2563053 edges, 113851 markings/sec, 10 secs
lola: 1929315 markings, 3660479 edges, 114748 markings/sec, 15 secs
lola: 2498077 markings, 4768749 edges, 113752 markings/sec, 20 secs
lola: 2927541 markings, 5878192 edges, 85893 markings/sec, 25 secs
lola: 3339092 markings, 6949635 edges, 82310 markings/sec, 30 secs
lola: 3718679 markings, 8178219 edges, 75917 markings/sec, 35 secs
lola: 4059640 markings, 9476221 edges, 68192 markings/sec, 40 secs
lola: 4452616 markings, 10733535 edges, 78595 markings/sec, 45 secs
lola: 4850221 markings, 11883002 edges, 79521 markings/sec, 50 secs
lola: 5238119 markings, 12990829 edges, 77580 markings/sec, 55 secs
lola: 5612530 markings, 14085576 edges, 74882 markings/sec, 60 secs
lola: 5982049 markings, 15322807 edges, 73904 markings/sec, 65 secs
lola: 6325737 markings, 16631566 edges, 68738 markings/sec, 70 secs
lola: 6724988 markings, 17905203 edges, 79850 markings/sec, 75 secs
lola: 7113409 markings, 19085641 edges, 77684 markings/sec, 80 secs
lola: 7484220 markings, 20227213 edges, 74162 markings/sec, 85 secs
lola: 7850013 markings, 21346752 edges, 73159 markings/sec, 90 secs
lola: 8208370 markings, 22445436 edges, 71671 markings/sec, 95 secs
lola: 8567797 markings, 23644420 edges, 71885 markings/sec, 100 secs
lola: 8907826 markings, 24940418 edges, 68006 markings/sec, 105 secs
lola: 9290250 markings, 26190355 edges, 76485 markings/sec, 110 secs
lola: 9670963 markings, 27389876 edges, 76143 markings/sec, 115 secs
lola: 10036476 markings, 28542576 edges, 73103 markings/sec, 120 secs
lola: 10394346 markings, 29668744 edges, 71574 markings/sec, 125 secs
lola: 10739531 markings, 30779915 edges, 69037 markings/sec, 130 secs
lola: 11084198 markings, 31868049 edges, 68933 markings/sec, 135 secs
lola: 11420625 markings, 32937100 edges, 67285 markings/sec, 140 secs
lola: 11762409 markings, 34228626 edges, 68357 markings/sec, 145 secs
lola: 12091161 markings, 35481209 edges, 65750 markings/sec, 150 secs
lola: 12503172 markings, 36716679 edges, 82402 markings/sec, 155 secs
lola: 12875599 markings, 37873650 edges, 74485 markings/sec, 160 secs
lola: 13226086 markings, 39033748 edges, 70097 markings/sec, 165 secs
lola: 13569649 markings, 40162445 edges, 68713 markings/sec, 170 secs
lola: 13912742 markings, 41275402 edges, 68619 markings/sec, 175 secs
lola: 14249995 markings, 42377753 edges, 67451 markings/sec, 180 secs
lola: 14579549 markings, 43474022 edges, 65911 markings/sec, 185 secs
lola: 14915602 markings, 44585958 edges, 67211 markings/sec, 190 secs
lola: 15258562 markings, 45895440 edges, 68592 markings/sec, 195 secs
lola: 15591733 markings, 47162202 edges, 66634 markings/sec, 200 secs
lola: 16012934 markings, 48373737 edges, 84240 markings/sec, 205 secs
lola: 16375049 markings, 49535410 edges, 72423 markings/sec, 210 secs
lola: 16725892 markings, 50692675 edges, 70169 markings/sec, 215 secs
lola: 17062874 markings, 51835635 edges, 67396 markings/sec, 220 secs
lola: 17402081 markings, 52957065 edges, 67841 markings/sec, 225 secs
lola: 17730583 markings, 54067719 edges, 65700 markings/sec, 230 secs
lola: 18064263 markings, 55178929 edges, 66736 markings/sec, 235 secs
lola: 18390755 markings, 56264665 edges, 65298 markings/sec, 240 secs
lola: 18714853 markings, 57343710 edges, 64820 markings/sec, 245 secs
lola: 19063542 markings, 58664807 edges, 69738 markings/sec, 250 secs
lola: 19400761 markings, 59952090 edges, 67444 markings/sec, 255 secs
lola: 19813492 markings, 61161590 edges, 82546 markings/sec, 260 secs
lola: 20186648 markings, 62328277 edges, 74631 markings/sec, 265 secs
lola: 20539997 markings, 63520098 edges, 70670 markings/sec, 270 secs
lola: 20887911 markings, 64669748 edges, 69583 markings/sec, 275 secs
lola: 21216702 markings, 65822007 edges, 65758 markings/sec, 280 secs
lola: 21553065 markings, 66956495 edges, 67273 markings/sec, 285 secs
lola: 21881909 markings, 68075972 edges, 65769 markings/sec, 290 secs
lola: 22213130 markings, 69180132 edges, 66244 markings/sec, 295 secs
lola: 22534214 markings, 70289258 edges, 64217 markings/sec, 300 secs
lola: 22854419 markings, 71375346 edges, 64041 markings/sec, 305 secs
lola: 23192022 markings, 72583478 edges, 67521 markings/sec, 310 secs
lola: 23529300 markings, 73874452 edges, 67456 markings/sec, 315 secs
lola: 23880795 markings, 75148458 edges, 70299 markings/sec, 320 secs
lola: 24210801 markings, 76321473 edges, 66001 markings/sec, 325 secs
lola: 24525253 markings, 77452020 edges, 62890 markings/sec, 330 secs
lola: 24840496 markings, 78587012 edges, 63049 markings/sec, 335 secs
lola: 25151856 markings, 79713789 edges, 62272 markings/sec, 340 secs
lola: 25450856 markings, 80725180 edges, 59800 markings/sec, 345 secs
lola: 25763748 markings, 81689585 edges, 62578 markings/sec, 350 secs
lola: 26111484 markings, 82724002 edges, 69547 markings/sec, 355 secs
lola: 26475196 markings, 83811794 edges, 72742 markings/sec, 360 secs
lola: 26703363 markings, 84612958 edges, 45633 markings/sec, 365 secs
lola: 26941923 markings, 85440221 edges, 47712 markings/sec, 370 secs
lola: 27168435 markings, 86224880 edges, 45302 markings/sec, 375 secs
lola: 27393581 markings, 87004956 edges, 45029 markings/sec, 380 secs
lola: 27616751 markings, 87778696 edges, 44634 markings/sec, 385 secs
lola: 27827913 markings, 88522536 edges, 42232 markings/sec, 390 secs
lola: 28050505 markings, 89293879 edges, 44518 markings/sec, 395 secs
lola: 28273459 markings, 90068303 edges, 44591 markings/sec, 400 secs
lola: 28495833 markings, 90841298 edges, 44475 markings/sec, 405 secs
lola: 28717827 markings, 91612409 edges, 44399 markings/sec, 410 secs
lola: 28939165 markings, 92382127 edges, 44268 markings/sec, 415 secs
lola: 29161297 markings, 93153057 edges, 44426 markings/sec, 420 secs
lola: 29389414 markings, 93939166 edges, 45623 markings/sec, 425 secs
lola: 29609141 markings, 94704106 edges, 43945 markings/sec, 430 secs
lola: 29827084 markings, 95464693 edges, 43589 markings/sec, 435 secs
lola: 30053639 markings, 96246713 edges, 45311 markings/sec, 440 secs
lola: 30278311 markings, 97023125 edges, 44934 markings/sec, 445 secs
lola: 30617173 markings, 97958527 edges, 67772 markings/sec, 450 secs
lola: 30975308 markings, 99091107 edges, 71627 markings/sec, 455 secs
lola: 31325703 markings, 100330209 edges, 70079 markings/sec, 460 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 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((p1 <= p134))) U A (F ((p134 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p134 + 1 <= p1))) U A(TRUE U (p134 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))
lola: processed formula length: 357
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: 356869 markings, 959951 edges, 3225129562912325632 markings/sec, 0 secs
lola: 731793 markings, 1985554 edges, 74985 markings/sec, 5 secs
lola: 1099046 markings, 2995688 edges, 73451 markings/sec, 10 secs
lola: 1442245 markings, 4026746 edges, 68640 markings/sec, 15 secs
lola: 1746425 markings, 5017367 edges, 60836 markings/sec, 20 secs
lola: 2056787 markings, 6058273 edges, 62072 markings/sec, 25 secs
lola: 2361406 markings, 7195165 edges, 60924 markings/sec, 30 secs
lola: 2663186 markings, 8309241 edges, 60356 markings/sec, 35 secs
lola: 2987292 markings, 9371022 edges, 64821 markings/sec, 40 secs
lola: 3286692 markings, 10376737 edges, 59880 markings/sec, 45 secs
lola: 3583048 markings, 11366376 edges, 59271 markings/sec, 50 secs
lola: 3881173 markings, 12383739 edges, 59625 markings/sec, 55 secs
lola: 4195781 markings, 13558601 edges, 62922 markings/sec, 60 secs
lola: 4499827 markings, 14680904 edges, 60809 markings/sec, 65 secs
lola: 4832551 markings, 15777062 edges, 66545 markings/sec, 70 secs
lola: 5141432 markings, 16837454 edges, 61776 markings/sec, 75 secs
lola: 5445538 markings, 17875892 edges, 60821 markings/sec, 80 secs
lola: 5746111 markings, 18897070 edges, 60115 markings/sec, 85 secs
lola: 6052773 markings, 19951642 edges, 61332 markings/sec, 90 secs
lola: 6368698 markings, 21130324 edges, 63185 markings/sec, 95 secs
lola: 6679463 markings, 22279014 edges, 62153 markings/sec, 100 secs
lola: 7021536 markings, 23395671 edges, 68415 markings/sec, 105 secs
lola: 7327387 markings, 24466573 edges, 61170 markings/sec, 110 secs
lola: 7629722 markings, 25516065 edges, 60467 markings/sec, 115 secs
lola: 7929216 markings, 26547667 edges, 59899 markings/sec, 120 secs
lola: 8225877 markings, 27567978 edges, 59332 markings/sec, 125 secs
lola: 8518799 markings, 28575945 edges, 58584 markings/sec, 130 secs
lola: 8840830 markings, 29766715 edges, 64406 markings/sec, 135 secs
lola: 9152678 markings, 30921718 edges, 62370 markings/sec, 140 secs
lola: 9494790 markings, 32057372 edges, 68422 markings/sec, 145 secs
lola: 9808910 markings, 33143791 edges, 62824 markings/sec, 150 secs
lola: 10112178 markings, 34209927 edges, 60654 markings/sec, 155 secs
lola: 10412646 markings, 35255147 edges, 60094 markings/sec, 160 secs
lola: 10707354 markings, 36291425 edges, 58942 markings/sec, 165 secs
lola: 11004397 markings, 37318548 edges, 59409 markings/sec, 170 secs
lola: 11297395 markings, 38334689 edges, 58600 markings/sec, 175 secs
lola: 11607886 markings, 39449159 edges, 62098 markings/sec, 180 secs
lola: 11918818 markings, 40605034 edges, 62186 markings/sec, 185 secs
lola: 12246267 markings, 41737817 edges, 65490 markings/sec, 190 secs
lola: 12575394 markings, 42838024 edges, 65825 markings/sec, 195 secs
lola: 12885941 markings, 43937352 edges, 62109 markings/sec, 200 secs
lola: 13186630 markings, 45006908 edges, 60138 markings/sec, 205 secs
lola: 13485262 markings, 46056017 edges, 59726 markings/sec, 210 secs
lola: 13780496 markings, 47091440 edges, 59047 markings/sec, 215 secs
lola: 14073996 markings, 48123579 edges, 58700 markings/sec, 220 secs
lola: 14366529 markings, 49140798 edges, 58507 markings/sec, 225 secs
lola: 14656652 markings, 50150956 edges, 58025 markings/sec, 230 secs
lola: 14972869 markings, 51305221 edges, 63243 markings/sec, 235 secs
lola: 15283265 markings, 52458554 edges, 62079 markings/sec, 240 secs
lola: 15612318 markings, 53577831 edges, 65811 markings/sec, 245 secs
lola: 15940997 markings, 54683911 edges, 65736 markings/sec, 250 secs
lola: 16253347 markings, 55771502 edges, 62470 markings/sec, 255 secs
lola: 16553304 markings, 56843840 edges, 59991 markings/sec, 260 secs
lola: 16852266 markings, 57907641 edges, 59792 markings/sec, 265 secs
lola: 17147519 markings, 58957659 edges, 59051 markings/sec, 270 secs
lola: 17441514 markings, 59990100 edges, 58799 markings/sec, 275 secs
lola: 17735131 markings, 61015213 edges, 58723 markings/sec, 280 secs
lola: 18026275 markings, 62040278 edges, 58229 markings/sec, 285 secs
lola: 18316403 markings, 63055116 edges, 58026 markings/sec, 290 secs
lola: 18629571 markings, 64193590 edges, 62634 markings/sec, 295 secs
lola: 18941188 markings, 65354754 edges, 62323 markings/sec, 300 secs
lola: 19269472 markings, 66466671 edges, 65657 markings/sec, 305 secs
lola: 19597623 markings, 67611084 edges, 65630 markings/sec, 310 secs
lola: 19913857 markings, 68666969 edges, 63247 markings/sec, 315 secs
lola: 20217514 markings, 69757367 edges, 60731 markings/sec, 320 secs
lola: 20517800 markings, 70823859 edges, 60057 markings/sec, 325 secs
lola: 20809874 markings, 71871058 edges, 58415 markings/sec, 330 secs
lola: 21101916 markings, 72912851 edges, 58408 markings/sec, 335 secs
lola: 21394131 markings, 73943784 edges, 58443 markings/sec, 340 secs
lola: 21685520 markings, 74975462 edges, 58278 markings/sec, 345 secs
lola: 21975639 markings, 75995928 edges, 58024 markings/sec, 350 secs
lola: 22264860 markings, 77017088 edges, 57844 markings/sec, 355 secs
lola: 22555519 markings, 78030117 edges, 58132 markings/sec, 360 secs
lola: 22876772 markings, 79231045 edges, 64251 markings/sec, 365 secs
lola: 23187714 markings, 80383837 edges, 62188 markings/sec, 370 secs
lola: 23515357 markings, 81473164 edges, 65529 markings/sec, 375 secs
lola: 23844682 markings, 82594210 edges, 65865 markings/sec, 380 secs
lola: 24155466 markings, 83640028 edges, 62157 markings/sec, 385 secs
lola: 24458292 markings, 84737662 edges, 60565 markings/sec, 390 secs
lola: 24757423 markings, 85811171 edges, 59826 markings/sec, 395 secs
lola: 25055205 markings, 86867787 edges, 59556 markings/sec, 400 secs
lola: 25349262 markings, 87931274 edges, 58811 markings/sec, 405 secs
lola: 25643456 markings, 88970924 edges, 58839 markings/sec, 410 secs
lola: 25935306 markings, 90003685 edges, 58370 markings/sec, 415 secs
lola: 26225427 markings, 91037227 edges, 58024 markings/sec, 420 secs
lola: 26516420 markings, 92063549 edges, 58199 markings/sec, 425 secs
lola: 26802766 markings, 93082730 edges, 57269 markings/sec, 430 secs
lola: 27088565 markings, 94083888 edges, 57160 markings/sec, 435 secs
lola: 27408436 markings, 95273230 edges, 63974 markings/sec, 440 secs
lola: 27718949 markings, 96427593 edges, 62103 markings/sec, 445 secs
lola: 28037249 markings, 97547811 edges, 63660 markings/sec, 450 secs
lola: 28336564 markings, 98611554 edges, 59863 markings/sec, 455 secs
lola: 28631138 markings, 99645980 edges, 58915 markings/sec, 460 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 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((1 <= p136 + p137) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + 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 <= p136 + p137) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))))
lola: processed formula length: 364
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 586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((p58 <= p2) AND (p135 <= p2)) OR (1 <= p4)) 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 781 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p0 + 1 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p0 + 1 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))
lola: processed formula length: 326
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 1172 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (F ((p58 <= p133))) AND ((p58 <= 2) AND (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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 1 <= p4))) OR (E (X ((p3 <= p110 + p111 + p112 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1172 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p58 <= p133)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p58 <= p133)))
lola: processed formula: A (F ((p58 <= p133)))
lola: processed formula length: 21
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 2344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p58 <= 2) AND (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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p58 <= 2) AND (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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 1 <= p4))
lola: processed formula length: 329
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 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N20-CTLCardinality-17.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((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 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p135) OR A (G ((1 <= p0))))) AND E (F ((p0 <= p100 + p101 + p102 + p103 + p104 + p105 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p135 + 1 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p135 + 1 <= 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 + p51 + p52 + p53 + p54 + p55 + p56 + p57)
lola: processed formula length: 314
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 ((p0 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p97 + p96 + p95 + p94 + p93 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + 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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-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 irma4mcc-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 r030-ebro-152646308300199"
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 ;