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 272K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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.9K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 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 lola
Input is PolyORBNT-COL-S10J40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257800439
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528087287751

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBNT-COL-S10J40 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBNT-COL-S10J40 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PolyORBNT-COL-S10J40 @ 3565 seconds
lola: LoLA will run for 3565 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13274/65536 symbol table entries, 4118 collisions
lola: preprocessing...
lola: Size of bit vector: 28608
lola: finding significant places
lola: 894 places, 12380 transitions, 782 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2738 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J40-LTLCardinality.task
lola: LP says that atomic proposition is always false: (p836 <= 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 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)
lola: LP says that atomic proposition is always false: (3 <= 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)
lola: LP says that atomic proposition is always false: (2 <= p57)
lola: LP says that atomic proposition is always false: (3 <= p115)
lola: LP says that atomic proposition is always true: (p0 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)
lola: LP says that atomic proposition is always true: (p849 <= 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)
lola: A (G (G (((p115 <= p251) U (1 <= p251))))) : A (F (G ((FALSE U (1 <= p750))))) : A ((X (X ((p293 <= 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))) U (1 <= p0))) : A ((F (G (FALSE)) U ((p55 <= p126) U (p893 <= 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 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292)))) : A (((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U X ((p891 + p890 + p889 + p888 + p887 + p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 <= p71)))) : A ((FALSE U G (F ((1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125))))) : A (F (F (((p294 <= p850) U (p750 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p737 + p727 + p717 + p707 + p697 + p687 + p677 + p667 + p657 + p647 + p637 + p627 + p617 + p607 + p597 + p587 + p577 + p567 + p557 + p547 + p537 + p527 + p517 + p507 + p497 + p487 + p477 + p467 + p457 + p447 + p437 + p427 + p417 + p407 + p397 + p387 + p377 + p367 + p357 + p347))))) : A (F (X (((p72 <= p849) U FALSE)))) : A (F ((2 <= p0))) : A ((F (X ((2 <= p294))) U G (X ((p71 <= p251))))) : A ((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 <= p838)) : A (G ((1 <= p837))) : A (G (F (G (F ((p847 + p848 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 <= p115)))))) : A (TRUE) : A ((F ((p837 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p737 + p727 + p717 + p707 + p697 + p687 + p677 + p667 + p657 + p647 + p637 + p627 + p617 + p607 + p597 + p587 + p577 + p567 + p557 + p547 + p537 + p527 + p517 + p507 + p497 + p487 + p477 + p467 + p457 + p447 + p437 + p427 + p417 + p407 + p397 + p387 + p377 + p367 + p357 + p347)) U G ((1 <= p850)))) : A (X (TRUE))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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 <= p838)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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 <= p838)
lola: processed formula length: 294
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.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: ========================================

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

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= p294)) U G ((p71 <= p251)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= p294)) U G ((p71 <= p251)))))
lola: processed formula length: 45
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 282 markings, 1041 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U X ((p891 + p890 + p889 + p888 + p887 + p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U X ((p891 + p890 + p889 + p888 + p887 + p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 ... (shortened)
lola: processed formula length: 571
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 23 markings, 22 edges
lola:
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p293 <= 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))) U (1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((p293 <= 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))) U (1 <= p0)))
lola: processed formula length: 320
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 18 markings, 18 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 12 markings, 11 edges
lola: ========================================

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

lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p0 <= 1)
lola: processed formula length: 9
lola: 30 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p750 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p398 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p398 + p399 + p400 + ... (shortened)
lola: processed formula length: 2881
lola: 30 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p750))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p750))))
lola: processed formula length: 23
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 19 markings, 20 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125))))
lola: processed formula length: 86
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 18 markings, 18 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p847 + p848 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 <= p115))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p847 + p848 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 <= p115))))
lola: processed formula length: 89
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 38 markings, 40 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p837 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p398 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p837 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p398 +... (shortened)
lola: processed formula length: 2905
lola: 28 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 19 markings, 20 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p55 <= p126) U (p893 <= 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 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((p55 <= p126) U (p893 <= 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 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292)))
lola: processed formula length: 316
lola: 32 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= p251)))) AND A (G (((p115 <= p251) OR (1 <= p251)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p115 <= p251) OR (1 <= p251))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G (((p115 <= p251) OR (1 <= p251))))
lola: processed formula length: 39
lola: 33 rewrites
lola: closed formula file PolyORBNT-COL-S10J40-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p251 + 1 <= p115) AND (p251 <= 0))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBNT-COL-S10J40-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes no no no yes no no yes no yes
lola:
preliminary result: no no no yes yes no yes no no no yes no no yes no yes
lola: memory consumption: 91140 KB
lola: time consumption: 178 seconds

BK_STOP 1528087470196

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J40"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PolyORBNT-COL-S10J40, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732257800439"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;