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)
...............
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 32K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470000842
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1527062644801

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-COL-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ PhilosophersDyn-COL-10 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2480/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-10-UpperBounds.task
lola: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) : MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40) : MAX(p150 + p151 + p152 + p153 + p154 + p159 + p158 + p157 + p156 + p155) : MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) : MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) : MAX(p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) : MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) : MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) : MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) : MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40) : MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) : MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 17049 markings, 48508 edges, 3410 markings/sec, 0 secs
lola: 34977 markings, 100319 edges, 3586 markings/sec, 5 secs
lola: 53901 markings, 157042 edges, 3785 markings/sec, 10 secs
lola: 72760 markings, 215474 edges, 3772 markings/sec, 15 secs
lola: 90999 markings, 273802 edges, 3648 markings/sec, 20 secs
lola: 110175 markings, 333632 edges, 3835 markings/sec, 25 secs
lola: 129450 markings, 395565 edges, 3855 markings/sec, 30 secs
lola: 148713 markings, 456224 edges, 3853 markings/sec, 35 secs
lola: 167455 markings, 515957 edges, 3748 markings/sec, 40 secs
lola: 185879 markings, 574132 edges, 3685 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617350 edges
lola: ========================================
check_solution: Constraint R4 = 1e+30 is above its equality of 0
check_solution: Constraint R5 = 1e+30 is above its equality of 0
check_solution: Constraint R6 = 1e+30 is above its equality of 0
check_solution: Constraint R7 = 1e+30 is above its equality of 0
check_solution: Constraint R8 = 1e+30 is above its equality of 0
check_solution: Constraint R9 = 1e+30 is above its equality of 0
check_solution: Constraint R10 = 1e+30 is above its equality of 0
check_solution: Constraint R11 = 1e+30 is above its equality of 0
check_solution: Constraint R12 = 1e+30 is above its equality of 0
check_solution: Constraint R13 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 0.5)

