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 268K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 19K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBNT-COL-S05J40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-152673533000276
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526981458420


BK_STOP 1526982095972

--------------------
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 PolyORBNT-COL-S05J40 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, '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': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1014809, 'Memory': 15944.45, 'Tool': 'lola'}, {'Time': 1092941, 'Memory': 15937.21, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-COL-S05J40...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBNT-COL-S05J40: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J40: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBNT-COL-S05J40 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2299/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 669 places, 1630 transitions, 567 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1208 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J40-CTLCardinality.task
lola: A (F ((((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 <= 1) AND (p223 <= p6)) AND A (X ((3 <= p222)))))) : E (G (A (G ((p236 <= 0))))) : (E (X (((p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + 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 <= p285) OR ((2 <= p237 + p238 + p239 + p240 + p241) AND (2 <= p6))))) AND A (F ((3 <= p225)))) : (A (G ((((p214 <= p417) OR (p229 <= p220)) AND (p284 <= p230 + p231 + p232 + p233 + p234)))) OR ((E (X ((2 <= p223))) AND ((p3 <= 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) AND (2 <= p236) AND (p0 <= p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89) AND (p225 <= p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p668))) AND ((p215 + p216 + p217 + p218 + p219 <= p1) OR (p375 + 1 <= p624)))) : NOT(E (G ((2 <= p230 + p231 + p232 + p233 + p234)))) : A (F ((A (F ((2 <= p172))) AND A (F ((1 <= p627)))))) : (E (F (((p230 + p231 + p232 + p233 + p234 + 1 <= p0) AND (p419 + p420 + p421 + p422 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p434 + p435 + p436 + p437 + p439 + p440 + p441 + p442 + p444 + p445 + p446 + p447 + p449 + p450 + p451 + p452 + p454 + p455 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p465 + p466 + p467 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p489 + p490 + p491 + p492 + p494 + p495 + p496 + p497 + p499 + p500 + p501 + p502 + p504 + p505 + p506 + p507 + p509 + p510 + p511 + p512 + p514 + p515 + p516 + p517 + p519 + p520 + p521 + p522 + p524 + p525 + p526 + p527 + p529 + p530 + p531 + p532 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p544 + p545 + p546 + p547 + p549 + p550 + p551 + p552 + p554 + p555 + p556 + p557 + p559 + p560 + p561 + p562 + p564 + p565 + p566 + p567 + p569 + p570 + p571 + p572 + p574 + p575 + p576 + p577 + p579 + p580 + p581 + p582 + p584 + p585 + p586 + p587 + p589 + p590 + p591 + p592 + p594 + p595 + p596 + p597 + p599 + p600 + p601 + p602 + p604 + p605 + p606 + p607 + p609 + p610 + p611 + p612 + p614 + p615 + p616 + p617 + p623 + p622 + p621 + p620 + p619 + p618 + p613 + p608 + p603 + p598 + p593 + p588 + p583 + p578 + p573 + p568 + p563 + p558 + p553 + p548 + p543 + p538 + p533 + p528 + p523 + p518 + p513 + p508 + p503 + p498 + p493 + p488 + p483 + p478 + p473 + p468 + p463 + p458 + p453 + p448 + p443 + p438 + p433 + p428 + p423 + 1 <= p291)))) OR A (G (E (G ((p3 <= p237 + p238 + p239 + p240 + p241)))))) : A (X ((A (G ((p2 <= p215 + p216 + p217 + p218 + p219))) AND E (F ((p418 <= p374)))))) : A (G (((p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p668 <= p227) OR (p229 <= p227) OR ((p221 <= p5) AND (p214 <= 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)) OR (1 <= p284)))) : (((2 <= p235) AND NOT(A (G ((p220 <= p222))))) AND A (((p48 <= p283) U ((2 <= 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) OR (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 <= p221))))) : E (F (A (((1 <= p225) U (2 <= p225))))) : E (F (NOT(E (G ((p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 <= p624)))))) : A (G ((A (X ((2 <= p214))) OR (2 <= p625)))) : E (((p291 <= 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) U A (F ((3 <= 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))))) : NOT(E ((((p172 <= p624) AND (p224 <= p236)) U ((3 <= p7 + p8 + p9 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p47) AND (p223 <= p230 + p231 + p232 + p233 + p234))))) : A (F (((((3 <= p284) AND (1 <= p221)) OR (3 <= 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 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND (2 <= p226))))
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 (F ((((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 <= 1) AND (p223 <= p6)) AND A (X ((3 <= p222))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((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 <= 1) AND (p223 <= p6)) AND AX((3 <= p222))))
lola: processed formula length: 342
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((p236 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (1 <= p236))))
lola: processed formula length: 36
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 583620 markings, 1234981 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1150898 markings, 2447934 edges, 113456 markings/sec, 5 secs
lola: 1715664 markings, 3655310 edges, 112953 markings/sec, 10 secs
lola: 2281749 markings, 4854114 edges, 113217 markings/sec, 15 secs
lola: 2838767 markings, 6050596 edges, 111404 markings/sec, 20 secs
lola: 3395150 markings, 7239159 edges, 111277 markings/sec, 25 secs
lola: 3953443 markings, 8424112 edges, 111659 markings/sec, 30 secs
lola: 4506355 markings, 9608214 edges, 110582 markings/sec, 35 secs
lola: 5056979 markings, 10783810 edges, 110125 markings/sec, 40 secs
lola: 5584413 markings, 11911973 edges, 105487 markings/sec, 45 secs
lola: 6107236 markings, 13029133 edges, 104565 markings/sec, 50 secs
lola: 6618583 markings, 14118593 edges, 102269 markings/sec, 55 secs
lola: 6762345 markings, 15543246 edges, 28752 markings/sec, 60 secs
lola: 7156804 markings, 16801480 edges, 78892 markings/sec, 65 secs
lola: 7587672 markings, 18040493 edges, 86174 markings/sec, 70 secs
lola: 8015973 markings, 19288589 edges, 85660 markings/sec, 75 secs
lola: 8447311 markings, 20531128 edges, 86268 markings/sec, 80 secs
lola: 8872138 markings, 21767768 edges, 84965 markings/sec, 85 secs
lola: 9297989 markings, 22997526 edges, 85170 markings/sec, 90 secs
lola: 9719081 markings, 24210456 edges, 84218 markings/sec, 95 secs
lola: 10119172 markings, 25379208 edges, 80018 markings/sec, 100 secs
lola: 10513375 markings, 26521265 edges, 78841 markings/sec, 105 secs
lola: 10708117 markings, 27825602 edges, 38948 markings/sec, 110 secs
lola: 11242704 markings, 28975001 edges, 106917 markings/sec, 115 secs
lola: 11692159 markings, 30030355 edges, 89891 markings/sec, 120 secs
lola: 12201446 markings, 31171860 edges, 101857 markings/sec, 125 secs
lola: 12721511 markings, 32298679 edges, 104013 markings/sec, 130 secs
lola: 13224076 markings, 33437573 edges, 100513 markings/sec, 135 secs
lola: 13735110 markings, 34580778 edges, 102207 markings/sec, 140 secs
lola: 14245850 markings, 35717149 edges, 102148 markings/sec, 145 secs
lola: 14758837 markings, 36850603 edges, 102597 markings/sec, 150 secs
lola: 15251386 markings, 38003301 edges, 98510 markings/sec, 155 secs
lola: 15769686 markings, 39134165 edges, 103660 markings/sec, 160 secs
lola: 16292255 markings, 40260890 edges, 104514 markings/sec, 165 secs
lola: 16770266 markings, 41421793 edges, 95602 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 240 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 240 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p34... (shortened)
lola: processed formula length: 647
lola: 1 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p225)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p225)))
lola: processed formula: A (F ((3 <= p225)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p214 <= p417) OR (p229 <= p220)) AND (p284 <= p230 + p231 + p232 + p233 + p234)))) OR ((E (X ((2 <= p223))) AND ((p3 <= 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 + p16... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p214 <= p417) OR (p229 <= p220)) AND (p284 <= p230 + p231 + p232 + p233 + p234))))
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 2268 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 35 edges
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p223)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p223))
lola: processed formula length: 15
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p3 <= 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) AND (2 <= p236) AND (p0 <= p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p58 + p59 + p60 + p61 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p3 <= 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) AND (2 <= p236) AND (p0 <= p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p58 + p59 + p60 + p61 + ... (shortened)
lola: processed formula length: 937
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: processed formula with 6 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((2 <= p230 + p231 + p232 + p233 + p234))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p230 + p231 + p232 + p233 + p234 <= 1)))
lola: processed formula: A (F ((p230 + p231 + p232 + p233 + p234 <= 1)))
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 73 edges
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((2 <= p172))) AND A (F ((1 <= p627))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (2 <= p172)) AND A(TRUE U (1 <= p627))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 37 edges
lola: ========================================
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p230 + p231 + p232 + p233 + p234 + 1 <= p0) AND (p419 + p420 + p421 + p422 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p434 + p435 + p436 + p437 + p439 + p440 + p441 + p442 + p444 + p445 + p446 + p447 + p449 + p450 + p451 + p452 + p454 + p455 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p465 + p466 + p467 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p479 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p230 + p231 + p232 + p233 + p234 + 1 <= p0) AND (p419 + p420 + p421 + p422 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p434 + p435 + p436 + p437 + p439 + p440 + p441 + p442 + p444 + p445 + p446 + p447 + p449 + p450 + p451 + p452 + p454 + p455 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p465 + p466 + p467 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p479 + ... (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 2268 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 PolyORBNT-COL-S05J40-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((p2 <= p215 + p216 + p217 + p218 + p219))) AND E (F ((p418 <= p374))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p2 <= p215 + p216 + p217 + p218 + p219)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((p2 <= p215 + p216 + p217 + p218 + p219)))))
lola: processed formula: A (X (A (G ((p2 <= p215 + p216 + p217 + p218 + p219)))))
lola: processed formula length: 56
lola: 1 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 563160 markings, 1395176 edges, 112632 markings/sec, 0 secs
lola: 1132738 markings, 2810042 edges, 113916 markings/sec, 5 secs
lola: 1700421 markings, 4219800 edges, 113537 markings/sec, 10 secs
lola: 2261227 markings, 5619967 edges, 112161 markings/sec, 15 secs
lola: 2821495 markings, 7014751 edges, 112054 markings/sec, 20 secs
lola: 3374305 markings, 8398171 edges, 110562 markings/sec, 25 secs
lola: 3930608 markings, 9767842 edges, 111261 markings/sec, 30 secs
lola: 4484095 markings, 11131809 edges, 110697 markings/sec, 35 secs
lola: 5024625 markings, 12494918 edges, 108106 markings/sec, 40 secs
lola: 5554749 markings, 13815118 edges, 106025 markings/sec, 45 secs
lola: 6072994 markings, 15104476 edges, 103649 markings/sec, 50 secs
lola: 6584747 markings, 16376861 edges, 102351 markings/sec, 55 secs
lola: 6973422 markings, 17702120 edges, 77735 markings/sec, 60 secs
lola: 7089358 markings, 19349724 edges, 23187 markings/sec, 65 secs
lola: 7508800 markings, 20765583 edges, 83888 markings/sec, 70 secs
lola: 7927738 markings, 22183029 edges, 83788 markings/sec, 75 secs
lola: 8350836 markings, 23601621 edges, 84620 markings/sec, 80 secs
lola: 8769343 markings, 25016965 edges, 83701 markings/sec, 85 secs
lola: 9186432 markings, 26427794 edges, 83418 markings/sec, 90 secs
lola: 9603658 markings, 27830137 edges, 83445 markings/sec, 95 secs
lola: 10018867 markings, 29226819 edges, 83042 markings/sec, 100 secs
lola: 10414037 markings, 30565269 edges, 79034 markings/sec, 105 secs
lola: 10807584 markings, 31886418 edges, 78709 markings/sec, 110 secs
lola: 11104422 markings, 33225291 edges, 59368 markings/sec, 115 secs
lola: 11321453 markings, 34670574 edges, 43406 markings/sec, 120 secs
lola: 11716734 markings, 35973046 edges, 79056 markings/sec, 125 secs
lola: 12111016 markings, 37270042 edges, 78856 markings/sec, 130 secs
lola: 12502889 markings, 38560214 edges, 78375 markings/sec, 135 secs
lola: 12877226 markings, 39800249 edges, 74867 markings/sec, 140 secs
lola: 13107445 markings, 41121802 edges, 46044 markings/sec, 145 secs
lola: 13660472 markings, 42493595 edges, 110605 markings/sec, 150 secs
lola: 14133961 markings, 43809415 edges, 94698 markings/sec, 155 secs
lola: 14647196 markings, 45117909 edges, 102647 markings/sec, 160 secs
lola: 15144762 markings, 46405172 edges, 99513 markings/sec, 165 secs
lola: 15626904 markings, 47695177 edges, 96428 markings/sec, 170 secs
lola: 16131854 markings, 49004444 edges, 100990 markings/sec, 175 secs
lola: 16627660 markings, 50284365 edges, 99161 markings/sec, 180 secs
lola: 16758247 markings, 50656869 edges, 26117 markings/sec, 185 secs
lola: 16758257 markings, 50656896 edges, 2 markings/sec, 190 secs
lola: 16758652 markings, 50657956 edges, 79 markings/sec, 195 secs
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: '
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p668 <= p227) OR (p229 <= p227) OR ((p221 <= p5) AND (p214 <= p376 + p377 + p378 + p379 + p380 + p381 + p382 +... (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 2268 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 PolyORBNT-COL-S05J40-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 749 markings, 886 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p235) AND NOT(A (G ((p220 <= p222))))) AND A (((p48 <= p283) U ((2 <= 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) OR (p57 + p56 + p55 + p54 + p53 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p235)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p235)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p222 + 1 <= p220)))
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 2268 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 PolyORBNT-COL-S05J40-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 48853 markings, 57823 edges, 9771 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 70702 markings, 87338 edges
lola: ========================================
lola: subprocess 11 will run for 627 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p48 <= p283) U ((2 <= 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) OR (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p58 + p59 + p60 + p61 + p62 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p48 <= p283) U ((2 <= 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) OR (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 <= p221))))
lola: processed formula: A (((p48 <= p283) U ((2 <= 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) OR (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p58 + p59 + p60 + p61 + p62 ... (shortened)
lola: processed formula length: 573
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 522 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p225) U (2 <= p225)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((1 <= p225) U (2 <= p225)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 507180 markings, 1587818 edges, 3067840576268271616 markings/sec, 0 secs
lola: 1006047 markings, 3146875 edges, 99773 markings/sec, 5 secs
lola: 1502022 markings, 4700583 edges, 99195 markings/sec, 10 secs
lola: 1995721 markings, 6246981 edges, 98740 markings/sec, 15 secs
lola: 2487827 markings, 7788215 edges, 98421 markings/sec, 20 secs
lola: 2981927 markings, 9322647 edges, 98820 markings/sec, 25 secs
lola: 3468366 markings, 10852255 edges, 97288 markings/sec, 30 secs
lola: 3952200 markings, 12374039 edges, 96767 markings/sec, 35 secs
lola: 4435271 markings, 13893935 edges, 96614 markings/sec, 40 secs
lola: 4916936 markings, 15408356 edges, 96333 markings/sec, 45 secs
lola: 5382639 markings, 16867475 edges, 93141 markings/sec, 50 secs
lola: 5845394 markings, 18310710 edges, 92551 markings/sec, 55 secs
lola: 6299862 markings, 19733433 edges, 90894 markings/sec, 60 secs
lola: 6725660 markings, 21131330 edges, 85160 markings/sec, 65 secs
lola: 6833223 markings, 22686056 edges, 21513 markings/sec, 70 secs
lola: 7215037 markings, 24174291 edges, 76363 markings/sec, 75 secs
lola: 7594287 markings, 25652865 edges, 75850 markings/sec, 80 secs
lola: 7972759 markings, 27128337 edges, 75694 markings/sec, 85 secs
lola: 8352120 markings, 28607368 edges, 75872 markings/sec, 90 secs
lola: 8728474 markings, 30075188 edges, 75271 markings/sec, 95 secs
lola: 9104484 markings, 31541850 edges, 75202 markings/sec, 100 secs
lola: 9483247 markings, 33018674 edges, 75753 markings/sec, 105 secs
lola: 9851216 markings, 34455285 edges, 73594 markings/sec, 110 secs
lola: 10212590 markings, 35862223 edges, 72275 markings/sec, 115 secs
lola: 10568127 markings, 37240544 edges, 71107 markings/sec, 120 secs
lola: 10759180 markings, 38691736 edges, 38211 markings/sec, 125 secs
lola: 11231258 markings, 40148481 edges, 94416 markings/sec, 130 secs
lola: 11621023 markings, 41517183 edges, 77953 markings/sec, 135 secs
lola: 12055273 markings, 42867865 edges, 86850 markings/sec, 140 secs
lola: 12466950 markings, 44217713 edges, 82335 markings/sec, 145 secs
lola: 12883095 markings, 45582676 edges, 83229 markings/sec, 150 secs
lola: 13319679 markings, 46937929 edges, 87317 markings/sec, 155 secs
lola: 13725466 markings, 48288526 edges, 81157 markings/sec, 160 secs
lola: 14165394 markings, 49646059 edges, 87986 markings/sec, 165 secs
lola: 14548664 markings, 50996565 edges, 76654 markings/sec, 170 secs
lola: 14979588 markings, 52339923 edges, 86185 markings/sec, 175 secs
lola: 15389344 markings, 53688343 edges, 81951 markings/sec, 180 secs
lola: 15805187 markings, 55044098 edges, 83169 markings/sec, 185 secs
lola: 16233908 markings, 56384826 edges, 85744 markings/sec, 190 secs
lola: 16640437 markings, 57738336 edges, 81306 markings/sec, 195 secs
lola: 17082365 markings, 59092760 edges, 88386 markings/sec, 200 secs
lola: 17141789 markings, 59340483 edges, 11885 markings/sec, 205 secs
lola: 17141804 markings, 59340530 edges, 3 markings/sec, 210 secs
lola: 17141824 markings, 59340593 edges, 4 markings/sec, 215 secs
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 PolyORBNT-COL-S05J40-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="CTLCardinality"
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/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 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 PolyORBNT-COL-S05J40, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-152673533000276"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;