Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r121-smll-155272326000004.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
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 r121-smll-155272326000004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.5K Feb 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 1 07:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 1 07:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 32K Mar 10 17:31 model.pnml

--------------------
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 1552848776494

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 @ 3570 seconds
lola: LoLA will run for 3570 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(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) : MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) : MAX(p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20) : MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) : MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) : MAX(p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) : MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) : 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 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p140 + p141 + p142 + p143 + p144 + p145 + p149 + p148 + p147 + p146) : MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) : MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) : MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) : MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
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: 13997 markings, 32491 edges, 2799 markings/sec, 30 secs
lola: 27561 markings, 66146 edges, 2713 markings/sec, 35 secs
lola: 40653 markings, 98478 edges, 2618 markings/sec, 40 secs
lola: 54310 markings, 133130 edges, 2731 markings/sec, 45 secs
lola: 67579 markings, 168429 edges, 2654 markings/sec, 50 secs
lola: 80583 markings, 203283 edges, 2601 markings/sec, 55 secs
lola: 93956 markings, 239520 edges, 2675 markings/sec, 60 secs
lola: 106727 markings, 274574 edges, 2554 markings/sec, 65 secs
lola: 120001 markings, 311232 edges, 2655 markings/sec, 70 secs
lola: 132797 markings, 346906 edges, 2559 markings/sec, 75 secs
lola: 146036 markings, 383283 edges, 2648 markings/sec, 80 secs
lola: 158857 markings, 418681 edges, 2564 markings/sec, 85 secs
lola: 171239 markings, 453148 edges, 2476 markings/sec, 90 secs
lola: 183801 markings, 488047 edges, 2512 markings/sec, 95 secs
lola: 196254 markings, 522442 edges, 2491 markings/sec, 100 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 530250 edges
lola: ========================================
check_solution: Constraint R1 = 6.92807464661e-310 is below its lower bound 1
check_solution: Constraint R157 = 0 is above its equality of -1
check_solution: Constraint R158 = 0 is above its equality of -1
check_solution: Constraint R159 = 0 is above its equality of -1
check_solution: Constraint R160 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R1 = 6.92807464662e-310 is below its lower bound 1
check_solution: Constraint R52 = 2.22809558103e-312 is above its equality of -1
check_solution: Constraint R53 = 2.27053549686e-312 is above its equality of -1
check_solution: Constraint R54 = 2.31297541269e-312 is above its equality of -1
check_solution: Constraint R55 = 2.35541532851e-312 is above its equality of -1
check_solution: Constraint R56 = 2.39785524434e-312 is above its equality of -1
check_solution: Constraint R57 = 2.44029516017e-312 is above its equality of -1
check_solution: Constraint R157 = 3.0556739397e-312 is above its equality of -1
check_solution: Constraint R158 = 3.09811385553e-312 is above its equality of -1
check_solution: Constraint R159 = 3.14055377135e-312 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA PhilosophersDyn-COL-10-UpperBounds-0 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
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: 13494 markings, 31291 edges, 2699 markings/sec, 30 secs
lola: 26899 markings, 64485 edges, 2681 markings/sec, 35 secs
lola: 39960 markings, 96778 edges, 2612 markings/sec, 40 secs
lola: 53574 markings, 131207 edges, 2723 markings/sec, 45 secs
lola: 66837 markings, 166571 edges, 2653 markings/sec, 50 secs
lola: 79819 markings, 201371 edges, 2596 markings/sec, 55 secs
lola: 93237 markings, 237616 edges, 2684 markings/sec, 60 secs
lola: 105990 markings, 272631 edges, 2551 markings/sec, 65 secs
lola: 119258 markings, 309094 edges, 2654 markings/sec, 70 secs
lola: 132046 markings, 344600 edges, 2558 markings/sec, 75 secs
lola: 145285 markings, 381310 edges, 2648 markings/sec, 80 secs
lola: 158122 markings, 416724 edges, 2567 markings/sec, 85 secs
lola: 170459 markings, 451051 edges, 2467 markings/sec, 90 secs
lola: 183063 markings, 486059 edges, 2521 markings/sec, 95 secs
lola: 195699 markings, 520965 edges, 2527 markings/sec, 100 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 530250 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-1 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)
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: 13130 markings, 29898 edges, 2626 markings/sec, 0 secs
lola: 26470 markings, 62848 edges, 2668 markings/sec, 5 secs
lola: 39727 markings, 95467 edges, 2651 markings/sec, 10 secs
lola: 52707 markings, 128727 edges, 2596 markings/sec, 15 secs
lola: 65740 markings, 163352 edges, 2607 markings/sec, 20 secs
lola: 78714 markings, 198216 edges, 2595 markings/sec, 25 secs
lola: 91447 markings, 232646 edges, 2547 markings/sec, 30 secs
lola: 104249 markings, 267611 edges, 2560 markings/sec, 35 secs
lola: 116934 markings, 302275 edges, 2537 markings/sec, 40 secs
lola: 129721 markings, 337266 edges, 2557 markings/sec, 45 secs
lola: 142518 markings, 372495 edges, 2559 markings/sec, 50 secs
lola: 155221 markings, 407725 edges, 2541 markings/sec, 55 secs
lola: 168399 markings, 443849 edges, 2636 markings/sec, 60 secs
lola: 181280 markings, 479536 edges, 2576 markings/sec, 65 secs
lola: 193985 markings, 514902 edges, 2541 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 530250 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-2 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 247 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: Structural Bound: 10
lola: 9498 markings, 21512 edges, 1900 markings/sec, 0 secs
lola: 22564 markings, 53671 edges, 2613 markings/sec, 5 secs
lola: 35798 markings, 86381 edges, 2647 markings/sec, 10 secs
lola: 48824 markings, 118586 edges, 2605 markings/sec, 15 secs
lola: 61638 markings, 152647 edges, 2563 markings/sec, 20 secs
lola: 74641 markings, 187524 edges, 2601 markings/sec, 25 secs
lola: 87392 markings, 221744 edges, 2550 markings/sec, 30 secs
lola: 100315 markings, 257086 edges, 2585 markings/sec, 35 secs
lola: 113080 markings, 292066 edges, 2553 markings/sec, 40 secs
lola: 126002 markings, 327955 edges, 2584 markings/sec, 45 secs
lola: 138947 markings, 363552 edges, 2589 markings/sec, 50 secs
lola: 152169 markings, 399979 edges, 2644 markings/sec, 55 secs
lola: 165241 markings, 436296 edges, 2614 markings/sec, 60 secs
lola: 178288 markings, 472760 edges, 2609 markings/sec, 65 secs
lola: 191233 markings, 508707 edges, 2589 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 530250 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-3 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 261 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: Structural Bound: 10
lola: 9943 markings, 22566 edges, 1989 markings/sec, 0 secs
lola: 22965 markings, 54630 edges, 2604 markings/sec, 5 secs
lola: 36156 markings, 87272 edges, 2638 markings/sec, 10 secs
lola: 49115 markings, 119360 edges, 2592 markings/sec, 15 secs
lola: 61894 markings, 153341 edges, 2556 markings/sec, 20 secs
lola: 74839 markings, 188035 edges, 2589 markings/sec, 25 secs
lola: 87536 markings, 222096 edges, 2539 markings/sec, 30 secs
lola: 100388 markings, 257297 edges, 2570 markings/sec, 35 secs
lola: 113096 markings, 292088 edges, 2542 markings/sec, 40 secs
lola: 125971 markings, 327851 edges, 2575 markings/sec, 45 secs
lola: 138864 markings, 363352 edges, 2579 markings/sec, 50 secs
lola: 152048 markings, 399595 edges, 2637 markings/sec, 55 secs
lola: 165061 markings, 435783 edges, 2603 markings/sec, 60 secs
lola: 178063 markings, 472020 edges, 2600 markings/sec, 65 secs
lola: 190950 markings, 507959 edges, 2577 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 530250 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-4 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)
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: 12993 markings, 29642 edges, 2599 markings/sec, 0 secs
lola: 26256 markings, 62112 edges, 2653 markings/sec, 5 secs
lola: 39431 markings, 94817 edges, 2635 markings/sec, 10 secs
lola: 52360 markings, 127968 edges, 2586 markings/sec, 15 secs
lola: 65348 markings, 162492 edges, 2598 markings/sec, 20 secs
lola: 78268 markings, 197055 edges, 2584 markings/sec, 25 secs
lola: 91042 markings, 231604 edges, 2555 markings/sec, 30 secs
lola: 103980 markings, 266981 edges, 2588 markings/sec, 35 secs
lola: 116768 markings, 301916 edges, 2558 markings/sec, 40 secs
lola: 129676 markings, 337169 edges, 2582 markings/sec, 45 secs
lola: 142562 markings, 372584 edges, 2577 markings/sec, 50 secs
lola: 155372 markings, 408080 edges, 2562 markings/sec, 55 secs
lola: 168660 markings, 444543 edges, 2658 markings/sec, 60 secs
lola: 181641 markings, 480554 edges, 2596 markings/sec, 65 secs
lola: 194423 markings, 516519 edges, 2556 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 530250 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-5 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 298 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: 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: 14101 markings, 38880 edges, 2820 markings/sec, 30 secs
lola: 27786 markings, 79887 edges, 2737 markings/sec, 35 secs
lola: 41236 markings, 118681 edges, 2690 markings/sec, 40 secs
lola: 54988 markings, 160136 edges, 2750 markings/sec, 45 secs
lola: 68580 markings, 202464 edges, 2718 markings/sec, 50 secs
lola: 81772 markings, 243586 edges, 2638 markings/sec, 55 secs
lola: 95249 markings, 287481 edges, 2695 markings/sec, 60 secs
lola: 108357 markings, 328697 edges, 2622 markings/sec, 65 secs
lola: 121735 markings, 370719 edges, 2676 markings/sec, 70 secs
lola: 134773 markings, 411885 edges, 2608 markings/sec, 75 secs
lola: 148040 markings, 453856 edges, 2653 markings/sec, 80 secs
lola: 161117 markings, 495629 edges, 2615 markings/sec, 85 secs
lola: 174146 markings, 538095 edges, 2606 markings/sec, 90 secs
lola: 186949 markings, 578644 edges, 2561 markings/sec, 95 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 7 will run for 319 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: 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: 13904 markings, 38358 edges, 2781 markings/sec, 30 secs
lola: 27502 markings, 79198 edges, 2720 markings/sec, 35 secs
lola: 40117 markings, 115461 edges, 2523 markings/sec, 40 secs
lola: 53668 markings, 156421 edges, 2710 markings/sec, 45 secs
lola: 67264 markings, 198571 edges, 2719 markings/sec, 50 secs
lola: 80439 markings, 239609 edges, 2635 markings/sec, 55 secs
lola: 93895 markings, 281915 edges, 2691 markings/sec, 60 secs
lola: 106965 markings, 323359 edges, 2614 markings/sec, 65 secs
lola: 120208 markings, 366545 edges, 2649 markings/sec, 70 secs
lola: 133201 markings, 407676 edges, 2599 markings/sec, 75 secs
lola: 146427 markings, 449277 edges, 2645 markings/sec, 80 secs
lola: 159470 markings, 490509 edges, 2609 markings/sec, 85 secs
lola: 172585 markings, 531918 edges, 2623 markings/sec, 90 secs
lola: 185386 markings, 572553 edges, 2560 markings/sec, 95 secs
lola: 198114 markings, 613018 edges, 2546 markings/sec, 100 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-7 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
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: 13817 markings, 32094 edges, 2763 markings/sec, 30 secs
lola: 27231 markings, 65316 edges, 2683 markings/sec, 35 secs
lola: 40146 markings, 97216 edges, 2583 markings/sec, 40 secs
lola: 53599 markings, 131257 edges, 2691 markings/sec, 45 secs
lola: 66719 markings, 166255 edges, 2624 markings/sec, 50 secs
lola: 79527 markings, 200577 edges, 2562 markings/sec, 55 secs
lola: 92829 markings, 236490 edges, 2660 markings/sec, 60 secs
lola: 105421 markings, 271125 edges, 2518 markings/sec, 65 secs
lola: 118540 markings, 307119 edges, 2624 markings/sec, 70 secs
lola: 131154 markings, 342197 edges, 2523 markings/sec, 75 secs
lola: 144214 markings, 378102 edges, 2612 markings/sec, 80 secs
lola: 156948 markings, 413297 edges, 2547 markings/sec, 85 secs
lola: 169162 markings, 447285 edges, 2443 markings/sec, 90 secs
lola: 181602 markings, 481820 edges, 2488 markings/sec, 95 secs
lola: 194013 markings, 516162 edges, 2482 markings/sec, 100 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 530250 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-8 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p149 + p148 + p147 + p146)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p149 + p148 + p147 + p146)
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

