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 S_BridgeAndVehicles-COL-V80P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074400412
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496346237604


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-COL-V80P50N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-COL-V80P50N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
ReachabilityCardinality @ S_BridgeAndVehicles-COL-V80P50N10 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2296/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.task
lola: E (F (((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 + p58 + 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 <= p90) AND (p91 + p92 <= p0) AND (2 <= p1) AND ((p1 <= 0) OR (p6 <= p5))))) : E (F (((p4 + 1 <= p89) AND (p88 <= 1)))) : E (F ((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 + p58 + 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))) : E (F ((((2 <= p4) OR (p93 + p94 <= p5) OR (p93 + p94 + 1 <= p1)) AND (p90 <= p1)))) : A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p98 + p97 + p96 + p99))) : E (F ((p6 <= p89))) : E (F (((p6 <= p93 + p94) AND ((p4 <= 0) OR (p2 + p3 <= 2))))) : E (F (((p4 <= p88) AND (1 <= p6)))) : A (G (((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p98 + p97 + p96 + p99) OR (2 <= p1) OR ((p91 + p92 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p98 + p97 + p96 + p99) AND (p91 + p92 <= p4)) OR ((p91 + p92 <= 1) AND ((p93 + p94 <= p5) OR (p95 <= p88)))))) : E (F (((p0 + 1 <= p95) AND (p4 + 1 <= p91 + p92) AND (p95 <= 2) AND (p91 + p92 <= 0)))) : E (F ((p4 <= p88))) : E (F ((2 <= p91 + p92))) : E (F ((2 <= p93 + p94))) : E (F ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p98 + p97 + p96 + p99))) : E (F (((p89 <= p5) AND (3 <= p88) AND ((2 <= p4) OR (1 <= p0)) AND (3 <= p91 + p92)))) : A (G ((((p2 + p3 <= 0) AND (p5 <= 2)) OR (p5 <= p4))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 +... (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 724 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p4 + 1 <= p89) AND (p88 <= 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 724 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-V80P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 11475 markings, 20244 edges, 2295 markings/sec, 0 secs
lola: sara is running 5 secs || 21421 markings, 36851 edges, 1989 markings/sec, 5 secs
lola: sara is running 10 secs || 31667 markings, 53867 edges, 2049 markings/sec, 10 secs
lola: sara is running 15 secs || 41655 markings, 70490 edges, 1998 markings/sec, 15 secs
lola: sara is running 20 secs || 51768 markings, 87303 edges, 2023 markings/sec, 20 secs
lola: sara is running 25 secs || 61836 markings, 104031 edges, 2014 markings/sec, 25 secs
lola: sara is running 30 secs || 72743 markings, 122153 edges, 2181 markings/sec, 30 secs
lola: sara is running 35 secs || 83000 markings, 140213 edges, 2051 markings/sec, 35 secs
lola: sara is running 40 secs || 92981 markings, 157954 edges, 1996 markings/sec, 40 secs
lola: sara is running 45 secs || 103512 markings, 176621 edges, 2106 markings/sec, 45 secs
lola: sara is running 50 secs || 114485 markings, 196077 edges, 2195 markings/sec, 50 secs
lola: sara is running 55 secs || 125599 markings, 215732 edges, 2223 markings/sec, 55 secs
lola: sara is running 60 secs || 136274 markings, 234779 edges, 2135 markings/sec, 60 secs
lola: sara is running 65 secs || 146540 markings, 253064 edges, 2053 markings/sec, 65 secs
lola: sara is running 70 secs || 156943 markings, 271471 edges, 2081 markings/sec, 70 secs
lola: sara is running 75 secs || 167345 markings, 289875 edges, 2080 markings/sec, 75 secs
lola: sara is running 80 secs || 178398 markings, 309432 edges, 2211 markings/sec, 80 secs
lola: sara is running 85 secs || 189075 markings, 328448 edges, 2135 markings/sec, 85 secs
lola: sara is running 90 secs || 199747 markings, 347365 edges, 2134 markings/sec, 90 secs
lola: sara is running 95 secs || 210163 markings, 365900 edges, 2083 markings/sec, 95 secs
lola: sara is running 100 secs || 221106 markings, 385274 edges, 2189 markings/sec, 100 secs
lola: sara is running 105 secs || 233129 markings, 406657 edges, 2405 markings/sec, 105 secs
lola: sara is running 110 secs || 244180 markings, 426368 edges, 2210 markings/sec, 110 secs
lola: sara is running 115 secs || 254109 markings, 443897 edges, 1986 markings/sec, 115 secs
sara: warning, failure of lp_solve (at job 74)
lola: sara is running 120 secs || 264066 markings, 461491 edges, 1991 markings/sec, 120 secs
lola: sara is running 125 secs || 273895 markings, 479045 edges, 1966 markings/sec, 125 secs
lola: sara is running 130 secs || 284928 markings, 498473 edges, 2207 markings/sec, 130 secs
lola: sara is running 135 secs || 296509 markings, 519209 edges, 2316 markings/sec, 135 secs
lola: sara is running 140 secs || 307725 markings, 539061 edges, 2243 markings/sec, 140 secs
lola: sara is running 145 secs || 318506 markings, 558121 edges, 2156 markings/sec, 145 secs
lola: sara is running 150 secs || 329780 markings, 578168 edges, 2255 markings/sec, 150 secs
lola: sara is running 155 secs || 341701 markings, 599298 edges, 2384 markings/sec, 155 secs
lola: sara is running 160 secs || 352779 markings, 618991 edges, 2216 markings/sec, 160 secs
lola: sara is running 165 secs || 363005 markings, 637163 edges, 2045 markings/sec, 165 secs
lola: sara is running 170 secs || 373345 markings, 655513 edges, 2068 markings/sec, 170 secs
lola: sara is running 175 secs || 383646 markings, 673800 edges, 2060 markings/sec, 175 secs
lola: sara is running 180 secs || 394495 markings, 692945 edges, 2170 markings/sec, 180 secs
lola: sara is running 185 secs || 405555 markings, 712601 edges, 2212 markings/sec, 185 secs
lola: sara is running 190 secs || 415679 markings, 730631 edges, 2025 markings/sec, 190 secs
lola: sara is running 195 secs || 425688 markings, 748292 edges, 2002 markings/sec, 195 secs
lola: sara is running 200 secs || 435317 markings, 765419 edges, 1926 markings/sec, 200 secs
lola: sara is running 205 secs || 445109 markings, 782783 edges, 1958 markings/sec, 205 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p... (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 724 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: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p4) OR (p93 + p94 <= p5) OR (p93 + p94 + 1 <= p1)) AND (p90 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (shortened)
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 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4.sara
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=-1)
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: E (F ((p6 <= p89)))
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 724 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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4.sara.
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-V80P50N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara is running 0 secs || 17143 markings, 37256 edges, 3429 markings/sec, 0 secs
lola: sara is running 5 secs || 33211 markings, 74280 edges, 3214 markings/sec, 5 secs
lola: sara is running 10 secs || 48738 markings, 110064 edges, 3105 markings/sec, 10 secs
lola: sara is running 15 secs || 63801 markings, 144227 edges, 3013 markings/sec, 15 secs
lola: sara is running 20 secs || 78642 markings, 178113 edges, 2968 markings/sec, 20 secs
lola: sara is running 25 secs || 92555 markings, 210404 edges, 2783 markings/sec, 25 secs
lola: sara is running 30 secs || 106945 markings, 243212 edges, 2878 markings/sec, 30 secs
lola: sara is running 35 secs || 120918 markings, 275788 edges, 2795 markings/sec, 35 secs
lola: sara is running 40 secs || 135502 markings, 309292 edges, 2917 markings/sec, 40 secs
lola: sara is running 45 secs || 150480 markings, 344366 edges, 2996 markings/sec, 45 secs
lola: sara is running 50 secs || 165017 markings, 378383 edges, 2907 markings/sec, 50 secs
lola: sara is running 55 secs || 181117 markings, 416130 edges, 3220 markings/sec, 55 secs
lola: sara is running 60 secs || 195611 markings, 450493 edges, 2899 markings/sec, 60 secs
lola: sara is running 65 secs || 209572 markings, 483657 edges, 2792 markings/sec, 65 secs
lola: sara is running 70 secs || 222921 markings, 514796 edges, 2670 markings/sec, 70 secs
lola: sara is running 75 secs || 239843 markings, 553725 edges, 3384 markings/sec, 75 secs
lola: sara is running 80 secs || 254142 markings, 587740 edges, 2860 markings/sec, 80 secs
lola: sara is running 85 secs || 268216 markings, 621146 edges, 2815 markings/sec, 85 secs
lola: sara is running 90 secs || 281792 markings, 653037 edges, 2715 markings/sec, 90 secs
lola: sara is running 95 secs || 295267 markings, 685120 edges, 2695 markings/sec, 95 secs
lola: sara is running 100 secs || 310613 markings, 721419 edges, 3069 markings/sec, 100 secs
lola: sara is running 105 secs || 324714 markings, 755091 edges, 2820 markings/sec, 105 secs
lola: sara is running 110 secs || 339492 markings, 790150 edges, 2956 markings/sec, 110 secs
lola: sara is running 115 secs || 353289 markings, 822508 edges, 2759 markings/sec, 115 secs
lola: sara is running 120 secs || 367334 markings, 855495 edges, 2809 markings/sec, 120 secs
lola: sara is running 125 secs || 380893 markings, 887680 edges, 2712 markings/sec, 125 secs
lola: sara is running 130 secs || 397473 markings, 927309 edges, 3316 markings/sec, 130 secs
lola: sara is running 135 secs || 412481 markings, 963305 edges, 3002 markings/sec, 135 secs
lola: sara is running 140 secs || 426852 markings, 996683 edges, 2874 markings/sec, 140 secs
lola: sara is running 145 secs || 441236 markings, 1030440 edges, 2877 markings/sec, 145 secs
lola: sara is running 150 secs || 454483 markings, 1061595 edges, 2649 markings/sec, 150 secs
lola: sara is running 155 secs || 467613 markings, 1092607 edges, 2626 markings/sec, 155 secs
lola: sara is running 160 secs || 482536 markings, 1128025 edges, 2985 markings/sec, 160 secs
lola: sara is running 165 secs || 497668 markings, 1164295 edges, 3026 markings/sec, 165 secs
lola: sara is running 170 secs || 512179 markings, 1198576 edges, 2902 markings/sec, 170 secs
lola: sara is running 175 secs || 525353 markings, 1229608 edges, 2635 markings/sec, 175 secs
lola: sara is running 180 secs || 537575 markings, 1257853 edges, 2444 markings/sec, 180 secs
lola: sara is running 185 secs || 550570 markings, 1288627 edges, 2599 markings/sec, 185 secs
lola: sara is running 190 secs || 563323 markings, 1318859 edges, 2551 markings/sec, 190 secs
lola: sara is running 195 secs || 579874 markings, 1358308 edges, 3310 markings/sec, 195 secs
lola: sara is running 200 secs || 595406 markings, 1395445 edges, 3106 markings/sec, 200 secs
lola: sara is running 205 secs || 609522 markings, 1428736 edges, 2823 markings/sec, 205 secs
lola: sara is running 210 secs || 623575 markings, 1461585 edges, 2811 markings/sec, 210 secs
lola: sara is running 215 secs || 637798 markings, 1495050 edges, 2845 markings/sec, 215 secs
lola: sara is running 220 secs || 652186 markings, 1528641 edges, 2878 markings/sec, 220 secs
lola: sara is running 225 secs || 664954 markings, 1559056 edges, 2554 markings/sec, 225 secs
lola: sara is running 230 secs || 681313 markings, 1597576 edges, 3272 markings/sec, 230 secs
lola: sara is running 235 secs || 696609 markings, 1634387 edges, 3059 markings/sec, 235 secs
lola: sara is running 240 secs || 711659 markings, 1669856 edges, 3010 markings/sec, 240 secs
lola: sara is running 245 secs || 726306 markings, 1704282 edges, 2929 markings/sec, 245 secs
lola: sara is running 250 secs || 741113 markings, 1739350 edges, 2961 markings/sec, 250 secs
lola: sara is running 255 secs || 755367 markings, 1772220 edges, 2851 markings/sec, 255 secs
lola: sara is running 260 secs || 770562 markings, 1807959 edges, 3039 markings/sec, 260 secs
lola: sara is running 265 secs || 783422 markings, 1838592 edges, 2572 markings/sec, 265 secs
lola: sara is running 270 secs || 799453 markings, 1876467 edges, 3206 markings/sec, 270 secs
lola: sara is running 275 secs || 814929 markings, 1913771 edges, 3095 markings/sec, 275 secs
lola: sara is running 280 secs || 828900 markings, 1946620 edges, 2794 markings/sec, 280 secs
lola: sara is running 285 secs || 843336 markings, 1980732 edges, 2887 markings/sec, 285 secs
lola: sara is running 290 secs || 857898 markings, 2014967 edges, 2912 markings/sec, 290 secs
lola: sara is running 295 secs || 872705 markings, 2049668 edges, 2961 markings/sec, 295 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 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p6 <= p93 + p94) AND ((p4 <= 0) OR (p2 + p3 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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-V80P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 19044 markings, 42638 edges, 3809 markings/sec, 0 secs
lola: sara is running 5 secs || 35875 markings, 80972 edges, 3366 markings/sec, 5 secs
lola: sara is running 10 secs || 51623 markings, 117248 edges, 3150 markings/sec, 10 secs
lola: sara is running 15 secs || 66718 markings, 151970 edges, 3019 markings/sec, 15 secs
lola: sara is running 20 secs || 82468 markings, 188183 edges, 3150 markings/sec, 20 secs
lola: sara is running 25 secs || 96948 markings, 222008 edges, 2896 markings/sec, 25 secs
lola: sara is running 30 secs || 112025 markings, 256546 edges, 3015 markings/sec, 30 secs
lola: sara is running 35 secs || 126020 markings, 289280 edges, 2799 markings/sec, 35 secs
lola: sara is running 40 secs || 141283 markings, 324487 edges, 3053 markings/sec, 40 secs
lola: sara is running 45 secs || 155758 markings, 358357 edges, 2895 markings/sec, 45 secs
lola: sara is running 50 secs || 169432 markings, 390254 edges, 2735 markings/sec, 50 secs
lola: sara is running 55 secs || 185525 markings, 428771 edges, 3219 markings/sec, 55 secs
lola: sara is running 60 secs || 199596 markings, 462105 edges, 2814 markings/sec, 60 secs
lola: sara is running 65 secs || 212792 markings, 493127 edges, 2639 markings/sec, 65 secs
lola: sara is running 70 secs || 226407 markings, 525721 edges, 2723 markings/sec, 70 secs
lola: sara is running 75 secs || 243266 markings, 564428 edges, 3372 markings/sec, 75 secs
lola: sara is running 80 secs || 258018 markings, 599480 edges, 2950 markings/sec, 80 secs
lola: sara is running 85 secs || 271778 markings, 632068 edges, 2752 markings/sec, 85 secs
lola: sara is running 90 secs || 285966 markings, 665792 edges, 2838 markings/sec, 90 secs
lola: sara is running 95 secs || 299583 markings, 697923 edges, 2723 markings/sec, 95 secs
lola: sara is running 100 secs || 314811 markings, 734532 edges, 3046 markings/sec, 100 secs
lola: sara is running 105 secs || 329228 markings, 768950 edges, 2883 markings/sec, 105 secs
lola: sara is running 110 secs || 342646 markings, 800248 edges, 2684 markings/sec, 110 secs
lola: sara is running 115 secs || 356040 markings, 831693 edges, 2679 markings/sec, 115 secs
lola: sara is running 120 secs || 369407 markings, 863254 edges, 2673 markings/sec, 120 secs
lola: sara is running 125 secs || 383516 markings, 896284 edges, 2822 markings/sec, 125 secs
lola: sara is running 130 secs || 398501 markings, 932814 edges, 2997 markings/sec, 130 secs
lola: sara is running 135 secs || 413773 markings, 969160 edges, 3054 markings/sec, 135 secs
lola: sara is running 140 secs || 427570 markings, 1001570 edges, 2759 markings/sec, 140 secs
lola: sara is running 145 secs || 440764 markings, 1032573 edges, 2639 markings/sec, 145 secs
lola: sara is running 150 secs || 453645 markings, 1062963 edges, 2576 markings/sec, 150 secs
lola: sara is running 155 secs || 465149 markings, 1089890 edges, 2301 markings/sec, 155 secs
lola: sara is running 160 secs || 480779 markings, 1127611 edges, 3126 markings/sec, 160 secs
lola: sara is running 165 secs || 495699 markings, 1163353 edges, 2984 markings/sec, 165 secs
lola: sara is running 170 secs || 508762 markings, 1194214 edges, 2613 markings/sec, 170 secs
lola: sara is running 175 secs || 522488 markings, 1226208 edges, 2745 markings/sec, 175 secs
lola: sara is running 180 secs || 536745 markings, 1259785 edges, 2851 markings/sec, 180 secs
lola: sara is running 185 secs || 550680 markings, 1292682 edges, 2787 markings/sec, 185 secs
lola: sara is running 190 secs || 562709 markings, 1320797 edges, 2406 markings/sec, 190 secs
lola: sara is running 195 secs || 578203 markings, 1358318 edges, 3099 markings/sec, 195 secs
lola: sara is running 200 secs || 591194 markings, 1389525 edges, 2598 markings/sec, 200 secs
lola: sara is running 205 secs || 605707 markings, 1424047 edges, 2903 markings/sec, 205 secs
lola: sara is running 210 secs || 618945 markings, 1454910 edges, 2648 markings/sec, 210 secs
lola: sara is running 215 secs || 632934 markings, 1488073 edges, 2798 markings/sec, 215 secs
lola: sara is running 220 secs || 645886 markings, 1518365 edges, 2590 markings/sec, 220 secs
lola: sara is running 225 secs || 659073 markings, 1548963 edges, 2637 markings/sec, 225 secs
lola: sara is running 230 secs || 672666 markings, 1581391 edges, 2719 markings/sec, 230 secs
lola: sara is running 235 secs || 688653 markings, 1619591 edges, 3197 markings/sec, 235 secs
lola: sara is running 240 secs || 704135 markings, 1656767 edges, 3096 markings/sec, 240 secs
lola: sara is running 245 secs || 717800 markings, 1689012 edges, 2733 markings/sec, 245 secs
lola: sara is running 250 secs || 731277 markings, 1720673 edges, 2695 markings/sec, 250 secs
lola: sara is running 255 secs || 744727 markings, 1753157 edges, 2690 markings/sec, 255 secs
lola: sara is running 260 secs || 757102 markings, 1781152 edges, 2475 markings/sec, 260 secs
lola: sara is running 265 secs || 770733 markings, 1813014 edges, 2726 markings/sec, 265 secs
lola: sara is running 270 secs || 782315 markings, 1840749 edges, 2316 markings/sec, 270 secs
lola: sara is running 275 secs || 798163 markings, 1878226 edges, 3170 markings/sec, 275 secs
lola: sara is running 280 secs || 813410 markings, 1915059 edges, 3049 markings/sec, 280 secs
lola: sara is running 285 secs || 826925 markings, 1947124 edges, 2703 markings/sec, 285 secs
lola: sara is running 290 secs || 841264 markings, 1980905 edges, 2868 markings/sec, 290 secs
lola: sara is running 295 secs || 855288 markings, 2013875 edges, 2805 markings/sec, 295 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p4 <= p88) AND (1 <= p6))))
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 724 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-V80P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p1... (shortened)
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 724 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 18 literals and 4 conjunctive subformulas
lola: The predicate is invariant.
lola: subprocess 9 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + 1 <= p95) AND (p4 + 1 <= p91 + p92) AND (p95 <= 2) AND (p91 + p92 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 453 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= p88)))
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 724 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-V80P50N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p91 + p92)))
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 724 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-V80P50N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 679 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p93 + p94)))
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 724 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-V80P50N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 905 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (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 724 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: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13.sara
lola: subprocess 14 will run for 1358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: E (F (((p89 <= p5) AND (3 <= p88) AND ((2 <= p4) OR (1 <= p0)) AND (3 <= p91 + p92))))
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 724 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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
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: subprocess 15 will run for 2717 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2 + p3 <= 0) AND (p5 <= 2)) OR (p5 <= p4))))
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 724 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-V80P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes unknown unknown yes yes no yes no no no no no
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496347060997

--------------------
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="S_BridgeAndVehicles-COL-V80P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
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/S_BridgeAndVehicles-COL-V80P50N10.tgz
mv S_BridgeAndVehicles-COL-V80P50N10 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 S_BridgeAndVehicles-COL-V80P50N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-149441074400412"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;