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 240K
-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.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K 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.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeoElection-COL-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200243
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1527023334556

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-COL-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating NeoElection-COL-2 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ NeoElection-COL-2 @ 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: 813/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 438
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-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 + p246 + p247 + p248 + p249 + p250 + p251 + p245 + p244 + p243 + p242 + p241 + p240 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p111 + p110 + p109 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p90 + p91 + p92 + p93 + p100 + p96 + p97 + p98 + p99 <= p47 + p46 + p45)
lola: after: (p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 <= p47 + p46 + p45)
lola: LP says that atomic proposition is always true: (p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 <= p47 + p46 + p45)
lola: place invariant simplifies atomic proposition
lola: before: (p432 + p433 + p434 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5)
lola: after: (0 <= 2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p81 + p82 + p83 <= p424 + p421 + p418 + p417 + p419 + p420 + p422 + p423 + p425)
lola: after: (0 <= 2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p81 + p82 + p83)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 <= p47 + p46 + p45)
lola: after: (2 <= p47 + p46 + p45)
lola: place invariant simplifies atomic proposition
lola: before: (p86 + p85 + p84 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5)
lola: after: (p86 + p85 + p84 <= 2)
lola: LP says that atomic proposition is always true: (p86 + p85 + p84 <= 2)
lola: LP says that atomic proposition is always false: (3 <= p47 + p46 + p45)
lola: place invariant simplifies atomic proposition
lola: before: (p424 + p421 + p418 + p417 + p419 + p420 + p422 + p423 + p425 <= p81 + p82 + p83)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p43 + p42 + p40 + p39 + p37 + p36 + p34 + p33 + p31 + p30 + p28 + p27 + p25 + p24 + p22 + p21 + p19 + p18 + p20 + p23 + p26 + p29 + p32 + p35 + p38 + p41 + p44)
lola: after: (0 <= 1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 + p253 + p254 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p271 + p272 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p289 + p290 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p307 + p308 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p325 + p326 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p343 + p344 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p361 + p362 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p379 + p380 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p397 + p398 + p403 + p404 + p406 + p407 + p409 + p410 + p412 + p413 <= p416 + p415 + p414)
lola: after: (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 <= p416 + p415 + p414)
lola: place invariant simplifies atomic proposition
lola: before: (p78 + p79 + p80 <= p431 + p430 + p429 + p428 + p427 + p426)
lola: after: (0 <= p431 + p430 + p429 + p428 + p427 + p426)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 + p246 + p247 + p248 + p249 + p250 + p251 + p245 + p244 + p243 + p242 + p241 + p240 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p111 + p110 + p109 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p90 + p91 + p92 + p93 + p100 + p96 + p97 + p98 + p99 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: after: (p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 <= 2)
lola: LP says that atomic proposition is always true: (p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 + p246 + p247 + p248 + p249 + p250 + p251 + p245 + p244 + p243 + p242 + p241 + p240 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p111 + p110 + p109 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p90 + p91 + p92 + p93 + p100 + p96 + p97 + p98 + p99)
lola: after: (2 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239)
lola: LP says that atomic proposition is always false: (2 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239)
lola: LP says that atomic proposition is always false: (1 <= p77 + p76 + p75 + p74 + p73 + p72)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 + p253 + p254 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p271 + p272 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p289 + p290 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p307 + p308 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p325 + p326 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p343 + p344 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p361 + p362 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p379 + p380 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p397 + p398 + p403 + p404 + p406 + p407 + p409 + p410 + p412 + p413)
lola: after: (1 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252)
lola: place invariant simplifies atomic proposition
lola: before: (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 + p253 + p254 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p271 + p272 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p289 + p290 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p307 + p308 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p325 + p326 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p343 + p344 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p361 + p362 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p379 + p380 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p397 + p398 + p403 + p404 + p406 + p407 + p409 + p410 + p412 + p413 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5)
lola: after: (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 <= 2)
lola: LP says that atomic proposition is always true: (p77 + p76 + p75 + p74 + p73 + p72 <= p86 + p85 + p84)
lola: place invariant simplifies atomic proposition
lola: before: (p43 + p42 + p40 + p39 + p37 + p36 + p34 + p33 + p31 + p30 + p28 + p27 + p25 + p24 + p22 + p21 + p19 + p18 + p20 + p23 + p26 + p29 + p32 + p35 + p38 + p41 + p44 <= p87 + p88 + p89)
lola: after: (4 <= p87 + p88 + p89)
lola: LP says that atomic proposition is always false: (4 <= p87 + p88 + p89)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p424 + p421 + p418 + p417 + p419 + p420 + p422 + p423 + p425)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p78 + p79 + p80 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: after: (0 <= 2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p43 + p42 + p40 + p39 + p37 + p36 + p34 + p33 + p31 + p30 + p28 + p27 + p25 + p24 + p22 + p21 + p19 + p18 + p20 + p23 + p26 + p29 + p32 + p35 + p38 + p41 + p44)
lola: after: (0 <= 2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 + p246 + p247 + p248 + p249 + p250 + p251 + p245 + p244 + p243 + p242 + p241 + p240 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p111 + p110 + p109 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p90 + p91 + p92 + p93 + p100 + p96 + p97 + p98 + p99)
lola: after: (3 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239)
lola: LP says that atomic proposition is always false: (3 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p432 + p433 + p434)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p53 + p52 + p51 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 + p253 + p254 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p271 + p272 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p289 + p290 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p307 + p308 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p325 + p326 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p343 + p344 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p361 + p362 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p379 + p380 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p397 + p398 + p403 + p404 + p406 + p407 + p409 + p410 + p412 + p413)
lola: after: (p53 + p52 + p51 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252)
lola: place invariant simplifies atomic proposition
lola: before: (p424 + p421 + p418 + p417 + p419 + p420 + p422 + p423 + p425 <= p53 + p52 + p51)
lola: after: (2 <= p53 + p52 + p51)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p424 + p421 + p418 + p417 + p419 + p420 + p422 + p423 + p425)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p432 + p433 + p434 <= p50 + p49 + p48)
lola: after: (0 <= p50 + p49 + p48)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p87 + p88 + p89)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p424 + p421 + p418 + p417 + p419 + p420 + p422 + p423 + p425)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 + p253 + p254 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p271 + p272 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p289 + p290 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p307 + p308 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p325 + p326 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p343 + p344 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p361 + p362 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p379 + p380 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p397 + p398 + p403 + p404 + p406 + p407 + p409 + p410 + p412 + p413 <= p437 + p436 + p435)
lola: after: (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 <= p437 + p436 + p435)
lola: LP says that atomic proposition is always true: (p77 + p76 + p75 + p74 + p73 + p72 <= p431 + p430 + p429 + p428 + p427 + p426)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p43 + p42 + p40 + p39 + p37 + p36 + p34 + p33 + p31 + p30 + p28 + p27 + p25 + p24 + p22 + p21 + p19 + p18 + p20 + p23 + p26 + p29 + p32 + p35 + p38 + p41 + p44 <= p416 + p415 + p414)
lola: after: (4 <= p416 + p415 + p414)
lola: LP says that atomic proposition is always false: (4 <= p416 + p415 + p414)
lola: place invariant simplifies atomic proposition
lola: before: (p81 + p82 + p83 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239 + p246 + p247 + p248 + p249 + p250 + p251 + p245 + p244 + p243 + p242 + p241 + p240 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p111 + p110 + p109 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p90 + p91 + p92 + p93 + p100 + p96 + p97 + p98 + p99)
lola: after: (0 <= p95 + p94 + p112 + p113 + p130 + p131 + p148 + p149 + p166 + p167 + p184 + p185 + p202 + p203 + p220 + p221 + p238 + p239)
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p416 + p415 + p414 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: after: (p416 + p415 + p414 <= 2)
lola: LP says that atomic proposition is always true: (p416 + p415 + p414 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (p416 + p415 + p414 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 + p253 + p254 + p259 + p260 + p262 + p263 + p265 + p266 + p268 + p269 + p271 + p272 + p277 + p278 + p280 + p281 + p283 + p284 + p286 + p287 + p289 + p290 + p295 + p296 + p298 + p299 + p301 + p302 + p304 + p305 + p307 + p308 + p313 + p314 + p316 + p317 + p319 + p320 + p322 + p323 + p325 + p326 + p331 + p332 + p334 + p335 + p337 + p338 + p340 + p341 + p343 + p344 + p349 + p350 + p352 + p353 + p355 + p356 + p358 + p359 + p361 + p362 + p367 + p368 + p370 + p371 + p373 + p374 + p376 + p377 + p379 + p380 + p385 + p386 + p388 + p389 + p391 + p392 + p394 + p395 + p397 + p398 + p403 + p404 + p406 + p407 + p409 + p410 + p412 + p413)
lola: after: (p416 + p415 + p414 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252)
lola: LP says that atomic proposition is always true: (p416 + p415 + p414 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252)
lola: A (G (())) : A (G (())) : E (F (())) : A (G ((((1 <= p53 + p52 + p51) AND (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 <= p416 + p415 + p414))))) : E (F (())) : E (F ((((2 <= p431 + p430 + p429 + p428 + p427 + p426)) OR ((1 <= p47 + p46 + p45) AND (p87 + p88 + p89 <= p50 + p49 + p48)) OR (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 <= 2)))) : E (F (FALSE)) : A (G (())) : A (G (TRUE)) : E (F (((p86 + p85 + p84 <= p87 + p88 + p89) AND (p53 + p52 + p51 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252)))) : E (F ((((2 <= p53 + p52 + p51) OR (1 <= p86 + p85 + p84))))) : A (G (FALSE)) : E (F ((p437 + p436 + p435 + 1 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252))) : E (F (())) : E (F (TRUE)) : A (G (((p431 + p430 + p429 + p428 + p427 + p426 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p53 + p52 + p51) OR (1 <= p86 + p85 + p84)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((2 <= p53 + p52 + p51) OR (1 <= p86 + p85 + p84)))))
lola: processed formula length: 61
lola: 31 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (((2 <= p53 + p52 + p51) OR (1 <= p86 + p85 + p84)))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p431 + p430 + p429 + p428 + p427 + p426 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p431 + p430 + p429 + p428 + p427 + p426 <= 0))))
lola: processed formula length: 56
lola: 32 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p437 + p436 + p435 + 1 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p29... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p437 + p436 + p435 + 1 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p29... (shortened)
lola: processed formula length: 537
lola: 31 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p53 + p52 + p51) AND (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((1 <= p53 + p52 + p51) AND (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + ... (shortened)
lola: processed formula length: 564
lola: 32 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p53 + p52 + p51 <= 0) OR (p416 + p415 + p414 + 1 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252)))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-13-0.sara
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p86 + p85 + p84 <= p87 + p88 + p89) AND (p53 + p52 + p51 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p30... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p86 + p85 + p84 <= p87 + p88 + p89) AND (p53 + p52 + p51 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p30... (shortened)
lola: processed formula length: 573
lola: 31 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p86 + p85 + p84 <= p87 + p88 + p89) AND (p53 + p52 + p51 <= p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-14-0.sara
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p431 + p430 + p429 + p428 + p427 + p426)) OR ((1 <= p47 + p46 + p45) AND (p87 + p88 + p89 <= p50 + p49 + p48)) OR (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p32... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((2 <= p431 + p430 + p429 + p428 + p427 + p426)) OR ((1 <= p47 + p46 + p45) AND (p87 + p88 + p89 <= p50 + p49 + p48)) OR (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p32... (shortened)
lola: processed formula length: 641
lola: 31 rewrites
lola: closed formula file NeoElection-COL-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: place or transition ordering is non-deterministic
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((2 <= p431 + p430 + p429 + p428 + p427 + p426)) OR ((1 <= p47 + p46 + p45) AND (p87 + p88 + p89 <= p50 + p49 + p48)) OR (p411 + p408 + p405 + p402 + p401 + p400 + p399 + p396 + p393 + p390 + p387 + p384 + p383 + p382 + p381 + p378 + p375 + p372 + p369 + p366 + p365 + p364 + p363 + p360 + p357 + p354 + p351 + p348 + p347 + p346 + p345 + p342 + p339 + p336 + p333 + p330 + p329 + p328 + p327 + p324 + p321 + p318 + p315 + p312 + p311 + p310 + p309 + p306 + p303 + p300 + p297 + p294 + p293 + p292 + p291 + p288 + p285 + p282 + p279 + p276 + p275 + p274 + p273 + p270 + p267 + p264 + p261 + p258 + p257 + p256 + p255 + p252 <= 2))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA NeoElection-COL-2-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no yes yes yes yes no yes no yes no
lola:
preliminary result: yes no no no yes yes no yes yes yes yes no yes no yes no
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-14-0.sara.
lola: memory consumption: 20968 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic



BK_TIME_CONFINEMENT_REACHED

--------------------
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="NeoElection-COL-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

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