fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r214-smll-152732265500371
Last Updated
June 26, 2018

About the Execution of M4M.full for PolyORBLF-COL-S04J06T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2199.490 318451.00 279718.00 1556.30 TTT?TFFFFTFFTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 4.4K 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 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 5.9K 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 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 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.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-COL-S04J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265500371
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527463429440


BK_STOP 1527463747891

--------------------
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 PolyORBLF-COL-S04J06T06 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 120892, 'Memory': 400, 'Tool': 'lola'}, {'Time': 130224, 'Memory': 551, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-COL-S04J06T06...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S04J06T06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S04J06T06: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-COL-S04J06T06 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 3808/65536 symbol table entries, 459 collisions
lola: preprocessing...
lola: finding significant places
lola: 618 places, 3190 transitions, 564 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2157 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: A ((p606 + p607 + p608 + p609 + p610 + p611 <= p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217)) : A (X (((3 <= p18) U X ((2 <= p241 + p242 + p243 + p244 + p245 + p246))))) : A ((p178 + p179 + p180 + p181 + p182 + p183 <= p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496)) : A (G ((G ((2 <= p605)) U F ((p32 + p33 + p34 + p35 + p36 + p37 <= p579))))) : A (F (((3 <= p417 + p418 + p419 + p421 + p422 + p423 + p425 + p426 + p427 + p429 + p430 + p431 + p433 + p434 + p435 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p440 + p436 + p432 + p428 + p424 + p420) U F ((p298 + p299 + p300 + p301 + p302 + p303 <= p597 + p596 + p595 + p594))))) : A (X (((p612 + p613 + p614 + p615 + p616 + p617 <= p6 + p7 + p8 + p9 + p10 + p11) U X ((1 <= p218 + p219 + p220 + p221 + p222 + p223))))) : A (X ((G ((2 <= p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)) U F ((3 <= p559 + p560 + p561 + p562 + p563 + p564 + p565))))) : A ((p224 + p225 + p226 + p227 <= p304 + p305 + p306 + p307 + p308 + p309)) : A ((((1 <= p580) U (1 <= p100 + p101 + p102 + p103 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p558))))) : A (F ((p552 + p553 + p554 + p555 + p556 + p557 <= p573 + p574 + p575 + p576 + p577 + p578))) : A ((((2 <= p310 + p311 + p312 + p313 + p314 + p315) U (p166 <= p552 + p553 + p554 + p555 + p556 + p557)) U X (G ((p445 + p446 + p447 + p448 + p449 + p450 <= 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 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388))))) : A ((2 <= p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)) : A (X ((X ((2 <= p235 + p236 + p237 + p238 + p239 + p240)) U F ((p580 <= p135))))) : A (((p546 + p547 + p548 + p549 + p550 + p551 <= p235 + p236 + p237 + p238 + p239 + p240) U (2 <= p32 + p33 + p34 + p35 + p36 + p37))) : A ((1 <= p612 + p613 + p614 + p615 + p616 + p617)) : A ((p123 + p124 + p125 + p126 + p127 + p128 <= p552 + p553 + p554 + p555 + p556 + p557))
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 ((p606 + p607 + p608 + p609 + p610 + p611 <= p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p606 + p607 + p608 + p609 + p610 + p611 <= p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217)
lola: processed formula length: 210
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= p18) U X ((2 <= p241 + p242 + p243 + p244 + p245 + p246)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((3 <= p18) U X ((2 <= p241 + p242 + p243 + p244 + p245 + p246)))))
lola: processed formula: A (X (((3 <= p18) U X ((2 <= p241 + p242 + p243 + p244 + p245 + p246)))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
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: 25 markings, 36 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p178 + p179 + p180 + p181 + p182 + p183 <= p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p178 + p179 + p180 + p181 + p182 + p183 <= p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496)
lola: processed formula length: 336
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((2 <= p605)) U F ((p32 + p33 + p34 + p35 + p36 + p37 <= p579)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((2 <= p605)) U F ((p32 + p33 + p34 + p35 + p36 + p37 <= p579)))))
lola: processed formula: A (G ((G ((2 <= p605)) U F ((p32 + p33 + p34 + p35 + p36 + p37 <= p579)))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 23748 markings, 26430 edges, 4750 markings/sec, 0 secs
lola: 47467 markings, 53781 edges, 4744 markings/sec, 5 secs
lola: 70592 markings, 81486 edges, 4625 markings/sec, 10 secs
lola: 94241 markings, 109816 edges, 4730 markings/sec, 15 secs
lola: 117639 markings, 137733 edges, 4680 markings/sec, 20 secs
lola: 141091 markings, 166438 edges, 4690 markings/sec, 25 secs
lola: 164441 markings, 195148 edges, 4670 markings/sec, 30 secs
lola: 187583 markings, 223445 edges, 4628 markings/sec, 35 secs
lola: 210848 markings, 251707 edges, 4653 markings/sec, 40 secs
lola: 234691 markings, 280600 edges, 4769 markings/sec, 45 secs
lola: 257934 markings, 310060 edges, 4649 markings/sec, 50 secs
lola: 281306 markings, 338728 edges, 4674 markings/sec, 55 secs
lola: 303865 markings, 366494 edges, 4512 markings/sec, 60 secs
lola: 327788 markings, 395841 edges, 4785 markings/sec, 65 secs
lola: 351600 markings, 424630 edges, 4762 markings/sec, 70 secs
lola: 375643 markings, 453584 edges, 4809 markings/sec, 75 secs
lola: 399607 markings, 483067 edges, 4793 markings/sec, 80 secs
lola: 423713 markings, 512554 edges, 4821 markings/sec, 85 secs
lola: 447794 markings, 542099 edges, 4816 markings/sec, 90 secs
lola: 471470 markings, 572162 edges, 4735 markings/sec, 95 secs
lola: 495482 markings, 602337 edges, 4802 markings/sec, 100 secs
lola: 519713 markings, 632451 edges, 4846 markings/sec, 105 secs
lola: 543541 markings, 663354 edges, 4766 markings/sec, 110 secs
lola: 567455 markings, 693651 edges, 4783 markings/sec, 115 secs
lola: 591429 markings, 723610 edges, 4795 markings/sec, 120 secs
lola: 615570 markings, 753354 edges, 4828 markings/sec, 125 secs
lola: 639356 markings, 782859 edges, 4757 markings/sec, 130 secs
lola: 663608 markings, 813927 edges, 4850 markings/sec, 135 secs
lola: 687508 markings, 844743 edges, 4780 markings/sec, 140 secs
lola: 711424 markings, 875171 edges, 4783 markings/sec, 145 secs
lola: 735256 markings, 904569 edges, 4766 markings/sec, 150 secs
lola: 757096 markings, 931762 edges, 4368 markings/sec, 155 secs
lola: 781090 markings, 961427 edges, 4799 markings/sec, 160 secs
lola: 804861 markings, 991835 edges, 4754 markings/sec, 165 secs
lola: 829315 markings, 1022224 edges, 4891 markings/sec, 170 secs
lola: 853589 markings, 1052608 edges, 4855 markings/sec, 175 secs
lola: 877257 markings, 1083703 edges, 4734 markings/sec, 180 secs
lola: 901639 markings, 1114039 edges, 4876 markings/sec, 185 secs
lola: 925649 markings, 1144245 edges, 4802 markings/sec, 190 secs
lola: 949716 markings, 1175131 edges, 4813 markings/sec, 195 secs
lola: 973266 markings, 1205781 edges, 4710 markings/sec, 200 secs
lola: 997134 markings, 1236413 edges, 4774 markings/sec, 205 secs
lola: 1020907 markings, 1267534 edges, 4755 markings/sec, 210 secs
lola: 1044752 markings, 1298061 edges, 4769 markings/sec, 215 secs
lola: 1069121 markings, 1328399 edges, 4874 markings/sec, 220 secs
lola: 1092913 markings, 1359059 edges, 4758 markings/sec, 225 secs
lola: 1116936 markings, 1390102 edges, 4805 markings/sec, 230 secs
lola: 1141022 markings, 1419994 edges, 4817 markings/sec, 235 secs
lola: 1165134 markings, 1450326 edges, 4822 markings/sec, 240 secs
lola: 1189191 markings, 1480923 edges, 4811 markings/sec, 245 secs
lola: 1212812 markings, 1512321 edges, 4724 markings/sec, 250 secs
lola: 1236938 markings, 1543063 edges, 4825 markings/sec, 255 secs
lola: 1261055 markings, 1574042 edges, 4823 markings/sec, 260 secs
lola: 1283670 markings, 1602660 edges, 4523 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p417 + p418 + p419 + p421 + p422 + p423 + p425 + p426 + p427 + p429 + p430 + p431 + p433 + p434 + p435 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p440 + p436 + p432 + p428 + p424 + p420) U F ((p298 + p299 + p300 + p301 + p302 + p303 <= p597 + p596 + p595 + p594)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p417 + p418 + p419 + p421 + p422 + p423 + p425 + p426 + p427 + p429 + p430 + p431 + p433 + p434 + p435 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p440 + p436 + p432 + p428 + p424 + p420) U F ((p298 + p299 + p300 + p301 + p302 + p303 <= p597 + p596 + p595 + p594)))))
lola: processed formula: A (F (((3 <= p417 + p418 + p419 + p421 + p422 + p423 + p425 + p426 + p427 + p429 + p430 + p431 + p433 + p434 + p435 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p440 + p436 + p432 + p428 + p424 + p420) U F ((p298 + p299 + p300 + p301 + p302 + p303 <= p597 + p596 + p595 + p594)))))
lola: processed formula length: 287
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 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: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p612 + p613 + p614 + p615 + p616 + p617 <= p6 + p7 + p8 + p9 + p10 + p11) U X ((1 <= p218 + p219 + p220 + p221 + p222 + p223)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p612 + p613 + p614 + p615 + p616 + p617 <= p6 + p7 + p8 + p9 + p10 + p11) U X ((1 <= p218 + p219 + p220 + p221 + p222 + p223)))))
lola: processed formula: A (X (((p612 + p613 + p614 + p615 + p616 + p617 <= p6 + p7 + p8 + p9 + p10 + p11) U X ((1 <= p218 + p219 + p220 + p221 + p222 + p223)))))
lola: processed formula length: 137
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
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: 590 markings, 590 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((2 <= p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)) U F ((3 <= p559 + p560 + p561 + p562 + p563 + p564 + p565)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((2 <= p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)) U F ((3 <= p559 + p560 + p561 + p562 + p563 + p564 + p565)))))
lola: processed formula: A (X ((G ((2 <= p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)) U F ((3 <= p559 + p560 + p561 + p562 + p563 + p564 + p565)))))
lola: processed formula length: 372
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 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: 590 markings, 590 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p224 + p225 + p226 + p227 <= p304 + p305 + p306 + p307 + p308 + p309))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p224 + p225 + p226 + p227 <= p304 + p305 + p306 + p307 + p308 + p309)
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p580) U (1 <= p100 + p101 + p102 + p103 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p558)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p580) U (1 <= p100 + p101 + p102 + p103 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p558)))))
lola: processed formula: A ((((1 <= p580) U (1 <= p100 + p101 + p102 + p103 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p558)))))
lola: processed formula length: 304
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 28 unused bits
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: 590 markings, 590 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p552 + p553 + p554 + p555 + p556 + p557 <= p573 + p574 + p575 + p576 + p577 + p578)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p552 + p553 + p554 + p555 + p556 + p557 <= p573 + p574 + p575 + p576 + p577 + p578)))
lola: processed formula: A (F ((p552 + p553 + p554 + p555 + p556 + p557 <= p573 + p574 + p575 + p576 + p577 + p578)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 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: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p310 + p311 + p312 + p313 + p314 + p315) U (p166 <= p552 + p553 + p554 + p555 + p556 + p557)) U X (G ((p445 + p446 + p447 + p448 + p449 + p450 <= 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 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= p310 + p311 + p312 + p313 + p314 + p315) U (p166 <= p552 + p553 + p554 + p555 + p556 + p557)) U X (G ((p445 + p446 + p447 + p448 + p449 + p450 <= 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 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388)))))
lola: processed formula: A ((((2 <= p310 + p311 + p312 + p313 + p314 + p315) U (p166 <= p552 + p553 + p554 + p555 + p556 + p557)) U X (G ((p445 + p446 + p447 + p448 + p449 + p450 <= 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 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 ... (shortened)
lola: processed formula length: 453
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
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: 1936 markings, 1947 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)
lola: processed formula length: 298
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((2 <= p235 + p236 + p237 + p238 + p239 + p240)) U F ((p580 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= p235 + p236 + p237 + p238 + p239 + p240)) U F ((p580 <= p135)))))
lola: processed formula: A (X ((X ((2 <= p235 + p236 + p237 + p238 + p239 + p240)) U F ((p580 <= p135)))))
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p546 + p547 + p548 + p549 + p550 + p551 <= p235 + p236 + p237 + p238 + p239 + p240) U (2 <= p32 + p33 + p34 + p35 + p36 + p37)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p546 + p547 + p548 + p549 + p550 + p551 <= p235 + p236 + p237 + p238 + p239 + p240) U (2 <= p32 + p33 + p34 + p35 + p36 + p37)))
lola: processed formula: A (((p546 + p547 + p548 + p549 + p550 + p551 <= p235 + p236 + p237 + p238 + p239 + p240) U (2 <= p32 + p33 + p34 + p35 + p36 + p37)))
lola: processed formula length: 133
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1181 markings, 1181 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p612 + p613 + p614 + p615 + p616 + p617))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p612 + p613 + p614 + p615 + p616 + p617)
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-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: ========================================
lola: subprocess 15 will run for 3267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p123 + p124 + p125 + p126 + p127 + p128 <= p552 + p553 + p554 + p555 + p556 + p557))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p123 + p124 + p125 + p126 + p127 + p128 <= p552 + p553 + p554 + p555 + p556 + p557)
lola: processed formula length: 84
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-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: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes unknown yes no no no no yes no no yes no yes yes
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-15 TRUE 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="PolyORBLF-COL-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
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/PolyORBLF-COL-S04J06T06.tgz
mv PolyORBLF-COL-S04J06T06 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 PolyORBLF-COL-S04J06T06, 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 r214-smll-152732265500371"
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 ;