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

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N10 @ 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: 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 (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 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 <= p162) AND (p184 + p185 <= p167) AND (2 <= p172) AND ((p172 <= 0) OR (p169 <= p163))))) : E (F (((p170 + 1 <= p168) AND (p166 <= 1)))) : E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 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))) : E (F ((((2 <= p170) OR (p186 + p187 <= p163) OR (p186 + p187 + 1 <= p172)) AND (p162 <= p172)))) : 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 + p98 + p97 + p96 + p95 + p94 + p93 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) : E (F ((p169 <= p168))) : E (F (((p169 <= p186 + p187) AND ((p170 <= 0) OR (p164 + p165 <= 2))))) : E (F (((p170 <= p166) AND (1 <= p169)))) : 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 + p98 + p97 + p96 + p95 + p94 + p93 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) OR (2 <= p172) OR ((p184 + p185 <= 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 + p98 + p97 + p96 + p95 + p94 + p93 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (p184 + p185 <= p170)) OR ((p184 + p185 <= 1) AND ((p186 + p187 <= p163) OR (p171 <= p166)))))) : E (F (((p167 + 1 <= p171) AND (p170 + 1 <= p184 + p185) AND (p171 <= 2) AND (p184 + p185 <= 0)))) : E (F ((p170 <= p166))) : E (F ((2 <= p184 + p185))) : E (F ((2 <= p186 + p187))) : 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 + p98 + p97 + p96 + p95 + p94 + p93 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) : E (F (((p168 <= p163) AND (3 <= p166) AND ((2 <= p170) OR (1 <= p167)) AND (3 <= p184 + p185)))) : A (G ((((p164 + p165 <= 0) AND (p163 <= 2)) OR (p163 <= p170))))
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 (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + ... (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 (((p170 + 1 <= p168) AND (p166 <= 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
sara: warning, failure of lp_solve (at job 6)
lola: sara is running 0 secs || 14135 markings, 30450 edges, 2827 markings/sec, 0 secs
lola: sara is running 5 secs || 26728 markings, 52937 edges, 2519 markings/sec, 5 secs
lola: sara is running 10 secs || 38470 markings, 75067 edges, 2348 markings/sec, 10 secs
lola: sara is running 15 secs || 47861 markings, 98124 edges, 1878 markings/sec, 15 secs
lola: sara is running 20 secs || 59478 markings, 129084 edges, 2323 markings/sec, 20 secs
lola: sara is running 25 secs || 71511 markings, 161074 edges, 2407 markings/sec, 25 secs
lola: sara is running 30 secs || 85017 markings, 194118 edges, 2701 markings/sec, 30 secs
lola: sara is running 35 secs || 96725 markings, 227306 edges, 2342 markings/sec, 35 secs
lola: sara is running 40 secs || 111152 markings, 253206 edges, 2885 markings/sec, 40 secs
lola: sara is running 45 secs || 121802 markings, 282751 edges, 2130 markings/sec, 45 secs
lola: sara is running 50 secs || 135019 markings, 316022 edges, 2643 markings/sec, 50 secs
lola: sara is running 55 secs || 147465 markings, 348799 edges, 2489 markings/sec, 55 secs
lola: sara is running 60 secs || 161731 markings, 374997 edges, 2853 markings/sec, 60 secs
lola: sara is running 65 secs || 171148 markings, 401764 edges, 1883 markings/sec, 65 secs
lola: sara is running 70 secs || 183064 markings, 433490 edges, 2383 markings/sec, 70 secs
lola: sara is running 75 secs || 197289 markings, 465486 edges, 2845 markings/sec, 75 secs
lola: sara is running 80 secs || 208921 markings, 493724 edges, 2326 markings/sec, 80 secs
lola: sara is running 85 secs || 219383 markings, 517691 edges, 2092 markings/sec, 85 secs
lola: sara is running 90 secs || 231142 markings, 548971 edges, 2352 markings/sec, 90 secs
lola: sara is running 95 secs || 245114 markings, 580924 edges, 2794 markings/sec, 95 secs
lola: sara is running 100 secs || 255822 markings, 613326 edges, 2142 markings/sec, 100 secs
lola: sara is running 105 secs || 269593 markings, 637556 edges, 2754 markings/sec, 105 secs
lola: sara is running 110 secs || 279994 markings, 666348 edges, 2080 markings/sec, 110 secs
lola: sara is running 115 secs || 292435 markings, 698378 edges, 2488 markings/sec, 115 secs
lola: sara is running 120 secs || 305626 markings, 730486 edges, 2638 markings/sec, 120 secs
lola: sara is running 125 secs || 318855 markings, 757732 edges, 2646 markings/sec, 125 secs
lola: sara is running 130 secs || 328377 markings, 782263 edges, 1904 markings/sec, 130 secs
lola: sara is running 135 secs || 340393 markings, 814262 edges, 2403 markings/sec, 135 secs
lola: sara is running 140 secs || 355101 markings, 846826 edges, 2942 markings/sec, 140 secs
lola: sara is running 145 secs || 365490 markings, 878250 edges, 2078 markings/sec, 145 secs
lola: sara is running 150 secs || 378976 markings, 903070 edges, 2697 markings/sec, 150 secs
lola: sara is running 155 secs || 389466 markings, 931830 edges, 2098 markings/sec, 155 secs
lola: sara is running 160 secs || 401719 markings, 963482 edges, 2451 markings/sec, 160 secs
lola: sara is running 165 secs || 415098 markings, 995584 edges, 2676 markings/sec, 165 secs
lola: sara is running 170 secs || 428068 markings, 1023289 edges, 2594 markings/sec, 170 secs
lola: sara is running 175 secs || 437950 markings, 1047784 edges, 1976 markings/sec, 175 secs
lola: sara is running 180 secs || 449941 markings, 1079687 edges, 2398 markings/sec, 180 secs
lola: sara is running 185 secs || 464380 markings, 1112528 edges, 2888 markings/sec, 185 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p6... (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: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p170) OR (p186 + p187 <= p163) OR (p186 + p187 + 1 <= p172)) AND (p162 <= p172))))
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-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 278 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: 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 invariant.
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p169 <= p168)))
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-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
lola: sara is running 0 secs || 18170 markings, 44810 edges, 3634 markings/sec, 0 secs
lola: sara is running 5 secs || 35574 markings, 90188 edges, 3481 markings/sec, 5 secs
lola: sara is running 10 secs || 50257 markings, 129294 edges, 2937 markings/sec, 10 secs
lola: sara is running 15 secs || 65866 markings, 169785 edges, 3122 markings/sec, 15 secs
lola: sara is running 20 secs || 81945 markings, 212259 edges, 3216 markings/sec, 20 secs
lola: sara is running 25 secs || 96321 markings, 251299 edges, 2875 markings/sec, 25 secs
lola: sara is running 30 secs || 111684 markings, 291960 edges, 3073 markings/sec, 30 secs
lola: sara is running 35 secs || 126345 markings, 332422 edges, 2932 markings/sec, 35 secs
lola: sara is running 40 secs || 141056 markings, 370831 edges, 2942 markings/sec, 40 secs
lola: sara is running 45 secs || 155416 markings, 410449 edges, 2872 markings/sec, 45 secs
lola: sara is running 50 secs || 169804 markings, 450935 edges, 2878 markings/sec, 50 secs
lola: sara is running 55 secs || 186680 markings, 497532 edges, 3375 markings/sec, 55 secs
lola: sara is running 60 secs || 201829 markings, 539702 edges, 3030 markings/sec, 60 secs
lola: sara is running 65 secs || 216218 markings, 579626 edges, 2878 markings/sec, 65 secs
lola: sara is running 70 secs || 231245 markings, 622779 edges, 3005 markings/sec, 70 secs
lola: sara is running 75 secs || 249458 markings, 672719 edges, 3643 markings/sec, 75 secs
lola: sara is running 80 secs || 264753 markings, 715142 edges, 3059 markings/sec, 80 secs
lola: sara is running 85 secs || 280172 markings, 758768 edges, 3084 markings/sec, 85 secs
lola: sara is running 90 secs || 294839 markings, 799299 edges, 2933 markings/sec, 90 secs
lola: sara is running 95 secs || 309794 markings, 841557 edges, 2991 markings/sec, 95 secs
lola: sara is running 100 secs || 326842 markings, 889877 edges, 3410 markings/sec, 100 secs
lola: sara is running 105 secs || 342137 markings, 932824 edges, 3059 markings/sec, 105 secs
lola: sara is running 110 secs || 357639 markings, 977377 edges, 3100 markings/sec, 110 secs
lola: sara is running 115 secs || 372487 markings, 1018906 edges, 2970 markings/sec, 115 secs
lola: sara is running 120 secs || 387397 markings, 1061516 edges, 2982 markings/sec, 120 secs
lola: sara is running 125 secs || 404313 markings, 1109877 edges, 3383 markings/sec, 125 secs
lola: sara is running 130 secs || 419337 markings, 1152583 edges, 3005 markings/sec, 130 secs
lola: sara is running 135 secs || 433669 markings, 1192805 edges, 2866 markings/sec, 135 secs
lola: sara is running 140 secs || 447853 markings, 1232780 edges, 2837 markings/sec, 140 secs
lola: sara is running 145 secs || 462129 markings, 1273216 edges, 2855 markings/sec, 145 secs
lola: sara is running 150 secs || 476154 markings, 1313993 edges, 2805 markings/sec, 150 secs
lola: sara is running 155 secs || 491221 markings, 1356611 edges, 3013 markings/sec, 155 secs
lola: sara is running 160 secs || 505991 markings, 1399022 edges, 2954 markings/sec, 160 secs
lola: sara is running 165 secs || 520369 markings, 1439491 edges, 2876 markings/sec, 165 secs
lola: sara is running 170 secs || 534805 markings, 1481023 edges, 2887 markings/sec, 170 secs
lola: sara is running 175 secs || 549138 markings, 1521287 edges, 2867 markings/sec, 175 secs
lola: sara is running 180 secs || 563192 markings, 1561168 edges, 2811 markings/sec, 180 secs
lola: sara is running 185 secs || 578239 markings, 1604721 edges, 3009 markings/sec, 185 secs
lola: sara is running 190 secs || 595593 markings, 1655687 edges, 3471 markings/sec, 190 secs
lola: sara is running 195 secs || 609747 markings, 1695363 edges, 2831 markings/sec, 195 secs
lola: sara is running 200 secs || 623534 markings, 1734473 edges, 2757 markings/sec, 200 secs
lola: sara is running 205 secs || 636856 markings, 1772272 edges, 2664 markings/sec, 205 secs
lola: sara is running 210 secs || 651029 markings, 1812887 edges, 2835 markings/sec, 210 secs
lola: sara is running 215 secs || 666005 markings, 1856086 edges, 2995 markings/sec, 215 secs
lola: sara is running 220 secs || 679921 markings, 1896494 edges, 2783 markings/sec, 220 secs
lola: sara is running 225 secs || 697196 markings, 1946277 edges, 3455 markings/sec, 225 secs
lola: sara is running 230 secs || 711285 markings, 1986218 edges, 2818 markings/sec, 230 secs
lola: sara is running 235 secs || 726773 markings, 2031730 edges, 3098 markings/sec, 235 secs
lola: sara is running 240 secs || 741038 markings, 2072719 edges, 2853 markings/sec, 240 secs
lola: sara is running 245 secs || 754520 markings, 2110668 edges, 2696 markings/sec, 245 secs
lola: sara is running 250 secs || 768408 markings, 2149356 edges, 2778 markings/sec, 250 secs
lola: sara is running 255 secs || 783060 markings, 2192070 edges, 2930 markings/sec, 255 secs
lola: sara is running 260 secs || 796056 markings, 2230365 edges, 2599 markings/sec, 260 secs
lola: sara is running 265 secs || 812266 markings, 2276066 edges, 3242 markings/sec, 265 secs
lola: sara is running 270 secs || 828455 markings, 2323444 edges, 3238 markings/sec, 270 secs
lola: sara is running 275 secs || 842891 markings, 2364610 edges, 2887 markings/sec, 275 secs
lola: sara is running 280 secs || 856779 markings, 2404469 edges, 2778 markings/sec, 280 secs
lola: sara is running 285 secs || 870955 markings, 2445300 edges, 2835 markings/sec, 285 secs
lola: sara is running 290 secs || 885229 markings, 2486578 edges, 2855 markings/sec, 290 secs
lola: sara is running 295 secs || 897774 markings, 2522740 edges, 2509 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 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p169 <= p186 + p187) AND ((p170 <= 0) OR (p164 + p165 <= 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 || 18389 markings, 45706 edges, 3678 markings/sec, 0 secs
lola: sara is running 5 secs || 36571 markings, 93429 edges, 3636 markings/sec, 5 secs
lola: sara is running 10 secs || 53326 markings, 137546 edges, 3351 markings/sec, 10 secs
lola: sara is running 15 secs || 69389 markings, 180436 edges, 3213 markings/sec, 15 secs
lola: sara is running 20 secs || 86529 markings, 225925 edges, 3428 markings/sec, 20 secs
lola: sara is running 25 secs || 102846 markings, 269626 edges, 3263 markings/sec, 25 secs
lola: sara is running 30 secs || 118753 markings, 312649 edges, 3181 markings/sec, 30 secs
lola: sara is running 35 secs || 134293 markings, 355586 edges, 3108 markings/sec, 35 secs
lola: sara is running 40 secs || 150616 markings, 399280 edges, 3265 markings/sec, 40 secs
lola: sara is running 45 secs || 165887 markings, 441342 edges, 3054 markings/sec, 45 secs
lola: sara is running 50 secs || 182659 markings, 488619 edges, 3354 markings/sec, 50 secs
lola: sara is running 55 secs || 198348 markings, 532858 edges, 3138 markings/sec, 55 secs
lola: sara is running 60 secs || 213443 markings, 575193 edges, 3019 markings/sec, 60 secs
lola: sara is running 65 secs || 227590 markings, 614294 edges, 2829 markings/sec, 65 secs
lola: sara is running 70 secs || 244139 markings, 659971 edges, 3310 markings/sec, 70 secs
lola: sara is running 75 secs || 259888 markings, 704522 edges, 3150 markings/sec, 75 secs
lola: sara is running 80 secs || 274988 markings, 746951 edges, 3020 markings/sec, 80 secs
lola: sara is running 85 secs || 289415 markings, 786906 edges, 2885 markings/sec, 85 secs
lola: sara is running 90 secs || 304165 markings, 829319 edges, 2950 markings/sec, 90 secs
lola: sara is running 95 secs || 319390 markings, 872538 edges, 3045 markings/sec, 95 secs
lola: sara is running 100 secs || 333138 markings, 911425 edges, 2750 markings/sec, 100 secs
lola: sara is running 105 secs || 346095 markings, 948037 edges, 2591 markings/sec, 105 secs
lola: sara is running 110 secs || 360611 markings, 989367 edges, 2903 markings/sec, 110 secs
lola: sara is running 115 secs || 375149 markings, 1030215 edges, 2908 markings/sec, 115 secs
lola: sara is running 120 secs || 389364 markings, 1070844 edges, 2843 markings/sec, 120 secs
lola: sara is running 125 secs || 405902 markings, 1118275 edges, 3308 markings/sec, 125 secs
lola: sara is running 130 secs || 420157 markings, 1158459 edges, 2851 markings/sec, 130 secs
lola: sara is running 135 secs || 435498 markings, 1202278 edges, 3068 markings/sec, 135 secs
lola: sara is running 140 secs || 449920 markings, 1242946 edges, 2884 markings/sec, 140 secs
lola: sara is running 145 secs || 464438 markings, 1284251 edges, 2904 markings/sec, 145 secs
lola: sara is running 150 secs || 479165 markings, 1326638 edges, 2945 markings/sec, 150 secs
lola: sara is running 155 secs || 494820 markings, 1371053 edges, 3131 markings/sec, 155 secs
lola: sara is running 160 secs || 510197 markings, 1415435 edges, 3075 markings/sec, 160 secs
lola: sara is running 165 secs || 524668 markings, 1456809 edges, 2894 markings/sec, 165 secs
lola: sara is running 170 secs || 539120 markings, 1498162 edges, 2890 markings/sec, 170 secs
lola: sara is running 175 secs || 553602 markings, 1539327 edges, 2896 markings/sec, 175 secs
lola: sara is running 180 secs || 567344 markings, 1577720 edges, 2748 markings/sec, 180 secs
lola: sara is running 185 secs || 582398 markings, 1621069 edges, 3011 markings/sec, 185 secs
lola: sara is running 190 secs || 599910 markings, 1672600 edges, 3502 markings/sec, 190 secs
lola: sara is running 195 secs || 613199 markings, 1710264 edges, 2658 markings/sec, 195 secs
lola: sara is running 200 secs || 626994 markings, 1749603 edges, 2759 markings/sec, 200 secs
lola: sara is running 205 secs || 640747 markings, 1788525 edges, 2751 markings/sec, 205 secs
lola: sara is running 210 secs || 654641 markings, 1828546 edges, 2779 markings/sec, 210 secs
lola: sara is running 215 secs || 668807 markings, 1869513 edges, 2833 markings/sec, 215 secs
lola: sara is running 220 secs || 681944 markings, 1908035 edges, 2627 markings/sec, 220 secs
lola: sara is running 225 secs || 697593 markings, 1951989 edges, 3130 markings/sec, 225 secs
lola: sara is running 230 secs || 713250 markings, 1997711 edges, 3131 markings/sec, 230 secs
lola: sara is running 235 secs || 726756 markings, 2036434 edges, 2701 markings/sec, 235 secs
lola: sara is running 240 secs || 739989 markings, 2074272 edges, 2647 markings/sec, 240 secs
lola: sara is running 245 secs || 753038 markings, 2111702 edges, 2610 markings/sec, 245 secs
lola: sara is running 250 secs || 767069 markings, 2152172 edges, 2806 markings/sec, 250 secs
lola: sara is running 255 secs || 779992 markings, 2190431 edges, 2585 markings/sec, 255 secs
lola: sara is running 260 secs || 791640 markings, 2221912 edges, 2330 markings/sec, 260 secs
lola: sara is running 265 secs || 806377 markings, 2265367 edges, 2947 markings/sec, 265 secs
lola: sara is running 270 secs || 822347 markings, 2311696 edges, 3194 markings/sec, 270 secs
lola: sara is running 275 secs || 836331 markings, 2351803 edges, 2797 markings/sec, 275 secs
lola: sara is running 280 secs || 851739 markings, 2397381 edges, 3082 markings/sec, 280 secs
lola: sara is running 285 secs || 864528 markings, 2433301 edges, 2558 markings/sec, 285 secs
lola: sara is running 290 secs || 877843 markings, 2470938 edges, 2663 markings/sec, 290 secs
lola: sara is running 295 secs || 892342 markings, 2513117 edges, 2900 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 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p170 <= p166) AND (1 <= p169))))
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 342 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: The predicate is invariant.
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p167 + 1 <= p171) AND (p170 + 1 <= p184 + p185) AND (p171 <= 2) AND (p184 + p185 <= 0))))
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 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 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p170 <= p166)))
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 546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p184 + p185)))
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 683 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p186 + p187)))
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 911 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: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13.sara
lola: The predicate is unreachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 14 will run for 1366 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13.sara.lola:
...considering subproblem: E (F (((p168 <= p163) AND (3 <= p166) AND ((2 <= p170) OR (1 <= p167)) AND (3 <= p184 + p185))))
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-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 2732 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p164 + p165 <= 0) AND (p163 <= 2)) OR (p163 <= p170))))
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: RESULT
lola:
SUMMARY: yes yes no yes yes unknown unknown yes yes no yes no no no no no
lola: ========================================
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 1494612506569

--------------------
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-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/BridgeAndVehicles-COL-V80P50N10.tgz
mv 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 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 r008-csrt-149436126300412"
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 ;