FORMULA PhilosophersDyn-COL-10-UpperBounds-10 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 443 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: Structural Bound: 10
lola: 9821 markings, 22319 edges, 1964 markings/sec, 0 secs
lola: 22316 markings, 53063 edges, 2499 markings/sec, 5 secs
lola: 35520 markings, 85700 edges, 2641 markings/sec, 10 secs
lola: 48538 markings, 117802 edges, 2604 markings/sec, 15 secs
lola: 61304 markings, 151808 edges, 2553 markings/sec, 20 secs
lola: 74265 markings, 186540 edges, 2592 markings/sec, 25 secs
lola: 86972 markings, 220641 edges, 2541 markings/sec, 30 secs
lola: 99871 markings, 255904 edges, 2580 markings/sec, 35 secs
lola: 112540 markings, 290633 edges, 2534 markings/sec, 40 secs
lola: 125416 markings, 326369 edges, 2575 markings/sec, 45 secs
lola: 138312 markings, 361904 edges, 2579 markings/sec, 50 secs
lola: 151528 markings, 398285 edges, 2643 markings/sec, 55 secs
lola: 164536 markings, 434355 edges, 2602 markings/sec, 60 secs
lola: 177563 markings, 470591 edges, 2605 markings/sec, 65 secs
lola: 190446 markings, 506381 edges, 2577 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 530250 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-UpperBounds-11 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 517 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: Structural Bound: 10
lola: 9934 markings, 22541 edges, 1987 markings/sec, 0 secs
lola: 22953 markings, 54594 edges, 2604 markings/sec, 5 secs
lola: 36126 markings, 87175 edges, 2635 markings/sec, 10 secs
lola: 49086 markings, 119285 edges, 2592 markings/sec, 15 secs
lola: 61858 markings, 153232 edges, 2554 markings/sec, 20 secs
lola: 74787 markings, 187914 edges, 2586 markings/sec, 25 secs
lola: 87485 markings, 221977 edges, 2540 markings/sec, 30 secs
lola: 99534 markings, 255057 edges, 2410 markings/sec, 35 secs
lola: 111440 markings, 287450 edges, 2381 markings/sec, 40 secs
lola: 124327 markings, 323265 edges, 2577 markings/sec, 45 secs
lola: 137148 markings, 358771 edges, 2564 markings/sec, 50 secs
lola: 150414 markings, 395340 edges, 2653 markings/sec, 55 secs
lola: 163419 markings, 431335 edges, 2601 markings/sec, 60 secs
lola: 176451 markings, 467501 edges, 2606 markings/sec, 65 secs
lola: 189352 markings, 503267 edges, 2580 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 530250 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-12 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
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: 13970 markings, 32448 edges, 2794 markings/sec, 30 secs
lola: 27505 markings, 65988 edges, 2707 markings/sec, 35 secs
lola: 40563 markings, 98220 edges, 2612 markings/sec, 40 secs
lola: 54173 markings, 132741 edges, 2722 markings/sec, 45 secs
lola: 67418 markings, 167983 edges, 2649 markings/sec, 50 secs
lola: 80401 markings, 202809 edges, 2597 markings/sec, 55 secs
lola: 93746 markings, 238962 edges, 2669 markings/sec, 60 secs
lola: 106480 markings, 273929 edges, 2547 markings/sec, 65 secs
lola: 119721 markings, 310395 edges, 2648 markings/sec, 70 secs
lola: 132483 markings, 345867 edges, 2552 markings/sec, 75 secs
lola: 145709 markings, 382443 edges, 2645 markings/sec, 80 secs
lola: 158501 markings, 417717 edges, 2558 markings/sec, 85 secs
lola: 170855 markings, 452115 edges, 2471 markings/sec, 90 secs
lola: 183449 markings, 487100 edges, 2519 markings/sec, 95 secs
lola: 196105 markings, 522045 edges, 2531 markings/sec, 100 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 530250 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-13 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
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: 13932 markings, 32335 edges, 2786 markings/sec, 30 secs
lola: 27437 markings, 65811 edges, 2701 markings/sec, 35 secs
lola: 40463 markings, 97990 edges, 2605 markings/sec, 40 secs
lola: 54045 markings, 132418 edges, 2716 markings/sec, 45 secs
lola: 67250 markings, 167602 edges, 2641 markings/sec, 50 secs
lola: 80209 markings, 202340 edges, 2592 markings/sec, 55 secs
lola: 93545 markings, 238412 edges, 2667 markings/sec, 60 secs
lola: 106251 markings, 273306 edges, 2541 markings/sec, 65 secs
lola: 119491 markings, 309754 edges, 2648 markings/sec, 70 secs
lola: 132251 markings, 345201 edges, 2552 markings/sec, 75 secs
lola: 145468 markings, 381772 edges, 2643 markings/sec, 80 secs
lola: 158246 markings, 417047 edges, 2556 markings/sec, 85 secs
lola: 170604 markings, 451460 edges, 2472 markings/sec, 90 secs
lola: 183208 markings, 486450 edges, 2521 markings/sec, 95 secs
lola: 195865 markings, 521443 edges, 2531 markings/sec, 100 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 530250 edges