FORMULA PhilosophersDyn-COL-10-UpperBounds-1 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 20345 markings, 57569 edges, 4069 markings/sec, 0 secs
lola: 40595 markings, 120909 edges, 4050 markings/sec, 5 secs
lola: 61538 markings, 186106 edges, 4189 markings/sec, 10 secs
lola: 82965 markings, 251912 edges, 4285 markings/sec, 15 secs
lola: 104436 markings, 318285 edges, 4294 markings/sec, 20 secs
lola: 123777 markings, 377853 edges, 3868 markings/sec, 25 secs
lola: 142680 markings, 437399 edges, 3781 markings/sec, 30 secs
lola: 160644 markings, 493880 edges, 3593 markings/sec, 35 secs
lola: 179843 markings, 555331 edges, 3840 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617350 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-2 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150 + p151 + p152 + p153 + p154 + p159 + p158 + p157 + p156 + p155)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150 + p151 + p152 + p153 + p154 + p159 + p158 + p157 + p156 + p155)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-3 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 18509 markings, 52153 edges, 3702 markings/sec, 0 secs
lola: 37089 markings, 107586 edges, 3716 markings/sec, 5 secs
lola: 55980 markings, 163717 edges, 3778 markings/sec, 10 secs
lola: 74310 markings, 221447 edges, 3666 markings/sec, 15 secs
lola: 93112 markings, 279650 edges, 3760 markings/sec, 20 secs
lola: 111171 markings, 336668 edges, 3612 markings/sec, 25 secs
lola: 129396 markings, 395398 edges, 3645 markings/sec, 30 secs
lola: 148244 markings, 454493 edges, 3770 markings/sec, 35 secs
lola: 166628 markings, 513745 edges, 3677 markings/sec, 40 secs
lola: 183987 markings, 568551 edges, 3472 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617350 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-4 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 20335 markings, 56990 edges, 4067 markings/sec, 0 secs
lola: 40108 markings, 115428 edges, 3955 markings/sec, 5 secs
lola: 60019 markings, 175850 edges, 3982 markings/sec, 10 secs
lola: 80220 markings, 238995 edges, 4040 markings/sec, 15 secs
lola: 100123 markings, 302541 edges, 3981 markings/sec, 20 secs
lola: 119250 markings, 362342 edges, 3825 markings/sec, 25 secs
lola: 138076 markings, 422771 edges, 3765 markings/sec, 30 secs
lola: 157527 markings, 485168 edges, 3890 markings/sec, 35 secs
lola: 176275 markings, 543805 edges, 3750 markings/sec, 40 secs
lola: 194547 markings, 602290 edges, 3654 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617350 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-5 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
========================================
lola: ...considering subproblem: MAX(p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 18763 markings, 52771 edges, 3753 markings/sec, 0 secs
lola: 37896 markings, 109793 edges, 3827 markings/sec, 5 secs
lola: 56931 markings, 167106 edges, 3807 markings/sec, 10 secs
lola: 76100 markings, 226085 edges, 3834 markings/sec, 15 secs
lola: 95185 markings, 287116 edges, 3817 markings/sec, 20 secs
lola: 114430 markings, 347107 edges, 3849 markings/sec, 25 secs
lola: 133462 markings, 408350 edges, 3806 markings/sec, 30 secs
lola: 152033 markings, 466549 edges, 3714 markings/sec, 35 secs
lola: 170141 markings, 525290 edges, 3622 markings/sec, 40 secs
lola: 188445 markings, 582581 edges, 3661 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 617350 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-6 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 20319 markings, 56937 edges, 4064 markings/sec, 0 secs
lola: 40199 markings, 115645 edges, 3976 markings/sec, 5 secs
lola: 59557 markings, 174354 edges, 3872 markings/sec, 10 secs
lola: 78559 markings, 234724 edges, 3800 markings/sec, 15 secs
lola: 97552 markings, 293624 edges, 3799 markings/sec, 20 secs
lola: 116883 markings, 355689 edges, 3866 markings/sec, 25 secs
lola: 136196 markings, 416299 edges, 3863 markings/sec, 30 secs
lola: 155898 markings, 478892 edges, 3940 markings/sec, 35 secs
lola: 175160 markings, 540776 edges, 3852 markings/sec, 40 secs
lola: 194442 markings, 601785 edges, 3856 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617350 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-7 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 52
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 19900 markings, 52536 edges, 3980 markings/sec, 0 secs
lola: 40692 markings, 109974 edges, 4158 markings/sec, 5 secs
lola: 60628 markings, 167713 edges, 3987 markings/sec, 10 secs
lola: 81340 markings, 229034 edges, 4142 markings/sec, 15 secs
lola: 101831 markings, 290793 edges, 4098 markings/sec, 20 secs
lola: 121973 markings, 351833 edges, 4028 markings/sec, 25 secs
lola: 141933 markings, 412451 edges, 3992 markings/sec, 30 secs
lola: 160766 markings, 469432 edges, 3767 markings/sec, 35 secs
lola: 182297 markings, 535061 edges, 4306 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 586281 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-8 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 21347 markings, 60659 edges, 4269 markings/sec, 0 secs
lola: 41425 markings, 123557 edges, 4016 markings/sec, 5 secs
lola: 62074 markings, 187744 edges, 4130 markings/sec, 10 secs
lola: 83885 markings, 255487 edges, 4362 markings/sec, 15 secs
lola: 105613 markings, 321420 edges, 4346 markings/sec, 20 secs
lola: 127525 markings, 388788 edges, 4382 markings/sec, 25 secs
lola: 149014 markings, 457694 edges, 4298 markings/sec, 30 secs
lola: 170511 markings, 526243 edges, 4299 markings/sec, 35 secs
lola: 192305 markings, 594944 edges, 4359 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617350 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-9 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 19661 markings, 55150 edges, 3932 markings/sec, 0 secs
lola: 39145 markings, 112906 edges, 3897 markings/sec, 5 secs
lola: 58247 markings, 170599 edges, 3820 markings/sec, 10 secs
lola: 78115 markings, 233098 edges, 3974 markings/sec, 15 secs
lola: 98119 markings, 295288 edges, 4001 markings/sec, 20 secs
lola: 117557 markings, 357488 edges, 3888 markings/sec, 25 secs
lola: 137361 markings, 420894 edges, 3961 markings/sec, 30 secs
lola: 156826 markings, 481800 edges, 3893 markings/sec, 35 secs
lola: 175806 markings, 542499 edges, 3796 markings/sec, 40 secs
lola: 194899 markings, 604117 edges, 3819 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 617350 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-11 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 19260 markings, 54066 edges, 3852 markings/sec, 0 secs
lola: 40064 markings, 115353 edges, 4161 markings/sec, 5 secs
lola: 60368 markings, 177454 edges, 4061 markings/sec, 10 secs
lola: 80814 markings, 240652 edges, 4089 markings/sec, 15 secs
lola: 100792 markings, 304292 edges, 3996 markings/sec, 20 secs
lola: 121014 markings, 368788 edges, 4044 markings/sec, 25 secs
lola: 140720 markings, 431353 edges, 3941 markings/sec, 30 secs
lola: 160755 markings, 494279 edges, 4007 markings/sec, 35 secs
lola: 179912 markings, 555562 edges, 3831 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 617350 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-12 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 21506 markings, 61306 edges, 4301 markings/sec, 0 secs
lola: 43772 markings, 131128 edges, 4453 markings/sec, 5 secs
lola: 66954 markings, 202934 edges, 4636 markings/sec, 10 secs
lola: 89469 markings, 271830 edges, 4503 markings/sec, 15 secs
lola: 112176 markings, 342062 edges, 4541 markings/sec, 20 secs
lola: 135281 markings, 413493 edges, 4621 markings/sec, 25 secs
lola: 157945 markings, 486421 edges, 4533 markings/sec, 30 secs
lola: 180984 markings, 558601 edges, 4608 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617350 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-13 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 18442 markings, 51922 edges, 3688 markings/sec, 0 secs
lola: 38680 markings, 111707 edges, 4048 markings/sec, 5 secs
lola: 58972 markings, 172614 edges, 4058 markings/sec, 10 secs
lola: 79657 markings, 237480 edges, 4137 markings/sec, 15 secs
lola: 99504 markings, 300968 edges, 3969 markings/sec, 20 secs
lola: 119407 markings, 362865 edges, 3981 markings/sec, 25 secs
lola: 139469 markings, 426659 edges, 4012 markings/sec, 30 secs
lola: 158872 markings, 488836 edges, 3881 markings/sec, 35 secs
lola: 177886 markings, 549243 edges, 3803 markings/sec, 40 secs
lola: 196748 markings, 608966 edges, 3772 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 617350 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-14 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 976 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 21807 markings, 55631 edges, 4361 markings/sec, 30 secs
lola: 42454 markings, 108852 edges, 4129 markings/sec, 35 secs
lola: 60784 markings, 159213 edges, 3666 markings/sec, 40 secs
lola: 78829 markings, 209414 edges, 3609 markings/sec, 45 secs
lola: 96794 markings, 260405 edges, 3593 markings/sec, 50 secs
lola: 115149 markings, 312501 edges, 3671 markings/sec, 55 secs
lola: 132709 markings, 362774 edges, 3512 markings/sec, 60 secs
lola: 151288 markings, 415345 edges, 3716 markings/sec, 65 secs
lola: 171652 markings, 473259 edges, 4073 markings/sec, 70 secs
lola: 190798 markings, 527707 edges, 3829 markings/sec, 75 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 551161 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-15 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 ... (shortened)
lola: processed formula length: 652
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 19884 markings, 50349 edges, 3977 markings/sec, 0 secs
lola: 41314 markings, 105616 edges, 4286 markings/sec, 5 secs
lola: 62428 markings, 163673 edges, 4223 markings/sec, 10 secs
lola: 83108 markings, 221273 edges, 4136 markings/sec, 15 secs
lola: 103057 markings, 277822 edges, 3990 markings/sec, 20 secs
lola: 123326 markings, 335634 edges, 4054 markings/sec, 25 secs
lola: 143004 markings, 391698 edges, 3936 markings/sec, 30 secs
lola: 162216 markings, 446364 edges, 3842 markings/sec, 35 secs
lola: 180658 markings, 498717 edges, 3688 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 551399 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-10 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2797 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 ... (shortened)
lola: processed formula length: 652
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 19622 markings, 49649 edges, 3924 markings/sec, 0 secs
lola: 39928 markings, 102016 edges, 4061 markings/sec, 5 secs
lola: 60191 markings, 157222 edges, 4053 markings/sec, 10 secs
lola: 80919 markings, 214852 edges, 4146 markings/sec, 15 secs
lola: 101131 markings, 272425 edges, 4042 markings/sec, 20 secs
lola: 121545 markings, 330657 edges, 4083 markings/sec, 25 secs
lola: 142249 markings, 389573 edges, 4141 markings/sec, 30 secs
lola: 162639 markings, 447472 edges, 4078 markings/sec, 35 secs
lola: 182609 markings, 504469 edges, 3994 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 551399 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-0 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 4 2 2 10 2 2 4 2 2 2 4 4 4 2 4 4
lola:
preliminary result: 4 2 2 10 2 2 4 2 2 2 4 4 4 2 4 4
lola: memory consumption: 35432 KB
lola: time consumption: 822 seconds

BK_STOP 1527063467116

--------------------
content from 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="PhilosophersDyn-COL-10"
export BK_EXAMINATION="UpperBounds"
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/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PhilosophersDyn-COL-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666470000842"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;