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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is BridgeAndVehicles-COL-V50P50N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126200372
=====================================================================

--------------------
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-V50P50N50-CTLCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494608638740


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-COL-V50P50N50 @ 3540 seconds
----- 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: 5576/65536 symbol table entries, 1422 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 5408 transitions, 161 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5813 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: NOT(A (G (((p115 + p116 + 1 <= p0) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= 1))))) : (NOT((A (G ((p58 <= p0))) OR ((p111 <= p114) OR (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 (p52 + p53 <= p57)))) OR E (F (((p110 <= 1))))) : NOT(A (G ((((p0 <= p115 + p116) AND (p57 <= p115 + p116)) OR (p114 + 1 <= p58))))) : (E (F (((p115 + p116 <= p52 + p53) AND (2 <= p114) AND (p113 + 1 <= p115 + p116)))) AND ((2 <= p110) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + 1 <= p112) OR (1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) OR (p113 <= p57))) : A (G (A (((p114 <= 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 + p51) U TRUE)))) : A (F (E (F (((1 <= p111) AND (3 <= p55 + p56)))))) : ((E (F ((p114 + 1 <= p0))) OR E (F ((p52 + p53 <= p54)))) AND A (G (A (F ((2 <= p115 + p116)))))) : ((((p113 <= p54) AND (p113 <= p112)) AND NOT(A (X ((1 <= p111))))) AND (E (G ((p110 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167))) OR ((((p110 <= p57) AND (p113 <= p57)) OR (p115 + p116 + 1 <= p58)) AND E (G ((p110 <= p58)))))) : (((p58 <= p54) AND (p111 + 1 <= p0)) OR A (X (A (F ((2 <= 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 <= p112) OR (p58 <= p112)) OR A (((3 <= p115 + p116) U (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 + p51 <= p112)))) AND A (F ((1 <= 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 <= 1) OR (p112 <= 0) OR (p111 + 1 <= p52 + p53) OR (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 + p51 <= 0)) AND ((3 <= 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 + p51) OR (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))) AND E (F (A (X ((p58 <= p0)))))) : A ((A (X ((p55 + p56 <= 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 + p51))) U E (F ((3 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167))))) : A (X (A (F (((1 <= p113) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p114)))))) : NOT(A (G (((p52 + p53 + 1 <= p112) OR (p114 <= 1))))) : E (F (((p0 <= 2) AND (p112 + 1 <= p111) AND ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p0) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p52 + p53) OR ((p115 + p116 <= p0)))))) : A (F (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 + 1 <= p111)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((p115 + p116 + 1 <= p0) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= 1)... (shortened)
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 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((A (G ((p58 <= p0))) OR ((p111 <= p114) OR (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 (p52 + p53 <= p57)))) OR E... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 + 1 <= p58)))
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 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p114 + 1 <= p111) AND (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 <= 0) AND (p57 + 1 <= p52 + p53))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p114 + 1 <= p111) AND (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 <= 0) AND (p57 + 1 <= p52 + p53))
lola: processed formula length: 372
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p110 <= 1))))
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 644 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-V50P50N50-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((p0 <= p115 + p116) AND (p57 <= p115 + p116)) OR (p114 + 1 <= p58)))))
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 644 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p115 + p116 <= p52 + p53) AND (2 <= p114) AND (p113 + 1 <= p115 + p116)))) AND ((2 <= p110) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p115 + p116 <= p52 + p53) AND (2 <= p114) AND (p113 + 1 <= p115 + p116))))
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 644 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3.sara.
lola: sara is running 0 secs || 3910 markings, 8641 edges, 782 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p114 <= 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 + p51) U TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((1 <= p111) AND (3 <= p55 + p56))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((1 <= p111) AND (3 <= p55 + p56))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 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: 165793 markings, 495931 edges, 3225752436249460736 markings/sec, 0 secs
lola: 347286 markings, 1037793 edges, 36299 markings/sec, 5 secs
lola: 528886 markings, 1596243 edges, 36320 markings/sec, 10 secs
lola: 726437 markings, 2152497 edges, 39510 markings/sec, 15 secs
lola: 927632 markings, 2708967 edges, 40239 markings/sec, 20 secs
lola: 1126414 markings, 3257470 edges, 39756 markings/sec, 25 secs
lola: 1328192 markings, 3821825 edges, 40356 markings/sec, 30 secs
lola: 1535830 markings, 4358214 edges, 41528 markings/sec, 35 secs
lola: 1732234 markings, 4932002 edges, 39281 markings/sec, 40 secs
lola: 1935011 markings, 5486042 edges, 40555 markings/sec, 45 secs
lola: 2141523 markings, 6026266 edges, 41302 markings/sec, 50 secs
lola: 2338677 markings, 6591870 edges, 39431 markings/sec, 55 secs
lola: 2536593 markings, 7152796 edges, 39583 markings/sec, 60 secs
lola: 2738985 markings, 7699914 edges, 40478 markings/sec, 65 secs
lola: 2943153 markings, 8235772 edges, 40834 markings/sec, 70 secs
lola: 3137697 markings, 8804127 edges, 38909 markings/sec, 75 secs
lola: 3331196 markings, 9365464 edges, 38700 markings/sec, 80 secs
lola: 3529413 markings, 9916529 edges, 39643 markings/sec, 85 secs
lola: 3730200 markings, 10459202 edges, 40157 markings/sec, 90 secs
lola: 3931841 markings, 11000108 edges, 40328 markings/sec, 95 secs
lola: 4123525 markings, 11571465 edges, 38337 markings/sec, 100 secs
lola: 4315743 markings, 12136462 edges, 38444 markings/sec, 105 secs
lola: 4509872 markings, 12689499 edges, 38826 markings/sec, 110 secs
lola: 4705188 markings, 13237909 edges, 39063 markings/sec, 115 secs
lola: 4900866 markings, 13784730 edges, 39136 markings/sec, 120 secs
lola: 5099686 markings, 14325314 edges, 39764 markings/sec, 125 secs
lola: 5291460 markings, 14898600 edges, 38355 markings/sec, 130 secs
lola: 5484861 markings, 15481773 edges, 38680 markings/sec, 135 secs
lola: 5671869 markings, 16030264 edges, 37402 markings/sec, 140 secs
lola: 5854861 markings, 16559714 edges, 36598 markings/sec, 145 secs
lola: 6041319 markings, 17085362 edges, 37292 markings/sec, 150 secs
lola: 6228440 markings, 17615182 edges, 37424 markings/sec, 155 secs
lola: 6432345 markings, 18172817 edges, 40781 markings/sec, 160 secs
lola: 6626753 markings, 18756462 edges, 38882 markings/sec, 165 secs
lola: 6816557 markings, 19340843 edges, 37961 markings/sec, 170 secs
lola: 7010916 markings, 19921816 edges, 38872 markings/sec, 175 secs
lola: 7201209 markings, 20483082 edges, 38059 markings/sec, 180 secs
lola: 7389471 markings, 21033954 edges, 37652 markings/sec, 185 secs
lola: 7575931 markings, 21584948 edges, 37292 markings/sec, 190 secs
lola: 7765947 markings, 22123673 edges, 38003 markings/sec, 195 secs
lola: 7946677 markings, 22647442 edges, 36146 markings/sec, 200 secs
lola: 8135854 markings, 23168883 edges, 37835 markings/sec, 205 secs
lola: 8309501 markings, 23719992 edges, 34729 markings/sec, 210 secs
lola: 8493228 markings, 24290578 edges, 36745 markings/sec, 215 secs
lola: 8679116 markings, 24855917 edges, 37178 markings/sec, 220 secs
lola: 8865836 markings, 25426127 edges, 37344 markings/sec, 225 secs
lola: 9056448 markings, 25988350 edges, 38122 markings/sec, 230 secs
lola: 9236228 markings, 26524196 edges, 35956 markings/sec, 235 secs
lola: 9419269 markings, 27058900 edges, 36608 markings/sec, 240 secs
lola: 9595170 markings, 27589372 edges, 35180 markings/sec, 245 secs
lola: 9783881 markings, 28121032 edges, 37742 markings/sec, 250 secs
lola: 9965644 markings, 28661238 edges, 36353 markings/sec, 255 secs
lola: 10155010 markings, 29227955 edges, 37873 markings/sec, 260 secs
lola: 10334502 markings, 29795344 edges, 35898 markings/sec, 265 secs
lola: 10512733 markings, 30356167 edges, 35646 markings/sec, 270 secs
lola: 10689691 markings, 30908683 edges, 35392 markings/sec, 275 secs
lola: 10872645 markings, 31463380 edges, 36591 markings/sec, 280 secs
lola: 11053386 markings, 32013174 edges, 36148 markings/sec, 285 secs
lola: 11232757 markings, 32560400 edges, 35874 markings/sec, 290 secs
lola: 11410657 markings, 33102468 edges, 35580 markings/sec, 295 secs
lola: 11595209 markings, 33651151 edges, 36910 markings/sec, 300 secs
lola: 11782283 markings, 34196435 edges, 37415 markings/sec, 305 secs
lola: 11964042 markings, 34733396 edges, 36352 markings/sec, 310 secs
lola: 12147802 markings, 35274859 edges, 36752 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p114 + 1 <= p0))) OR E (F ((p52 + p53 <= p54)))) AND A (G (A (F ((2 <= p115 + p116))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p114 + 1 <= p0)))
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 644 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-V50P50N50-CTLCardinality-6.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= p115 + p116)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-6.sara.
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= p115 + p116)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p113 <= p54) AND (p113 <= p112)) AND NOT(A (X ((1 <= p111))))) AND (E (G ((p110 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p113 <= p54) AND (p113 <= p112))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p113 <= p54) AND (p113 <= p112))
lola: processed formula length: 34
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p111 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p111 <= 0))
lola: processed formula length: 15
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p110 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + 1 <= p110)))
lola: processed formula length: 383
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p110 <= p57) AND (p113 <= p57)) OR (p115 + p116 + 1 <= p58))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p110 <= p57) AND (p113 <= p57)) OR (p115 + p116 + 1 <= p58))
lola: processed formula length: 64
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-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: ========================================
lola: subprocess 11 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p110 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p58 + 1 <= p110)))
lola: processed formula length: 32
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 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: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p58 <= p54) AND (p111 + 1 <= p0)) OR A (X (A (F ((2 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p58 <= p54) AND (p111 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p58 <= p54) AND (p111 + 1 <= p0))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-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: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((2 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (2 <= p0)))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((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 <= p112) OR (p58 <= p112)) OR A (((3 <= p115 + p116) U (p1 + p2 + p3 + p4 + p5 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((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 <= p112) OR (p58 <= p112))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((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 <= p112) OR (p58 <= p112))
lola: processed formula length: 343
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= p0))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 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: ========================================lola:
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((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 <= 1) OR (p112 <= 0) OR (p111 + 1 <= p52 + p53) OR (p1 + p2 + p3 + p4 + p5 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((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 <= 1) OR (p112 <= 0) OR (p111 + 1 <= p52 + p53) OR (p1 + p2 + p3 + p4 + p5 + p6 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((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 <= 1) OR (p112 <= 0) OR (p111 + 1 <= p52 + p53) OR (p1 + p2 + p3 + p4 + p5 + p6 ... (shortened)
lola: processed formula length: 1308
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 6 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: ========================================
lola: subprocess 11 will run for 641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p58 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p58 <= p0)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p55 + p56 <= 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 + p51))) U E (F ((3 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((p55 + p56 <= 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 + p51)) U E(TRUE U (3 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126... (shortened)
lola: processed formula length: 690
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 177542 markings, 515582 edges, 2976872481744224256 markings/sec, 0 secs
lola: 360382 markings, 1118952 edges, 36568 markings/sec, 5 secs
lola: 548171 markings, 1678038 edges, 37558 markings/sec, 10 secs
lola: 728691 markings, 2203967 edges, 36104 markings/sec, 15 secs
lola: 901095 markings, 2704702 edges, 34481 markings/sec, 20 secs
lola: 1075446 markings, 3237061 edges, 34870 markings/sec, 25 secs
lola: 1267449 markings, 3895010 edges, 38401 markings/sec, 30 secs
lola: 1457604 markings, 4523949 edges, 38031 markings/sec, 35 secs
lola: 1640325 markings, 5132370 edges, 36544 markings/sec, 40 secs
lola: 1810089 markings, 5696567 edges, 33953 markings/sec, 45 secs
lola: 1976176 markings, 6252204 edges, 33217 markings/sec, 50 secs
lola: 2141737 markings, 6804439 edges, 33112 markings/sec, 55 secs
lola: 2304351 markings, 7352320 edges, 32523 markings/sec, 60 secs
lola: 2466993 markings, 7899307 edges, 32528 markings/sec, 65 secs
lola: 2636534 markings, 8488866 edges, 33908 markings/sec, 70 secs
lola: 2822831 markings, 9133855 edges, 37259 markings/sec, 75 secs
lola: 3009278 markings, 9768699 edges, 37289 markings/sec, 80 secs
lola: 3187707 markings, 10383838 edges, 35686 markings/sec, 85 secs
lola: 3364494 markings, 10992338 edges, 35357 markings/sec, 90 secs
lola: 3539697 markings, 11599248 edges, 35041 markings/sec, 95 secs
lola: 3710810 markings, 12199516 edges, 34223 markings/sec, 100 secs
lola: 3879613 markings, 12790547 edges, 33761 markings/sec, 105 secs
lola: 4047398 markings, 13375867 edges, 33557 markings/sec, 110 secs
lola: 4206290 markings, 13940169 edges, 31778 markings/sec, 115 secs
lola: 4368067 markings, 14504726 edges, 32355 markings/sec, 120 secs
lola: 4526868 markings, 15066470 edges, 31760 markings/sec, 125 secs
lola: 4689312 markings, 15642732 edges, 32489 markings/sec, 130 secs
lola: 4871376 markings, 16289978 edges, 36413 markings/sec, 135 secs
lola: 5060606 markings, 16951187 edges, 37846 markings/sec, 140 secs
lola: 5240015 markings, 17571112 edges, 35882 markings/sec, 145 secs
lola: 5414927 markings, 18181630 edges, 34982 markings/sec, 150 secs
lola: 5587745 markings, 18783457 edges, 34564 markings/sec, 155 secs
lola: 5755278 markings, 19378929 edges, 33507 markings/sec, 160 secs
lola: 5923056 markings, 19975427 edges, 33556 markings/sec, 165 secs
lola: 6093376 markings, 20580747 edges, 34064 markings/sec, 170 secs
lola: 6262344 markings, 21179900 edges, 33794 markings/sec, 175 secs
lola: 6429724 markings, 21784410 edges, 33476 markings/sec, 180 secs
lola: 6598455 markings, 22381816 edges, 33746 markings/sec, 185 secs
lola: 6761985 markings, 22972858 edges, 32706 markings/sec, 190 secs
lola: 6926959 markings, 23568365 edges, 32995 markings/sec, 195 secs
lola: 7092679 markings, 24166278 edges, 33144 markings/sec, 200 secs
lola: 7255680 markings, 24753914 edges, 32600 markings/sec, 205 secs
lola: 7418456 markings, 25341071 edges, 32555 markings/sec, 210 secs
lola: 7578508 markings, 25918114 edges, 32010 markings/sec, 215 secs
lola: 7755614 markings, 26553051 edges, 35421 markings/sec, 220 secs
lola: 7943972 markings, 27220620 edges, 37672 markings/sec, 225 secs
lola: 8136474 markings, 27891602 edges, 38500 markings/sec, 230 secs
lola: 8326824 markings, 28555413 edges, 38070 markings/sec, 235 secs
lola: 8504181 markings, 29183149 edges, 35471 markings/sec, 240 secs
lola: 8683486 markings, 29815629 edges, 35861 markings/sec, 245 secs
lola: 8858543 markings, 30443109 edges, 35011 markings/sec, 250 secs
lola: 9032222 markings, 31063428 edges, 34736 markings/sec, 255 secs
lola: 9200511 markings, 31677198 edges, 33658 markings/sec, 260 secs
lola: 9374075 markings, 32296378 edges, 34713 markings/sec, 265 secs
lola: 9540063 markings, 32901237 edges, 33198 markings/sec, 270 secs
lola: 9704464 markings, 33499283 edges, 32880 markings/sec, 275 secs
lola: 9871279 markings, 34106598 edges, 33363 markings/sec, 280 secs
lola: 10040121 markings, 34721493 edges, 33768 markings/sec, 285 secs
lola: 10209270 markings, 35337234 edges, 33830 markings/sec, 290 secs
lola: 10377542 markings, 35950157 edges, 33654 markings/sec, 295 secs
lola: 10544445 markings, 36556810 edges, 33381 markings/sec, 300 secs
lola: 10706953 markings, 37147960 edges, 32502 markings/sec, 305 secs
lola: 10871026 markings, 37742363 edges, 32815 markings/sec, 310 secs
lola: 11034187 markings, 38352009 edges, 32632 markings/sec, 315 secs
lola: 11191926 markings, 38925769 edges, 31548 markings/sec, 320 secs
lola: 11372391 markings, 39577725 edges, 36093 markings/sec, 325 secs
lola: 11564782 markings, 40263524 edges, 38478 markings/sec, 330 secs
lola: 11755871 markings, 40932637 edges, 38218 markings/sec, 335 secs
lola: 11943990 markings, 41591745 edges, 37624 markings/sec, 340 secs
lola: 12125696 markings, 42232244 edges, 36341 markings/sec, 345 secs
lola: 12300994 markings, 42862980 edges, 35060 markings/sec, 350 secs
lola: 12478222 markings, 43498615 edges, 35446 markings/sec, 355 secs
lola: 12651223 markings, 44120495 edges, 34600 markings/sec, 360 secs
lola: 12824169 markings, 44738992 edges, 34589 markings/sec, 365 secs
lola: 12992584 markings, 45355722 edges, 33683 markings/sec, 370 secs
lola: 13164162 markings, 45975105 edges, 34316 markings/sec, 375 secs
lola: 13331074 markings, 46577086 edges, 33382 markings/sec, 380 secs
lola: 13497177 markings, 47183619 edges, 33221 markings/sec, 385 secs
lola: 13664680 markings, 47796283 edges, 33501 markings/sec, 390 secs
lola: 13831318 markings, 48404975 edges, 33328 markings/sec, 395 secs
lola: 14000868 markings, 49023060 edges, 33910 markings/sec, 400 secs
lola: 14165516 markings, 49639400 edges, 32930 markings/sec, 405 secs
lola: 14324067 markings, 50222820 edges, 31710 markings/sec, 410 secs
lola: 14478091 markings, 50782926 edges, 30805 markings/sec, 415 secs
lola: 14636991 markings, 51361501 edges, 31780 markings/sec, 420 secs
lola: 14788660 markings, 51933768 edges, 30334 markings/sec, 425 secs
lola: 14941163 markings, 52488365 edges, 30501 markings/sec, 430 secs
lola: 15098575 markings, 53057971 edges, 31482 markings/sec, 435 secs
lola: 15246628 markings, 53619211 edges, 29611 markings/sec, 440 secs
lola: 15405196 markings, 54193961 edges, 31714 markings/sec, 445 secs
lola: 15562585 markings, 54789400 edges, 31478 markings/sec, 450 secs
lola: 15747597 markings, 55455536 edges, 37002 markings/sec, 455 secs
lola: 15939906 markings, 56144335 edges, 38462 markings/sec, 460 secs
lola: 16135092 markings, 56829548 edges, 39037 markings/sec, 465 secs
lola: 16325162 markings, 57499533 edges, 38014 markings/sec, 470 secs
lola: 16509075 markings, 58152541 edges, 36783 markings/sec, 475 secs
lola: 16686691 markings, 58778838 edges, 35523 markings/sec, 480 secs
lola: 16859506 markings, 59398643 edges, 34563 markings/sec, 485 secs
lola: 17033816 markings, 60033757 edges, 34862 markings/sec, 490 secs
lola: 17207899 markings, 60662250 edges, 34817 markings/sec, 495 secs
lola: 17378647 markings, 61288130 edges, 34150 markings/sec, 500 secs
lola: 17551290 markings, 61902646 edges, 34529 markings/sec, 505 secs
lola: 17719665 markings, 62520370 edges, 33675 markings/sec, 510 secs
lola: 17888281 markings, 63138274 edges, 33723 markings/sec, 515 secs
lola: 18054625 markings, 63746414 edges, 33269 markings/sec, 520 secs
lola: 18221604 markings, 64356448 edges, 33396 markings/sec, 525 secs
lola: 18388316 markings, 64966352 edges, 33342 markings/sec, 530 secs
lola: 18550734 markings, 65581670 edges, 32484 markings/sec, 535 secs
lola: 18715724 markings, 66185191 edges, 32998 markings/sec, 540 secs
lola: 18884976 markings, 66803801 edges, 33850 markings/sec, 545 secs
lola: 19055184 markings, 67423920 edges, 34042 markings/sec, 550 secs
lola: 19213487 markings, 68026124 edges, 31661 markings/sec, 555 secs
lola: 19376792 markings, 68621209 edges, 32661 markings/sec, 560 secs
lola: 19547394 markings, 69242108 edges, 34120 markings/sec, 565 secs
lola: 19706142 markings, 69846908 edges, 31750 markings/sec, 570 secs
lola: 19874386 markings, 70459643 edges, 33649 markings/sec, 575 secs
lola: 20035119 markings, 71070360 edges, 32147 markings/sec, 580 secs
lola: 20200554 markings, 71672474 edges, 33087 markings/sec, 585 secs
lola: 20363669 markings, 72291626 edges, 32623 markings/sec, 590 secs
lola: 20526084 markings, 72883123 edges, 32483 markings/sec, 595 secs
lola: 20689077 markings, 73501289 edges, 32599 markings/sec, 600 secs
lola: 20880465 markings, 74186395 edges, 38278 markings/sec, 605 secs
lola: 21074292 markings, 74882551 edges, 38765 markings/sec, 610 secs
lola: 21264392 markings, 75552300 edges, 38020 markings/sec, 615 secs
lola: 21451423 markings, 76209039 edges, 37406 markings/sec, 620 secs
lola: 21635800 markings, 76862208 edges, 36875 markings/sec, 625 secs
lola: 21815316 markings, 77508477 edges, 35903 markings/sec, 630 secs
lola: 21992783 markings, 78145827 edges, 35493 markings/sec, 635 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p113) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p114))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((1 <= p113) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p114))))
lola: processed formula length: 396
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 855 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((p52 + p53 + 1 <= p112) OR (p114 <= 1)))))
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 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 <= 2) AND (p112 + 1 <= p111) AND ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167... (shortened)
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 644 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2565 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (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 + 1 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p111 <= 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: 348
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: no yes yes no yes unknown no yes no yes yes unknown yes yes yes no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494609613680

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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-V50P50N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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-V50P50N50.tgz
mv BridgeAndVehicles-COL-V50P50N50 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is BridgeAndVehicles-COL-V50P50N50, 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 r008-csrt-149436126200372"
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 ;