About the Execution of Irma.struct for SafeBus-COL-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 715.360 | 1215223.00 | 2349080.00 | 3897.80 | FTF?FTTFTFFTTFTT | 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 208K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is SafeBus-COL-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-smll-152685549700201
=====================================================================
--------------------
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 SafeBus-COL-15-ReachabilityCardinality-00
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-01
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-02
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-03
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-04
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-05
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-06
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-07
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-08
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-09
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-10
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-11
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-12
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-13
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-14
FORMULA_NAME SafeBus-COL-15-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526933711015
BK_STOP 1526934926238
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SafeBus-COL-15 as instance name.
Using SafeBus 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 549637, 'Memory': 360.23, 'Tool': 'lola'}, {'Time': 1989375, 'Memory': 972.63, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola SafeBus-COL-15...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
SafeBus-COL-15: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
SafeBus-COL-15: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ SafeBus-COL-15 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5437/65536 symbol table entries, 1233 collisions
lola: preprocessing...
lola: finding significant places
lola: 636 places, 4801 transitions, 556 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2193 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-15-ReachabilityCardinality.task
lola: A (G ((((1 <= p590) AND (2 <= p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587) AND (p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + 1 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621)) OR (1 <= p589)))) : E (F ((((1 <= p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) AND (p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 <= p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347) AND ((p588 + 1 <= p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347) OR (p589 <= 1))))) : A (G (((p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p44 + p59 + p74 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p287 + p288 + p289 + p290 + p291 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 <= p302) OR (1 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621)))) : A (G (((p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 <= 1) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p44 + p59 + p74 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1) OR ((p590 + 1 <= p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606) AND (p285 + 1 <= p287 + p288 + p289 + p290 + p291 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292))))) : E (F (((p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + 1 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18 + p17 + p16 + p15 <= 2) AND (p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606 <= 0)))) : A (G ((((2 <= p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605) AND (1 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284) AND (p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + 1 <= p590)) OR (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p287 + p288 + p289 + p290 + p291 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) AND ((p286 <= p589) OR (p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + 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 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621)))))) : E (F ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) AND (1 <= p590)) OR ((p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) AND (p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621))))) : E (F ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))) : E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347) AND (p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)))) : A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621))) : A (G (((p287 + p288 + p289 + p290 + p291 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 <= 0) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18 + p17 + p16 + p15 <= p590)))) : E (F (((3 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) AND (1 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621) AND (p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18 + p17 + p16 + p15) AND (p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= 0) AND (p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= 0)))) : E (F ((1 <= p588))) : E (F ((2 <= p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606))) : E (F (((p302 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) AND (p286 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14) AND ((2 <= p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347) OR (p285 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317)) AND (p589 + 1 <= p588)))) : A (G (((p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18 + p17 + p16 + p15) OR ((1 <= p588) AND (2 <= p588)) OR (3 <= p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p590) AND (2 <= p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587) AND (p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + 1 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621)) OR (1 <= p589))))
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 2224 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) AND (p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 <= p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344... (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 2224 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 +... (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 2224 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 <= 1) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 ... (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 2224 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1911 markings, 1948 edges, 382 markings/sec, 0 secs
lola: sara is running 5 secs || 3899 markings, 4012 edges, 398 markings/sec, 5 secs
lola: sara is running 10 secs || 5929 markings, 6176 edges, 406 markings/sec, 10 secs
lola: sara is running 15 secs || 8019 markings, 8491 edges, 418 markings/sec, 15 secs
lola: sara is running 20 secs || 10094 markings, 10782 edges, 415 markings/sec, 20 secs
lola: sara is running 25 secs || 12053 markings, 12941 edges, 392 markings/sec, 25 secs
lola: sara is running 30 secs || 14159 markings, 15334 edges, 421 markings/sec, 30 secs
lola: sara is running 35 secs || 16326 markings, 17880 edges, 433 markings/sec, 35 secs
lola: sara is running 40 secs || 18519 markings, 20549 edges, 439 markings/sec, 40 secs
lola: sara is running 45 secs || 20737 markings, 23282 edges, 444 markings/sec, 45 secs
lola: sara is running 50 secs || 22884 markings, 25820 edges, 429 markings/sec, 50 secs
lola: sara is running 55 secs || 25050 markings, 28549 edges, 433 markings/sec, 55 secs
lola: sara is running 60 secs || 27263 markings, 31448 edges, 443 markings/sec, 60 secs
lola: sara is running 65 secs || 29468 markings, 34248 edges, 441 markings/sec, 65 secs
lola: sara is running 70 secs || 31569 markings, 36712 edges, 420 markings/sec, 70 secs
lola: sara is running 75 secs || 33792 markings, 39639 edges, 445 markings/sec, 75 secs
lola: sara is running 80 secs || 35927 markings, 42168 edges, 427 markings/sec, 80 secs
lola: sara is running 85 secs || 37984 markings, 44671 edges, 411 markings/sec, 85 secs
lola: sara is running 90 secs || 40115 markings, 47291 edges, 426 markings/sec, 90 secs
lola: sara is running 95 secs || 42212 markings, 49787 edges, 419 markings/sec, 95 secs
lola: sara is running 100 secs || 44272 markings, 52063 edges, 412 markings/sec, 100 secs
lola: sara is running 105 secs || 46239 markings, 54120 edges, 393 markings/sec, 105 secs
lola: sara is running 110 secs || 48340 markings, 56547 edges, 420 markings/sec, 110 secs
lola: sara is running 115 secs || 50493 markings, 59329 edges, 431 markings/sec, 115 secs
lola: sara is running 120 secs || 52610 markings, 62156 edges, 423 markings/sec, 120 secs
lola: sara is running 125 secs || 54795 markings, 65040 edges, 437 markings/sec, 125 secs
lola: sara is running 130 secs || 56904 markings, 67678 edges, 422 markings/sec, 130 secs
lola: sara is running 135 secs || 59069 markings, 70349 edges, 433 markings/sec, 135 secs
lola: sara is running 140 secs || 61328 markings, 73398 edges, 452 markings/sec, 140 secs
lola: sara is running 145 secs || 63411 markings, 75813 edges, 417 markings/sec, 145 secs
lola: sara is running 150 secs || 65527 markings, 78196 edges, 423 markings/sec, 150 secs
lola: sara is running 155 secs || 67614 markings, 80506 edges, 417 markings/sec, 155 secs
lola: sara is running 160 secs || 69707 markings, 82856 edges, 419 markings/sec, 160 secs
lola: sara is running 165 secs || 71751 markings, 85016 edges, 409 markings/sec, 165 secs
lola: sara is running 170 secs || 73746 markings, 87085 edges, 399 markings/sec, 170 secs
lola: sara is running 175 secs || 75790 markings, 89251 edges, 409 markings/sec, 175 secs
lola: sara is running 180 secs || 77880 markings, 91598 edges, 418 markings/sec, 180 secs
lola: sara is running 185 secs || 79917 markings, 93816 edges, 407 markings/sec, 185 secs
lola: sara is running 190 secs || 81949 markings, 96053 edges, 406 markings/sec, 190 secs
lola: sara is running 195 secs || 83946 markings, 98359 edges, 399 markings/sec, 195 secs
lola: sara is running 200 secs || 85988 markings, 100740 edges, 408 markings/sec, 200 secs
lola: sara is running 205 secs || 88125 markings, 103335 edges, 427 markings/sec, 205 secs
lola: sara is running 210 secs || 90279 markings, 106080 edges, 431 markings/sec, 210 secs
lola: sara is running 215 secs || 92383 markings, 108634 edges, 421 markings/sec, 215 secs
lola: sara is running 220 secs || 94478 markings, 110996 edges, 419 markings/sec, 220 secs
lola: sara is running 225 secs || 96694 markings, 113893 edges, 443 markings/sec, 225 secs
lola: sara is running 230 secs || 98844 markings, 116468 edges, 430 markings/sec, 230 secs
lola: sara is running 235 secs || 100957 markings, 118880 edges, 423 markings/sec, 235 secs
lola: sara is running 240 secs || 103021 markings, 121289 edges, 413 markings/sec, 240 secs
lola: sara is running 245 secs || 105188 markings, 124013 edges, 433 markings/sec, 245 secs
lola: sara is running 250 secs || 107336 markings, 126696 edges, 430 markings/sec, 250 secs
lola: sara is running 255 secs || 109396 markings, 129047 edges, 412 markings/sec, 255 secs
lola: sara is running 260 secs || 111493 markings, 131524 edges, 419 markings/sec, 260 secs
lola: sara is running 265 secs || 113648 markings, 134106 edges, 431 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + 1 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18 + p17 + p16 + p15 <= 2) AND (p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610... (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 2224 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605) AND (1 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284) AND (p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + 1 <= p590)) OR (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 +... (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 2224 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1230 markings, 1277 edges, 246 markings/sec, 0 secs
lola: sara is running 5 secs || 2419 markings, 2649 edges, 238 markings/sec, 5 secs
lola: sara is running 10 secs || 3613 markings, 4178 edges, 239 markings/sec, 10 secs
lola: sara is running 15 secs || 4809 markings, 5699 edges, 239 markings/sec, 15 secs
lola: sara is running 20 secs || 6003 markings, 7093 edges, 239 markings/sec, 20 secs
lola: sara is running 25 secs || 7196 markings, 8514 edges, 239 markings/sec, 25 secs
lola: sara is running 30 secs || 8408 markings, 10005 edges, 242 markings/sec, 30 secs
lola: sara is running 35 secs || 9610 markings, 11589 edges, 240 markings/sec, 35 secs
lola: sara is running 40 secs || 10806 markings, 13280 edges, 239 markings/sec, 40 secs
lola: sara is running 45 secs || 12035 markings, 14989 edges, 246 markings/sec, 45 secs
lola: sara is running 50 secs || 13253 markings, 16669 edges, 244 markings/sec, 50 secs
lola: sara is running 55 secs || 14477 markings, 18250 edges, 245 markings/sec, 55 secs
lola: sara is running 60 secs || 15720 markings, 20150 edges, 249 markings/sec, 60 secs
lola: sara is running 65 secs || 16948 markings, 22175 edges, 246 markings/sec, 65 secs
lola: sara is running 70 secs || 18241 markings, 24160 edges, 259 markings/sec, 70 secs
lola: sara is running 75 secs || 19514 markings, 26276 edges, 255 markings/sec, 75 secs
lola: sara is running 80 secs || 20783 markings, 28615 edges, 254 markings/sec, 80 secs
lola: sara is running 85 secs || 22030 markings, 30529 edges, 249 markings/sec, 85 secs
lola: sara is running 90 secs || 23304 markings, 32693 edges, 255 markings/sec, 90 secs
lola: sara is running 95 secs || 24636 markings, 35140 edges, 266 markings/sec, 95 secs
lola: sara is running 100 secs || 25891 markings, 37180 edges, 251 markings/sec, 100 secs
lola: sara is running 105 secs || 27208 markings, 39691 edges, 263 markings/sec, 105 secs
lola: sara is running 110 secs || 28486 markings, 41933 edges, 256 markings/sec, 110 secs
lola: sara is running 115 secs || 29757 markings, 44225 edges, 254 markings/sec, 115 secs
lola: sara is running 120 secs || 31075 markings, 46831 edges, 264 markings/sec, 120 secs
lola: sara is running 125 secs || 32380 markings, 49151 edges, 261 markings/sec, 125 secs
lola: sara is running 130 secs || 33697 markings, 51439 edges, 263 markings/sec, 130 secs
lola: sara is running 135 secs || 35001 markings, 53298 edges, 261 markings/sec, 135 secs
lola: sara is running 140 secs || 36314 markings, 55671 edges, 263 markings/sec, 140 secs
lola: sara is running 145 secs || 37605 markings, 57894 edges, 258 markings/sec, 145 secs
lola: sara is running 150 secs || 38863 markings, 60155 edges, 252 markings/sec, 150 secs
lola: sara is running 155 secs || 40123 markings, 62319 edges, 252 markings/sec, 155 secs
lola: sara is running 160 secs || 41392 markings, 64451 edges, 254 markings/sec, 160 secs
lola: sara is running 165 secs || 42673 markings, 67192 edges, 256 markings/sec, 165 secs
lola: sara is running 170 secs || 43987 markings, 69161 edges, 263 markings/sec, 170 secs
lola: sara is running 175 secs || 45283 markings, 71624 edges, 259 markings/sec, 175 secs
lola: sara is running 180 secs || 46615 markings, 74144 edges, 266 markings/sec, 180 secs
lola: sara is running 185 secs || 47903 markings, 76254 edges, 258 markings/sec, 185 secs
lola: sara is running 190 secs || 49223 markings, 78401 edges, 264 markings/sec, 190 secs
lola: sara is running 195 secs || 50566 markings, 80750 edges, 269 markings/sec, 195 secs
lola: sara is running 200 secs || 51911 markings, 83490 edges, 269 markings/sec, 200 secs
lola: sara is running 205 secs || 53212 markings, 86193 edges, 260 markings/sec, 205 secs
lola: sara is running 210 secs || 54606 markings, 88929 edges, 279 markings/sec, 210 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) AND (1 <= p590)) OR ((p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + ... (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 2224 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 SafeBus-COL-15-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)))
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 2224 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: 1 markings, 0 edges
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-7.sara
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347) AND (p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621)))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 10 will run for 508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p287 + p288 + p289 + p290 + p291 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 <= 0) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18 + p17 + p16 + p15 <= p590))))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) AND (1 <= p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621) AND (p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + ... (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 2224 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 762 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p588)))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606)))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1779 markings, 1846 edges, 356 markings/sec, 0 secs
lola: sara is running 5 secs || 3369 markings, 3564 edges, 318 markings/sec, 5 secs
lola: sara is running 10 secs || 5026 markings, 5354 edges, 331 markings/sec, 10 secs
lola: sara is running 15 secs || 6549 markings, 7087 edges, 305 markings/sec, 15 secs
lola: sara is running 20 secs || 8070 markings, 8843 edges, 304 markings/sec, 20 secs
lola: sara is running 25 secs || 9661 markings, 10662 edges, 318 markings/sec, 25 secs
lola: sara is running 30 secs || 11241 markings, 12480 edges, 316 markings/sec, 30 secs
lola: sara is running 35 secs || 12749 markings, 14341 edges, 302 markings/sec, 35 secs
lola: sara is running 40 secs || 13962 markings, 15929 edges, 243 markings/sec, 40 secs
lola: sara is running 45 secs || 15188 markings, 17546 edges, 245 markings/sec, 45 secs
lola: sara is running 50 secs || 16442 markings, 19187 edges, 251 markings/sec, 50 secs
lola: sara is running 55 secs || 17825 markings, 20912 edges, 277 markings/sec, 55 secs
lola: sara is running 60 secs || 19447 markings, 22705 edges, 324 markings/sec, 60 secs
lola: sara is running 65 secs || 21002 markings, 24450 edges, 311 markings/sec, 65 secs
lola: sara is running 70 secs || 22239 markings, 26141 edges, 247 markings/sec, 70 secs
lola: sara is running 75 secs || 23722 markings, 27909 edges, 297 markings/sec, 75 secs
lola: sara is running 80 secs || 25354 markings, 29784 edges, 326 markings/sec, 80 secs
lola: sara is running 85 secs || 27018 markings, 31758 edges, 333 markings/sec, 85 secs
lola: sara is running 90 secs || 28606 markings, 33638 edges, 318 markings/sec, 90 secs
lola: sara is running 95 secs || 30044 markings, 35439 edges, 288 markings/sec, 95 secs
lola: sara is running 100 secs || 31689 markings, 37360 edges, 329 markings/sec, 100 secs
lola: sara is running 105 secs || 33075 markings, 39197 edges, 277 markings/sec, 105 secs
lola: sara is running 110 secs || 34200 markings, 40736 edges, 225 markings/sec, 110 secs
lola: sara is running 115 secs || 35532 markings, 42334 edges, 266 markings/sec, 115 secs
lola: sara is running 120 secs || 36902 markings, 44076 edges, 274 markings/sec, 120 secs
lola: sara is running 125 secs || 38139 markings, 45617 edges, 247 markings/sec, 125 secs
lola: sara is running 130 secs || 39330 markings, 47147 edges, 238 markings/sec, 130 secs
lola: sara is running 135 secs || 40478 markings, 48634 edges, 230 markings/sec, 135 secs
lola: sara is running 140 secs || 41691 markings, 50232 edges, 243 markings/sec, 140 secs
lola: sara is running 145 secs || 42961 markings, 51993 edges, 254 markings/sec, 145 secs
lola: sara is running 150 secs || 44223 markings, 53782 edges, 252 markings/sec, 150 secs
lola: sara is running 155 secs || 45661 markings, 55628 edges, 288 markings/sec, 155 secs
lola: sara is running 160 secs || 46829 markings, 57132 edges, 234 markings/sec, 160 secs
lola: sara is running 165 secs || 48064 markings, 58749 edges, 247 markings/sec, 165 secs
lola: sara is running 170 secs || 49253 markings, 60372 edges, 238 markings/sec, 170 secs
lola: sara is running 175 secs || 50654 markings, 62160 edges, 280 markings/sec, 175 secs
lola: sara is running 180 secs || 51881 markings, 63857 edges, 245 markings/sec, 180 secs
lola: sara is running 185 secs || 53278 markings, 65843 edges, 279 markings/sec, 185 secs
lola: sara is running 190 secs || 54402 markings, 67451 edges, 225 markings/sec, 190 secs
lola: sara is running 195 secs || 55810 markings, 69406 edges, 282 markings/sec, 195 secs
lola: sara is running 200 secs || 56978 markings, 71051 edges, 234 markings/sec, 200 secs
lola: sara is running 205 secs || 58288 markings, 72876 edges, 262 markings/sec, 205 secs
lola: sara is running 210 secs || 59455 markings, 74423 edges, 233 markings/sec, 210 secs
lola: sara is running 215 secs || 60568 markings, 75954 edges, 223 markings/sec, 215 secs
lola: sara is running 220 secs || 61816 markings, 77746 edges, 250 markings/sec, 220 secs
lola: sara is running 225 secs || 63115 markings, 79674 edges, 260 markings/sec, 225 secs
lola: sara is running 230 secs || 64622 markings, 81802 edges, 301 markings/sec, 230 secs
lola: sara is running 235 secs || 66015 markings, 83718 edges, 279 markings/sec, 235 secs
lola: sara is running 240 secs || 67184 markings, 85371 edges, 234 markings/sec, 240 secs
lola: sara is running 245 secs || 68469 markings, 87250 edges, 257 markings/sec, 245 secs
lola: sara is running 250 secs || 69840 markings, 89221 edges, 274 markings/sec, 250 secs
lola: sara is running 255 secs || 71126 markings, 91105 edges, 257 markings/sec, 255 secs
lola: sara is running 260 secs || 72766 markings, 92843 edges, 328 markings/sec, 260 secs
lola: sara is running 265 secs || 74439 markings, 94708 edges, 335 markings/sec, 265 secs
lola: sara is running 270 secs || 76007 markings, 96575 edges, 314 markings/sec, 270 secs
lola: sara is running 275 secs || 77702 markings, 98552 edges, 339 markings/sec, 275 secs
lola: sara is running 280 secs || 79085 markings, 100538 edges, 277 markings/sec, 280 secs
lola: sara is running 285 secs || 80526 markings, 102697 edges, 288 markings/sec, 285 secs
lola: sara is running 290 secs || 81834 markings, 104536 edges, 262 markings/sec, 290 secs
lola: sara is running 295 secs || 83254 markings, 106703 edges, 284 markings/sec, 295 secs
lola: sara is running 300 secs || 84601 markings, 108712 edges, 269 markings/sec, 300 secs
lola: sara is running 305 secs || 85962 markings, 110724 edges, 272 markings/sec, 305 secs
lola: sara is running 310 secs || 87432 markings, 112490 edges, 294 markings/sec, 310 secs
lola: sara is running 315 secs || 88969 markings, 114182 edges, 307 markings/sec, 315 secs
lola: sara is running 320 secs || 90281 markings, 115814 edges, 262 markings/sec, 320 secs
lola: sara is running 325 secs || 91697 markings, 117816 edges, 283 markings/sec, 325 secs
lola: sara is running 330 secs || 92963 markings, 119739 edges, 253 markings/sec, 330 secs
lola: sara is running 335 secs || 94211 markings, 121565 edges, 250 markings/sec, 335 secs
lola: sara is running 340 secs || 95526 markings, 123563 edges, 263 markings/sec, 340 secs
lola: sara is running 345 secs || 96964 markings, 125726 edges, 288 markings/sec, 345 secs
lola: sara is running 350 secs || 98525 markings, 128045 edges, 312 markings/sec, 350 secs
lola: sara is running 355 secs || 99830 markings, 130056 edges, 261 markings/sec, 355 secs
lola: sara is running 360 secs || 101072 markings, 131842 edges, 248 markings/sec, 360 secs
lola: sara is running 365 secs || 102324 markings, 133768 edges, 250 markings/sec, 365 secs
lola: sara is running 370 secs || 103579 markings, 135633 edges, 251 markings/sec, 370 secs
lola: sara is running 375 secs || 105117 markings, 138109 edges, 308 markings/sec, 375 secs
lola: sara is running 380 secs || 106545 markings, 140326 edges, 286 markings/sec, 380 secs
lola: sara is running 385 secs || 108061 markings, 142690 edges, 303 markings/sec, 385 secs
lola: sara is running 390 secs || 109477 markings, 144868 edges, 283 markings/sec, 390 secs
lola: sara is running 395 secs || 111047 markings, 147412 edges, 314 markings/sec, 395 secs
lola: sara is running 400 secs || 112631 markings, 149926 edges, 317 markings/sec, 400 secs
lola: sara is running 405 secs || 114408 markings, 152106 edges, 355 markings/sec, 405 secs
lola: sara is running 410 secs || 116076 markings, 154579 edges, 334 markings/sec, 410 secs
lola: sara is running 415 secs || 117734 markings, 156687 edges, 332 markings/sec, 415 secs
lola: sara is running 420 secs || 119103 markings, 158360 edges, 274 markings/sec, 420 secs
lola: sara is running 425 secs || 120442 markings, 160014 edges, 268 markings/sec, 425 secs
lola: sara is running 430 secs || 121789 markings, 161704 edges, 269 markings/sec, 430 secs
lola: sara is running 435 secs || 122943 markings, 163203 edges, 231 markings/sec, 435 secs
lola: sara is running 440 secs || 124355 markings, 164849 edges, 282 markings/sec, 440 secs
lola: sara is running 445 secs || 125993 markings, 166658 edges, 328 markings/sec, 445 secs
lola: sara is running 450 secs || 127192 markings, 168184 edges, 240 markings/sec, 450 secs
lola: sara is running 455 secs || 128548 markings, 169835 edges, 271 markings/sec, 455 secs
lola: sara is running 460 secs || 130143 markings, 172232 edges, 319 markings/sec, 460 secs
lola: sara is running 465 secs || 131487 markings, 174365 edges, 269 markings/sec, 465 secs
lola: sara is running 470 secs || 132987 markings, 176848 edges, 300 markings/sec, 470 secs
lola: sara is running 475 secs || 134328 markings, 178656 edges, 268 markings/sec, 475 secs
lola: sara is running 480 secs || 135675 markings, 180326 edges, 269 markings/sec, 480 secs
lola: sara is running 485 secs || 137164 markings, 182053 edges, 298 markings/sec, 485 secs
lola: sara is running 490 secs || 138547 markings, 183831 edges, 277 markings/sec, 490 secs
lola: sara is running 495 secs || 140212 markings, 185950 edges, 333 markings/sec, 495 secs
lola: sara is running 500 secs || 141855 markings, 187849 edges, 329 markings/sec, 500 secs
lola: sara is running 505 secs || 143361 markings, 189635 edges, 301 markings/sec, 505 secs
lola: sara is running 510 secs || 144711 markings, 191384 edges, 270 markings/sec, 510 secs
lola: sara is running 515 secs || 146179 markings, 193289 edges, 294 markings/sec, 515 secs
lola: sara is running 520 secs || 147702 markings, 195696 edges, 305 markings/sec, 520 secs
lola: sara is running 525 secs || 149114 markings, 197604 edges, 282 markings/sec, 525 secs
lola: sara is running 530 secs || 150470 markings, 199627 edges, 271 markings/sec, 530 secs
lola: sara is running 535 secs || 151610 markings, 201235 edges, 228 markings/sec, 535 secs
lola: sara is running 540 secs || 152792 markings, 202846 edges, 236 markings/sec, 540 secs
lola: sara is running 545 secs || 154100 markings, 204539 edges, 262 markings/sec, 545 secs
lola: sara is running 550 secs || 155504 markings, 206266 edges, 281 markings/sec, 550 secs
lola: sara is running 555 secs || 156613 markings, 207717 edges, 222 markings/sec, 555 secs
lola: sara is running 560 secs || 157842 markings, 209318 edges, 246 markings/sec, 560 secs
lola: sara is running 565 secs || 159071 markings, 210905 edges, 246 markings/sec, 565 secs
lola: sara is running 570 secs || 160354 markings, 212546 edges, 257 markings/sec, 570 secs
lola: sara is running 575 secs || 161707 markings, 214410 edges, 271 markings/sec, 575 secs
lola: sara is running 580 secs || 163126 markings, 216197 edges, 284 markings/sec, 580 secs
lola: sara is running 585 secs || 164422 markings, 218281 edges, 259 markings/sec, 585 secs
lola: sara is running 590 secs || 165930 markings, 220791 edges, 302 markings/sec, 590 secs
lola: sara is running 595 secs || 167573 markings, 223241 edges, 329 markings/sec, 595 secs
lola: sara is running 600 secs || 168916 markings, 224811 edges, 269 markings/sec, 600 secs
lola: sara is running 605 secs || 170109 markings, 226455 edges, 239 markings/sec, 605 secs
lola: sara is running 610 secs || 171356 markings, 228175 edges, 249 markings/sec, 610 secs
lola: sara is running 615 secs || 172431 markings, 229617 edges, 215 markings/sec, 615 secs
lola: sara is running 620 secs || 173740 markings, 231530 edges, 262 markings/sec, 620 secs
lola: sara is running 625 secs || 174922 markings, 233159 edges, 236 markings/sec, 625 secs
lola: sara is running 630 secs || 176206 markings, 234828 edges, 257 markings/sec, 630 secs
lola: sara is running 635 secs || 177539 markings, 236524 edges, 267 markings/sec, 635 secs
lola: sara is running 640 secs || 178641 markings, 238014 edges, 220 markings/sec, 640 secs
lola: sara is running 645 secs || 179895 markings, 239691 edges, 251 markings/sec, 645 secs
lola: sara is running 650 secs || 180994 markings, 241204 edges, 220 markings/sec, 650 secs
lola: sara is running 655 secs || 182269 markings, 243017 edges, 255 markings/sec, 655 secs
lola: sara is running 660 secs || 183591 markings, 244783 edges, 264 markings/sec, 660 secs
lola: sara is running 665 secs || 184790 markings, 246411 edges, 240 markings/sec, 665 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1188 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p302 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) AND (p286 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14) AND ((2 <= p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347) OR (p285 <= p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + ... (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 2224 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 2377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p620 + p619 + p618 + p617 + p616 + p615 + p614 + p613 + p612 + p611 + p610 + p609 + p608 + p607 + p606 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18 + p17 + p16 + p15) OR ((1 <= p588) AND (2 <= p588)) OR (3 <= p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605))))
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 2224 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1773 markings, 1840 edges, 355 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown no yes yes no yes no no yes yes no yes yes
FORMULA SafeBus-COL-15-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA SafeBus-COL-15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="SafeBus-COL-15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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/SafeBus-COL-15.tgz
mv SafeBus-COL-15 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 irma4mcc-structural"
echo " Input is SafeBus-COL-15, 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 r151-smll-152685549700201"
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 '
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 ;