About the Execution of LoLA for S_BridgeAndVehicles-COL-V50P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1783.680 | 1458107.00 | 2920431.00 | 140.20 | F?F?FFFTFFTF?T?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_BridgeAndVehicles-COL-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074300331
=====================================================================
--------------------
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-V50P20N10-ReachabilityCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496341031517
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-COL-V50P20N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-COL-V50P20N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
ReachabilityCardinality @ S_BridgeAndVehicles-COL-V50P20N10 @ 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: 1456/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.task
lola: E (F (((3 <= p3 + p4) AND (p3 + p4 <= p1) AND (2 <= 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) AND ((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 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p127) OR (p2 <= 0))))) : A (G (((2 <= p72) OR (3 <= p67) OR (p3 + p4 + 1 <= p0)))) : A (G ((((p70 + p71 <= 1) AND (p126 <= 1)) OR (((3 <= p69) OR (p69 <= p67)) AND ((p72 <= p1) OR (p69 <= p72)))))) : A (G (((((p2 <= p126) AND (p124 + p125 <= p3 + p4)) OR (p3 + p4 <= p67)) AND ((p127 <= 0) OR (p124 + p125 <= 2))))) : A (G ((((1 <= p3 + p4) AND (3 <= p127)) OR ((3 <= 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) AND (p69 <= p0)) OR (p69 <= p3 + p4) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p69) OR (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 + 1 <= p70 + p71)))) : A (G ((((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p68) AND (p70 + p71 <= p0)) OR (p69 <= p2)))) : A (G ((((2 <= p68) OR (1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR ((p3 + p4 <= p127) AND (3 <= p68))) AND (((2 <= p0) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p1)) OR (1 <= p72))))) : A (G (((p70 + p71 <= 2) OR ((2 <= p67) AND (p1 <= p126))))) : A (G ((2 <= p72))) : E (F ((((p67 <= 2) AND (p70 + p71 <= 0)) OR (((p3 + p4 <= p1) OR (3 <= p2)) AND (2 <= p70 + p71))))) : A (G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p2))) : E (F (((2 <= p1) AND (p72 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))) : A (G ((1 <= p67))) : E (F (((p2 <= p1) AND (2 <= p124 + p125)))) : A (G ((((p1 + 1 <= p72) OR (p0 <= 0)) AND ((p124 + p125 + 1 <= p3 + p4) OR (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 <= 1))))) : E (F (((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 <= 0) OR (p2 <= 2))))
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 (((3 <= p3 + p4) AND (p3 + p4 <= p1) AND (2 <= 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) AND ((2 <= p100 + p101 + p102 + p103 + p104... (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 484 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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p72) OR (3 <= p67) OR (p3 + p4 + 1 <= p0))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16531 markings, 43298 edges, 3306 markings/sec, 0 secs
lola: sara is running 5 secs || 33628 markings, 88714 edges, 3419 markings/sec, 5 secs
lola: sara is running 10 secs || 52375 markings, 138110 edges, 3749 markings/sec, 10 secs
lola: sara is running 15 secs || 70698 markings, 186915 edges, 3665 markings/sec, 15 secs
lola: sara is running 20 secs || 88412 markings, 233722 edges, 3543 markings/sec, 20 secs
lola: sara is running 25 secs || 106233 markings, 280430 edges, 3564 markings/sec, 25 secs
lola: sara is running 30 secs || 117082 markings, 307450 edges, 2170 markings/sec, 30 secs
lola: sara is running 35 secs || 127898 markings, 334295 edges, 2163 markings/sec, 35 secs
lola: sara is running 40 secs || 146912 markings, 386187 edges, 3803 markings/sec, 40 secs
lola: sara is running 45 secs || 158172 markings, 413882 edges, 2252 markings/sec, 45 secs
lola: sara is running 50 secs || 168596 markings, 442267 edges, 2085 markings/sec, 50 secs
lola: sara is running 55 secs || 185014 markings, 486996 edges, 3284 markings/sec, 55 secs
lola: sara is running 60 secs || 195756 markings, 516520 edges, 2148 markings/sec, 60 secs
lola: sara is running 65 secs || 212016 markings, 561258 edges, 3252 markings/sec, 65 secs
lola: sara is running 70 secs || 224695 markings, 595750 edges, 2536 markings/sec, 70 secs
lola: sara is running 75 secs || 237587 markings, 631245 edges, 2578 markings/sec, 75 secs
lola: sara is running 80 secs || 252868 markings, 672956 edges, 3056 markings/sec, 80 secs
lola: sara is running 85 secs || 263252 markings, 701328 edges, 2077 markings/sec, 85 secs
lola: sara is running 90 secs || 278003 markings, 741889 edges, 2950 markings/sec, 90 secs
lola: sara is running 95 secs || 293470 markings, 784239 edges, 3093 markings/sec, 95 secs
lola: sara is running 100 secs || 306776 markings, 820764 edges, 2661 markings/sec, 100 secs
lola: sara is running 105 secs || 319818 markings, 856629 edges, 2608 markings/sec, 105 secs
lola: sara is running 110 secs || 334931 markings, 898421 edges, 3023 markings/sec, 110 secs
lola: sara is running 115 secs || 349804 markings, 943531 edges, 2975 markings/sec, 115 secs
lola: sara is running 120 secs || 362037 markings, 975352 edges, 2447 markings/sec, 120 secs
lola: sara is running 125 secs || 373952 markings, 1010387 edges, 2383 markings/sec, 125 secs
lola: sara is running 130 secs || 386006 markings, 1046315 edges, 2411 markings/sec, 130 secs
lola: sara is running 135 secs || 403559 markings, 1094003 edges, 3511 markings/sec, 135 secs
lola: sara is running 140 secs || 420026 markings, 1139513 edges, 3293 markings/sec, 140 secs
lola: sara is running 145 secs || 431376 markings, 1177020 edges, 2270 markings/sec, 145 secs
lola: sara is running 150 secs || 442687 markings, 1209443 edges, 2262 markings/sec, 150 secs
lola: sara is running 155 secs || 453888 markings, 1239945 edges, 2240 markings/sec, 155 secs
lola: sara is running 160 secs || 465157 markings, 1270464 edges, 2254 markings/sec, 160 secs
lola: sara is running 165 secs || 476340 markings, 1300708 edges, 2237 markings/sec, 165 secs
lola: sara is running 170 secs || 487521 markings, 1331305 edges, 2236 markings/sec, 170 secs
lola: sara is running 175 secs || 499188 markings, 1370622 edges, 2333 markings/sec, 175 secs
lola: sara is running 180 secs || 511025 markings, 1413049 edges, 2367 markings/sec, 180 secs
lola: sara is running 185 secs || 522999 markings, 1455346 edges, 2395 markings/sec, 185 secs
lola: sara is running 190 secs || 534827 markings, 1497250 edges, 2366 markings/sec, 190 secs
lola: sara is running 195 secs || 545663 markings, 1534409 edges, 2167 markings/sec, 195 secs
lola: sara is running 200 secs || 556186 markings, 1568332 edges, 2105 markings/sec, 200 secs
lola: sara is running 205 secs || 566856 markings, 1604419 edges, 2134 markings/sec, 205 secs
lola: sara is running 210 secs || 584051 markings, 1654511 edges, 3439 markings/sec, 210 secs
lola: sara is running 215 secs || 594559 markings, 1689130 edges, 2102 markings/sec, 215 secs
lola: sara is running 220 secs || 604744 markings, 1720971 edges, 2037 markings/sec, 220 secs
lola: sara is running 225 secs || 619982 markings, 1765707 edges, 3048 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p70 + p71 <= 1) AND (p126 <= 1)) OR (((3 <= p69) OR (p69 <= p67)) AND ((p72 <= p1) OR (p69 <= p72))))))
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 484 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p2 <= p126) AND (p124 + p125 <= p3 + p4)) OR (p3 + p4 <= p67)) AND ((p127 <= 0) OR (p124 + p125 <= 2)))))
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 484 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p3 + p4) AND (3 <= p127)) OR ((3 <= 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) AND (p69 <= p0)) OR (p69 <= p3 + p4) OR (p... (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 484 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p10... (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 484 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p68) OR (1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR ((p3 + p4 <= p127) AND (3 <= p68))) AND (((2 <= p0) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p98 + p97 + p96 + p95 + p94 + p93 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 ... (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 484 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 52753 markings, 141906 edges, 10551 markings/sec, 0 secs
lola: sara is running 5 secs || 102029 markings, 288560 edges, 9855 markings/sec, 5 secs
lola: sara is running 10 secs || 144961 markings, 420061 edges, 8586 markings/sec, 10 secs
lola: sara is running 15 secs || 194440 markings, 572835 edges, 9896 markings/sec, 15 secs
lola: sara is running 20 secs || 245039 markings, 731166 edges, 10120 markings/sec, 20 secs
lola: sara is running 25 secs || 294441 markings, 886976 edges, 9880 markings/sec, 25 secs
lola: sara is running 30 secs || 344600 markings, 1050484 edges, 10032 markings/sec, 30 secs
lola: sara is running 35 secs || 394344 markings, 1206723 edges, 9949 markings/sec, 35 secs
lola: sara is running 40 secs || 446846 markings, 1373416 edges, 10500 markings/sec, 40 secs
lola: sara is running 45 secs || 500264 markings, 1549073 edges, 10684 markings/sec, 45 secs
lola: sara is running 50 secs || 554200 markings, 1719764 edges, 10787 markings/sec, 50 secs
lola: sara is running 55 secs || 605915 markings, 1893448 edges, 10343 markings/sec, 55 secs
lola: sara is running 60 secs || 664465 markings, 2077804 edges, 11710 markings/sec, 60 secs
lola: sara is running 65 secs || 716409 markings, 2250031 edges, 10389 markings/sec, 65 secs
lola: sara is running 70 secs || 770461 markings, 2422356 edges, 10810 markings/sec, 70 secs
lola: sara is running 75 secs || 816881 markings, 2579095 edges, 9284 markings/sec, 75 secs
lola: sara is running 80 secs || 872153 markings, 2753059 edges, 11054 markings/sec, 80 secs
lola: sara is running 85 secs || 925022 markings, 2930925 edges, 10574 markings/sec, 85 secs
lola: sara is running 90 secs || 968160 markings, 3070108 edges, 8628 markings/sec, 90 secs
lola: sara is running 95 secs || 1003906 markings, 3188220 edges, 7149 markings/sec, 95 secs
lola: sara is running 100 secs || 1045909 markings, 3329365 edges, 8401 markings/sec, 100 secs
lola: sara is running 105 secs || 1091992 markings, 3485024 edges, 9217 markings/sec, 105 secs
lola: sara is running 110 secs || 1142422 markings, 3655825 edges, 10086 markings/sec, 110 secs
lola: sara is running 115 secs || 1185038 markings, 3802546 edges, 8523 markings/sec, 115 secs
lola: sara is running 120 secs || 1236849 markings, 3980877 edges, 10362 markings/sec, 120 secs
lola: sara is running 125 secs || 1277669 markings, 4110619 edges, 8164 markings/sec, 125 secs
lola: sara is running 130 secs || 1312064 markings, 4226840 edges, 6879 markings/sec, 130 secs
lola: sara is running 135 secs || 1351489 markings, 4359539 edges, 7885 markings/sec, 135 secs
lola: sara is running 140 secs || 1390250 markings, 4491139 edges, 7752 markings/sec, 140 secs
lola: sara is running 145 secs || 1435345 markings, 4644074 edges, 9019 markings/sec, 145 secs
lola: sara is running 150 secs || 1476730 markings, 4786046 edges, 8277 markings/sec, 150 secs
lola: sara is running 155 secs || 1517921 markings, 4928216 edges, 8238 markings/sec, 155 secs
lola: sara is running 160 secs || 1561347 markings, 5078226 edges, 8685 markings/sec, 160 secs
lola: sara is running 165 secs || 1608121 markings, 5232146 edges, 9355 markings/sec, 165 secs
lola: sara is running 170 secs || 1643114 markings, 5347697 edges, 6999 markings/sec, 170 secs
lola: sara is running 175 secs || 1677471 markings, 5465664 edges, 6871 markings/sec, 175 secs
lola: sara is running 180 secs || 1718844 markings, 5603873 edges, 8275 markings/sec, 180 secs
lola: sara is running 185 secs || 1757795 markings, 5736352 edges, 7790 markings/sec, 185 secs
lola: sara is running 190 secs || 1801193 markings, 5884033 edges, 8680 markings/sec, 190 secs
lola: sara is running 195 secs || 1843369 markings, 6027073 edges, 8435 markings/sec, 195 secs
lola: sara is running 200 secs || 1885135 markings, 6170076 edges, 8353 markings/sec, 200 secs
lola: sara is running 205 secs || 1926467 markings, 6311564 edges, 8266 markings/sec, 205 secs
lola: sara is running 210 secs || 1967342 markings, 6454445 edges, 8175 markings/sec, 210 secs
lola: sara is running 215 secs || 2006929 markings, 6579233 edges, 7917 markings/sec, 215 secs
lola: sara is running 220 secs || 2040943 markings, 6694432 edges, 6803 markings/sec, 220 secs
lola: sara is running 225 secs || 2073973 markings, 6808073 edges, 6606 markings/sec, 225 secs
lola: sara is running 230 secs || 2113531 markings, 6940119 edges, 7912 markings/sec, 230 secs
lola: sara is running 235 secs || 2150234 markings, 7065934 edges, 7341 markings/sec, 235 secs
lola: sara is running 240 secs || 2187149 markings, 7192732 edges, 7383 markings/sec, 240 secs
lola: sara is running 245 secs || 2225548 markings, 7324558 edges, 7680 markings/sec, 245 secs
lola: sara is running 250 secs || 2265147 markings, 7460258 edges, 7920 markings/sec, 250 secs
lola: sara is running 255 secs || 2305045 markings, 7596462 edges, 7980 markings/sec, 255 secs
lola: sara is running 260 secs || 2340946 markings, 7722782 edges, 7180 markings/sec, 260 secs
lola: sara is running 265 secs || 2375865 markings, 7842560 edges, 6984 markings/sec, 265 secs
lola: sara is running 270 secs || 2419011 markings, 7984068 edges, 8629 markings/sec, 270 secs
lola: sara is running 275 secs || 2452957 markings, 8096560 edges, 6789 markings/sec, 275 secs
lola: sara is running 280 secs || 2487110 markings, 8212523 edges, 6831 markings/sec, 280 secs
lola: sara is running 285 secs || 2521168 markings, 8329710 edges, 6812 markings/sec, 285 secs
lola: sara is running 290 secs || 2558188 markings, 8454949 edges, 7404 markings/sec, 290 secs
lola: sara is running 295 secs || 2594935 markings, 8581479 edges, 7349 markings/sec, 295 secs
lola: sara is running 300 secs || 2631834 markings, 8708225 edges, 7380 markings/sec, 300 secs
lola: sara is running 305 secs || 2669269 markings, 8836433 edges, 7487 markings/sec, 305 secs
lola: sara is running 310 secs || 2703787 markings, 8956957 edges, 6904 markings/sec, 310 secs
lola: sara is running 315 secs || 2741390 markings, 9086992 edges, 7521 markings/sec, 315 secs
lola: sara is running 320 secs || 2778663 markings, 9217000 edges, 7455 markings/sec, 320 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 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p70 + p71 <= 2) OR ((2 <= p67) AND (p1 <= p126)))))
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 484 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-V50P20N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p72)))
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 484 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-V50P20N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 13)
lola: sara is running 0 secs || 53687 markings, 152257 edges, 10737 markings/sec, 0 secs
lola: sara is running 5 secs || 104581 markings, 307328 edges, 10179 markings/sec, 5 secs
lola: sara is running 10 secs || 151421 markings, 451026 edges, 9368 markings/sec, 10 secs
lola: sara is running 15 secs || 202061 markings, 611209 edges, 10128 markings/sec, 15 secs
lola: sara is running 20 secs || 252612 markings, 777251 edges, 10110 markings/sec, 20 secs
lola: sara is running 25 secs || 305260 markings, 948875 edges, 10530 markings/sec, 25 secs
lola: sara is running 30 secs || 358857 markings, 1123472 edges, 10719 markings/sec, 30 secs
lola: sara is running 35 secs || 409805 markings, 1292531 edges, 10190 markings/sec, 35 secs
lola: sara is running 40 secs || 464659 markings, 1473961 edges, 10971 markings/sec, 40 secs
lola: sara is running 45 secs || 515382 markings, 1641169 edges, 10145 markings/sec, 45 secs
lola: sara is running 50 secs || 570067 markings, 1825734 edges, 10937 markings/sec, 50 secs
lola: sara is running 55 secs || 619309 markings, 1987774 edges, 9848 markings/sec, 55 secs
lola: sara is running 60 secs || 673748 markings, 2172248 edges, 10888 markings/sec, 60 secs
lola: sara is running 65 secs || 724436 markings, 2340343 edges, 10138 markings/sec, 65 secs
lola: sara is running 70 secs || 779915 markings, 2527872 edges, 11096 markings/sec, 70 secs
lola: sara is running 75 secs || 829800 markings, 2699042 edges, 9977 markings/sec, 75 secs
lola: sara is running 80 secs || 883876 markings, 2876701 edges, 10815 markings/sec, 80 secs
lola: sara is running 85 secs || 935063 markings, 3051651 edges, 10237 markings/sec, 85 secs
lola: sara is running 90 secs || 988016 markings, 3227153 edges, 10591 markings/sec, 90 secs
lola: sara is running 95 secs || 1043620 markings, 3417287 edges, 11121 markings/sec, 95 secs
lola: sara is running 100 secs || 1094271 markings, 3592932 edges, 10130 markings/sec, 100 secs
lola: sara is running 105 secs || 1135334 markings, 3723067 edges, 8213 markings/sec, 105 secs
lola: sara is running 110 secs || 1178154 markings, 3866736 edges, 8564 markings/sec, 110 secs
lola: sara is running 115 secs || 1225755 markings, 4029416 edges, 9520 markings/sec, 115 secs
lola: sara is running 120 secs || 1276787 markings, 4204827 edges, 10206 markings/sec, 120 secs
lola: sara is running 125 secs || 1321921 markings, 4360709 edges, 9027 markings/sec, 125 secs
lola: sara is running 130 secs || 1375895 markings, 4547733 edges, 10795 markings/sec, 130 secs
lola: sara is running 135 secs || 1424079 markings, 4709575 edges, 9637 markings/sec, 135 secs
lola: sara is running 140 secs || 1459510 markings, 4825579 edges, 7086 markings/sec, 140 secs
lola: sara is running 145 secs || 1502375 markings, 4969929 edges, 8573 markings/sec, 145 secs
lola: sara is running 150 secs || 1545070 markings, 5115346 edges, 8539 markings/sec, 150 secs
lola: sara is running 155 secs || 1592217 markings, 5277871 edges, 9429 markings/sec, 155 secs
lola: sara is running 160 secs || 1634420 markings, 5423554 edges, 8441 markings/sec, 160 secs
lola: sara is running 165 secs || 1683703 markings, 5596395 edges, 9857 markings/sec, 165 secs
lola: sara is running 170 secs || 1732410 markings, 5764351 edges, 9741 markings/sec, 170 secs
lola: sara is running 175 secs || 1779741 markings, 5926963 edges, 9466 markings/sec, 175 secs
lola: sara is running 180 secs || 1816683 markings, 6045486 edges, 7388 markings/sec, 180 secs
lola: sara is running 185 secs || 1854567 markings, 6173404 edges, 7577 markings/sec, 185 secs
lola: sara is running 190 secs || 1897026 markings, 6318485 edges, 8492 markings/sec, 190 secs
lola: sara is running 195 secs || 1939664 markings, 6464217 edges, 8528 markings/sec, 195 secs
lola: sara is running 200 secs || 1979174 markings, 6600650 edges, 7902 markings/sec, 200 secs
lola: sara is running 205 secs || 2021118 markings, 6744741 edges, 8389 markings/sec, 205 secs
lola: sara is running 210 secs || 2064962 markings, 6896601 edges, 8769 markings/sec, 210 secs
lola: sara is running 215 secs || 2108494 markings, 7047186 edges, 8706 markings/sec, 215 secs
lola: sara is running 220 secs || 2151756 markings, 7196509 edges, 8652 markings/sec, 220 secs
lola: sara is running 225 secs || 2197637 markings, 7346273 edges, 9176 markings/sec, 225 secs
lola: sara is running 230 secs || 2230534 markings, 7455709 edges, 6579 markings/sec, 230 secs
lola: sara is running 235 secs || 2267737 markings, 7582450 edges, 7441 markings/sec, 235 secs
lola: sara is running 240 secs || 2306703 markings, 7715836 edges, 7793 markings/sec, 240 secs
lola: sara is running 245 secs || 2349905 markings, 7863673 edges, 8640 markings/sec, 245 secs
lola: sara is running 250 secs || 2391227 markings, 8006705 edges, 8264 markings/sec, 250 secs
lola: sara is running 255 secs || 2432187 markings, 8148601 edges, 8192 markings/sec, 255 secs
lola: sara is running 260 secs || 2474372 markings, 8294664 edges, 8437 markings/sec, 260 secs
lola: sara is running 265 secs || 2517516 markings, 8444023 edges, 8629 markings/sec, 265 secs
lola: sara is running 270 secs || 2558993 markings, 8589076 edges, 8295 markings/sec, 270 secs
lola: sara is running 275 secs || 2598605 markings, 8727667 edges, 7922 markings/sec, 275 secs
lola: sara is running 280 secs || 2640918 markings, 8863804 edges, 8463 markings/sec, 280 secs
lola: sara is running 285 secs || 2674617 markings, 8976645 edges, 6740 markings/sec, 285 secs
lola: sara is running 290 secs || 2709058 markings, 9094583 edges, 6888 markings/sec, 290 secs
lola: sara is running 295 secs || 2749459 markings, 9232475 edges, 8080 markings/sec, 295 secs
lola: sara is running 300 secs || 2787194 markings, 9363130 edges, 7547 markings/sec, 300 secs
lola: sara is running 305 secs || 2826644 markings, 9499845 edges, 7890 markings/sec, 305 secs
lola: sara is running 310 secs || 2867139 markings, 9640125 edges, 8099 markings/sec, 310 secs
lola: sara is running 315 secs || 2908678 markings, 9784500 edges, 8308 markings/sec, 315 secs
lola: sara is running 320 secs || 2951086 markings, 9931846 edges, 8482 markings/sec, 320 secs
lola: sara is running 325 secs || 2994518 markings, 10082445 edges, 8686 markings/sec, 325 secs
lola: sara is running 330 secs || 3034410 markings, 10222297 edges, 7978 markings/sec, 330 secs
lola: sara is running 335 secs || 3072007 markings, 10353342 edges, 7519 markings/sec, 335 secs
lola: sara is running 340 secs || 3115260 markings, 10496198 edges, 8651 markings/sec, 340 secs
lola: sara is running 345 secs || 3148909 markings, 10607012 edges, 6730 markings/sec, 345 secs
lola: sara is running 350 secs || 3181201 markings, 10716682 edges, 6458 markings/sec, 350 secs
lola: sara is running 355 secs || 3217329 markings, 10841463 edges, 7226 markings/sec, 355 secs
lola: sara is running 360 secs || 3255492 markings, 10972326 edges, 7633 markings/sec, 360 secs
lola: sara is running 365 secs || 3295674 markings, 11111442 edges, 8036 markings/sec, 365 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p67 <= 2) AND (p70 + p71 <= 0)) OR (((p3 + p4 <= p1) OR (3 <= p2)) AND (2 <= p70 + p71)))))
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 484 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 10 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p2)))
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 484 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: ========================================
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-V50P20N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1) AND (p72 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))
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 484 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-V50P20N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 87690 markings, 209228 edges, 17538 markings/sec, 0 secs
lola: sara is running 5 secs || 177853 markings, 426934 edges, 18033 markings/sec, 5 secs
lola: sara is running 10 secs || 247115 markings, 589107 edges, 13852 markings/sec, 10 secs
lola: sara is running 15 secs || 316518 markings, 755435 edges, 13881 markings/sec, 15 secs
lola: sara is running 20 secs || 390815 markings, 932185 edges, 14859 markings/sec, 20 secs
lola: sara is running 25 secs || 459032 markings, 1092587 edges, 13643 markings/sec, 25 secs
lola: sara is running 30 secs || 524854 markings, 1251125 edges, 13164 markings/sec, 30 secs
lola: sara is running 35 secs || 590475 markings, 1417475 edges, 13124 markings/sec, 35 secs
lola: sara is running 40 secs || 654110 markings, 1575431 edges, 12727 markings/sec, 40 secs
lola: sara is running 45 secs || 723478 markings, 1744157 edges, 13874 markings/sec, 45 secs
lola: sara is running 50 secs || 793349 markings, 1916504 edges, 13974 markings/sec, 50 secs
lola: sara is running 55 secs || 867676 markings, 2099590 edges, 14865 markings/sec, 55 secs
lola: sara is running 60 secs || 937944 markings, 2272337 edges, 14054 markings/sec, 60 secs
lola: sara is running 65 secs || 996629 markings, 2426401 edges, 11737 markings/sec, 65 secs
lola: sara is running 70 secs || 1044083 markings, 2558829 edges, 9491 markings/sec, 70 secs
lola: sara is running 75 secs || 1109018 markings, 2735181 edges, 12987 markings/sec, 75 secs
lola: sara is running 80 secs || 1174341 markings, 2910910 edges, 13065 markings/sec, 80 secs
lola: sara is running 85 secs || 1238020 markings, 3081857 edges, 12736 markings/sec, 85 secs
lola: sara is running 90 secs || 1309548 markings, 3271821 edges, 14306 markings/sec, 90 secs
lola: sara is running 95 secs || 1375006 markings, 3447853 edges, 13092 markings/sec, 95 secs
lola: sara is running 100 secs || 1438343 markings, 3618752 edges, 12667 markings/sec, 100 secs
lola: sara is running 105 secs || 1510794 markings, 3811177 edges, 14490 markings/sec, 105 secs
lola: sara is running 110 secs || 1570359 markings, 3975571 edges, 11913 markings/sec, 110 secs
lola: sara is running 115 secs || 1614097 markings, 4106930 edges, 8748 markings/sec, 115 secs
lola: sara is running 120 secs || 1663936 markings, 4254124 edges, 9968 markings/sec, 120 secs
lola: sara is running 125 secs || 1728058 markings, 4434650 edges, 12824 markings/sec, 125 secs
lola: sara is running 130 secs || 1795120 markings, 4624634 edges, 13412 markings/sec, 130 secs
lola: sara is running 135 secs || 1863185 markings, 4817175 edges, 13613 markings/sec, 135 secs
lola: sara is running 140 secs || 1928883 markings, 5003462 edges, 13140 markings/sec, 140 secs
lola: sara is running 145 secs || 1994193 markings, 5189163 edges, 13062 markings/sec, 145 secs
lola: sara is running 150 secs || 2057709 markings, 5369930 edges, 12703 markings/sec, 150 secs
lola: sara is running 155 secs || 2120518 markings, 5549156 edges, 12562 markings/sec, 155 secs
lola: sara is running 160 secs || 2180640 markings, 5721146 edges, 12024 markings/sec, 160 secs
lola: sara is running 165 secs || 2241502 markings, 5894848 edges, 12172 markings/sec, 165 secs
lola: sara is running 170 secs || 2304078 markings, 6075292 edges, 12515 markings/sec, 170 secs
lola: sara is running 175 secs || 2347505 markings, 6211191 edges, 8685 markings/sec, 175 secs
lola: sara is running 180 secs || 2393863 markings, 6354428 edges, 9272 markings/sec, 180 secs
lola: sara is running 185 secs || 2439897 markings, 6495205 edges, 9207 markings/sec, 185 secs
lola: sara is running 190 secs || 2502108 markings, 6673825 edges, 12442 markings/sec, 190 secs
lola: sara is running 195 secs || 2555723 markings, 6839322 edges, 10723 markings/sec, 195 secs
lola: sara is running 200 secs || 2619127 markings, 7024066 edges, 12681 markings/sec, 200 secs
lola: sara is running 205 secs || 2682116 markings, 7207418 edges, 12598 markings/sec, 205 secs
lola: sara is running 210 secs || 2750249 markings, 7406794 edges, 13627 markings/sec, 210 secs
lola: sara is running 215 secs || 2799672 markings, 7560973 edges, 9885 markings/sec, 215 secs
lola: sara is running 220 secs || 2861424 markings, 7741702 edges, 12350 markings/sec, 220 secs
lola: sara is running 225 secs || 2922964 markings, 7922400 edges, 12308 markings/sec, 225 secs
lola: sara is running 230 secs || 2984336 markings, 8102505 edges, 12274 markings/sec, 230 secs
lola: sara is running 235 secs || 3046699 markings, 8286892 edges, 12473 markings/sec, 235 secs
lola: sara is running 240 secs || 3107624 markings, 8466232 edges, 12185 markings/sec, 240 secs
lola: sara is running 245 secs || 3166650 markings, 8640553 edges, 11805 markings/sec, 245 secs
lola: sara is running 250 secs || 3215460 markings, 8795393 edges, 9762 markings/sec, 250 secs
lola: sara is running 255 secs || 3253159 markings, 8916595 edges, 7540 markings/sec, 255 secs
lola: sara is running 260 secs || 3296208 markings, 9052494 edges, 8610 markings/sec, 260 secs
lola: sara is running 265 secs || 3338430 markings, 9186912 edges, 8444 markings/sec, 265 secs
lola: sara is running 270 secs || 3385043 markings, 9332450 edges, 9323 markings/sec, 270 secs
lola: sara is running 275 secs || 3449984 markings, 9521365 edges, 12988 markings/sec, 275 secs
lola: sara is running 280 secs || 3501881 markings, 9688159 edges, 10379 markings/sec, 280 secs
lola: sara is running 285 secs || 3564911 markings, 9873995 edges, 12606 markings/sec, 285 secs
lola: sara is running 290 secs || 3622167 markings, 10056447 edges, 11451 markings/sec, 290 secs
lola: sara is running 295 secs || 3685042 markings, 10244472 edges, 12575 markings/sec, 295 secs
lola: sara is running 300 secs || 3749726 markings, 10437812 edges, 12937 markings/sec, 300 secs
lola: sara is running 305 secs || 3801546 markings, 10602992 edges, 10364 markings/sec, 305 secs
lola: sara is running 310 secs || 3862535 markings, 10785937 edges, 12198 markings/sec, 310 secs
lola: sara is running 315 secs || 3925774 markings, 10974970 edges, 12648 markings/sec, 315 secs
lola: sara is running 320 secs || 3976291 markings, 11136318 edges, 10103 markings/sec, 320 secs
lola: sara is running 325 secs || 4036098 markings, 11316351 edges, 11961 markings/sec, 325 secs
lola: sara is running 330 secs || 4095392 markings, 11494059 edges, 11859 markings/sec, 330 secs
lola: sara is running 335 secs || 4160278 markings, 11690580 edges, 12977 markings/sec, 335 secs
lola: sara is running 340 secs || 4211841 markings, 11854507 edges, 10313 markings/sec, 340 secs
lola: sara is running 345 secs || 4274312 markings, 12047049 edges, 12494 markings/sec, 345 secs
lola: sara is running 350 secs || 4312742 markings, 12171814 edges, 7686 markings/sec, 350 secs
lola: sara is running 355 secs || 4350067 markings, 12294194 edges, 7465 markings/sec, 355 secs
lola: sara is running 360 secs || 4391770 markings, 12427644 edges, 8341 markings/sec, 360 secs
lola: sara is running 365 secs || 4436919 markings, 12575041 edges, 9030 markings/sec, 365 secs
lola: sara is running 370 secs || 4476808 markings, 12703776 edges, 7978 markings/sec, 370 secs
lola: sara is running 375 secs || 4526235 markings, 12860910 edges, 9885 markings/sec, 375 secs
lola: sara is running 380 secs || 4589805 markings, 13046916 edges, 12714 markings/sec, 380 secs
lola: sara is running 385 secs || 4639535 markings, 13209711 edges, 9946 markings/sec, 385 secs
lola: sara is running 390 secs || 4707393 markings, 13414385 edges, 13572 markings/sec, 390 secs
lola: sara is running 395 secs || 4757280 markings, 13577953 edges, 9977 markings/sec, 395 secs
lola: sara is running 400 secs || 4823235 markings, 13777466 edges, 13191 markings/sec, 400 secs
lola: sara is running 405 secs || 4874604 markings, 13944943 edges, 10274 markings/sec, 405 secs
lola: sara is running 410 secs || 4937615 markings, 14136848 edges, 12602 markings/sec, 410 secs
lola: sara is running 415 secs || 4993455 markings, 14318270 edges, 11168 markings/sec, 415 secs
lola: sara is running 420 secs || 5053432 markings, 14499727 edges, 11995 markings/sec, 420 secs
lola: sara is running 425 secs || 5115685 markings, 14696468 edges, 12451 markings/sec, 425 secs
lola: sara is running 430 secs || 5170965 markings, 14871257 edges, 11056 markings/sec, 430 secs
lola: sara is running 435 secs || 5233331 markings, 15060431 edges, 12473 markings/sec, 435 secs
lola: sara is running 440 secs || 5285555 markings, 15231010 edges, 10445 markings/sec, 440 secs
lola: sara is running 445 secs || 5343915 markings, 15408212 edges, 11672 markings/sec, 445 secs
lola: sara is running 450 secs || 5408508 markings, 15607722 edges, 12919 markings/sec, 450 secs
lola: sara is running 455 secs || 5458812 markings, 15772460 edges, 10061 markings/sec, 455 secs
lola: sara is running 460 secs || 5515530 markings, 15945089 edges, 11344 markings/sec, 460 secs
lola: sara is running 465 secs || 5565600 markings, 16111633 edges, 10014 markings/sec, 465 secs
lola: sara is running 470 secs || 5602598 markings, 16234400 edges, 7400 markings/sec, 470 secs
lola: sara is running 475 secs || 5641162 markings, 16363104 edges, 7713 markings/sec, 475 secs
lola: sara is running 480 secs || 5679279 markings, 16489324 edges, 7623 markings/sec, 480 secs
lola: sara is running 485 secs || 5729744 markings, 16653933 edges, 10093 markings/sec, 485 secs
lola: sara is running 490 secs || 5768997 markings, 16783131 edges, 7851 markings/sec, 490 secs
lola: sara is running 495 secs || 5809866 markings, 16916104 edges, 8174 markings/sec, 495 secs
lola: sara is running 500 secs || 5860666 markings, 17081124 edges, 10160 markings/sec, 500 secs
lola: sara is running 505 secs || 5928524 markings, 17280196 edges, 13572 markings/sec, 505 secs
lola: sara is running 510 secs || 5974713 markings, 17435522 edges, 9238 markings/sec, 510 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p67)))
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 484 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-V50P20N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2 <= p1) AND (2 <= p124 + p125))))
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 484 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-V50P20N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13.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 14 will run for 1041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1 + 1 <= p72) OR (p0 <= 0)) AND ((p124 + p125 + 1 <= p3 + p4) OR (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 <= 1)))))
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 484 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-V50P20N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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 <= 0) OR (p2 <= 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 484 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 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================lola:
RESULT
lola:
SUMMARY: no unknown no no yes no unknown yes unknown yes no unknown no no no yes
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496342489624
--------------------
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-V50P20N10"
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-V50P20N10.tgz
mv S_BridgeAndVehicles-COL-V50P20N10 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-V50P20N10, 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-149441074300331"
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 '
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 ;