FORMULA PhilosophersDyn-COL-10-UpperBounds-14 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1147 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: 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: 14062 markings, 38789 edges, 2812 markings/sec, 30 secs
lola: 27731 markings, 79757 edges, 2734 markings/sec, 35 secs
lola: 41154 markings, 118383 edges, 2685 markings/sec, 40 secs
lola: 54873 markings, 159820 edges, 2744 markings/sec, 45 secs
lola: 68433 markings, 201996 edges, 2712 markings/sec, 50 secs
lola: 81613 markings, 243069 edges, 2636 markings/sec, 55 secs
lola: 95058 markings, 286492 edges, 2689 markings/sec, 60 secs
lola: 108123 markings, 328157 edges, 2613 markings/sec, 65 secs
lola: 121494 markings, 370062 edges, 2674 markings/sec, 70 secs
lola: 134490 markings, 411108 edges, 2599 markings/sec, 75 secs
lola: 147723 markings, 452894 edges, 2647 markings/sec, 80 secs
lola: 160764 markings, 494309 edges, 2608 markings/sec, 85 secs
lola: 173789 markings, 536296 edges, 2605 markings/sec, 90 secs
lola: 186539 markings, 577364 edges, 2550 markings/sec, 95 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-15 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2189 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 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p6... (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 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p6... (shortened)
lola: processed formula length: 642
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: 13867 markings, 32194 edges, 2773 markings/sec, 30 secs
lola: 27357 markings, 65622 edges, 2698 markings/sec, 35 secs
lola: 40346 markings, 97735 edges, 2598 markings/sec, 40 secs
lola: 53854 markings, 131903 edges, 2702 markings/sec, 45 secs
lola: 67011 markings, 166997 edges, 2631 markings/sec, 50 secs
lola: 79898 markings, 201551 edges, 2577 markings/sec, 55 secs
lola: 93158 markings, 237395 edges, 2652 markings/sec, 60 secs
lola: 105764 markings, 272024 edges, 2521 markings/sec, 65 secs
lola: 118878 markings, 308030 edges, 2623 markings/sec, 70 secs
lola: 131569 markings, 343303 edges, 2538 markings/sec, 75 secs
lola: 144661 markings, 379341 edges, 2618 markings/sec, 80 secs
lola: 157393 markings, 414596 edges, 2546 markings/sec, 85 secs
lola: 169656 markings, 448706 edges, 2453 markings/sec, 90 secs
lola: 182177 markings, 483482 edges, 2504 markings/sec, 95 secs
lola: 194652 markings, 517993 edges, 2495 markings/sec, 100 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 199051 markings, 530250 edges
lola: ========================================

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

BK_STOP 1552850265514

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory

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="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
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 r121-smll-155272326000004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
if [ "UpperBounds" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "UpperBounds" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;