fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987871300058
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Philosophers-COL-001000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15758.040 3600000.00 3653206.00 3490.50 T??FT?T???T?TFT? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871300058.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is Philosophers-COL-001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871300058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 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 Philosophers-COL-001000-00
FORMULA_NAME Philosophers-COL-001000-01
FORMULA_NAME Philosophers-COL-001000-02
FORMULA_NAME Philosophers-COL-001000-03
FORMULA_NAME Philosophers-COL-001000-04
FORMULA_NAME Philosophers-COL-001000-05
FORMULA_NAME Philosophers-COL-001000-06
FORMULA_NAME Philosophers-COL-001000-07
FORMULA_NAME Philosophers-COL-001000-08
FORMULA_NAME Philosophers-COL-001000-09
FORMULA_NAME Philosophers-COL-001000-10
FORMULA_NAME Philosophers-COL-001000-11
FORMULA_NAME Philosophers-COL-001000-12
FORMULA_NAME Philosophers-COL-001000-13
FORMULA_NAME Philosophers-COL-001000-14
FORMULA_NAME Philosophers-COL-001000-15

=== Now, execution of the tool begins

BK_START 1591124321170

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 18:58:43] [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]
[2020-06-02 18:58:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 18:58:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 18:58:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2020-06-02 18:58:44] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-06-02 18:58:44] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 38 ms.
[2020-06-02 18:58:44] [INFO ] Computed order based on color domains.
[2020-06-02 18:58:44] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions in 59 ms.
[2020-06-02 18:58:44] [INFO ] Unfolded HLPN properties in 8 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 362 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 5965 ms. (steps per millisecond=16 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 5000 rows 5000 cols
[2020-06-02 18:58:51] [INFO ] Computed 2000 place invariants in 115 ms
[2020-06-02 18:58:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3966 ms returned sat
[2020-06-02 18:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 18:59:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 18:59:11] [INFO ] [Real]Absence check using state equation in 15389 ms returned (error "Failed to check-sat")
[2020-06-02 18:59:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 4378 ms returned sat
[2020-06-02 18:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 18:59:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 18:59:31] [INFO ] [Real]Absence check using state equation in 15065 ms returned (error "Failed to check-sat")
[2020-06-02 18:59:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 4274 ms returned sat
[2020-06-02 18:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 18:59:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 18:59:51] [INFO ] [Real]Absence check using state equation in 15251 ms returned (error "Failed to check-sat")
[2020-06-02 18:59:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4276 ms returned sat
[2020-06-02 18:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:00:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:00:11] [INFO ] [Real]Absence check using state equation in 15327 ms returned unknown
[2020-06-02 19:00:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 4409 ms returned sat
[2020-06-02 19:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:00:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:00:31] [INFO ] [Real]Absence check using state equation in 15094 ms returned (error "Failed to check-sat")
[2020-06-02 19:00:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3792 ms returned sat
[2020-06-02 19:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:00:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:00:51] [INFO ] [Real]Absence check using state equation in 15971 ms returned (error "Failed to check-sat")
[2020-06-02 19:00:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4102 ms returned sat
[2020-06-02 19:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:01:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:01:11] [INFO ] [Real]Absence check using state equation in 15331 ms returned (error "Failed to check-sat")
[2020-06-02 19:01:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 3783 ms returned sat
[2020-06-02 19:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:01:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:01:31] [INFO ] [Real]Absence check using state equation in 15782 ms returned (error "Failed to check-sat")
[2020-06-02 19:01:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3928 ms returned sat
[2020-06-02 19:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:01:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:01:51] [INFO ] [Real]Absence check using state equation in 15571 ms returned unknown
[2020-06-02 19:01:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3942 ms returned sat
[2020-06-02 19:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:02:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:02:11] [INFO ] [Real]Absence check using state equation in 15683 ms returned (error "Failed to check-sat")
[2020-06-02 19:02:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 4012 ms returned sat
[2020-06-02 19:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:02:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:02:31] [INFO ] [Real]Absence check using state equation in 15608 ms returned unknown
[2020-06-02 19:02:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3649 ms returned sat
[2020-06-02 19:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:02:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:02:51] [INFO ] [Real]Absence check using state equation in 15979 ms returned (error "Failed to check-sat")
[2020-06-02 19:02:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4176 ms returned sat
[2020-06-02 19:02:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:03:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:03:11] [INFO ] [Real]Absence check using state equation in 15440 ms returned (error "Failed to check-sat")
[2020-06-02 19:03:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 4243 ms returned sat
[2020-06-02 19:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:03:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:03:31] [INFO ] [Real]Absence check using state equation in 15389 ms returned (error "Failed to check-sat")
[2020-06-02 19:03:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3815 ms returned sat
[2020-06-02 19:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:03:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:03:51] [INFO ] [Real]Absence check using state equation in 15675 ms returned unknown
[2020-06-02 19:03:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3766 ms returned sat
[2020-06-02 19:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:04:11] [INFO ] [Real]Absence check using state equation in 15825 ms returned (error "Failed to check-sat")
[2020-06-02 19:04:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 4012 ms returned sat
[2020-06-02 19:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:04:31] [INFO ] [Real]Absence check using state equation in 15573 ms returned (error "Failed to check-sat")
[2020-06-02 19:04:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3892 ms returned sat
[2020-06-02 19:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:51] [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: Broken pipe (= s1999 (- (+ 1 t4000 t4999) (+ t0 t1999 t2999 t3000)))") while checking expression at index 17
[2020-06-02 19:04:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3920 ms returned sat
[2020-06-02 19:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:05:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:05:11] [INFO ] [Real]Absence check using state equation in 15686 ms returned (error "Failed to check-sat")
[2020-06-02 19:05:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 3838 ms returned sat
[2020-06-02 19:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:05:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:05:31] [INFO ] [Real]Absence check using state equation in 15681 ms returned (error "Failed to check-sat")
[2020-06-02 19:05:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3826 ms returned sat
[2020-06-02 19:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:05:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:05:51] [INFO ] [Real]Absence check using state equation in 15692 ms returned (error "Failed to check-sat")
[2020-06-02 19:05:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3840 ms returned sat
[2020-06-02 19:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:06:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:06:11] [INFO ] [Real]Absence check using state equation in 15777 ms returned (error "Failed to check-sat")
[2020-06-02 19:06:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 4160 ms returned sat
[2020-06-02 19:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:06:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:06:31] [INFO ] [Real]Absence check using state equation in 15359 ms returned unknown
[2020-06-02 19:06:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3967 ms returned sat
[2020-06-02 19:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:06:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:06:51] [INFO ] [Real]Absence check using state equation in 15624 ms returned (error "Failed to check-sat")
[2020-06-02 19:06:56] [INFO ] [Real]Absence check using 2000 positive place invariants in 4421 ms returned sat
[2020-06-02 19:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:07:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:07:11] [INFO ] [Real]Absence check using state equation in 15113 ms returned unknown
[2020-06-02 19:07:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 4424 ms returned sat
[2020-06-02 19:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:07:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:07:31] [INFO ] [Real]Absence check using state equation in 14954 ms returned (error "Failed to check-sat")
[2020-06-02 19:07:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 4012 ms returned sat
[2020-06-02 19:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:07:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:07:51] [INFO ] [Real]Absence check using state equation in 15543 ms returned unknown
[2020-06-02 19:07:56] [INFO ] [Real]Absence check using 2000 positive place invariants in 4154 ms returned sat
[2020-06-02 19:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:08:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:08:11] [INFO ] [Real]Absence check using state equation in 15284 ms returned unknown
[2020-06-02 19:08:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 4115 ms returned sat
[2020-06-02 19:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:08:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:08:31] [INFO ] [Real]Absence check using state equation in 15390 ms returned (error "Failed to check-sat")
[2020-06-02 19:08:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 4122 ms returned sat
[2020-06-02 19:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:08:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:08:51] [INFO ] [Real]Absence check using state equation in 15330 ms returned (error "Failed to check-sat")
[2020-06-02 19:08:56] [INFO ] [Real]Absence check using 2000 positive place invariants in 4012 ms returned sat
[2020-06-02 19:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:09:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:09:11] [INFO ] [Real]Absence check using state equation in 15442 ms returned (error "Failed to check-sat")
[2020-06-02 19:09:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 3769 ms returned sat
[2020-06-02 19:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:09:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:09:31] [INFO ] [Real]Absence check using state equation in 15751 ms returned (error "Failed to check-sat")
[2020-06-02 19:09:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 3933 ms returned sat
[2020-06-02 19:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:09:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:09:51] [INFO ] [Real]Absence check using state equation in 15531 ms returned (error "Failed to check-sat")
[2020-06-02 19:09:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3883 ms returned sat
[2020-06-02 19:09:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:10:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:10:11] [INFO ] [Real]Absence check using state equation in 15631 ms returned (error "Failed to check-sat")
[2020-06-02 19:10:12] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-02 19:10:13] [INFO ] Flatten gal took : 879 ms
FORMULA Philosophers-COL-001000-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 19:10:13] [INFO ] Applying decomposition
[2020-06-02 19:10:13] [INFO ] Flatten gal took : 428 ms
[2020-06-02 19:10:14] [INFO ] Decomposing Gal with order
[2020-06-02 19:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 19:10:15] [INFO ] Removed a total of 1000 redundant transitions.
[2020-06-02 19:10:16] [INFO ] Flatten gal took : 592 ms
[2020-06-02 19:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 191 ms.
[2020-06-02 19:10:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 136 ms.
[2020-06-02 19:10:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 39 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Philosophers-COL-001000 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 11107436 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16123036 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="Philosophers-COL-001000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Philosophers-COL-001000, 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 r176-tajo-158987871300058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-001000.tgz
mv Philosophers-COL-001000 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 ;