fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r355-tall-171683758700394
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldPPPs-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14679.455 3600000.00 14149872.00 312.00 ??T????F???????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758700394.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPs-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758700394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 52K May 18 16:43 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 ShieldPPPs-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPs-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716955537131

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 04:05:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 04:05:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:05:38] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-29 04:05:38] [INFO ] Transformed 207 places.
[2024-05-29 04:05:38] [INFO ] Transformed 192 transitions.
[2024-05-29 04:05:38] [INFO ] Found NUPN structural information;
[2024-05-29 04:05:38] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 88 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 201 transition count 186
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 201 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 200 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 200 transition count 185
Applied a total of 14 rules in 37 ms. Remains 200 /207 variables (removed 7) and now considering 185/192 (removed 7) transitions.
// Phase 1: matrix 185 rows 200 cols
[2024-05-29 04:05:38] [INFO ] Computed 34 invariants in 17 ms
[2024-05-29 04:05:38] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 04:05:38] [INFO ] Invariant cache hit.
[2024-05-29 04:05:39] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-29 04:05:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 11 ms to minimize.
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 9 ms to minimize.
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-29 04:05:41] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 3 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 4 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:43] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:05:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:44] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:05:44] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:44] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:05:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:05:46] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:05:47] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:48] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:05:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:48] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:05:48] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 185/385 variables, 200/289 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:50] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:05:50] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:05:50] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:05:50] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:50] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 04:05:50] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:05:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:05:51] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:05:51] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:51] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 10/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:52] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:05:52] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:52] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 13/315 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:05:56] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:58] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:05:58] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/385 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:59] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:06:00] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:06:00] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:00] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/385 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/385 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/385 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:05] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 0 ms to minimize.
[2024-05-29 04:06:06] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:06:06] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:06:06] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/385 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/385 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/385 variables, and 350 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:06:10] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-05-29 04:06:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:11] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 56 places in 30 ms of which 3 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 14/175 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:13] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:14] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 2 ms to minimize.
[2024-05-29 04:06:14] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:06:14] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:15] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:06:15] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:06:15] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:16] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:06:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:06:16] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:06:16] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:06:16] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 50 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 48 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:06:17] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 9/196 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 185/385 variables, 200/396 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 184/580 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 14/594 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:26] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 04:06:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:06:27] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:06:28] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:06:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:06:28] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:06:28] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:06:28] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:06:28] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/385 variables, 9/603 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:34] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:06:34] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:06:35] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:06:35] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 04:06:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:06:36] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:06:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 7/610 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/385 variables, and 610 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 192/192 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 200/207 places, 185/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60599 ms. Remains : 200/207 places, 185/192 transitions.
Support contains 88 out of 200 places after structural reductions.
[2024-05-29 04:06:39] [INFO ] Flatten gal took : 41 ms
[2024-05-29 04:06:39] [INFO ] Flatten gal took : 29 ms
[2024-05-29 04:06:39] [INFO ] Input system was already deterministic with 185 transitions.
Support contains 86 out of 200 places (down from 88) after GAL structural reductions.
RANDOM walk for 40000 steps (71 resets) in 1428 ms. (27 steps per ms) remains 2/68 properties
BEST_FIRST walk for 40003 steps (10 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
[2024-05-29 04:06:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 195/200 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/385 variables, 200/234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/385 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 234 constraints, problems are : Problem set: 1 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp43 is UNSAT
After SMT solving in domain Int declared 200/385 variables, and 34 constraints, problems are : Problem set: 2 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 185 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 199 transition count 164
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 179 transition count 164
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 40 place count 179 transition count 149
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 70 place count 164 transition count 149
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 84 place count 150 transition count 135
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 150 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 98 place count 150 transition count 132
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 147 transition count 132
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 192 place count 103 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 101 transition count 86
Applied a total of 194 rules in 54 ms. Remains 101 /200 variables (removed 99) and now considering 86/185 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 101/200 places, 86/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 199 transition count 161
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 176 transition count 161
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 46 place count 176 transition count 147
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 74 place count 162 transition count 147
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 89 place count 147 transition count 132
Iterating global reduction 2 with 15 rules applied. Total rules applied 104 place count 147 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 104 place count 147 transition count 128
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 143 transition count 128
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 204 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 95 transition count 80
Applied a total of 206 rules in 23 ms. Remains 95 /200 variables (removed 105) and now considering 80/185 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 95/200 places, 80/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 199 transition count 161
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 176 transition count 161
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 176 transition count 146
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 161 transition count 146
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 91 place count 146 transition count 131
Iterating global reduction 2 with 15 rules applied. Total rules applied 106 place count 146 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 106 place count 146 transition count 127
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 142 transition count 127
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 206 place count 96 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 94 transition count 79
Applied a total of 208 rules in 31 ms. Remains 94 /200 variables (removed 106) and now considering 79/185 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 94/200 places, 79/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 79 transitions.
RANDOM walk for 464 steps (0 resets) in 9 ms. (46 steps per ms) remains 0/1 properties
FORMULA ShieldPPPs-PT-003B-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 199 transition count 162
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 177 transition count 162
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 177 transition count 147
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 162 transition count 147
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 88 place count 148 transition count 133
Iterating global reduction 2 with 14 rules applied. Total rules applied 102 place count 148 transition count 133
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 102 place count 148 transition count 129
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 144 transition count 129
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 200 place count 99 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 97 transition count 82
Applied a total of 202 rules in 25 ms. Remains 97 /200 variables (removed 103) and now considering 82/185 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 97/200 places, 82/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 5 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 188 transition count 173
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 188 transition count 173
Applied a total of 24 rules in 6 ms. Remains 188 /200 variables (removed 12) and now considering 173/185 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 188/200 places, 173/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 199 transition count 166
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 181 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 180 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 38 place count 180 transition count 153
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 168 transition count 153
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 73 place count 157 transition count 142
Iterating global reduction 3 with 11 rules applied. Total rules applied 84 place count 157 transition count 142
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 157 transition count 140
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 155 transition count 140
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 182 place count 108 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 106 transition count 91
Applied a total of 184 rules in 22 ms. Remains 106 /200 variables (removed 94) and now considering 91/185 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 106/200 places, 91/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 6 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 7 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 6 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 20 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 12 ms
[2024-05-29 04:06:40] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 5 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:41] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 188 transition count 173
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 188 transition count 173
Applied a total of 24 rules in 6 ms. Remains 188 /200 variables (removed 12) and now considering 173/185 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 188/200 places, 173/185 transitions.
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:41] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 185 transition count 170
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 185 transition count 170
Applied a total of 30 rules in 6 ms. Remains 185 /200 variables (removed 15) and now considering 170/185 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 185/200 places, 170/185 transitions.
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:41] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 199 transition count 161
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 176 transition count 161
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 176 transition count 146
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 161 transition count 146
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 90 place count 147 transition count 132
Iterating global reduction 2 with 14 rules applied. Total rules applied 104 place count 147 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 104 place count 147 transition count 128
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 143 transition count 128
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 206 place count 96 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 94 transition count 79
Applied a total of 208 rules in 19 ms. Remains 94 /200 variables (removed 106) and now considering 79/185 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 94/200 places, 79/185 transitions.
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 3 ms
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:06:41] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 5 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:41] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 6 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:41] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:41] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:41] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2024-05-29 04:06:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 185 transitions and 514 arcs took 3 ms.
Total runtime 63026 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-003B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 200
TRANSITIONS: 185
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1131
MODEL NAME: /home/mcc/execution/413/model
200 places, 185 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldPPPs-PT-003B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ShieldPPPs-PT-003B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPs-PT-003B, 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 r355-tall-171683758700394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-003B.tgz
mv ShieldPPPs-PT-003B 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 ;