About the Execution of LoLA for S_BridgeAndVehicles-COL-V50P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2643.640 | 1063004.00 | 2127390.00 | 105.00 | 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 S_BridgeAndVehicles-COL-V50P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074300358
=====================================================================
--------------------
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 1496342561513
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-COL-V50P50N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-COL-V50P50N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
ReachabilityCardinality @ S_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 ((p109 <= p126 + p127))) : A (G ((2 <= p108))) : A (G (((p106 + p107 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) OR (2 <= p53)))) : E (F ((3 <= p110))) : A (G ((2 <= p109))) : E (F (((p53 <= 0) AND ((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 <= p124) OR (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) AND ((p126 + p127 <= 2) OR (p109 + 1 <= p53))))) : A (G (((((p125 <= p53) OR (2 <= p54)) AND (p54 <= p109)) OR (p53 <= p126 + p127)))) : E (F (((3 <= p122) AND (p124 + 1 <= p125)))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p54) AND (p108 + 1 <= p53) AND ((p106 + p107 + 1 <= p54) OR (p124 + 1 <= p106 + p107))))) : E (F (((p108 <= 1) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p124)))) : E (F ((((1 <= p122) OR (3 <= p106 + p107)) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))) : E (F (((2 <= p106 + p107) AND ((2 <= p106 + p107) OR (p110 <= p53) OR (p109 <= 1))))) : E (F ((((p124 <= p53) OR (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p106 + p107)) AND (p123 + 1 <= p126 + p127) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))) : A (G ((p126 + p127 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121))) : E (F ((p109 <= p0 + p1))) : E (F ((((p53 <= p110) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 1)) OR ((p108 <= 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 ((p109 <= p126 + 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.sara
lola: state equation: calling and running 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 <= p108)))
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
lola: sara is running 0 secs || 54651 markings, 144777 edges, 10930 markings/sec, 0 secs
lola: sara is running 5 secs || 109528 markings, 295062 edges, 10975 markings/sec, 5 secs
lola: sara is running 10 secs || 164367 markings, 448479 edges, 10968 markings/sec, 10 secs
lola: sara is running 15 secs || 215625 markings, 593886 edges, 10252 markings/sec, 15 secs
lola: sara is running 20 secs || 264040 markings, 732321 edges, 9683 markings/sec, 20 secs
lola: sara is running 25 secs || 309176 markings, 861568 edges, 9027 markings/sec, 25 secs
lola: sara is running 30 secs || 357185 markings, 998753 edges, 9602 markings/sec, 30 secs
lola: sara is running 35 secs || 402813 markings, 1130052 edges, 9126 markings/sec, 35 secs
lola: sara is running 40 secs || 450502 markings, 1267803 edges, 9538 markings/sec, 40 secs
lola: sara is running 45 secs || 494166 markings, 1393470 edges, 8733 markings/sec, 45 secs
lola: sara is running 50 secs || 541717 markings, 1530708 edges, 9510 markings/sec, 50 secs
lola: sara is running 55 secs || 585880 markings, 1658578 edges, 8833 markings/sec, 55 secs
lola: sara is running 60 secs || 633132 markings, 1795580 edges, 9450 markings/sec, 60 secs
lola: sara is running 65 secs || 678843 markings, 1928530 edges, 9142 markings/sec, 65 secs
lola: sara is running 70 secs || 723812 markings, 2057720 edges, 8994 markings/sec, 70 secs
lola: sara is running 75 secs || 769845 markings, 2192545 edges, 9207 markings/sec, 75 secs
lola: sara is running 80 secs || 811974 markings, 2314752 edges, 8426 markings/sec, 80 secs
lola: sara is running 85 secs || 855428 markings, 2440592 edges, 8691 markings/sec, 85 secs
lola: sara is running 90 secs || 896626 markings, 2560946 edges, 8240 markings/sec, 90 secs
lola: sara is running 95 secs || 938551 markings, 2682819 edges, 8385 markings/sec, 95 secs
lola: sara is running 100 secs || 981553 markings, 2807804 edges, 8600 markings/sec, 100 secs
lola: sara is running 105 secs || 1023649 markings, 2931969 edges, 8419 markings/sec, 105 secs
lola: sara is running 110 secs || 1064234 markings, 3049609 edges, 8117 markings/sec, 110 secs
lola: sara is running 115 secs || 1106631 markings, 3172400 edges, 8479 markings/sec, 115 secs
lola: sara is running 120 secs || 1167776 markings, 3352661 edges, 12229 markings/sec, 120 secs
lola: sara is running 125 secs || 1218820 markings, 3500503 edges, 10209 markings/sec, 125 secs
lola: sara is running 130 secs || 1263105 markings, 3628119 edges, 8857 markings/sec, 130 secs
lola: sara is running 135 secs || 1307479 markings, 3760197 edges, 8875 markings/sec, 135 secs
lola: sara is running 140 secs || 1347296 markings, 3875560 edges, 7963 markings/sec, 140 secs
lola: sara is running 145 secs || 1390000 markings, 4001139 edges, 8541 markings/sec, 145 secs
lola: sara is running 150 secs || 1435673 markings, 4133209 edges, 9135 markings/sec, 150 secs
lola: sara is running 155 secs || 1502144 markings, 4335694 edges, 13294 markings/sec, 155 secs
lola: sara is running 160 secs || 1550564 markings, 4476226 edges, 9684 markings/sec, 160 secs
lola: sara is running 165 secs || 1594271 markings, 4601214 edges, 8741 markings/sec, 165 secs
lola: sara is running 170 secs || 1641983 markings, 4743429 edges, 9542 markings/sec, 170 secs
lola: sara is running 175 secs || 1684905 markings, 4868928 edges, 8584 markings/sec, 175 secs
lola: sara is running 180 secs || 1726334 markings, 4990367 edges, 8286 markings/sec, 180 secs
lola: sara is running 185 secs || 1768602 markings, 5114733 edges, 8454 markings/sec, 185 secs
lola: sara is running 190 secs || 1825604 markings, 5280030 edges, 11400 markings/sec, 190 secs
lola: sara is running 195 secs || 1879765 markings, 5442042 edges, 10832 markings/sec, 195 secs
lola: sara is running 200 secs || 1928969 markings, 5586447 edges, 9841 markings/sec, 200 secs
lola: sara is running 205 secs || 1976680 markings, 5724850 edges, 9542 markings/sec, 205 secs
lola: sara is running 210 secs || 2022674 markings, 5861536 edges, 9199 markings/sec, 210 secs
lola: sara is running 215 secs || 2064964 markings, 5985388 edges, 8458 markings/sec, 215 secs
lola: sara is running 220 secs || 2108811 markings, 6114554 edges, 8769 markings/sec, 220 secs
lola: sara is running 225 secs || 2150926 markings, 6239121 edges, 8423 markings/sec, 225 secs
lola: sara is running 230 secs || 2193277 markings, 6357595 edges, 8470 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 (((p106 + p107 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) 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 <= p110)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p109)))
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-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 ((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 <= p124) OR (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + ... (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 <= p54)) AND (p54 <= p109)) OR (p53 <= p126 + p127))))
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.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
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 <= p122) AND (p124 + 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
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7.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: ========================================
lola: ...considering subproblem: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p54) AND (p108 + 1 <= p53) AND ((p106 + p107 + 1 <= p54) OR (p124 + 1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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
sara: warning, failure of lp_solve (at job 95)
lola: sara is running 0 secs || 34165 markings, 88347 edges, 6833 markings/sec, 0 secs
lola: sara is running 5 secs || 70955 markings, 190271 edges, 7358 markings/sec, 5 secs
lola: sara is running 10 secs || 107779 markings, 294466 edges, 7365 markings/sec, 10 secs
lola: sara is running 15 secs || 144647 markings, 399816 edges, 7374 markings/sec, 15 secs
lola: sara is running 20 secs || 183252 markings, 511205 edges, 7721 markings/sec, 20 secs
lola: sara is running 25 secs || 218414 markings, 611952 edges, 7032 markings/sec, 25 secs
lola: sara is running 30 secs || 253661 markings, 713070 edges, 7049 markings/sec, 30 secs
lola: sara is running 35 secs || 286698 markings, 811272 edges, 6607 markings/sec, 35 secs
lola: sara is running 40 secs || 320978 markings, 911362 edges, 6856 markings/sec, 40 secs
lola: sara is running 45 secs || 354992 markings, 1009879 edges, 6803 markings/sec, 45 secs
lola: sara is running 50 secs || 386003 markings, 1102385 edges, 6202 markings/sec, 50 secs
lola: sara is running 55 secs || 420157 markings, 1202927 edges, 6831 markings/sec, 55 secs
lola: sara is running 60 secs || 451333 markings, 1293993 edges, 6235 markings/sec, 60 secs
lola: sara is running 65 secs || 486406 markings, 1397464 edges, 7015 markings/sec, 65 secs
lola: sara is running 70 secs || 520942 markings, 1496777 edges, 6907 markings/sec, 70 secs
lola: sara is running 75 secs || 552841 markings, 1594402 edges, 6380 markings/sec, 75 secs
lola: sara is running 80 secs || 585910 markings, 1691467 edges, 6614 markings/sec, 80 secs
lola: sara is running 85 secs || 622881 markings, 1797732 edges, 7394 markings/sec, 85 secs
lola: sara is running 90 secs || 652588 markings, 1889383 edges, 5941 markings/sec, 90 secs
lola: sara is running 95 secs || 685352 markings, 1988051 edges, 6553 markings/sec, 95 secs
lola: sara is running 100 secs || 719218 markings, 2087166 edges, 6773 markings/sec, 100 secs
lola: sara is running 105 secs || 753209 markings, 2186549 edges, 6798 markings/sec, 105 secs
lola: sara is running 110 secs || 783755 markings, 2280662 edges, 6109 markings/sec, 110 secs
lola: sara is running 115 secs || 816544 markings, 2376887 edges, 6558 markings/sec, 115 secs
lola: sara is running 120 secs || 848759 markings, 2472453 edges, 6443 markings/sec, 120 secs
lola: sara is running 125 secs || 879528 markings, 2564697 edges, 6154 markings/sec, 125 secs
lola: sara is running 130 secs || 912794 markings, 2664335 edges, 6653 markings/sec, 130 secs
lola: sara is running 135 secs || 945152 markings, 2760455 edges, 6472 markings/sec, 135 secs
lola: sara is running 140 secs || 978196 markings, 2858441 edges, 6609 markings/sec, 140 secs
lola: sara is running 145 secs || 1010224 markings, 2954086 edges, 6406 markings/sec, 145 secs
lola: sara is running 150 secs || 1041770 markings, 3049666 edges, 6309 markings/sec, 150 secs
lola: sara is running 155 secs || 1077388 markings, 3154545 edges, 7124 markings/sec, 155 secs
lola: sara is running 160 secs || 1110388 markings, 3253519 edges, 6600 markings/sec, 160 secs
lola: sara is running 165 secs || 1148737 markings, 3366462 edges, 7670 markings/sec, 165 secs
lola: sara is running 170 secs || 1187675 markings, 3485283 edges, 7788 markings/sec, 170 secs
lola: sara is running 175 secs || 1223553 markings, 3593481 edges, 7176 markings/sec, 175 secs
lola: sara is running 180 secs || 1256403 markings, 3696034 edges, 6570 markings/sec, 180 secs
lola: sara is running 185 secs || 1288448 markings, 3796784 edges, 6409 markings/sec, 185 secs
lola: sara is running 190 secs || 1322300 markings, 3893635 edges, 6770 markings/sec, 190 secs
lola: sara is running 195 secs || 1354360 markings, 3987488 edges, 6412 markings/sec, 195 secs
lola: sara is running 200 secs || 1387293 markings, 4082928 edges, 6587 markings/sec, 200 secs
lola: sara is running 205 secs || 1421579 markings, 4182677 edges, 6857 markings/sec, 205 secs
lola: sara is running 210 secs || 1459006 markings, 4293504 edges, 7485 markings/sec, 210 secs
lola: sara is running 215 secs || 1498514 markings, 4417459 edges, 7902 markings/sec, 215 secs
lola: sara is running 220 secs || 1536478 markings, 4533089 edges, 7593 markings/sec, 220 secs
lola: sara is running 225 secs || 1572243 markings, 4645528 edges, 7153 markings/sec, 225 secs
lola: sara is running 230 secs || 1606407 markings, 4753772 edges, 6833 markings/sec, 230 secs
lola: sara is running 235 secs || 1641397 markings, 4859318 edges, 6998 markings/sec, 235 secs
lola: sara is running 240 secs || 1672554 markings, 4948615 edges, 6231 markings/sec, 240 secs
lola: sara is running 245 secs || 1704515 markings, 5042430 edges, 6392 markings/sec, 245 secs
lola: sara is running 250 secs || 1736012 markings, 5133902 edges, 6299 markings/sec, 250 secs
lola: sara is running 255 secs || 1767673 markings, 5225989 edges, 6332 markings/sec, 255 secs
lola: sara is running 260 secs || 1801548 markings, 5326221 edges, 6775 markings/sec, 260 secs
lola: sara is running 265 secs || 1839599 markings, 5445731 edges, 7610 markings/sec, 265 secs
lola: sara is running 270 secs || 1880983 markings, 5571088 edges, 8277 markings/sec, 270 secs
lola: sara is running 275 secs || 1918754 markings, 5686839 edges, 7554 markings/sec, 275 secs
lola: sara is running 280 secs || 1953120 markings, 5794483 edges, 6873 markings/sec, 280 secs
lola: sara is running 285 secs || 1989007 markings, 5908946 edges, 7177 markings/sec, 285 secs
lola: sara is running 290 secs || 2027501 markings, 6023936 edges, 7699 markings/sec, 290 secs
lola: sara is running 295 secs || 2060152 markings, 6118386 edges, 6530 markings/sec, 295 secs
lola: sara is running 300 secs || 2096392 markings, 6223252 edges, 7248 markings/sec, 300 secs
lola: sara is running 305 secs || 2130312 markings, 6321380 edges, 6784 markings/sec, 305 secs
lola: sara is running 310 secs || 2162598 markings, 6415030 edges, 6457 markings/sec, 310 secs
lola: sara is running 315 secs || 2199924 markings, 6525279 edges, 7465 markings/sec, 315 secs
lola: sara is running 320 secs || 2239987 markings, 6650854 edges, 8013 markings/sec, 320 secs
lola: sara is running 325 secs || 2283123 markings, 6782838 edges, 8627 markings/sec, 325 secs
lola: sara is running 330 secs || 2321070 markings, 6898499 edges, 7589 markings/sec, 330 secs
lola: sara is running 335 secs || 2359084 markings, 7015467 edges, 7603 markings/sec, 335 secs
lola: sara is running 340 secs || 2396469 markings, 7130924 edges, 7477 markings/sec, 340 secs
lola: sara is running 345 secs || 2430528 markings, 7240439 edges, 6812 markings/sec, 345 secs
lola: sara is running 350 secs || 2464759 markings, 7338386 edges, 6846 markings/sec, 350 secs
lola: sara is running 355 secs || 2499632 markings, 7439276 edges, 6975 markings/sec, 355 secs
lola: sara is running 360 secs || 2533163 markings, 7535509 edges, 6706 markings/sec, 360 secs
lola: sara is running 365 secs || 2566148 markings, 7631027 edges, 6597 markings/sec, 365 secs
lola: sara is running 370 secs || 2597486 markings, 7720895 edges, 6268 markings/sec, 370 secs
lola: sara is running 375 secs || 2633070 markings, 7825078 edges, 7117 markings/sec, 375 secs
lola: sara is running 380 secs || 2675621 markings, 7956724 edges, 8510 markings/sec, 380 secs
lola: sara is running 385 secs || 2719419 markings, 8092456 edges, 8760 markings/sec, 385 secs
lola: sara is running 390 secs || 2759408 markings, 8213935 edges, 7998 markings/sec, 390 secs
lola: sara is running 395 secs || 2797159 markings, 8328587 edges, 7550 markings/sec, 395 secs
lola: sara is running 400 secs || 2833915 markings, 8441845 edges, 7351 markings/sec, 400 secs
lola: sara is running 405 secs || 2869896 markings, 8554624 edges, 7196 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 (((p108 <= 1) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p124))))
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
lola: sara is running 0 secs || 60935 markings, 145278 edges, 12187 markings/sec, 0 secs
lola: sara is running 5 secs || 117910 markings, 280590 edges, 11395 markings/sec, 5 secs
lola: sara is running 10 secs || 182626 markings, 438971 edges, 12943 markings/sec, 10 secs
lola: sara is running 15 secs || 241292 markings, 580369 edges, 11733 markings/sec, 15 secs
lola: sara is running 20 secs || 293368 markings, 702193 edges, 10415 markings/sec, 20 secs
lola: sara is running 25 secs || 350573 markings, 840031 edges, 11441 markings/sec, 25 secs
lola: sara is running 30 secs || 404619 markings, 967645 edges, 10809 markings/sec, 30 secs
lola: sara is running 35 secs || 457310 markings, 1092198 edges, 10538 markings/sec, 35 secs
lola: sara is running 40 secs || 507395 markings, 1208101 edges, 10017 markings/sec, 40 secs
lola: sara is running 45 secs || 551239 markings, 1316303 edges, 8769 markings/sec, 45 secs
lola: sara is running 50 secs || 598902 markings, 1431917 edges, 9533 markings/sec, 50 secs
lola: sara is running 55 secs || 651784 markings, 1557939 edges, 10576 markings/sec, 55 secs
lola: sara is running 60 secs || 697359 markings, 1664348 edges, 9115 markings/sec, 60 secs
lola: sara is running 65 secs || 745580 markings, 1777708 edges, 9644 markings/sec, 65 secs
lola: sara is running 70 secs || 787858 markings, 1874831 edges, 8456 markings/sec, 70 secs
lola: sara is running 75 secs || 836695 markings, 1991480 edges, 9767 markings/sec, 75 secs
lola: sara is running 80 secs || 880308 markings, 2100790 edges, 8723 markings/sec, 80 secs
lola: sara is running 85 secs || 917675 markings, 2197403 edges, 7473 markings/sec, 85 secs
lola: sara is running 90 secs || 962491 markings, 2306040 edges, 8963 markings/sec, 90 secs
lola: sara is running 95 secs || 1004830 markings, 2403538 edges, 8468 markings/sec, 95 secs
lola: sara is running 100 secs || 1057713 markings, 2530411 edges, 10577 markings/sec, 100 secs
lola: sara is running 105 secs || 1103482 markings, 2641256 edges, 9154 markings/sec, 105 secs
lola: sara is running 110 secs || 1142205 markings, 2728286 edges, 7745 markings/sec, 110 secs
lola: sara is running 115 secs || 1187374 markings, 2832939 edges, 9034 markings/sec, 115 secs
lola: sara is running 120 secs || 1231461 markings, 2938630 edges, 8817 markings/sec, 120 secs
lola: sara is running 125 secs || 1270749 markings, 3033133 edges, 7858 markings/sec, 125 secs
lola: sara is running 130 secs || 1307694 markings, 3135249 edges, 7389 markings/sec, 130 secs
lola: sara is running 135 secs || 1345612 markings, 3240087 edges, 7584 markings/sec, 135 secs
lola: sara is running 140 secs || 1392009 markings, 3358077 edges, 9279 markings/sec, 140 secs
lola: sara is running 145 secs || 1435373 markings, 3460893 edges, 8673 markings/sec, 145 secs
lola: sara is running 150 secs || 1478910 markings, 3562840 edges, 8707 markings/sec, 150 secs
lola: sara is running 155 secs || 1521704 markings, 3662399 edges, 8559 markings/sec, 155 secs
lola: sara is running 160 secs || 1562776 markings, 3758010 edges, 8214 markings/sec, 160 secs
lola: sara is running 165 secs || 1603707 markings, 3852233 edges, 8186 markings/sec, 165 secs
lola: sara is running 170 secs || 1645161 markings, 3947239 edges, 8291 markings/sec, 170 secs
lola: sara is running 175 secs || 1693208 markings, 4063091 edges, 9609 markings/sec, 175 secs
lola: sara is running 180 secs || 1734600 markings, 4164881 edges, 8278 markings/sec, 180 secs
lola: sara is running 185 secs || 1771733 markings, 4267512 edges, 7427 markings/sec, 185 secs
lola: sara is running 190 secs || 1807090 markings, 4366000 edges, 7071 markings/sec, 190 secs
lola: sara is running 195 secs || 1845988 markings, 4476813 edges, 7780 markings/sec, 195 secs
lola: sara is running 200 secs || 1898265 markings, 4616301 edges, 10455 markings/sec, 200 secs
lola: sara is running 205 secs || 1932030 markings, 4692530 edges, 6753 markings/sec, 205 secs
lola: sara is running 210 secs || 1972130 markings, 4789069 edges, 8020 markings/sec, 210 secs
lola: sara is running 215 secs || 2015614 markings, 4895934 edges, 8697 markings/sec, 215 secs
lola: sara is running 220 secs || 2058153 markings, 4999949 edges, 8508 markings/sec, 220 secs
lola: sara is running 225 secs || 2098252 markings, 5093113 edges, 8020 markings/sec, 225 secs
lola: sara is running 230 secs || 2138726 markings, 5185966 edges, 8095 markings/sec, 230 secs
lola: sara is running 235 secs || 2180191 markings, 5283763 edges, 8293 markings/sec, 235 secs
lola: sara is running 240 secs || 2219357 markings, 5376436 edges, 7833 markings/sec, 240 secs
lola: sara is running 245 secs || 2260041 markings, 5475012 edges, 8137 markings/sec, 245 secs
lola: sara is running 250 secs || 2301535 markings, 5577916 edges, 8299 markings/sec, 250 secs
lola: sara is running 255 secs || 2339727 markings, 5682336 edges, 7638 markings/sec, 255 secs
lola: sara is running 260 secs || 2380255 markings, 5806303 edges, 8106 markings/sec, 260 secs
lola: sara is running 265 secs || 2416541 markings, 5907292 edges, 7257 markings/sec, 265 secs
lola: sara is running 270 secs || 2454054 markings, 6016440 edges, 7503 markings/sec, 270 secs
lola: sara is running 275 secs || 2495608 markings, 6131172 edges, 8311 markings/sec, 275 secs
lola: sara is running 280 secs || 2540832 markings, 6250149 edges, 9045 markings/sec, 280 secs
lola: sara is running 285 secs || 2584414 markings, 6353961 edges, 8716 markings/sec, 285 secs
lola: sara is running 290 secs || 2610621 markings, 6408482 edges, 5241 markings/sec, 290 secs
lola: sara is running 295 secs || 2656131 markings, 6525104 edges, 9102 markings/sec, 295 secs
lola: sara is running 300 secs || 2701366 markings, 6638470 edges, 9047 markings/sec, 300 secs
lola: sara is running 305 secs || 2740520 markings, 6722879 edges, 7831 markings/sec, 305 secs
lola: sara is running 310 secs || 2771086 markings, 6793733 edges, 6113 markings/sec, 310 secs
lola: sara is running 315 secs || 2813891 markings, 6901700 edges, 8561 markings/sec, 315 secs
lola: sara is running 320 secs || 2855858 markings, 7006832 edges, 8393 markings/sec, 320 secs
lola: sara is running 325 secs || 2896982 markings, 7108172 edges, 8225 markings/sec, 325 secs
lola: sara is running 330 secs || 2936190 markings, 7199677 edges, 7842 markings/sec, 330 secs
lola: sara is running 335 secs || 2973638 markings, 7286265 edges, 7490 markings/sec, 335 secs
lola: sara is running 340 secs || 3009867 markings, 7385545 edges, 7246 markings/sec, 340 secs
lola: sara is running 345 secs || 3050749 markings, 7512609 edges, 8176 markings/sec, 345 secs
lola: sara is running 350 secs || 3092396 markings, 7640660 edges, 8329 markings/sec, 350 secs
lola: sara is running 355 secs || 3131402 markings, 7751197 edges, 7801 markings/sec, 355 secs
lola: sara is running 360 secs || 3174899 markings, 7884081 edges, 8699 markings/sec, 360 secs
lola: sara is running 365 secs || 3215350 markings, 7999134 edges, 8090 markings/sec, 365 secs
lola: sara is running 370 secs || 3266868 markings, 8136834 edges, 10304 markings/sec, 370 secs
lola: sara is running 375 secs || 3297616 markings, 8212897 edges, 6150 markings/sec, 375 secs
lola: sara is running 380 secs || 3345138 markings, 8336508 edges, 9504 markings/sec, 380 secs
lola: sara is running 385 secs || 3376841 markings, 8399318 edges, 6341 markings/sec, 385 secs
lola: sara is running 390 secs || 3421042 markings, 8517176 edges, 8840 markings/sec, 390 secs
lola: sara is running 395 secs || 3463906 markings, 8618722 edges, 8573 markings/sec, 395 secs
lola: sara is running 400 secs || 3492081 markings, 8682437 edges, 5635 markings/sec, 400 secs
lola: sara is running 405 secs || 3537727 markings, 8803918 edges, 9129 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 <= p122) OR (3 <= p106 + p107)) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))
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 <= p106 + p107) AND ((2 <= p106 + p107) OR (p110 <= p53) OR (p109 <= 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 ((((p124 <= p53) OR (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p106 + p107)) AND (p123 + 1 <= p126 + p127) AND (3 <= p100 + p101 + p102 +... (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: ========================================
lola: subprocess 13 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p126 + p127 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121)))
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-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
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 ((p109 <= p0 + p1)))
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 <= p110) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 1)) OR ((p108 <= 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
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes yes no yes no yes unknown unknown no no no yes yes yes
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 1496343624517
--------------------
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-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/S_BridgeAndVehicles-COL-V50P50N10.tgz
mv S_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 S_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 r088-csrt-149441074300358"
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 ;