fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r227-tall-162098231300398
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldPPPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9324.743 3600000.00 3629889.00 13090.90 FFTFFFFF?FFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231300398.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldPPPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231300398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 376K May 5 16:52 model.pnml

--------------------
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 ShieldPPPt-PT-020B-00
FORMULA_NAME ShieldPPPt-PT-020B-01
FORMULA_NAME ShieldPPPt-PT-020B-02
FORMULA_NAME ShieldPPPt-PT-020B-03
FORMULA_NAME ShieldPPPt-PT-020B-04
FORMULA_NAME ShieldPPPt-PT-020B-05
FORMULA_NAME ShieldPPPt-PT-020B-06
FORMULA_NAME ShieldPPPt-PT-020B-07
FORMULA_NAME ShieldPPPt-PT-020B-08
FORMULA_NAME ShieldPPPt-PT-020B-09
FORMULA_NAME ShieldPPPt-PT-020B-10
FORMULA_NAME ShieldPPPt-PT-020B-11
FORMULA_NAME ShieldPPPt-PT-020B-12
FORMULA_NAME ShieldPPPt-PT-020B-13
FORMULA_NAME ShieldPPPt-PT-020B-14
FORMULA_NAME ShieldPPPt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621180296119

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 15:51:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 15:51:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:51:37] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2021-05-16 15:51:37] [INFO ] Transformed 1563 places.
[2021-05-16 15:51:37] [INFO ] Transformed 1423 transitions.
[2021-05-16 15:51:37] [INFO ] Found NUPN structural information;
[2021-05-16 15:51:38] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 69 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 609 ms. (steps per millisecond=164 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 1423 rows 1563 cols
[2021-05-16 15:51:38] [INFO ] Computed 221 place invariants in 44 ms
[2021-05-16 15:51:39] [INFO ] [Real]Absence check using 221 positive place invariants in 207 ms returned sat
[2021-05-16 15:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:51:43] [INFO ] [Real]Absence check using state equation in 4067 ms returned sat
[2021-05-16 15:51:44] [INFO ] Deduced a trap composed of 20 places in 608 ms
[2021-05-16 15:51:44] [INFO ] Deduced a trap composed of 23 places in 563 ms
[2021-05-16 15:51:45] [INFO ] Deduced a trap composed of 25 places in 583 ms
[2021-05-16 15:51:45] [INFO ] Deduced a trap composed of 20 places in 574 ms
[2021-05-16 15:51:46] [INFO ] Deduced a trap composed of 27 places in 573 ms
[2021-05-16 15:51:47] [INFO ] Deduced a trap composed of 25 places in 553 ms
[2021-05-16 15:51:47] [INFO ] Deduced a trap composed of 25 places in 591 ms
[2021-05-16 15:51:48] [INFO ] Deduced a trap composed of 27 places in 534 ms
[2021-05-16 15:51:48] [INFO ] Deduced a trap composed of 27 places in 485 ms
[2021-05-16 15:51:49] [INFO ] Deduced a trap composed of 29 places in 479 ms
[2021-05-16 15:51:50] [INFO ] Deduced a trap composed of 28 places in 466 ms
[2021-05-16 15:51:50] [INFO ] Deduced a trap composed of 25 places in 470 ms
[2021-05-16 15:51:51] [INFO ] Deduced a trap composed of 35 places in 442 ms
[2021-05-16 15:51:51] [INFO ] Deduced a trap composed of 23 places in 428 ms
[2021-05-16 15:51:51] [INFO ] Deduced a trap composed of 22 places in 409 ms
[2021-05-16 15:51:52] [INFO ] Deduced a trap composed of 29 places in 405 ms
[2021-05-16 15:51:52] [INFO ] Deduced a trap composed of 27 places in 390 ms
[2021-05-16 15:51:53] [INFO ] Deduced a trap composed of 31 places in 477 ms
[2021-05-16 15:51:53] [INFO ] Deduced a trap composed of 41 places in 389 ms
[2021-05-16 15:51:54] [INFO ] Deduced a trap composed of 34 places in 390 ms
[2021-05-16 15:51:54] [INFO ] Deduced a trap composed of 32 places in 371 ms
[2021-05-16 15:51:55] [INFO ] Deduced a trap composed of 42 places in 359 ms
[2021-05-16 15:51:55] [INFO ] Deduced a trap composed of 30 places in 351 ms
[2021-05-16 15:51:55] [INFO ] Deduced a trap composed of 35 places in 342 ms
[2021-05-16 15:51:56] [INFO ] Deduced a trap composed of 34 places in 334 ms
[2021-05-16 15:51:56] [INFO ] Deduced a trap composed of 33 places in 326 ms
[2021-05-16 15:51:57] [INFO ] Deduced a trap composed of 33 places in 318 ms
[2021-05-16 15:51:57] [INFO ] Deduced a trap composed of 34 places in 309 ms
[2021-05-16 15:51:57] [INFO ] Deduced a trap composed of 27 places in 302 ms
[2021-05-16 15:51:58] [INFO ] Deduced a trap composed of 37 places in 294 ms
[2021-05-16 15:51:58] [INFO ] Deduced a trap composed of 47 places in 286 ms
[2021-05-16 15:51:58] [INFO ] Deduced a trap composed of 32 places in 279 ms
[2021-05-16 15:51:59] [INFO ] Deduced a trap composed of 15 places in 917 ms
[2021-05-16 15:51:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s1255 s1256 s1257 s1258 s1259 s1260 s1280 s1281 s1282 s1283 s1284) 0)") while checking expression at index 0
[2021-05-16 15:52:00] [INFO ] [Real]Absence check using 221 positive place invariants in 195 ms returned sat
[2021-05-16 15:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:52:04] [INFO ] [Real]Absence check using state equation in 4230 ms returned sat
[2021-05-16 15:52:04] [INFO ] Deduced a trap composed of 21 places in 594 ms
[2021-05-16 15:52:05] [INFO ] Deduced a trap composed of 26 places in 571 ms
[2021-05-16 15:52:06] [INFO ] Deduced a trap composed of 29 places in 562 ms
[2021-05-16 15:52:06] [INFO ] Deduced a trap composed of 20 places in 551 ms
[2021-05-16 15:52:07] [INFO ] Deduced a trap composed of 21 places in 544 ms
[2021-05-16 15:52:07] [INFO ] Deduced a trap composed of 24 places in 529 ms
[2021-05-16 15:52:08] [INFO ] Deduced a trap composed of 26 places in 532 ms
[2021-05-16 15:52:09] [INFO ] Deduced a trap composed of 30 places in 526 ms
[2021-05-16 15:52:09] [INFO ] Deduced a trap composed of 18 places in 529 ms
[2021-05-16 15:52:10] [INFO ] Deduced a trap composed of 35 places in 516 ms
[2021-05-16 15:52:10] [INFO ] Deduced a trap composed of 23 places in 494 ms
[2021-05-16 15:52:11] [INFO ] Deduced a trap composed of 28 places in 482 ms
[2021-05-16 15:52:11] [INFO ] Deduced a trap composed of 18 places in 472 ms
[2021-05-16 15:52:12] [INFO ] Deduced a trap composed of 27 places in 459 ms
[2021-05-16 15:52:12] [INFO ] Deduced a trap composed of 19 places in 443 ms
[2021-05-16 15:52:13] [INFO ] Deduced a trap composed of 29 places in 434 ms
[2021-05-16 15:52:13] [INFO ] Deduced a trap composed of 35 places in 430 ms
[2021-05-16 15:52:14] [INFO ] Deduced a trap composed of 36 places in 435 ms
[2021-05-16 15:52:14] [INFO ] Deduced a trap composed of 29 places in 426 ms
[2021-05-16 15:52:15] [INFO ] Deduced a trap composed of 26 places in 433 ms
[2021-05-16 15:52:15] [INFO ] Deduced a trap composed of 25 places in 418 ms
[2021-05-16 15:52:16] [INFO ] Deduced a trap composed of 26 places in 413 ms
[2021-05-16 15:52:16] [INFO ] Deduced a trap composed of 27 places in 411 ms
[2021-05-16 15:52:17] [INFO ] Deduced a trap composed of 29 places in 407 ms
[2021-05-16 15:52:17] [INFO ] Deduced a trap composed of 23 places in 392 ms
[2021-05-16 15:52:18] [INFO ] Deduced a trap composed of 21 places in 393 ms
[2021-05-16 15:52:18] [INFO ] Deduced a trap composed of 28 places in 396 ms
[2021-05-16 15:52:18] [INFO ] Deduced a trap composed of 30 places in 382 ms
[2021-05-16 15:52:19] [INFO ] Deduced a trap composed of 16 places in 385 ms
[2021-05-16 15:52:19] [INFO ] Deduced a trap composed of 28 places in 383 ms
[2021-05-16 15:52:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s947 s948 s949 s950 s951 s958 s959 s960 s962 s963 s964 s965 s966 s967 s968 s969 s979 s988 s989 s990) 0)") while checking expression at index 1
[2021-05-16 15:52:20] [INFO ] [Real]Absence check using 221 positive place invariants in 195 ms returned sat
[2021-05-16 15:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:52:24] [INFO ] [Real]Absence check using state equation in 4084 ms returned sat
[2021-05-16 15:52:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:52:24] [INFO ] [Nat]Absence check using 221 positive place invariants in 240 ms returned sat
[2021-05-16 15:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:52:28] [INFO ] [Nat]Absence check using state equation in 3991 ms returned sat
[2021-05-16 15:52:29] [INFO ] Deduced a trap composed of 21 places in 491 ms
[2021-05-16 15:52:29] [INFO ] Deduced a trap composed of 29 places in 483 ms
[2021-05-16 15:52:30] [INFO ] Deduced a trap composed of 24 places in 474 ms
[2021-05-16 15:52:30] [INFO ] Deduced a trap composed of 28 places in 467 ms
[2021-05-16 15:52:31] [INFO ] Deduced a trap composed of 20 places in 454 ms
[2021-05-16 15:52:31] [INFO ] Deduced a trap composed of 20 places in 447 ms
[2021-05-16 15:52:32] [INFO ] Deduced a trap composed of 25 places in 449 ms
[2021-05-16 15:52:32] [INFO ] Deduced a trap composed of 15 places in 419 ms
[2021-05-16 15:52:33] [INFO ] Deduced a trap composed of 19 places in 418 ms
[2021-05-16 15:52:33] [INFO ] Deduced a trap composed of 25 places in 408 ms
[2021-05-16 15:52:34] [INFO ] Deduced a trap composed of 38 places in 398 ms
[2021-05-16 15:52:34] [INFO ] Deduced a trap composed of 26 places in 397 ms
[2021-05-16 15:52:34] [INFO ] Deduced a trap composed of 26 places in 384 ms
[2021-05-16 15:52:35] [INFO ] Deduced a trap composed of 28 places in 370 ms
[2021-05-16 15:52:35] [INFO ] Deduced a trap composed of 23 places in 370 ms
[2021-05-16 15:52:36] [INFO ] Deduced a trap composed of 29 places in 361 ms
[2021-05-16 15:52:36] [INFO ] Deduced a trap composed of 25 places in 366 ms
[2021-05-16 15:52:37] [INFO ] Deduced a trap composed of 21 places in 337 ms
[2021-05-16 15:52:37] [INFO ] Deduced a trap composed of 22 places in 338 ms
[2021-05-16 15:52:37] [INFO ] Deduced a trap composed of 23 places in 334 ms
[2021-05-16 15:52:38] [INFO ] Deduced a trap composed of 20 places in 314 ms
[2021-05-16 15:52:38] [INFO ] Deduced a trap composed of 34 places in 323 ms
[2021-05-16 15:52:38] [INFO ] Deduced a trap composed of 38 places in 311 ms
[2021-05-16 15:52:39] [INFO ] Deduced a trap composed of 32 places in 300 ms
[2021-05-16 15:52:39] [INFO ] Deduced a trap composed of 32 places in 286 ms
[2021-05-16 15:52:39] [INFO ] Deduced a trap composed of 34 places in 273 ms
[2021-05-16 15:52:40] [INFO ] Deduced a trap composed of 32 places in 275 ms
[2021-05-16 15:52:40] [INFO ] Deduced a trap composed of 27 places in 268 ms
[2021-05-16 15:52:40] [INFO ] Deduced a trap composed of 33 places in 259 ms
[2021-05-16 15:52:41] [INFO ] Deduced a trap composed of 34 places in 245 ms
[2021-05-16 15:52:41] [INFO ] Deduced a trap composed of 36 places in 237 ms
[2021-05-16 15:52:41] [INFO ] Deduced a trap composed of 30 places in 227 ms
[2021-05-16 15:52:41] [INFO ] Deduced a trap composed of 33 places in 224 ms
[2021-05-16 15:52:42] [INFO ] Deduced a trap composed of 23 places in 214 ms
[2021-05-16 15:52:42] [INFO ] Deduced a trap composed of 29 places in 212 ms
[2021-05-16 15:52:42] [INFO ] Deduced a trap composed of 29 places in 203 ms
[2021-05-16 15:52:42] [INFO ] Deduced a trap composed of 33 places in 196 ms
[2021-05-16 15:52:43] [INFO ] Deduced a trap composed of 26 places in 190 ms
[2021-05-16 15:52:43] [INFO ] Deduced a trap composed of 24 places in 181 ms
[2021-05-16 15:52:43] [INFO ] Deduced a trap composed of 37 places in 173 ms
[2021-05-16 15:52:43] [INFO ] Deduced a trap composed of 36 places in 161 ms
[2021-05-16 15:52:43] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 15133 ms
[2021-05-16 15:52:43] [INFO ] Computed and/alt/rep : 1422/2123/1422 causal constraints in 75 ms.
[2021-05-16 15:52:44] [INFO ] Added : 30 causal constraints over 6 iterations in 479 ms. Result :(error "Failed to check-sat")
[2021-05-16 15:52:44] [INFO ] [Real]Absence check using 221 positive place invariants in 196 ms returned sat
[2021-05-16 15:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:52:48] [INFO ] [Real]Absence check using state equation in 4143 ms returned sat
[2021-05-16 15:52:49] [INFO ] Deduced a trap composed of 19 places in 536 ms
[2021-05-16 15:52:50] [INFO ] Deduced a trap composed of 22 places in 529 ms
[2021-05-16 15:52:50] [INFO ] Deduced a trap composed of 30 places in 533 ms
[2021-05-16 15:52:51] [INFO ] Deduced a trap composed of 19 places in 510 ms
[2021-05-16 15:52:51] [INFO ] Deduced a trap composed of 23 places in 495 ms
[2021-05-16 15:52:52] [INFO ] Deduced a trap composed of 24 places in 514 ms
[2021-05-16 15:52:52] [INFO ] Deduced a trap composed of 21 places in 484 ms
[2021-05-16 15:52:53] [INFO ] Deduced a trap composed of 29 places in 485 ms
[2021-05-16 15:52:53] [INFO ] Deduced a trap composed of 21 places in 465 ms
[2021-05-16 15:52:54] [INFO ] Deduced a trap composed of 28 places in 458 ms
[2021-05-16 15:52:54] [INFO ] Deduced a trap composed of 26 places in 453 ms
[2021-05-16 15:52:55] [INFO ] Deduced a trap composed of 20 places in 444 ms
[2021-05-16 15:52:55] [INFO ] Deduced a trap composed of 27 places in 442 ms
[2021-05-16 15:52:56] [INFO ] Deduced a trap composed of 33 places in 422 ms
[2021-05-16 15:52:56] [INFO ] Deduced a trap composed of 31 places in 425 ms
[2021-05-16 15:52:57] [INFO ] Deduced a trap composed of 28 places in 404 ms
[2021-05-16 15:52:57] [INFO ] Deduced a trap composed of 30 places in 403 ms
[2021-05-16 15:52:58] [INFO ] Deduced a trap composed of 22 places in 400 ms
[2021-05-16 15:52:58] [INFO ] Deduced a trap composed of 28 places in 388 ms
[2021-05-16 15:52:59] [INFO ] Deduced a trap composed of 28 places in 392 ms
[2021-05-16 15:52:59] [INFO ] Deduced a trap composed of 35 places in 381 ms
[2021-05-16 15:52:59] [INFO ] Deduced a trap composed of 22 places in 374 ms
[2021-05-16 15:53:00] [INFO ] Deduced a trap composed of 29 places in 353 ms
[2021-05-16 15:53:00] [INFO ] Deduced a trap composed of 27 places in 341 ms
[2021-05-16 15:53:01] [INFO ] Deduced a trap composed of 33 places in 338 ms
[2021-05-16 15:53:01] [INFO ] Deduced a trap composed of 26 places in 324 ms
[2021-05-16 15:53:01] [INFO ] Deduced a trap composed of 34 places in 317 ms
[2021-05-16 15:53:02] [INFO ] Deduced a trap composed of 34 places in 308 ms
[2021-05-16 15:53:02] [INFO ] Deduced a trap composed of 36 places in 294 ms
[2021-05-16 15:53:02] [INFO ] Deduced a trap composed of 32 places in 293 ms
[2021-05-16 15:53:03] [INFO ] Deduced a trap composed of 33 places in 284 ms
[2021-05-16 15:53:03] [INFO ] Deduced a trap composed of 23 places in 270 ms
[2021-05-16 15:53:03] [INFO ] Deduced a trap composed of 36 places in 261 ms
[2021-05-16 15:53:04] [INFO ] Deduced a trap composed of 36 places in 246 ms
[2021-05-16 15:53:04] [INFO ] Deduced a trap composed of 34 places in 240 ms
[2021-05-16 15:53:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s177 s178 s179 s180 s181 s182 s183 s184 s188 s222 s223 s224 s225 s226 s227 s228) 0)") while checking expression at index 3
[2021-05-16 15:53:04] [INFO ] [Real]Absence check using 221 positive place invariants in 193 ms returned sat
[2021-05-16 15:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:53:08] [INFO ] [Real]Absence check using state equation in 4101 ms returned sat
[2021-05-16 15:53:09] [INFO ] Deduced a trap composed of 30 places in 550 ms
[2021-05-16 15:53:10] [INFO ] Deduced a trap composed of 25 places in 542 ms
[2021-05-16 15:53:10] [INFO ] Deduced a trap composed of 28 places in 540 ms
[2021-05-16 15:53:11] [INFO ] Deduced a trap composed of 20 places in 521 ms
[2021-05-16 15:53:11] [INFO ] Deduced a trap composed of 21 places in 518 ms
[2021-05-16 15:53:12] [INFO ] Deduced a trap composed of 19 places in 513 ms
[2021-05-16 15:53:12] [INFO ] Deduced a trap composed of 24 places in 515 ms
[2021-05-16 15:53:13] [INFO ] Deduced a trap composed of 22 places in 570 ms
[2021-05-16 15:53:14] [INFO ] Deduced a trap composed of 29 places in 561 ms
[2021-05-16 15:53:14] [INFO ] Deduced a trap composed of 19 places in 506 ms
[2021-05-16 15:53:15] [INFO ] Deduced a trap composed of 29 places in 525 ms
[2021-05-16 15:53:15] [INFO ] Deduced a trap composed of 28 places in 486 ms
[2021-05-16 15:53:16] [INFO ] Deduced a trap composed of 32 places in 471 ms
[2021-05-16 15:53:16] [INFO ] Deduced a trap composed of 28 places in 469 ms
[2021-05-16 15:53:17] [INFO ] Deduced a trap composed of 21 places in 460 ms
[2021-05-16 15:53:17] [INFO ] Deduced a trap composed of 26 places in 447 ms
[2021-05-16 15:53:18] [INFO ] Deduced a trap composed of 19 places in 456 ms
[2021-05-16 15:53:18] [INFO ] Deduced a trap composed of 21 places in 511 ms
[2021-05-16 15:53:19] [INFO ] Deduced a trap composed of 20 places in 441 ms
[2021-05-16 15:53:19] [INFO ] Deduced a trap composed of 18 places in 423 ms
[2021-05-16 15:53:20] [INFO ] Deduced a trap composed of 23 places in 413 ms
[2021-05-16 15:53:20] [INFO ] Deduced a trap composed of 22 places in 413 ms
[2021-05-16 15:53:21] [INFO ] Deduced a trap composed of 36 places in 490 ms
[2021-05-16 15:53:21] [INFO ] Deduced a trap composed of 26 places in 389 ms
[2021-05-16 15:53:22] [INFO ] Deduced a trap composed of 25 places in 384 ms
[2021-05-16 15:53:22] [INFO ] Deduced a trap composed of 25 places in 362 ms
[2021-05-16 15:53:23] [INFO ] Deduced a trap composed of 31 places in 361 ms
[2021-05-16 15:53:23] [INFO ] Deduced a trap composed of 26 places in 365 ms
[2021-05-16 15:53:23] [INFO ] Deduced a trap composed of 37 places in 349 ms
[2021-05-16 15:53:24] [INFO ] Deduced a trap composed of 25 places in 340 ms
[2021-05-16 15:53:24] [INFO ] Deduced a trap composed of 33 places in 340 ms
[2021-05-16 15:53:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s287 s288 s289 s290 s291 s292 s293 s294 s295 s331 s332 s333 s334 s335 s336 s337 s349) 0)") while checking expression at index 4
[2021-05-16 15:53:24] [INFO ] [Real]Absence check using 221 positive place invariants in 192 ms returned sat
[2021-05-16 15:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:53:29] [INFO ] [Real]Absence check using state equation in 4154 ms returned sat
[2021-05-16 15:53:29] [INFO ] Deduced a trap composed of 21 places in 588 ms
[2021-05-16 15:53:30] [INFO ] Deduced a trap composed of 23 places in 617 ms
[2021-05-16 15:53:31] [INFO ] Deduced a trap composed of 35 places in 584 ms
[2021-05-16 15:53:31] [INFO ] Deduced a trap composed of 29 places in 585 ms
[2021-05-16 15:53:32] [INFO ] Deduced a trap composed of 17 places in 544 ms
[2021-05-16 15:53:32] [INFO ] Deduced a trap composed of 30 places in 538 ms
[2021-05-16 15:53:33] [INFO ] Deduced a trap composed of 29 places in 530 ms
[2021-05-16 15:53:34] [INFO ] Deduced a trap composed of 29 places in 523 ms
[2021-05-16 15:53:34] [INFO ] Deduced a trap composed of 25 places in 521 ms
[2021-05-16 15:53:35] [INFO ] Deduced a trap composed of 21 places in 510 ms
[2021-05-16 15:53:35] [INFO ] Deduced a trap composed of 23 places in 495 ms
[2021-05-16 15:53:36] [INFO ] Deduced a trap composed of 27 places in 485 ms
[2021-05-16 15:53:36] [INFO ] Deduced a trap composed of 17 places in 470 ms
[2021-05-16 15:53:37] [INFO ] Deduced a trap composed of 32 places in 483 ms
[2021-05-16 15:53:37] [INFO ] Deduced a trap composed of 23 places in 453 ms
[2021-05-16 15:53:38] [INFO ] Deduced a trap composed of 20 places in 457 ms
[2021-05-16 15:53:38] [INFO ] Deduced a trap composed of 30 places in 443 ms
[2021-05-16 15:53:39] [INFO ] Deduced a trap composed of 43 places in 442 ms
[2021-05-16 15:53:39] [INFO ] Deduced a trap composed of 40 places in 442 ms
[2021-05-16 15:53:40] [INFO ] Deduced a trap composed of 30 places in 425 ms
[2021-05-16 15:53:40] [INFO ] Deduced a trap composed of 33 places in 419 ms
[2021-05-16 15:53:41] [INFO ] Deduced a trap composed of 37 places in 408 ms
[2021-05-16 15:53:41] [INFO ] Deduced a trap composed of 34 places in 385 ms
[2021-05-16 15:53:42] [INFO ] Deduced a trap composed of 26 places in 382 ms
[2021-05-16 15:53:42] [INFO ] Deduced a trap composed of 36 places in 377 ms
[2021-05-16 15:53:42] [INFO ] Deduced a trap composed of 42 places in 374 ms
[2021-05-16 15:53:43] [INFO ] Deduced a trap composed of 33 places in 392 ms
[2021-05-16 15:53:43] [INFO ] Deduced a trap composed of 40 places in 369 ms
[2021-05-16 15:53:44] [INFO ] Deduced a trap composed of 35 places in 370 ms
[2021-05-16 15:53:44] [INFO ] Deduced a trap composed of 36 places in 341 ms
[2021-05-16 15:53:44] [INFO ] Deduced a trap composed of 34 places in 327 ms
[2021-05-16 15:53:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s331 s332 s333 s334 s335 s336 s337 s338 s339 s398 s399 s400 s401 s402 s403 s404 s405 s406) 0)") while checking expression at index 5
[2021-05-16 15:53:45] [INFO ] [Real]Absence check using 221 positive place invariants in 194 ms returned sat
[2021-05-16 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:53:49] [INFO ] [Real]Absence check using state equation in 4084 ms returned sat
[2021-05-16 15:53:49] [INFO ] Deduced a trap composed of 31 places in 524 ms
[2021-05-16 15:53:50] [INFO ] Deduced a trap composed of 24 places in 502 ms
[2021-05-16 15:53:51] [INFO ] Deduced a trap composed of 29 places in 485 ms
[2021-05-16 15:53:51] [INFO ] Deduced a trap composed of 25 places in 465 ms
[2021-05-16 15:53:52] [INFO ] Deduced a trap composed of 25 places in 448 ms
[2021-05-16 15:53:52] [INFO ] Deduced a trap composed of 39 places in 435 ms
[2021-05-16 15:53:53] [INFO ] Deduced a trap composed of 38 places in 425 ms
[2021-05-16 15:53:53] [INFO ] Deduced a trap composed of 29 places in 420 ms
[2021-05-16 15:53:53] [INFO ] Deduced a trap composed of 23 places in 406 ms
[2021-05-16 15:53:54] [INFO ] Deduced a trap composed of 20 places in 371 ms
[2021-05-16 15:53:54] [INFO ] Deduced a trap composed of 20 places in 386 ms
[2021-05-16 15:53:55] [INFO ] Deduced a trap composed of 20 places in 361 ms
[2021-05-16 15:53:55] [INFO ] Deduced a trap composed of 30 places in 364 ms
[2021-05-16 15:53:56] [INFO ] Deduced a trap composed of 32 places in 352 ms
[2021-05-16 15:53:56] [INFO ] Deduced a trap composed of 21 places in 347 ms
[2021-05-16 15:53:56] [INFO ] Deduced a trap composed of 23 places in 341 ms
[2021-05-16 15:53:57] [INFO ] Deduced a trap composed of 36 places in 324 ms
[2021-05-16 15:53:57] [INFO ] Deduced a trap composed of 33 places in 329 ms
[2021-05-16 15:53:57] [INFO ] Deduced a trap composed of 27 places in 314 ms
[2021-05-16 15:53:58] [INFO ] Deduced a trap composed of 31 places in 303 ms
[2021-05-16 15:53:58] [INFO ] Deduced a trap composed of 21 places in 295 ms
[2021-05-16 15:53:58] [INFO ] Deduced a trap composed of 36 places in 272 ms
[2021-05-16 15:53:59] [INFO ] Deduced a trap composed of 34 places in 264 ms
[2021-05-16 15:53:59] [INFO ] Deduced a trap composed of 34 places in 266 ms
[2021-05-16 15:53:59] [INFO ] Deduced a trap composed of 36 places in 255 ms
[2021-05-16 15:54:00] [INFO ] Deduced a trap composed of 29 places in 245 ms
[2021-05-16 15:54:00] [INFO ] Deduced a trap composed of 41 places in 241 ms
[2021-05-16 15:54:00] [INFO ] Deduced a trap composed of 30 places in 233 ms
[2021-05-16 15:54:01] [INFO ] Deduced a trap composed of 28 places in 234 ms
[2021-05-16 15:54:01] [INFO ] Deduced a trap composed of 18 places in 231 ms
[2021-05-16 15:54:01] [INFO ] Deduced a trap composed of 30 places in 225 ms
[2021-05-16 15:54:01] [INFO ] Deduced a trap composed of 33 places in 217 ms
[2021-05-16 15:54:02] [INFO ] Deduced a trap composed of 37 places in 209 ms
[2021-05-16 15:54:02] [INFO ] Deduced a trap composed of 36 places in 197 ms
[2021-05-16 15:54:02] [INFO ] Deduced a trap composed of 33 places in 184 ms
[2021-05-16 15:54:02] [INFO ] Deduced a trap composed of 29 places in 182 ms
[2021-05-16 15:54:03] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2021-05-16 15:54:03] [INFO ] Deduced a trap composed of 39 places in 164 ms
[2021-05-16 15:54:03] [INFO ] Deduced a trap composed of 36 places in 160 ms
[2021-05-16 15:54:03] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 14135 ms
[2021-05-16 15:54:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:54:04] [INFO ] [Nat]Absence check using 221 positive place invariants in 237 ms returned sat
[2021-05-16 15:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:07] [INFO ] [Nat]Absence check using state equation in 3899 ms returned sat
[2021-05-16 15:54:08] [INFO ] Deduced a trap composed of 18 places in 503 ms
[2021-05-16 15:54:09] [INFO ] Deduced a trap composed of 27 places in 535 ms
[2021-05-16 15:54:09] [INFO ] Deduced a trap composed of 19 places in 493 ms
[2021-05-16 15:54:10] [INFO ] Deduced a trap composed of 24 places in 484 ms
[2021-05-16 15:54:10] [INFO ] Deduced a trap composed of 18 places in 491 ms
[2021-05-16 15:54:11] [INFO ] Deduced a trap composed of 27 places in 480 ms
[2021-05-16 15:54:11] [INFO ] Deduced a trap composed of 33 places in 479 ms
[2021-05-16 15:54:12] [INFO ] Deduced a trap composed of 21 places in 464 ms
[2021-05-16 15:54:12] [INFO ] Deduced a trap composed of 26 places in 452 ms
[2021-05-16 15:54:13] [INFO ] Deduced a trap composed of 19 places in 457 ms
[2021-05-16 15:54:13] [INFO ] Deduced a trap composed of 31 places in 443 ms
[2021-05-16 15:54:14] [INFO ] Deduced a trap composed of 28 places in 433 ms
[2021-05-16 15:54:14] [INFO ] Deduced a trap composed of 29 places in 435 ms
[2021-05-16 15:54:15] [INFO ] Deduced a trap composed of 28 places in 427 ms
[2021-05-16 15:54:15] [INFO ] Deduced a trap composed of 22 places in 429 ms
[2021-05-16 15:54:16] [INFO ] Deduced a trap composed of 33 places in 415 ms
[2021-05-16 15:54:16] [INFO ] Deduced a trap composed of 17 places in 494 ms
[2021-05-16 15:54:17] [INFO ] Deduced a trap composed of 23 places in 406 ms
[2021-05-16 15:54:17] [INFO ] Deduced a trap composed of 24 places in 399 ms
[2021-05-16 15:54:17] [INFO ] Deduced a trap composed of 21 places in 408 ms
[2021-05-16 15:54:18] [INFO ] Deduced a trap composed of 34 places in 388 ms
[2021-05-16 15:54:18] [INFO ] Deduced a trap composed of 27 places in 382 ms
[2021-05-16 15:54:19] [INFO ] Deduced a trap composed of 27 places in 373 ms
[2021-05-16 15:54:19] [INFO ] Deduced a trap composed of 34 places in 364 ms
[2021-05-16 15:54:20] [INFO ] Deduced a trap composed of 35 places in 355 ms
[2021-05-16 15:54:20] [INFO ] Deduced a trap composed of 28 places in 352 ms
[2021-05-16 15:54:20] [INFO ] Deduced a trap composed of 30 places in 351 ms
[2021-05-16 15:54:21] [INFO ] Deduced a trap composed of 23 places in 352 ms
[2021-05-16 15:54:21] [INFO ] Deduced a trap composed of 32 places in 328 ms
[2021-05-16 15:54:21] [INFO ] Deduced a trap composed of 26 places in 322 ms
[2021-05-16 15:54:22] [INFO ] Deduced a trap composed of 35 places in 309 ms
[2021-05-16 15:54:22] [INFO ] Deduced a trap composed of 31 places in 305 ms
[2021-05-16 15:54:22] [INFO ] Deduced a trap composed of 29 places in 297 ms
[2021-05-16 15:54:23] [INFO ] Deduced a trap composed of 36 places in 292 ms
[2021-05-16 15:54:23] [INFO ] Deduced a trap composed of 28 places in 280 ms
[2021-05-16 15:54:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s958 s959 s960 s961 s962 s965 s966 s967 s969 s970 s971 s982 s988 s1024 s1025 s1026 s1027 s1028 s1029 s1030 s1042) 0)") while checking expression at index 6
[2021-05-16 15:54:23] [INFO ] Flatten gal took : 129 ms
[2021-05-16 15:54:23] [INFO ] Applying decomposition
[2021-05-16 15:54:24] [INFO ] Flatten gal took : 104 ms
[2021-05-16 15:54:24] [INFO ] Decomposing Gal with order
[2021-05-16 15:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:54:24] [INFO ] Flatten gal took : 185 ms
[2021-05-16 15:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2021-05-16 15:54:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-16 15:54:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPt-PT-020B @ 3570 seconds

FORMULA ShieldPPPt-PT-020B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 6889392 kB
After kill :
MemTotal: 16427364 kB
MemFree: 9409148 kB

--------------------
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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ShieldPPPt-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-tall-162098231300398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;