fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r142-qhx2-152673583600026
Last Updated
June 26, 2018

About the Execution of M4M.full for QuasiCertifProtocol-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12171.090 721216.00 1485279.00 2787.50 ???????????????? normal

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 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 72K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583600026
=====================================================================


--------------------
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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1527944648325


BK_STOP 1527945369541

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 881, 'Memory': 105.74, 'Tool': 'lola'}, {'Time': 1145, 'Memory': 125.95, 'Tool': 'lola'}, {'Time': 751068, 'Memory': 15938.97, 'Tool': 'itstools'}, {'Time': 752471, 'Memory': 15933.27, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ QuasiCertifProtocol-COL-10 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-ReachabilityCardinality.task
lola: E (F ((((p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p83 <= 0) OR (p285 <= p417 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416)) AND (2 <= p24)))) : E (F ((3 <= p60))) : E (F (())) : A (G ((p396 + p385 + p374 + p363 + p352 + p341 + p330 + p319 + p308 + p297 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 <= p24))) : A (G (((p12 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p83) OR ((2 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260) AND (3 <= p396 + p385 + p374 + p363 + p352 + p341 + p330 + p319 + p308 + p297 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406) AND (p100 + p101 + p102 + p103 + p104 + p105 + p95 + p96 + p97 + p98 + p99 <= 0))))) : E (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23))) : E (F (((p284 <= 1) AND (p417 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 <= 0) AND (p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND (p417 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + 1 <= p61)))) : A (G (((p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p94 <= 1) OR (p12 <= 0) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + 1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 <= 2)))) : A (G (((p396 + p385 + p374 + p363 + p352 + p341 + p330 + p319 + p308 + p297 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 <= p285) OR (2 <= p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p262 + p263 + p264)))) : A (G ((2 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25))) : E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273) AND (1 <= p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38)))) : E (F ((((2 <= p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428) OR (p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + 1 <= p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p262 + p263 + p264)) AND (((p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 <= p24) AND (p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 <= p12)) OR (1 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130))))) : A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p473 + p462 + p451 + p440 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549) OR (2 <= p60)))) : E (F (((3 <= p106) OR (((p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130) OR (2 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130)) AND ((2 <= p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p262 + p263 + p264) OR (1 <= p284)))))) : E (F ((1 <= p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p94))) : E (F (((p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 <= p61) AND (1 <= p60) AND (p11 <= p473 + p462 + p451 + p440 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549) AND (2 <= p11) AND ((p473 + p462 + p451 + p440 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= 2) OR ((2 <= p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p94) AND (p12 <= p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p262 + p263 + p264))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p83 <= 0) OR (p285 <= p417 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416)) AND (2 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p396 + p385 + p374 + p363 + p352 + p341 + p330 + p319 + p308 + p297 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p331 + p332 + p333 + p334 + p335 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p12 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p83) OR ((2 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260) AND (3 <= p396 + p385 + p374 + p363 + p352 + p341 + p330 + p319 + p308 + p297 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p309 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-4.sara.
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p284 <= 1) AND (p417 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 <= 0) AND (p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p21... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p94 <= 1) OR (p12 <= 0) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + 1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 65 markings, 64 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p396 + p385 + p374 + p363 + p352 + p341 + p330 + p319 + p308 + p297 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p331 + p332 + p333 + p334 + p335 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.sara.
state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273) AND (1 <= p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E (F ((((2 <= p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428) OR (p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p217 + p228 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara.

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 479696 markings, 1292238 edges, 95939 markings/sec, 0 secs
lola: sara is running 5 secs || 946242 markings, 2661985 edges, 93309 markings/sec, 5 secs
lola: sara is running 10 secs || 1476476 markings, 4228118 edges, 106047 markings/sec, 10 secs
lola: sara is running 15 secs || 1979444 markings, 5858076 edges, 100594 markings/sec, 15 secs
lola: sara is running 20 secs || 2406690 markings, 7414616 edges, 85449 markings/sec, 20 secs
lola: sara is running 25 secs || 2770220 markings, 8174382 edges, 72706 markings/sec, 25 secs
lola: sara is running 30 secs || 3099985 markings, 8978735 edges, 65953 markings/sec, 30 secs
lola: sara is running 35 secs || 3423873 markings, 9865776 edges, 64778 markings/sec, 35 secs
lola: sara is running 40 secs || 3743887 markings, 10843783 edges, 64003 markings/sec, 40 secs
lola: sara is running 45 secs || 4099077 markings, 11650455 edges, 71038 markings/sec, 45 secs
lola: sara is running 50 secs || 4436121 markings, 12547716 edges, 67409 markings/sec, 50 secs
lola: sara is running 55 secs || 4747649 markings, 13553639 edges, 62306 markings/sec, 55 secs
lola: sara is running 60 secs || 5103060 markings, 14394803 edges, 71082 markings/sec, 60 secs
lola: sara is running 65 secs || 5436302 markings, 15358006 edges, 66648 markings/sec, 65 secs
lola: sara is running 70 secs || 5767877 markings, 16350812 edges, 66315 markings/sec, 70 secs
lola: sara is running 75 secs || 6121390 markings, 17268167 edges, 70703 markings/sec, 75 secs
lola: sara is running 80 secs || 6429746 markings, 18291871 edges, 61671 markings/sec, 80 secs
lola: sara is running 85 secs || 6749321 markings, 19099409 edges, 63915 markings/sec, 85 secs
lola: sara is running 90 secs || 7049706 markings, 20142935 edges, 60077 markings/sec, 90 secs
lola: sara is running 95 secs || 7364329 markings, 20978043 edges, 62925 markings/sec, 95 secs
lola: sara is running 100 secs || 7666720 markings, 22003428 edges, 60478 markings/sec, 100 secs
lola: sara is running 105 secs || 7990781 markings, 22949917 edges, 64812 markings/sec, 105 secs
lola: sara is running 110 secs || 8304484 markings, 23958948 edges, 62741 markings/sec, 110 secs
lola: sara is running 115 secs || 8618388 markings, 25047864 edges, 62781 markings/sec, 115 secs
lola: sara is running 120 secs || 8933033 markings, 26107093 edges, 62929 markings/sec, 120 secs
lola: sara is running 125 secs || 9242911 markings, 27189812 edges, 61976 markings/sec, 125 secs
lola: sara is running 130 secs || 9533755 markings, 28348649 edges, 58169 markings/sec, 130 secs
lola: sara is running 135 secs || 9820868 markings, 29554124 edges, 57423 markings/sec, 135 secs
lola: sara is running 140 secs || 10083691 markings, 30859427 edges, 52565 markings/sec, 140 secs
lola: sara is running 145 secs || 10387039 markings, 31893334 edges, 60670 markings/sec, 145 secs
lola: sara is running 150 secs || 10742536 markings, 32753252 edges, 71099 markings/sec, 150 secs
lola: sara is running 155 secs || 11084044 markings, 33681305 edges, 68302 markings/sec, 155 secs
lola: sara is running 160 secs || 11414405 markings, 34673348 edges, 66072 markings/sec, 160 secs
lola: sara is running 165 secs || 11778141 markings, 35564850 edges, 72747 markings/sec, 165 secs
lola: sara is running 170 secs || 12103588 markings, 36591756 edges, 65089 markings/sec, 170 secs
lola: sara is running 175 secs || 12459758 markings, 37544057 edges, 71234 markings/sec, 175 secs
lola: sara is running 180 secs || 12807648 markings, 38510088 edges, 69578 markings/sec, 180 secs
lola: sara is running 185 secs || 13139124 markings, 39536501 edges, 66295 markings/sec, 185 secs
lola: sara is running 190 secs || 13489576 markings, 40517428 edges, 70090 markings/sec, 190 secs
lola: sara is running 195 secs || 13825846 markings, 41560975 edges, 67254 markings/sec, 195 secs
lola: sara is running 200 secs || 14158675 markings, 42619969 edges, 66566 markings/sec, 200 secs
lola: sara is running 205 secs || 14503671 markings, 43628680 edges, 68999 markings/sec, 205 secs
lola: sara is running 210 secs || 14831227 markings, 44716242 edges, 65511 markings/sec, 210 secs
lola: sara is running 215 secs || 15151256 markings, 45817286 edges, 64006 markings/sec, 215 secs
lola: sara is running 220 secs || 15472249 markings, 46921080 edges, 64199 markings/sec, 220 secs
lola: sara is running 225 secs || 15794259 markings, 47985071 edges, 64402 markings/sec, 225 secs
lola: sara is running 230 secs || 16092122 markings, 49146302 edges, 59573 markings/sec, 230 secs
lola: sara is running 235 secs || 16380214 markings, 50351026 edges, 57618 markings/sec, 235 secs
lola: sara is running 240 secs || 16643788 markings, 51624358 edges, 52715 markings/sec, 240 secs
lola: sara is running 245 secs || 16927742 markings, 52763307 edges, 56791 markings/sec, 245 secs
lola: sara is running 250 secs || 17289912 markings, 53636331 edges, 72434 markings/sec, 250 secs
lola: sara is running 255 secs || 17610326 markings, 54574149 edges, 64083 markings/sec, 255 secs
lola: sara is running 260 secs || 17950442 markings, 55543535 edges, 68023 markings/sec, 260 secs
lola: sara is running 265 secs || 18294925 markings, 56467030 edges, 68897 markings/sec, 265 secs
lola: sara is running 270 secs || 18606712 markings, 57491533 edges, 62357 markings/sec, 270 secs
lola: sara is running 275 secs || 18967683 markings, 58436929 edges, 72194 markings/sec, 275 secs
lola: sara is running 280 secs || 19292683 markings, 59504568 edges, 65000 markings/sec, 280 secs
lola: sara is running 285 secs || 19649654 markings, 60547295 edges, 71394 markings/sec, 285 secs
lola: sara is running 290 secs || 19992369 markings, 61628252 edges, 68543 markings/sec, 290 secs
lola: sara is running 295 secs || 20308534 markings, 62697827 edges, 63233 markings/sec, 295 secs
lola: sara is running 300 secs || 20628740 markings, 63739636 edges, 64041 markings/sec, 300 secs
lola: sara is running 305 secs || 20943953 markings, 64764550 edges, 63043 markings/sec, 305 secs
lola: sara is running 310 secs || 21238136 markings, 65740167 edges, 58837 markings/sec, 310 secs
lola: sara is running 315 secs || 21498068 markings, 66828400 edges, 51986 markings/sec, 315 secs
lola: sara is running 320 secs || 21782637 markings, 67914351 edges, 56914 markings/sec, 320 secs
lola: sara is running 325 secs || 22043472 markings, 69057998 edges, 52167 markings/sec, 325 secs
lola: sara is running 330 secs || 22281873 markings, 70278641 edges, 47680 markings/sec, 330 secs
lola: sara is running 335 secs || 22609958 markings, 71238319 edges, 65617 markings/sec, 335 secs
lola: sara is running 340 secs || 22945206 markings, 72145056 edges, 67050 markings/sec, 340 secs
lola: sara is running 345 secs || 23268288 markings, 73178715 edges, 64616 markings/sec, 345 secs
lola: sara is running 350 secs || 23620808 markings, 74128279 edges, 70504 markings/sec, 350 secs
lola: sara is running 355 secs || 23955725 markings, 75210227 edges, 66983 markings/sec, 355 secs
lola: sara is running 360 secs || 24303583 markings, 76241217 edges, 69572 markings/sec, 360 secs
lola: sara is running 365 secs || 24644125 markings, 77293202 edges, 68108 markings/sec, 365 secs
lola: sara is running 370 secs || 24970740 markings, 78390608 edges, 65323 markings/sec, 370 secs
lola: sara is running 375 secs || 25288370 markings, 79504199 edges, 63526 markings/sec, 375 secs
lola: sara is running 380 secs || 25614440 markings, 80555315 edges, 65214 markings/sec, 380 secs
lola: sara is running 385 secs || 25937240 markings, 81607610 edges, 64560 markings/sec, 385 secs
lola: sara is running 390 secs || 26227171 markings, 82767256 edges, 57986 markings/sec, 390 secs
lola: sara is running 395 secs || 26515863 markings, 83941769 edges, 57738 markings/sec, 395 secs
lola: sara is running 400 secs || 26772652 markings, 85120799 edges, 51358 markings/sec, 400 secs
lola: sara is running 405 secs || 26995079 markings, 86294119 edges, 44485 markings/sec, 405 secs
lola: sara is running 410 secs || 27348554 markings, 87164521 edges, 70695 markings/sec, 410 secs
lola: sara is running 415 secs || 27646114 markings, 88217868 edges, 59512 markings/sec, 415 secs
lola: sara is running 420 secs || 27988739 markings, 89123091 edges, 68525 markings/sec, 420 secs
lola: sara is running 425 secs || 28303606 markings, 90176272 edges, 62973 markings/sec, 425 secs
lola: sara is running 430 secs || 28646683 markings, 91187469 edges, 68615 markings/sec, 430 secs
lola: sara is running 435 secs || 28970641 markings, 92237985 edges, 64792 markings/sec, 435 secs
lola: sara is running 440 secs || 29291060 markings, 93308006 edges, 64084 markings/sec, 440 secs
lola: sara is running 445 secs || 29606418 markings, 94389904 edges, 63072 markings/sec, 445 secs
lola: sara is running 450 secs || 29902504 markings, 95468688 edges, 59217 markings/sec, 450 secs
lola: sara is running 455 secs || 30190803 markings, 96580657 edges, 57660 markings/sec, 455 secs
lola: sara is running 460 secs || 30462049 markings, 97754357 edges, 54249 markings/sec, 460 secs
lola: sara is running 465 secs || 30709999 markings, 98972521 edges, 49590 markings/sec, 465 secs
lola: sara is running 470 secs || 30970210 markings, 99994261 edges, 52042 markings/sec, 470 secs
lola: sara is running 475 secs || 31277180 markings, 100874149 edges, 61394 markings/sec, 475 secs
lola: sara is running 480 secs || 31571034 markings, 101828131 edges, 58771 markings/sec, 480 secs
lola: sara is running 485 secs || 31870811 markings, 102827486 edges, 59955 markings/sec, 485 secs
lola: sara is running 490 secs || 32174074 markings, 103738588 edges, 60653 markings/sec, 490 secs
lola: sara is running 495 secs || 32472475 markings, 104747439 edges, 59680 markings/sec, 495 secs
lola: sara is running 500 secs || 32771801 markings, 105767425 edges, 59865 markings/sec, 500 secs
lola: sara is running 505 secs || 33058263 markings, 106815521 edges, 57292 markings/sec, 505 secs
lola: sara is running 510 secs || 33347270 markings, 107934628 edges, 57801 markings/sec, 510 secs
lola: sara is running 515 secs || 33630886 markings, 109146714 edges, 56723 markings/sec, 515 secs
lola: sara is running 520 secs || 33893371 markings, 110457528 edges, 52497 markings/sec, 520 secs
lola: sara is running 525 secs || 34174092 markings, 111499563 edges, 56144 markings/sec, 525 secs
lola: sara is running 530 secs || 34475200 markings, 112542384 edges, 60222 markings/sec, 530 secs
lola: sara is running 535 secs || 34787993 markings, 113467563 edges, 62559 markings/sec, 535 secs
lola: sara is running 540 secs || 35090009 markings, 114493497 edges, 60403 markings/sec, 540 secs
lola: sara is running 545 secs || 35405052 markings, 115601407 edges, 63009 markings/sec, 545 secs
lola: sara is running 550 secs || 35719226 markings, 116807975 edges, 62835 markings/sec, 550 secs
lola: sara is running 555 secs || 36023631 markings, 117959929 edges, 60881 markings/sec, 555 secs
lola: sara is running 560 secs || 36280055 markings, 119108931 edges, 51285 markings/sec, 560 secs
lola: sara is running 565 secs || 36522423 markings, 120313526 edges, 48474 markings/sec, 565 secs
lola: sara is running 570 secs || 36803181 markings, 121282809 edges, 56152 markings/sec, 570 secs
lola: sara is running 575 secs || 37094306 markings, 122298980 edges, 58225 markings/sec, 575 secs
lola: sara is running 580 secs || 37387472 markings, 123324173 edges, 58633 markings/sec, 580 secs
lola: sara is running 585 secs || 37687532 markings, 124308743 edges, 60012 markings/sec, 585 secs
lola: sara is running 590 secs || 37961989 markings, 125401079 edges, 54891 markings/sec, 590 secs
lola: sara is running 595 secs || 38247673 markings, 126589719 edges, 57137 markings/sec, 595 secs
lola: sara is running 600 secs || 38490862 markings, 127717400 edges, 48638 markings/sec, 600 secs
lola: sara is running 605 secs || 38729684 markings, 128908454 edges, 47764 markings/sec, 605 secs
lola: sara is running 610 secs || 39028053 markings, 129973337 edges, 59674 markings/sec, 610 secs
lola: sara is running 615 secs || 39340977 markings, 130935043 edges, 62585 markings/sec, 615 secs
lola: sara is running 620 secs || 39621630 markings, 132074831 edges, 56131 markings/sec, 620 secs
lola: sara is running 625 secs || 39900407 markings, 133206080 edges, 55755 markings/sec, 625 secs
lola: sara is running 630 secs || 40163646 markings, 134406240 edges, 52648 markings/sec, 630 secs
lola: sara is running 635 secs || 40405842 markings, 135640669 edges, 48439 markings/sec, 635 secs
lola: sara is running 640 secs || 40708751 markings, 136642949 edges, 60582 markings/sec, 640 secs
lola: sara is running 645 secs || 40986843 markings, 137742777 edges, 55618 markings/sec, 645 secs
lola: sara is running 650 secs || 41269285 markings, 138919581 edges, 56488 markings/sec, 650 secs
lola: sara is running 655 secs || 41526721 markings, 140146368 edges, 51487 markings/sec, 655 secs
lola: sara is running 660 secs || 41779580 markings, 141316670 edges, 50572 markings/sec, 660 secs
lola: sara is running 665 secs || 42073017 markings, 142347896 edges, 58687 markings/sec, 665 secs
lola: sara is running 670 secs || 42327248 markings, 143507673 edges, 50846 markings/sec, 670 secs
lola: sara is running 675 secs || 42602949 markings, 144580875 edges, 55140 markings/sec, 675 secs
lola: sara is running 680 secs || 42850562 markings, 145743562 edges, 49523 markings/sec, 680 secs
lola: sara is running 685 secs || 43090740 markings, 146919851 edges, 48036 markings/sec, 685 secs
lola: sara is running 690 secs || 43312322 markings, 148155642 edges, 44316 markings/sec, 690 secs
lola: sara is running 695 secs || 43553147 markings, 149261630 edges, 48165 markings/sec, 695 secs
lola: sara is running 700 secs || 43803003 markings, 150394730 edges, 49971 markings/sec, 700 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
Aborted (core dumped)
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
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/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is QuasiCertifProtocol-COL-10, 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 r142-qhx2-152673583600026"
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 ;