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 NeoElection-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484700227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494632428263


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
UpperBounds @ NeoElection-COL-2 @ 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: 813/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 375 transitions, 156 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 249 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-2-UpperBounds.task
lola: MAX(p426 + p427 + p428) : MAX(p408 + p405 + p402 + p399 + p398 + p397 + p396 + p393 + p390 + p387 + p384 + p381 + p380 + p379 + p378 + p375 + p372 + p369 + p366 + p363 + p362 + p361 + p360 + p357 + p354 + p351 + p348 + p345 + p344 + p343 + p342 + p339 + p336 + p333 + p330 + p327 + p326 + p325 + p324 + p321 + p318 + p315 + p312 + p309 + p308 + p307 + p306 + p303 + p300 + p297 + p294 + p291 + p290 + p289 + p288 + p285 + p282 + p279 + p276 + p273 + p272 + p271 + p270 + p267 + p264 + p261 + p258 + p255 + p254 + p253 + p252 + p249 + p250 + p251 + p256 + p257 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p274 + p275 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p292 + p293 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p310 + p311 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p328 + p329 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p346 + p347 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p364 + p365 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p382 + p383 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p400 + p401 + p403 + p404 + p406 + p407 + p409 + p410) : MAX(p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204) : MAX(p431 + p430 + p429) : MAX(p425 + p424 + p423 + p422 + p421 + p420) : MAX(p431 + p430 + p429) : MAX(p418 + p415 + p412 + p411 + p413 + p414 + p416 + p417 + p419) : MAX(p192 + p193 + p194 + p195 + p196 + p197) : MAX(p435 + p436 + p437) : MAX(p198 + p199 + p200) : MAX(p3 + p4 + p5) : MAX(p432 + p433 + p434) : MAX(p83 + p82 + p65 + p64 + p100 + p101 + p47 + p46 + p29 + p28 + p11 + p10 + p118 + p119 + p136 + p137 + p154 + p155 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 + p109 + p108 + p107 + p106 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p105 + p104 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p103 + p102 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p9 + p8 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p7 + p6 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p171 + p172 + p173 + p174 + p175 + p177 + p178 + p179 + p180 + p181 + p183 + p184 + p185 + p186 + p187 + p188 + p182 + p176) : MAX(p408 + p405 + p402 + p399 + p398 + p397 + p396 + p393 + p390 + p387 + p384 + p381 + p380 + p379 + p378 + p375 + p372 + p369 + p366 + p363 + p362 + p361 + p360 + p357 + p354 + p351 + p348 + p345 + p344 + p343 + p342 + p339 + p336 + p333 + p330 + p327 + p326 + p325 + p324 + p321 + p318 + p315 + p312 + p309 + p308 + p307 + p306 + p303 + p300 + p297 + p294 + p291 + p290 + p289 + p288 + p285 + p282 + p279 + p276 + p273 + p272 + p271 + p270 + p267 + p264 + p261 + p258 + p255 + p254 + p253 + p252 + p249 + p250 + p251 + p256 + p257 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p274 + p275 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p292 + p293 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p310 + p311 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p328 + p329 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p346 + p347 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p364 + p365 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p382 + p383 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p400 + p401 + p403 + p404 + p406 + p407 + p409 + p410) : MAX(p418 + p415 + p412 + p411 + p413 + p414 + p416 + p417 + p419)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p426 + p427 + p428)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p408 + p405 + p402 + p399 + p398 + p397 + p396 + p393 + p390 + p387 + p384 + p381 + p380 + p379 + p378 + p375 + p372 + p369 + p366 + p363 + p362 + p361 + p360 + p357 + p354 + p351 + p348 + p345 + p344 + p343 + p342 + p339 + p336 + p333 + p330 + p327 + p326 + p325 + p324 + p321 + p318 + p315 + p312 + p309 + p308 + p307 + p306 + p303 + p300 + p297 + p294 + p291 + p290 + p289 + p288 + p285 + p282... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p431 + p430 + p429)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p425 + p424 + p423 + p422 + p421 + p420)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p431 + p430 + p429)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p418 + p415 + p412 + p411 + p413 + p414 + p416 + p417 + p419)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p192 + p193 + p194 + p195 + p196 + p197)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p435 + p436 + p437)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p198 + p199 + p200)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p3 + p4 + p5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p432 + p433 + p434)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p83 + p82 + p65 + p64 + p100 + p101 + p47 + p46 + p29 + p28 + p11 + p10 + p118 + p119 + p136 + p137 + p154 + p155 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p171 + p172 + p173 + p174 + p175 + p177 + p178 + p179 + p180 + p181 + p183 + p184 + p185 + p186 + p187 + p188 + p182 + p176)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p408 + p405 + p402 + p399 + p398 + p397 + p396 + p393 + p390 + p387 + p384 + p381 + p380 + p379 + p378 + p375 + p372 + p369 + p366 + p363 + p362 + p361 + p360 + p357 + p354 + p351 + p348 + p345 + p344 + p343 + p342 + p339 + p336 + p333 + p330 + p327 + p326 + p325 + p324 + p321 + p318 + p315 + p312 + p309 + p308 + p307 + p306 + p303 + p300 + p297 + p294 + p291 + p290 + p289 + p288 + p285 + p282... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p418 + p415 + p412 + p411 + p413 + p414 + p416 + p417 + p419)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
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: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: RESULT
lola:
SUMMARY: 0 2 2 2 2 2 2 0 2 0 2 0 0 2 2 2
FORMULA NeoElection-COL-2-UpperBounds-0 0 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-1 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-2 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-3 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-4 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-5 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-6 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-7 0 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-8 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-9 0 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-10 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-11 0 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-12 0 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-13 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeoElection-COL-2-UpperBounds-15 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494632428445

--------------------
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="NeoElection-COL-2"
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/NeoElection-COL-2.tgz
mv NeoElection-COL-2 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 NeoElection-COL-2, 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 r038-blw7-149440484700227"
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 ;