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 GlobalResAllocation-COL-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264300439
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494702369348


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ GlobalResAllocation-COL-05 @ 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: 56180/65536 symbol table entries, 38797 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 56105 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2220 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: A (G (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14) OR (p70 + p71 + p72 + p73 + p74 <= 1) OR (p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p70 + p71 + p72 + p73 + p74)))) : E (F (((p70 + p71 + p72 + p73 + p74 <= 2) AND (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 2) AND ((2 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) AND ((p70 + p71 + p72 + p73 + p74 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p70 + p71 + p72 + p73 + p74))))) : A (G (((2 <= p15 + p16 + p17 + p18 + p19) OR (p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)))) : A (G (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p70 + p71 + p72 + p73 + p74) OR (p0 + p1 + p2 + p3 + p4 <= 2) OR (p0 + p1 + p2 + p3 + p4 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR (1 <= p0 + p1 + p2 + p3 + p4)))) : A (G (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= 2) OR ((2 <= p0 + p1 + p2 + p3 + p4) AND (3 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14) AND (p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))))) : A (G (((p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 0) OR (3 <= p0 + p1 + p2 + p3 + p4)))) : A (G ((((2 <= p15 + p16 + p17 + p18 + p19) AND (1 <= p0 + p1 + p2 + p3 + p4)) OR ((3 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p0 + p1 + p2 + p3 + p4)) OR (2 <= p0 + p1 + p2 + p3 + p4) OR (p0 + p1 + p2 + p3 + p4 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 2)))) : A (G ((1 <= p0 + p1 + p2 + p3 + p4))) : A (G (((p70 + p71 + p72 + p73 + p74 <= 2) OR (p15 + p16 + p17 + p18 + p19 <= 2) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 0)))) : A (G ((2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))) : A (G ((2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))) : E (F (())) : E (F (((p70 + p71 + p72 + p73 + p74 + 1 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) AND (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19) AND ((p15 + p16 + p17 + p18 + p19 + 1 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR ((3 <= p15 + p16 + p17 + p18 + p19) AND (p0 + p1 + p2 + p3 + p4 <= p70 + p71 + p72 + p73 + p74)))))) : A (G (TRUE)) : E (F (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 2) AND ((1 <= p15 + p16 + p17 + p18 + p19) OR (3 <= p70 + p71 + p72 + p73 + p74)) AND (3 <= p15 + p16 + p17 + p18 + p19)))) : A (G (()))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14) OR (p70 + p71 + p72 + p73 + p74 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p70 + p71 + p72 + p73 + p74 <= 2) AND (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 2) AND ((2 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) AND ((p70 + p71 + p72 + p73 + p74 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p70 + p71 + p72 + p73 + p74)))))
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 220 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 255 markings, 357 edges, 51 markings/sec, 0 secs
lola: sara is running 5 secs || 878 markings, 1169 edges, 125 markings/sec, 5 secs
lola: sara is running 10 secs || 1506 markings, 1970 edges, 126 markings/sec, 10 secs
lola: sara is running 15 secs || 2193 markings, 2860 edges, 137 markings/sec, 15 secs
lola: sara is running 20 secs || 2843 markings, 3698 edges, 130 markings/sec, 20 secs
lola: sara is running 25 secs || 3471 markings, 4507 edges, 126 markings/sec, 25 secs
lola: sara is running 30 secs || 4122 markings, 5369 edges, 130 markings/sec, 30 secs
lola: sara is running 35 secs || 4772 markings, 6244 edges, 130 markings/sec, 35 secs
lola: sara is running 40 secs || 5436 markings, 7117 edges, 133 markings/sec, 40 secs
lola: sara is running 45 secs || 6071 markings, 7963 edges, 127 markings/sec, 45 secs
lola: sara is running 50 secs || 6555 markings, 8616 edges, 97 markings/sec, 50 secs
lola: sara is running 55 secs || 6929 markings, 9147 edges, 75 markings/sec, 55 secs
lola: sara is running 60 secs || 7556 markings, 9956 edges, 125 markings/sec, 60 secs
lola: sara is running 65 secs || 8123 markings, 10754 edges, 113 markings/sec, 65 secs
lola: sara is running 70 secs || 8684 markings, 11511 edges, 112 markings/sec, 70 secs
lola: sara is running 75 secs || 9350 markings, 12404 edges, 133 markings/sec, 75 secs
lola: sara is running 80 secs || 9988 markings, 13227 edges, 128 markings/sec, 80 secs
lola: sara is running 85 secs || 10615 markings, 14115 edges, 125 markings/sec, 85 secs
lola: sara is running 90 secs || 11280 markings, 14981 edges, 133 markings/sec, 90 secs
lola: sara is running 95 secs || 11946 markings, 15883 edges, 133 markings/sec, 95 secs
lola: sara is running 100 secs || 12563 markings, 16731 edges, 123 markings/sec, 100 secs
lola: sara is running 105 secs || 13249 markings, 17651 edges, 137 markings/sec, 105 secs
lola: sara is running 110 secs || 13908 markings, 18520 edges, 132 markings/sec, 110 secs
lola: sara is running 115 secs || 14583 markings, 19476 edges, 135 markings/sec, 115 secs
lola: sara is running 120 secs || 15187 markings, 20275 edges, 121 markings/sec, 120 secs
lola: sara is running 125 secs || 15927 markings, 21299 edges, 148 markings/sec, 125 secs
lola: sara is running 130 secs || 16559 markings, 22178 edges, 126 markings/sec, 130 secs
lola: sara is running 135 secs || 17233 markings, 23108 edges, 135 markings/sec, 135 secs
lola: sara is running 140 secs || 17740 markings, 23878 edges, 101 markings/sec, 140 secs
lola: sara is running 145 secs || 18449 markings, 24855 edges, 142 markings/sec, 145 secs
lola: sara is running 150 secs || 19164 markings, 25851 edges, 143 markings/sec, 150 secs
lola: sara is running 155 secs || 19905 markings, 26835 edges, 148 markings/sec, 155 secs
lola: sara is running 160 secs || 20555 markings, 27743 edges, 130 markings/sec, 160 secs
lola: sara is running 165 secs || 21237 markings, 28698 edges, 136 markings/sec, 165 secs
lola: sara is running 170 secs || 21875 markings, 29580 edges, 128 markings/sec, 170 secs
lola: sara is running 175 secs || 22548 markings, 30484 edges, 135 markings/sec, 175 secs
lola: sara is running 180 secs || 23259 markings, 31449 edges, 142 markings/sec, 180 secs
lola: sara is running 185 secs || 24016 markings, 32522 edges, 151 markings/sec, 185 secs
lola: sara is running 190 secs || 24753 markings, 33534 edges, 147 markings/sec, 190 secs
lola: sara is running 195 secs || 25476 markings, 34553 edges, 145 markings/sec, 195 secs
lola: sara is running 200 secs || 26182 markings, 35581 edges, 141 markings/sec, 200 secs
lola: sara is running 205 secs || 26828 markings, 36528 edges, 129 markings/sec, 205 secs
lola: sara is running 210 secs || 27537 markings, 37474 edges, 142 markings/sec, 210 secs
lola: sara is running 215 secs || 28212 markings, 38409 edges, 135 markings/sec, 215 secs
lola: sara is running 220 secs || 28918 markings, 39356 edges, 141 markings/sec, 220 secs
lola: sara is running 225 secs || 29637 markings, 40462 edges, 144 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p15 + p16 + p17 + p18 + p19) OR (p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 59 markings, 69 edges, 12 markings/sec, 0 secs
lola: sara is running 5 secs || 228 markings, 336 edges, 34 markings/sec, 5 secs
lola: sara is running 10 secs || 508 markings, 818 edges, 56 markings/sec, 10 secs
lola: sara is running 15 secs || 788 markings, 1298 edges, 56 markings/sec, 15 secs
lola: sara is running 20 secs || 1091 markings, 1865 edges, 61 markings/sec, 20 secs
lola: sara is running 25 secs || 1399 markings, 2401 edges, 62 markings/sec, 25 secs
lola: sara is running 30 secs || 1748 markings, 3057 edges, 70 markings/sec, 30 secs
lola: sara is running 35 secs || 2126 markings, 3758 edges, 76 markings/sec, 35 secs
lola: sara is running 40 secs || 2560 markings, 4567 edges, 87 markings/sec, 40 secs
lola: sara is running 45 secs || 2934 markings, 5334 edges, 75 markings/sec, 45 secs
lola: sara is running 50 secs || 3345 markings, 6167 edges, 82 markings/sec, 50 secs
lola: sara is running 55 secs || 3720 markings, 6911 edges, 75 markings/sec, 55 secs
lola: sara is running 60 secs || 4123 markings, 7639 edges, 81 markings/sec, 60 secs
lola: sara is running 65 secs || 4499 markings, 8446 edges, 75 markings/sec, 65 secs
lola: sara is running 70 secs || 4943 markings, 9301 edges, 89 markings/sec, 70 secs
lola: sara is running 75 secs || 5404 markings, 10183 edges, 92 markings/sec, 75 secs
lola: sara is running 80 secs || 5824 markings, 11084 edges, 84 markings/sec, 80 secs
lola: sara is running 85 secs || 6214 markings, 11832 edges, 78 markings/sec, 85 secs
lola: sara is running 90 secs || 6689 markings, 12796 edges, 95 markings/sec, 90 secs
lola: sara is running 95 secs || 7145 markings, 13659 edges, 91 markings/sec, 95 secs
lola: sara is running 100 secs || 7539 markings, 14251 edges, 79 markings/sec, 100 secs
lola: sara is running 105 secs || 7993 markings, 15164 edges, 91 markings/sec, 105 secs
lola: sara is running 110 secs || 8457 markings, 16078 edges, 93 markings/sec, 110 secs
lola: sara is running 115 secs || 8932 markings, 16923 edges, 95 markings/sec, 115 secs
lola: sara is running 120 secs || 9411 markings, 17963 edges, 96 markings/sec, 120 secs
lola: sara is running 125 secs || 9814 markings, 18668 edges, 81 markings/sec, 125 secs
lola: sara is running 130 secs || 10277 markings, 19580 edges, 93 markings/sec, 130 secs
lola: sara is running 135 secs || 10750 markings, 20559 edges, 95 markings/sec, 135 secs
lola: sara is running 140 secs || 11199 markings, 21561 edges, 90 markings/sec, 140 secs
lola: sara is running 145 secs || 11695 markings, 22586 edges, 99 markings/sec, 145 secs
lola: sara is running 150 secs || 12158 markings, 23651 edges, 93 markings/sec, 150 secs
lola: sara is running 155 secs || 12610 markings, 24545 edges, 90 markings/sec, 155 secs
lola: sara is running 160 secs || 13100 markings, 25567 edges, 98 markings/sec, 160 secs
lola: sara is running 165 secs || 13579 markings, 26556 edges, 96 markings/sec, 165 secs
lola: sara is running 170 secs || 13981 markings, 27456 edges, 80 markings/sec, 170 secs
lola: sara is running 175 secs || 14416 markings, 28395 edges, 87 markings/sec, 175 secs
lola: sara is running 180 secs || 14883 markings, 29306 edges, 93 markings/sec, 180 secs
lola: sara is running 185 secs || 15346 markings, 30216 edges, 93 markings/sec, 185 secs
lola: sara is running 190 secs || 15798 markings, 31186 edges, 90 markings/sec, 190 secs
lola: sara is running 195 secs || 16330 markings, 32250 edges, 106 markings/sec, 195 secs
lola: sara is running 200 secs || 16829 markings, 33316 edges, 100 markings/sec, 200 secs
lola: sara is running 205 secs || 17323 markings, 34349 edges, 99 markings/sec, 205 secs
lola: sara is running 210 secs || 17818 markings, 35304 edges, 99 markings/sec, 210 secs
lola: sara is running 215 secs || 18279 markings, 36258 edges, 92 markings/sec, 215 secs
lola: sara is running 220 secs || 18779 markings, 37298 edges, 100 markings/sec, 220 secs
lola: sara is running 225 secs || 19221 markings, 38258 edges, 88 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p70 + p71 + p72 + p73 + p74) OR (p0 + p1 + p2 + p3 + p4 <= 2) OR (p0 + p1 + p2 + p3 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 415 markings, 534 edges, 83 markings/sec, 0 secs
lola: sara is running 5 secs || 1130 markings, 1527 edges, 143 markings/sec, 5 secs
lola: sara is running 10 secs || 1831 markings, 2433 edges, 140 markings/sec, 10 secs
lola: sara is running 15 secs || 2539 markings, 3376 edges, 142 markings/sec, 15 secs
lola: sara is running 20 secs || 3253 markings, 4316 edges, 143 markings/sec, 20 secs
lola: sara is running 25 secs || 3986 markings, 5284 edges, 147 markings/sec, 25 secs
lola: sara is running 30 secs || 4701 markings, 6233 edges, 143 markings/sec, 30 secs
lola: sara is running 35 secs || 5423 markings, 7192 edges, 144 markings/sec, 35 secs
lola: sara is running 40 secs || 6144 markings, 8150 edges, 144 markings/sec, 40 secs
lola: sara is running 45 secs || 6871 markings, 9109 edges, 145 markings/sec, 45 secs
lola: sara is running 50 secs || 7594 markings, 10066 edges, 145 markings/sec, 50 secs
lola: sara is running 55 secs || 8313 markings, 11000 edges, 144 markings/sec, 55 secs
lola: sara is running 60 secs || 9045 markings, 11949 edges, 146 markings/sec, 60 secs
lola: sara is running 65 secs || 9792 markings, 12948 edges, 149 markings/sec, 65 secs
lola: sara is running 70 secs || 10502 markings, 13880 edges, 142 markings/sec, 70 secs
lola: sara is running 75 secs || 11225 markings, 14852 edges, 145 markings/sec, 75 secs
lola: sara is running 80 secs || 11951 markings, 15899 edges, 145 markings/sec, 80 secs
lola: sara is running 85 secs || 12683 markings, 16879 edges, 146 markings/sec, 85 secs
lola: sara is running 90 secs || 13402 markings, 17824 edges, 144 markings/sec, 90 secs
lola: sara is running 95 secs || 14134 markings, 18829 edges, 146 markings/sec, 95 secs
lola: sara is running 100 secs || 14866 markings, 19804 edges, 146 markings/sec, 100 secs
lola: sara is running 105 secs || 15634 markings, 20862 edges, 154 markings/sec, 105 secs
lola: sara is running 110 secs || 16365 markings, 21819 edges, 146 markings/sec, 110 secs
lola: sara is running 115 secs || 17094 markings, 22806 edges, 146 markings/sec, 115 secs
lola: sara is running 120 secs || 17815 markings, 23752 edges, 144 markings/sec, 120 secs
lola: sara is running 125 secs || 18549 markings, 24729 edges, 147 markings/sec, 125 secs
lola: sara is running 130 secs || 19267 markings, 25665 edges, 144 markings/sec, 130 secs
lola: sara is running 135 secs || 19988 markings, 26630 edges, 144 markings/sec, 135 secs
lola: sara is running 140 secs || 20709 markings, 27621 edges, 144 markings/sec, 140 secs
lola: sara is running 145 secs || 21440 markings, 28614 edges, 146 markings/sec, 145 secs
lola: sara is running 150 secs || 22171 markings, 29604 edges, 146 markings/sec, 150 secs
lola: sara is running 155 secs || 22902 markings, 30650 edges, 146 markings/sec, 155 secs
lola: sara is running 160 secs || 23623 markings, 31615 edges, 144 markings/sec, 160 secs
lola: sara is running 165 secs || 24338 markings, 32556 edges, 143 markings/sec, 165 secs
lola: sara is running 170 secs || 25062 markings, 33601 edges, 145 markings/sec, 170 secs
lola: sara is running 175 secs || 25791 markings, 34620 edges, 146 markings/sec, 175 secs
lola: sara is running 180 secs || 26539 markings, 35629 edges, 150 markings/sec, 180 secs
lola: sara is running 185 secs || 27258 markings, 36613 edges, 144 markings/sec, 185 secs
lola: sara is running 190 secs || 27987 markings, 37636 edges, 146 markings/sec, 190 secs
lola: sara is running 195 secs || 28721 markings, 38643 edges, 147 markings/sec, 195 secs
lola: sara is running 200 secs || 29451 markings, 39660 edges, 146 markings/sec, 200 secs
lola: sara is running 205 secs || 30203 markings, 40697 edges, 150 markings/sec, 205 secs
lola: sara is running 210 secs || 30927 markings, 41700 edges, 145 markings/sec, 210 secs
lola: sara is running 215 secs || 31660 markings, 42684 edges, 147 markings/sec, 215 secs
lola: sara is running 220 secs || 32367 markings, 43643 edges, 141 markings/sec, 220 secs
lola: sara is running 225 secs || 33119 markings, 44748 edges, 150 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= 2) OR ((2 <= p0 + p1 + p2 + p3 + p4) AND (3 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-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 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 0) OR (3 <= p0 + p1 + p2 + p3 + p4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p15 + p16 + p17 + p18 + p19) AND (1 <= p0 + p1 + p2 + p3 + p4)) OR ((3 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p0 + p1 + p2 + p3 + p4)) OR (2 <= p0 + p1 + p2 + p3 + p4) OR (p0 + p1 + p2 + p3 + p4 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-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 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p0 + p1 + p2 + p3 + p4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p70 + p71 + p72 + p73 + p74 <= 2) OR (p15 + p16 + p17 + p18 + p19 <= 2) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 0))))
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 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 563 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 704 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p70 + p71 + p72 + p73 + p74 + 1 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) AND (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 ... (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 220 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 939 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= 2) AND ((1 <= p15 + p16 + p17 + p18 + p19) OR (3 <= p70 + p71 + p72 + p73 + p74)) AND (3 <= p15 + p16 + p17 + p18 + p19))))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-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 2816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
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 220 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: no unknown unknown unknown no no no no no no no no yes yes yes yes
lola: ========================================
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494703094014

--------------------
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="GlobalResAllocation-COL-05"
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/GlobalResAllocation-COL-05.tgz
mv GlobalResAllocation-COL-05 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 GlobalResAllocation-COL-05, 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 r028-blw3-149440264300439"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;