About the Execution of LoLA for BridgeAndVehicles-COL-V50P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2138.990 | 1063432.00 | 2129396.00 | 85.10 | T?FFFTTTTTFTFT?? | 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 BridgeAndVehicles-COL-V50P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126200358
=====================================================================
--------------------
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-V50P50N10-ReachabilityCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494607911549
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V50P50N10 @ 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-V50P50N10-ReachabilityCardinality.task
lola: E (F ((p126 <= p51 + p52))) : A (G ((2 <= p123))) : A (G (((p119 + p120 <= 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) OR (2 <= p53)))) : E (F ((3 <= p127))) : A (G ((2 <= p126))) : E (F (((p53 <= 0) AND ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p54) OR (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)) AND ((p51 + p52 <= 2) OR (p126 + 1 <= p53))))) : A (G (((((p125 <= p53) OR (2 <= p118)) AND (p118 <= p126)) OR (p53 <= p51 + p52)))) : E (F (((3 <= p55) AND (p54 + 1 <= p125)))) : 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 + 1 <= p118) AND (p123 + 1 <= p53) AND ((p119 + p120 + 1 <= p118) OR (p54 + 1 <= p119 + p120))))) : E (F (((p123 <= 1) AND (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 + 1 <= p54)))) : E (F ((((1 <= p55) OR (3 <= p119 + p120)) AND (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)))) : E (F (((2 <= p119 + p120) AND ((2 <= p119 + p120) OR (p127 <= p53) OR (p126 <= 1))))) : E (F ((((p54 <= p53) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p98 + p97 + p96 + p95 + p94 + p93 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p119 + p120)) AND (p124 + 1 <= p51 + p52) AND (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)))) : A (G ((p51 + p52 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))) : E (F ((p126 <= p121 + p122))) : E (F ((((p53 <= p127) AND (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 <= 1)) OR ((p123 <= 2) AND (p125 <= 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 ((p126 <= p51 + p52)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p123)))
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-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1)
lola: sara is running 0 secs || 54909 markings, 143391 edges, 10982 markings/sec, 0 secs
lola: sara is running 5 secs || 105052 markings, 281836 edges, 10029 markings/sec, 5 secs
lola: sara is running 10 secs || 159456 markings, 432652 edges, 10881 markings/sec, 10 secs
lola: sara is running 15 secs || 208950 markings, 570997 edges, 9899 markings/sec, 15 secs
lola: sara is running 20 secs || 258865 markings, 710091 edges, 9983 markings/sec, 20 secs
lola: sara is running 25 secs || 307092 markings, 849612 edges, 9645 markings/sec, 25 secs
lola: sara is running 30 secs || 357143 markings, 991303 edges, 10010 markings/sec, 30 secs
lola: sara is running 35 secs || 405427 markings, 1129374 edges, 9657 markings/sec, 35 secs
lola: sara is running 40 secs || 454609 markings, 1272331 edges, 9836 markings/sec, 40 secs
lola: sara is running 45 secs || 503379 markings, 1409439 edges, 9754 markings/sec, 45 secs
lola: sara is running 50 secs || 552064 markings, 1553135 edges, 9737 markings/sec, 50 secs
lola: sara is running 55 secs || 601731 markings, 1691329 edges, 9933 markings/sec, 55 secs
lola: sara is running 60 secs || 653925 markings, 1844715 edges, 10439 markings/sec, 60 secs
lola: sara is running 65 secs || 709636 markings, 2000592 edges, 11142 markings/sec, 65 secs
lola: sara is running 70 secs || 763716 markings, 2159439 edges, 10816 markings/sec, 70 secs
lola: sara is running 75 secs || 819240 markings, 2311963 edges, 11105 markings/sec, 75 secs
lola: sara is running 80 secs || 872938 markings, 2468156 edges, 10740 markings/sec, 80 secs
lola: sara is running 85 secs || 927304 markings, 2621175 edges, 10873 markings/sec, 85 secs
lola: sara is running 90 secs || 982410 markings, 2781112 edges, 11021 markings/sec, 90 secs
lola: sara is running 95 secs || 1034810 markings, 2929896 edges, 10480 markings/sec, 95 secs
lola: sara is running 100 secs || 1087416 markings, 3080450 edges, 10521 markings/sec, 100 secs
lola: sara is running 105 secs || 1135076 markings, 3217565 edges, 9532 markings/sec, 105 secs
lola: sara is running 110 secs || 1180018 markings, 3345491 edges, 8988 markings/sec, 110 secs
lola: sara is running 115 secs || 1225274 markings, 3473439 edges, 9051 markings/sec, 115 secs
lola: sara is running 120 secs || 1272043 markings, 3608781 edges, 9354 markings/sec, 120 secs
lola: sara is running 125 secs || 1320257 markings, 3748995 edges, 9643 markings/sec, 125 secs
lola: sara is running 130 secs || 1368012 markings, 3884894 edges, 9551 markings/sec, 130 secs
lola: sara is running 135 secs || 1417292 markings, 4029437 edges, 9856 markings/sec, 135 secs
lola: sara is running 140 secs || 1464256 markings, 4161603 edges, 9393 markings/sec, 140 secs
lola: sara is running 145 secs || 1515673 markings, 4304971 edges, 10283 markings/sec, 145 secs
lola: sara is running 150 secs || 1563386 markings, 4440407 edges, 9543 markings/sec, 150 secs
lola: sara is running 155 secs || 1611359 markings, 4578276 edges, 9595 markings/sec, 155 secs
lola: sara is running 160 secs || 1655691 markings, 4709013 edges, 8866 markings/sec, 160 secs
lola: sara is running 165 secs || 1698472 markings, 4833228 edges, 8556 markings/sec, 165 secs
lola: sara is running 170 secs || 1743200 markings, 4964168 edges, 8946 markings/sec, 170 secs
lola: sara is running 175 secs || 1784718 markings, 5082934 edges, 8304 markings/sec, 175 secs
lola: sara is running 180 secs || 1826895 markings, 5203483 edges, 8435 markings/sec, 180 secs
lola: sara is running 185 secs || 1869186 markings, 5323241 edges, 8458 markings/sec, 185 secs
lola: sara is running 190 secs || 1914739 markings, 5453138 edges, 9111 markings/sec, 190 secs
lola: sara is running 195 secs || 1961887 markings, 5587966 edges, 9430 markings/sec, 195 secs
lola: sara is running 200 secs || 2006282 markings, 5718726 edges, 8879 markings/sec, 200 secs
lola: sara is running 205 secs || 2046347 markings, 5835178 edges, 8013 markings/sec, 205 secs
lola: sara is running 210 secs || 2093716 markings, 5974237 edges, 9474 markings/sec, 210 secs
lola: sara is running 215 secs || 2141496 markings, 6113640 edges, 9556 markings/sec, 215 secs
lola: sara is running 220 secs || 2184609 markings, 6237978 edges, 8623 markings/sec, 220 secs
lola: sara is running 225 secs || 2229998 markings, 6368623 edges, 9078 markings/sec, 225 secs
lola: sara is running 230 secs || 2277350 markings, 6503232 edges, 9470 markings/sec, 230 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 (((p119 + p120 <= 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) OR (2 <= p53))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2.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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p127)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p126)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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-V50P50N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p53 <= 0) AND ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p54) OR (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)... (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 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p125 <= p53) OR (2 <= p118)) AND (p118 <= p126)) OR (p53 <= p51 + p52))))
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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p55) AND (p54 + 1 <= 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-V50P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 8 will run for 412 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 + 1 <= p118) AND (p123 + 1 <= p53) AND ((p119 + p120 + 1 <= p118) OR (p54 + 1 <= p119 + p120)))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 52475 markings, 131093 edges, 10495 markings/sec, 0 secs
lola: sara is running 5 secs || 103107 markings, 268766 edges, 10126 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 428)
lola: sara is running 10 secs || 149353 markings, 395085 edges, 9249 markings/sec, 10 secs
lola: sara is running 15 secs || 196724 markings, 523481 edges, 9474 markings/sec, 15 secs
lola: sara is running 20 secs || 243166 markings, 655818 edges, 9288 markings/sec, 20 secs
lola: sara is running 25 secs || 294677 markings, 799582 edges, 10302 markings/sec, 25 secs
lola: sara is running 30 secs || 344663 markings, 938722 edges, 9997 markings/sec, 30 secs
lola: sara is running 35 secs || 394158 markings, 1080508 edges, 9899 markings/sec, 35 secs
lola: sara is running 40 secs || 444117 markings, 1218701 edges, 9992 markings/sec, 40 secs
lola: sara is running 45 secs || 493486 markings, 1362776 edges, 9874 markings/sec, 45 secs
lola: sara is running 50 secs || 543812 markings, 1500872 edges, 10065 markings/sec, 50 secs
lola: sara is running 55 secs || 593047 markings, 1644224 edges, 9847 markings/sec, 55 secs
lola: sara is running 60 secs || 640444 markings, 1772226 edges, 9479 markings/sec, 60 secs
lola: sara is running 65 secs || 686360 markings, 1904810 edges, 9183 markings/sec, 65 secs
lola: sara is running 70 secs || 732713 markings, 2032147 edges, 9271 markings/sec, 70 secs
lola: sara is running 75 secs || 782801 markings, 2175627 edges, 10018 markings/sec, 75 secs
lola: sara is running 80 secs || 830622 markings, 2314276 edges, 9564 markings/sec, 80 secs
lola: sara is running 85 secs || 883747 markings, 2458013 edges, 10625 markings/sec, 85 secs
lola: sara is running 90 secs || 933432 markings, 2602321 edges, 9937 markings/sec, 90 secs
lola: sara is running 95 secs || 983945 markings, 2740917 edges, 10103 markings/sec, 95 secs
lola: sara is running 100 secs || 1032623 markings, 2879856 edges, 9736 markings/sec, 100 secs
lola: sara is running 105 secs || 1082030 markings, 3022777 edges, 9881 markings/sec, 105 secs
lola: sara is running 110 secs || 1126875 markings, 3151209 edges, 8969 markings/sec, 110 secs
lola: sara is running 115 secs || 1168830 markings, 3263635 edges, 8391 markings/sec, 115 secs
lola: sara is running 120 secs || 1209999 markings, 3377403 edges, 8234 markings/sec, 120 secs
lola: sara is running 125 secs || 1247002 markings, 3477225 edges, 7401 markings/sec, 125 secs
lola: sara is running 130 secs || 1289203 markings, 3595703 edges, 8440 markings/sec, 130 secs
lola: sara is running 135 secs || 1341293 markings, 3750816 edges, 10418 markings/sec, 135 secs
lola: sara is running 140 secs || 1393180 markings, 3905895 edges, 10377 markings/sec, 140 secs
lola: sara is running 145 secs || 1441511 markings, 4046500 edges, 9666 markings/sec, 145 secs
lola: sara is running 150 secs || 1485858 markings, 4165587 edges, 8869 markings/sec, 150 secs
lola: sara is running 155 secs || 1526236 markings, 4278936 edges, 8076 markings/sec, 155 secs
lola: sara is running 160 secs || 1563537 markings, 4381957 edges, 7460 markings/sec, 160 secs
lola: sara is running 165 secs || 1601871 markings, 4487195 edges, 7667 markings/sec, 165 secs
lola: sara is running 170 secs || 1649124 markings, 4624368 edges, 9451 markings/sec, 170 secs
lola: sara is running 175 secs || 1700165 markings, 4778308 edges, 10208 markings/sec, 175 secs
lola: sara is running 180 secs || 1751487 markings, 4932417 edges, 10264 markings/sec, 180 secs
lola: sara is running 185 secs || 1799668 markings, 5073654 edges, 9636 markings/sec, 185 secs
lola: sara is running 190 secs || 1840117 markings, 5184162 edges, 8090 markings/sec, 190 secs
lola: sara is running 195 secs || 1880906 markings, 5298447 edges, 8158 markings/sec, 195 secs
lola: sara is running 200 secs || 1918596 markings, 5403830 edges, 7538 markings/sec, 200 secs
lola: sara is running 205 secs || 1956678 markings, 5509282 edges, 7616 markings/sec, 205 secs
lola: sara is running 210 secs || 1994928 markings, 5613871 edges, 7650 markings/sec, 210 secs
lola: sara is running 215 secs || 2045985 markings, 5766975 edges, 10211 markings/sec, 215 secs
lola: sara is running 220 secs || 2097394 markings, 5921532 edges, 10282 markings/sec, 220 secs
lola: sara is running 225 secs || 2148331 markings, 6075018 edges, 10187 markings/sec, 225 secs
lola: sara is running 230 secs || 2195981 markings, 6215801 edges, 9530 markings/sec, 230 secs
lola: sara is running 235 secs || 2236752 markings, 6328732 edges, 8154 markings/sec, 235 secs
lola: sara is running 240 secs || 2278297 markings, 6444146 edges, 8309 markings/sec, 240 secs
lola: sara is running 245 secs || 2315183 markings, 6548229 edges, 7377 markings/sec, 245 secs
lola: sara is running 250 secs || 2353015 markings, 6654121 edges, 7566 markings/sec, 250 secs
lola: sara is running 255 secs || 2391456 markings, 6760802 edges, 7688 markings/sec, 255 secs
lola: sara is running 260 secs || 2429051 markings, 6862783 edges, 7519 markings/sec, 260 secs
lola: sara is running 265 secs || 2475191 markings, 7004215 edges, 9228 markings/sec, 265 secs
lola: sara is running 270 secs || 2525315 markings, 7155390 edges, 10025 markings/sec, 270 secs
lola: sara is running 275 secs || 2570966 markings, 7293659 edges, 9130 markings/sec, 275 secs
lola: sara is running 280 secs || 2615793 markings, 7429391 edges, 8965 markings/sec, 280 secs
lola: sara is running 285 secs || 2655682 markings, 7543781 edges, 7978 markings/sec, 285 secs
lola: sara is running 290 secs || 2695175 markings, 7652135 edges, 7899 markings/sec, 290 secs
lola: sara is running 295 secs || 2735957 markings, 7766149 edges, 8156 markings/sec, 295 secs
lola: sara is running 300 secs || 2774876 markings, 7876543 edges, 7784 markings/sec, 300 secs
lola: sara is running 305 secs || 2812799 markings, 7983439 edges, 7585 markings/sec, 305 secs
lola: sara is running 310 secs || 2850865 markings, 8089228 edges, 7613 markings/sec, 310 secs
lola: sara is running 315 secs || 2886611 markings, 8187765 edges, 7149 markings/sec, 315 secs
lola: sara is running 320 secs || 2935226 markings, 8330134 edges, 9723 markings/sec, 320 secs
lola: sara is running 325 secs || 2982985 markings, 8477105 edges, 9552 markings/sec, 325 secs
lola: sara is running 330 secs || 3032733 markings, 8628061 edges, 9950 markings/sec, 330 secs
lola: sara is running 335 secs || 3082115 markings, 8778382 edges, 9876 markings/sec, 335 secs
lola: sara is running 340 secs || 3125295 markings, 8905487 edges, 8636 markings/sec, 340 secs
lola: sara is running 345 secs || 3164568 markings, 9016550 edges, 7855 markings/sec, 345 secs
lola: sara is running 350 secs || 3204169 markings, 9124658 edges, 7920 markings/sec, 350 secs
lola: sara is running 355 secs || 3239035 markings, 9223126 edges, 6973 markings/sec, 355 secs
lola: sara is running 360 secs || 3273989 markings, 9322634 edges, 6991 markings/sec, 360 secs
lola: sara is running 365 secs || 3309780 markings, 9424080 edges, 7158 markings/sec, 365 secs
lola: sara is running 370 secs || 3343225 markings, 9517380 edges, 6689 markings/sec, 370 secs
lola: sara is running 375 secs || 3378481 markings, 9614008 edges, 7051 markings/sec, 375 secs
lola: sara is running 380 secs || 3418853 markings, 9727141 edges, 8074 markings/sec, 380 secs
lola: sara is running 385 secs || 3466555 markings, 9874251 edges, 9540 markings/sec, 385 secs
lola: sara is running 390 secs || 3515992 markings, 10023143 edges, 9887 markings/sec, 390 secs
lola: sara is running 395 secs || 3564465 markings, 10171084 edges, 9695 markings/sec, 395 secs
lola: sara is running 400 secs || 3613424 markings, 10321269 edges, 9792 markings/sec, 400 secs
lola: sara is running 405 secs || 3659203 markings, 10456150 edges, 9156 markings/sec, 405 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 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p123 <= 1) AND (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 + 1 <= p54))))
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-V50P50N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 6)
lola: sara is running 0 secs || 91808 markings, 227777 edges, 18362 markings/sec, 0 secs
lola: sara is running 5 secs || 183805 markings, 466166 edges, 18399 markings/sec, 5 secs
lola: sara is running 10 secs || 269621 markings, 687476 edges, 17163 markings/sec, 10 secs
lola: sara is running 15 secs || 348518 markings, 896891 edges, 15779 markings/sec, 15 secs
lola: sara is running 20 secs || 423101 markings, 1103753 edges, 14917 markings/sec, 20 secs
lola: sara is running 25 secs || 502086 markings, 1324708 edges, 15797 markings/sec, 25 secs
lola: sara is running 30 secs || 577286 markings, 1533864 edges, 15040 markings/sec, 30 secs
lola: sara is running 35 secs || 648769 markings, 1727038 edges, 14297 markings/sec, 35 secs
lola: sara is running 40 secs || 722512 markings, 1925409 edges, 14749 markings/sec, 40 secs
lola: sara is running 45 secs || 795314 markings, 2122864 edges, 14560 markings/sec, 45 secs
lola: sara is running 50 secs || 878439 markings, 2364721 edges, 16625 markings/sec, 50 secs
lola: sara is running 55 secs || 955832 markings, 2584032 edges, 15479 markings/sec, 55 secs
lola: sara is running 60 secs || 1036047 markings, 2815126 edges, 16043 markings/sec, 60 secs
lola: sara is running 65 secs || 1114322 markings, 3040276 edges, 15655 markings/sec, 65 secs
lola: sara is running 70 secs || 1177278 markings, 3205775 edges, 12591 markings/sec, 70 secs
lola: sara is running 75 secs || 1240452 markings, 3370268 edges, 12635 markings/sec, 75 secs
lola: sara is running 80 secs || 1311779 markings, 3574512 edges, 14265 markings/sec, 80 secs
lola: sara is running 85 secs || 1370889 markings, 3735057 edges, 11822 markings/sec, 85 secs
lola: sara is running 90 secs || 1447077 markings, 3956653 edges, 15238 markings/sec, 90 secs
lola: sara is running 95 secs || 1523312 markings, 4180813 edges, 15247 markings/sec, 95 secs
lola: sara is running 100 secs || 1603316 markings, 4412700 edges, 16001 markings/sec, 100 secs
lola: sara is running 105 secs || 1678580 markings, 4634997 edges, 15053 markings/sec, 105 secs
lola: sara is running 110 secs || 1756645 markings, 4861621 edges, 15613 markings/sec, 110 secs
lola: sara is running 115 secs || 1824916 markings, 5049383 edges, 13654 markings/sec, 115 secs
lola: sara is running 120 secs || 1880562 markings, 5193479 edges, 11129 markings/sec, 120 secs
lola: sara is running 125 secs || 1946234 markings, 5367099 edges, 13134 markings/sec, 125 secs
lola: sara is running 130 secs || 2022349 markings, 5594040 edges, 15223 markings/sec, 130 secs
lola: sara is running 135 secs || 2075493 markings, 5728622 edges, 10629 markings/sec, 135 secs
lola: sara is running 140 secs || 2141277 markings, 5919557 edges, 13157 markings/sec, 140 secs
lola: sara is running 145 secs || 2218037 markings, 6146272 edges, 15352 markings/sec, 145 secs
lola: sara is running 150 secs || 2294106 markings, 6369861 edges, 15214 markings/sec, 150 secs
lola: sara is running 155 secs || 2369328 markings, 6593645 edges, 15044 markings/sec, 155 secs
lola: sara is running 160 secs || 2448180 markings, 6827821 edges, 15770 markings/sec, 160 secs
lola: sara is running 165 secs || 2523154 markings, 7046489 edges, 14995 markings/sec, 165 secs
lola: sara is running 170 secs || 2597355 markings, 7266273 edges, 14840 markings/sec, 170 secs
lola: sara is running 175 secs || 2661697 markings, 7440751 edges, 12868 markings/sec, 175 secs
lola: sara is running 180 secs || 2714457 markings, 7580179 edges, 10552 markings/sec, 180 secs
lola: sara is running 185 secs || 2769264 markings, 7721576 edges, 10961 markings/sec, 185 secs
lola: sara is running 190 secs || 2832892 markings, 7893866 edges, 12726 markings/sec, 190 secs
lola: sara is running 195 secs || 2908293 markings, 8122769 edges, 15080 markings/sec, 195 secs
lola: sara is running 200 secs || 2964141 markings, 8265189 edges, 11170 markings/sec, 200 secs
lola: sara is running 205 secs || 3012397 markings, 8394998 edges, 9651 markings/sec, 205 secs
lola: sara is running 210 secs || 3081733 markings, 8598965 edges, 13867 markings/sec, 210 secs
lola: sara is running 215 secs || 3157987 markings, 8826708 edges, 15251 markings/sec, 215 secs
lola: sara is running 220 secs || 3234474 markings, 9052661 edges, 15297 markings/sec, 220 secs
lola: sara is running 225 secs || 3311365 markings, 9285172 edges, 15378 markings/sec, 225 secs
lola: sara is running 230 secs || 3383116 markings, 9497698 edges, 14350 markings/sec, 230 secs
lola: sara is running 235 secs || 3453947 markings, 9708345 edges, 14166 markings/sec, 235 secs
lola: sara is running 240 secs || 3524279 markings, 9917895 edges, 14066 markings/sec, 240 secs
lola: sara is running 245 secs || 3599764 markings, 10144497 edges, 15097 markings/sec, 245 secs
lola: sara is running 250 secs || 3668466 markings, 10331694 edges, 13740 markings/sec, 250 secs
lola: sara is running 255 secs || 3718525 markings, 10468236 edges, 10012 markings/sec, 255 secs
lola: sara is running 260 secs || 3773644 markings, 10609337 edges, 11024 markings/sec, 260 secs
lola: sara is running 265 secs || 3826208 markings, 10749828 edges, 10513 markings/sec, 265 secs
lola: sara is running 270 secs || 3888071 markings, 10915821 edges, 12373 markings/sec, 270 secs
lola: sara is running 275 secs || 3951137 markings, 11100253 edges, 12613 markings/sec, 275 secs
lola: sara is running 280 secs || 4022590 markings, 11300199 edges, 14291 markings/sec, 280 secs
lola: sara is running 285 secs || 4068659 markings, 11424107 edges, 9214 markings/sec, 285 secs
lola: sara is running 290 secs || 4112883 markings, 11546099 edges, 8845 markings/sec, 290 secs
lola: sara is running 295 secs || 4166441 markings, 11692847 edges, 10712 markings/sec, 295 secs
lola: sara is running 300 secs || 4237376 markings, 11909145 edges, 14187 markings/sec, 300 secs
lola: sara is running 305 secs || 4313668 markings, 12137372 edges, 15258 markings/sec, 305 secs
lola: sara is running 310 secs || 4389858 markings, 12365421 edges, 15238 markings/sec, 310 secs
lola: sara is running 315 secs || 4467714 markings, 12597171 edges, 15571 markings/sec, 315 secs
lola: sara is running 320 secs || 4546188 markings, 12830262 edges, 15695 markings/sec, 320 secs
lola: sara is running 325 secs || 4624020 markings, 13069053 edges, 15566 markings/sec, 325 secs
lola: sara is running 330 secs || 4699150 markings, 13293990 edges, 15026 markings/sec, 330 secs
lola: sara is running 335 secs || 4775618 markings, 13522927 edges, 15294 markings/sec, 335 secs
lola: sara is running 340 secs || 4851512 markings, 13750162 edges, 15179 markings/sec, 340 secs
lola: sara is running 345 secs || 4906016 markings, 13888653 edges, 10901 markings/sec, 345 secs
lola: sara is running 350 secs || 4954328 markings, 14022378 edges, 9662 markings/sec, 350 secs
lola: sara is running 355 secs || 5007069 markings, 14162170 edges, 10548 markings/sec, 355 secs
lola: sara is running 360 secs || 5056613 markings, 14290409 edges, 9909 markings/sec, 360 secs
lola: sara is running 365 secs || 5110121 markings, 14430540 edges, 10702 markings/sec, 365 secs
lola: sara is running 370 secs || 5170932 markings, 14598517 edges, 12162 markings/sec, 370 secs
lola: sara is running 375 secs || 5231711 markings, 14773022 edges, 12156 markings/sec, 375 secs
lola: sara is running 380 secs || 5311920 markings, 15015007 edges, 16042 markings/sec, 380 secs
lola: sara is running 385 secs || 5360155 markings, 15131049 edges, 9647 markings/sec, 385 secs
lola: sara is running 390 secs || 5406633 markings, 15260796 edges, 9296 markings/sec, 390 secs
lola: sara is running 395 secs || 5454475 markings, 15393127 edges, 9568 markings/sec, 395 secs
lola: sara is running 400 secs || 5505480 markings, 15529854 edges, 10201 markings/sec, 400 secs
lola: sara is running 405 secs || 5576289 markings, 15745288 edges, 14162 markings/sec, 405 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p55) OR (3 <= p119 + p120)) AND (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))))
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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.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 11 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p119 + p120) AND ((2 <= p119 + p120) OR (p127 <= p53) OR (p126 <= 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 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-V50P50N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-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 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p54 <= p53) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p98 + p97 + p96 + p95 + p94 + p93 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p119 + p120)) AND (p124 + 1 <= p51 + p52) AND (3 ... (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 6 literals and 2 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-V50P50N10-ReachabilityCardinality-12.sara
lola: subprocess 13 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p51 + p52 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)))
lola: lola: ========================================
========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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)
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13.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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p126 <= p121 + p122)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2477 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p53 <= p127) AND (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 <= 1)) OR ((p123 <= 2) AND (p125 <= 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: yes unknown yes yes no yes no yes unknown unknown no no no yes yes yes
lola: ========================================
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494608974981
--------------------
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-V50P50N10"
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-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 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-V50P50N10, 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-149436126200358"
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 ;