Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 59K Mar 24 05:37 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 BusinessProcesses-PT-02-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591156530244

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:55:31] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-06-03 03:55:31] [INFO ] Transformed 262 places.
[2020-06-03 03:55:31] [INFO ] Transformed 219 transitions.
[2020-06-03 03:55:31] [INFO ] Found NUPN structural information;
[2020-06-03 03:55:31] [INFO ] Parsed PT model containing 262 places and 219 transitions in 77 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Incomplete random walk after 100000 steps, including 1359 resets, run finished after 198 ms. (steps per millisecond=505 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0]
// Phase 1: matrix 204 rows 245 cols
[2020-06-03 03:55:32] [INFO ] Computed 43 place invariants in 16 ms
[2020-06-03 03:55:32] [INFO ] [Real]Absence check using 30 positive place invariants in 37 ms returned sat
[2020-06-03 03:55:32] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-06-03 03:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:32] [INFO ] [Real]Absence check using state equation in 94 ms returned unsat
[2020-06-03 03:55:32] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:55:32] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:32] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-06-03 03:55:32] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 03:55:32] [INFO ] Deduced a trap composed of 13 places in 36 ms
[2020-06-03 03:55:32] [INFO ] Deduced a trap composed of 17 places in 31 ms
[2020-06-03 03:55:32] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2020-06-03 03:55:32] [INFO ] Deduced a trap composed of 19 places in 18 ms
[2020-06-03 03:55:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 240 ms
[2020-06-03 03:55:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-03 03:55:32] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:32] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 15 places in 39 ms
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 11 places in 32 ms
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 13 places in 30 ms
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 17 places in 31 ms
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 19 places in 19 ms
[2020-06-03 03:55:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 233 ms
[2020-06-03 03:55:33] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:55:33] [INFO ] Added : 152 causal constraints over 31 iterations in 443 ms. Result :sat
[2020-06-03 03:55:33] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:55:33] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:33] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2020-06-03 03:55:33] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 13 places in 47 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 17 places in 46 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 16 places in 31 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 18 places in 21 ms
[2020-06-03 03:55:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 469 ms
[2020-06-03 03:55:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-06-03 03:55:34] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:34] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 17 places in 56 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 13 places in 46 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 16 places in 28 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2020-06-03 03:55:34] [INFO ] Deduced a trap composed of 18 places in 20 ms
[2020-06-03 03:55:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 453 ms
[2020-06-03 03:55:35] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:55:35] [INFO ] Added : 150 causal constraints over 31 iterations in 506 ms. Result :sat
[2020-06-03 03:55:35] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:55:35] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:36] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 10 places in 55 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 19 places in 97 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 11 places in 35 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 19 places in 39 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 26 places in 39 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 28 places in 54 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2020-06-03 03:55:36] [INFO ] Deduced a trap composed of 30 places in 51 ms
[2020-06-03 03:55:37] [INFO ] Deduced a trap composed of 29 places in 56 ms
[2020-06-03 03:55:37] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2020-06-03 03:55:37] [INFO ] Deduced a trap composed of 26 places in 44 ms
[2020-06-03 03:55:37] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1061 ms
[2020-06-03 03:55:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2020-06-03 03:55:37] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:37] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 19 places in 157 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 11 places in 133 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 8 places in 100 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 15 places in 51 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 18 places in 274 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 19 places in 35 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 26 places in 32 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 19 places in 29 ms
[2020-06-03 03:55:38] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-06-03 03:55:39] [INFO ] Deduced a trap composed of 29 places in 27 ms
[2020-06-03 03:55:39] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2020-06-03 03:55:39] [INFO ] Deduced a trap composed of 21 places in 28 ms
[2020-06-03 03:55:39] [INFO ] Deduced a trap composed of 37 places in 28 ms
[2020-06-03 03:55:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1226 ms
[2020-06-03 03:55:39] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-06-03 03:55:39] [INFO ] Added : 165 causal constraints over 34 iterations in 549 ms. Result :sat
[2020-06-03 03:55:39] [INFO ] Deduced a trap composed of 52 places in 39 ms
[2020-06-03 03:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-06-03 03:55:39] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-06-03 03:55:39] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:55:39] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2020-06-03 03:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:39] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 13 places in 48 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 14 places in 41 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 15 places in 41 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 23 places in 40 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 33 places in 44 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 57 places in 40 ms
[2020-06-03 03:55:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 479 ms
[2020-06-03 03:55:40] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:55:40] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:40] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 15 places in 62 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 15 places in 39 ms
[2020-06-03 03:55:40] [INFO ] Deduced a trap composed of 8 places in 55 ms
[2020-06-03 03:55:41] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2020-06-03 03:55:41] [INFO ] Deduced a trap composed of 30 places in 126 ms
[2020-06-03 03:55:41] [INFO ] Deduced a trap composed of 15 places in 20 ms
[2020-06-03 03:55:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 512 ms
[2020-06-03 03:55:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-06-03 03:55:41] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:41] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-06-03 03:55:41] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-06-03 03:55:41] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-06-03 03:55:41] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-06-03 03:55:41] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-06-03 03:55:42] [INFO ] Deduced a trap composed of 8 places in 835 ms
[2020-06-03 03:55:43] [INFO ] Deduced a trap composed of 20 places in 738 ms
[2020-06-03 03:55:43] [INFO ] Deduced a trap composed of 30 places in 147 ms
[2020-06-03 03:55:43] [INFO ] Deduced a trap composed of 15 places in 73 ms
[2020-06-03 03:55:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2127 ms
[2020-06-03 03:55:43] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 6 ms.
[2020-06-03 03:55:44] [INFO ] Added : 138 causal constraints over 28 iterations in 613 ms. Result :sat
[2020-06-03 03:55:44] [INFO ] [Real]Absence check using 30 positive place invariants in 139 ms returned sat
[2020-06-03 03:55:44] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 104 ms returned sat
[2020-06-03 03:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:45] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2020-06-03 03:55:47] [INFO ] Deduced a trap composed of 15 places in 1920 ms
[2020-06-03 03:55:47] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2020-06-03 03:55:47] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2020-06-03 03:55:47] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 03:55:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2121 ms
[2020-06-03 03:55:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 68 ms returned sat
[2020-06-03 03:55:47] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:47] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2020-06-03 03:55:47] [INFO ] Deduced a trap composed of 15 places in 99 ms
[2020-06-03 03:55:48] [INFO ] Deduced a trap composed of 17 places in 60 ms
[2020-06-03 03:55:48] [INFO ] Deduced a trap composed of 19 places in 349 ms
[2020-06-03 03:55:48] [INFO ] Deduced a trap composed of 8 places in 56 ms
[2020-06-03 03:55:48] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2020-06-03 03:55:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 681 ms
[2020-06-03 03:55:48] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-06-03 03:55:49] [INFO ] Added : 139 causal constraints over 29 iterations in 762 ms. Result :sat
[2020-06-03 03:55:49] [INFO ] [Real]Absence check using 30 positive place invariants in 30 ms returned sat
[2020-06-03 03:55:49] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:49] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2020-06-03 03:55:49] [INFO ] Deduced a trap composed of 8 places in 34 ms
[2020-06-03 03:55:49] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-06-03 03:55:49] [INFO ] Deduced a trap composed of 28 places in 32 ms
[2020-06-03 03:55:49] [INFO ] Deduced a trap composed of 16 places in 27 ms
[2020-06-03 03:55:50] [INFO ] Deduced a trap composed of 29 places in 500 ms
[2020-06-03 03:55:50] [INFO ] Deduced a trap composed of 19 places in 67 ms
[2020-06-03 03:55:50] [INFO ] Deduced a trap composed of 31 places in 67 ms
[2020-06-03 03:55:50] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2020-06-03 03:55:50] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-06-03 03:55:50] [INFO ] Deduced a trap composed of 35 places in 90 ms
[2020-06-03 03:55:50] [INFO ] Deduced a trap composed of 34 places in 62 ms
[2020-06-03 03:55:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1167 ms
[2020-06-03 03:55:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 35 ms returned sat
[2020-06-03 03:55:50] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-06-03 03:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:51] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2020-06-03 03:55:51] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2020-06-03 03:55:51] [INFO ] Deduced a trap composed of 12 places in 35 ms
[2020-06-03 03:55:51] [INFO ] Deduced a trap composed of 28 places in 33 ms
[2020-06-03 03:55:51] [INFO ] Deduced a trap composed of 16 places in 311 ms
[2020-06-03 03:55:51] [INFO ] Deduced a trap composed of 29 places in 55 ms
[2020-06-03 03:55:51] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2020-06-03 03:55:52] [INFO ] Deduced a trap composed of 31 places in 1001 ms
[2020-06-03 03:55:52] [INFO ] Deduced a trap composed of 22 places in 42 ms
[2020-06-03 03:55:52] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-06-03 03:55:53] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2020-06-03 03:55:53] [INFO ] Deduced a trap composed of 34 places in 26 ms
[2020-06-03 03:55:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1891 ms
[2020-06-03 03:55:53] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 13 ms.
[2020-06-03 03:55:53] [INFO ] Added : 155 causal constraints over 31 iterations in 596 ms. Result :sat
[2020-06-03 03:55:53] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-06-03 03:55:53] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2020-06-03 03:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:54] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-06-03 03:55:54] [INFO ] Deduced a trap composed of 19 places in 89 ms
[2020-06-03 03:55:54] [INFO ] Deduced a trap composed of 12 places in 82 ms
[2020-06-03 03:55:54] [INFO ] Deduced a trap composed of 11 places in 529 ms
[2020-06-03 03:55:54] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2020-06-03 03:55:55] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 03:55:55] [INFO ] Deduced a trap composed of 20 places in 51 ms
[2020-06-03 03:55:55] [INFO ] Deduced a trap composed of 23 places in 236 ms
[2020-06-03 03:55:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1294 ms
[2020-06-03 03:55:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 206 ms returned sat
[2020-06-03 03:55:55] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 104 ms returned sat
[2020-06-03 03:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:56] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2020-06-03 03:55:56] [INFO ] Deduced a trap composed of 19 places in 40 ms
[2020-06-03 03:55:56] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-06-03 03:55:56] [INFO ] Deduced a trap composed of 11 places in 36 ms
[2020-06-03 03:55:56] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2020-06-03 03:55:56] [INFO ] Deduced a trap composed of 16 places in 30 ms
[2020-06-03 03:55:56] [INFO ] Deduced a trap composed of 23 places in 32 ms
[2020-06-03 03:55:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 290 ms
[2020-06-03 03:55:56] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-06-03 03:55:57] [INFO ] Added : 143 causal constraints over 29 iterations in 407 ms. Result :sat
[2020-06-03 03:55:57] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2020-06-03 03:55:57] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:57] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 10 places in 42 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 14 places in 59 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 13 places in 43 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 26 places in 27 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 29 places in 29 ms
[2020-06-03 03:55:57] [INFO ] Deduced a trap composed of 35 places in 51 ms
[2020-06-03 03:55:58] [INFO ] Deduced a trap composed of 31 places in 240 ms
[2020-06-03 03:55:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 712 ms
[2020-06-03 03:55:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 31 ms returned sat
[2020-06-03 03:55:58] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2020-06-03 03:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:58] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-06-03 03:55:58] [INFO ] Deduced a trap composed of 10 places in 51 ms
[2020-06-03 03:55:58] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-06-03 03:55:58] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2020-06-03 03:55:59] [INFO ] Deduced a trap composed of 16 places in 429 ms
[2020-06-03 03:55:59] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2020-06-03 03:55:59] [INFO ] Deduced a trap composed of 28 places in 34 ms
[2020-06-03 03:55:59] [INFO ] Deduced a trap composed of 18 places in 243 ms
[2020-06-03 03:55:59] [INFO ] Deduced a trap composed of 26 places in 31 ms
[2020-06-03 03:55:59] [INFO ] Deduced a trap composed of 29 places in 372 ms
[2020-06-03 03:56:02] [INFO ] Deduced a trap composed of 18 places in 2412 ms
[2020-06-03 03:56:04] [INFO ] Deduced a trap composed of 36 places in 2456 ms
[2020-06-03 03:56:04] [INFO ] Deduced a trap composed of 31 places in 56 ms
[2020-06-03 03:56:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6366 ms
[2020-06-03 03:56:04] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 22 ms.
[2020-06-03 03:56:06] [INFO ] Added : 156 causal constraints over 32 iterations in 1314 ms. Result :sat
[2020-06-03 03:56:06] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-03 03:56:06] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:56:06] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 03:56:06] [INFO ] Deduced a trap composed of 11 places in 63 ms
[2020-06-03 03:56:06] [INFO ] Deduced a trap composed of 8 places in 118 ms
[2020-06-03 03:56:06] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2020-06-03 03:56:06] [INFO ] Deduced a trap composed of 15 places in 114 ms
[2020-06-03 03:56:06] [INFO ] Deduced a trap composed of 22 places in 61 ms
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 35 places in 109 ms
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 10 places in 103 ms
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 35 places in 76 ms
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 33 places in 50 ms
[2020-06-03 03:56:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1104 ms
[2020-06-03 03:56:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:56:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 36 ms returned sat
[2020-06-03 03:56:07] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-06-03 03:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:56:07] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2020-06-03 03:56:07] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-06-03 03:56:08] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2020-06-03 03:56:08] [INFO ] Deduced a trap composed of 14 places in 39 ms
[2020-06-03 03:56:08] [INFO ] Deduced a trap composed of 14 places in 34 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 21 places in 1014 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 17 places in 328 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 22 places in 42 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 28 places in 70 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 27 places in 30 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 37 places in 26 ms
[2020-06-03 03:56:09] [INFO ] Deduced a trap composed of 33 places in 27 ms
[2020-06-03 03:56:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1930 ms
[2020-06-03 03:56:09] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-06-03 03:56:10] [INFO ] Added : 147 causal constraints over 30 iterations in 469 ms. Result :sat
[2020-06-03 03:56:10] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-06-03 03:56:10] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-06-03 03:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:56:10] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2020-06-03 03:56:10] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-06-03 03:56:10] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2020-06-03 03:56:10] [INFO ] Deduced a trap composed of 21 places in 67 ms
[2020-06-03 03:56:10] [INFO ] Deduced a trap composed of 12 places in 51 ms
[2020-06-03 03:56:10] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2020-06-03 03:56:10] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 03:56:11] [INFO ] Deduced a trap composed of 19 places in 54 ms
[2020-06-03 03:56:13] [INFO ] Deduced a trap composed of 55 places in 2258 ms
[2020-06-03 03:56:13] [INFO ] Deduced a trap composed of 33 places in 97 ms
[2020-06-03 03:56:13] [INFO ] Deduced a trap composed of 23 places in 98 ms
[2020-06-03 03:56:13] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-06-03 03:56:13] [INFO ] Deduced a trap composed of 56 places in 52 ms
[2020-06-03 03:56:13] [INFO ] Deduced a trap composed of 58 places in 50 ms
[2020-06-03 03:56:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3166 ms
[2020-06-03 03:56:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:56:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-06-03 03:56:13] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:56:13] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 13 places in 80 ms
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 11 places in 33 ms
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2020-06-03 03:56:14] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2020-06-03 03:56:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 469 ms
[2020-06-03 03:56:14] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 7 ms.
[2020-06-03 03:56:14] [INFO ] Added : 142 causal constraints over 29 iterations in 559 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 03:56:15] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:56:15] [INFO ] Flatten gal took : 49 ms
[2020-06-03 03:56:15] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:56:15] [INFO ] Flatten gal took : 19 ms
FORMULA BusinessProcesses-PT-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:56:15] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 03:56:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BusinessProcesses-PT-02 @ 3570 seconds

FORMULA BusinessProcesses-PT-02-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 4741008 kB
After kill :
MemTotal: 16427332 kB
MemFree: 4759212 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="BusinessProcesses-PT-02"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;