Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399600505.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K 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:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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-08-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717225338850

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:02:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:02:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:02:20] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-01 07:02:20] [INFO ] Transformed 393 places.
[2024-06-01 07:02:20] [INFO ] Transformed 344 transitions.
[2024-06-01 07:02:20] [INFO ] Found NUPN structural information;
[2024-06-01 07:02:20] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
Support contains 116 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 375 transition count 331
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 45 place count 335 transition count 291
Iterating global reduction 1 with 40 rules applied. Total rules applied 85 place count 335 transition count 291
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 101 place count 319 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 117 place count 319 transition count 275
Applied a total of 117 rules in 71 ms. Remains 319 /380 variables (removed 61) and now considering 275/331 (removed 56) transitions.
// Phase 1: matrix 275 rows 319 cols
[2024-06-01 07:02:20] [INFO ] Computed 53 invariants in 23 ms
[2024-06-01 07:02:20] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 07:02:20] [INFO ] Invariant cache hit.
[2024-06-01 07:02:21] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-01 07:02:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 4/319 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 18 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 7 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 3 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 4 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 3 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 3 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 3 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 3 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 4 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:51] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:02:51] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:51] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:51] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 30113ms, After SMT, problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 30130ms
Starting structural reductions in LTL mode, iteration 1 : 319/380 places, 275/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30806 ms. Remains : 319/380 places, 275/331 transitions.
Support contains 116 out of 319 places after structural reductions.
[2024-06-01 07:02:51] [INFO ] Flatten gal took : 54 ms
[2024-06-01 07:02:51] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:02:51] [INFO ] Input system was already deterministic with 275 transitions.
Support contains 106 out of 319 places (down from 116) after GAL structural reductions.
RANDOM walk for 40000 steps (339 resets) in 2300 ms. (17 steps per ms) remains 14/70 properties
BEST_FIRST walk for 40004 steps (58 resets) in 256 ms. (155 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (58 resets) in 198 ms. (201 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (60 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 221 ms. (180 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (60 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (59 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (61 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (61 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
[2024-06-01 07:02:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 133/147 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 120/267 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 40/307 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 267/574 variables, 307/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 17/591 variables, 9/369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 3/594 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/594 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/594 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 372 constraints, problems are : Problem set: 0 solved, 6 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 133/147 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
Problem AtomicPropp36 is UNSAT
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 120/267 variables, 29/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 20/61 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 4 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 20/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 20/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 5461ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 173 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 640 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 309 transition count 216
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 99 place count 261 transition count 216
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 99 place count 261 transition count 160
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 222 place count 194 transition count 160
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 255 place count 161 transition count 127
Iterating global reduction 2 with 33 rules applied. Total rules applied 288 place count 161 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 288 place count 161 transition count 125
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 293 place count 158 transition count 125
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 131 rules applied. Total rules applied 424 place count 92 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 91 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 90 transition count 59
Applied a total of 426 rules in 48 ms. Remains 90 /319 variables (removed 229) and now considering 59/275 (removed 216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 90/319 places, 59/275 transitions.
RANDOM walk for 20048 steps (805 resets) in 404 ms. (49 steps per ms) remains 0/5 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:02:58] [INFO ] Input system was already deterministic with 275 transitions.
Computed a total of 113 stabilizing places and 107 stable transitions
Graph (complete) has 649 edges and 319 vertex of which 315 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 186 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 308 transition count 211
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 254 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 253 transition count 210
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 112 place count 253 transition count 154
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 235 place count 186 transition count 154
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 275 place count 146 transition count 114
Iterating global reduction 3 with 40 rules applied. Total rules applied 315 place count 146 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 315 place count 146 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 320 place count 143 transition count 112
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 448 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 449 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 450 place count 76 transition count 48
Applied a total of 450 rules in 38 ms. Remains 76 /319 variables (removed 243) and now considering 48/275 (removed 227) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 76/319 places, 48/275 transitions.
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:02:58] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 278 transition count 237
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 278 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 278 transition count 236
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 262 transition count 220
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 262 transition count 220
Applied a total of 112 rules in 21 ms. Remains 262 /319 variables (removed 57) and now considering 220/275 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 262/319 places, 220/275 transitions.
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:02:58] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 42 place count 277 transition count 236
Iterating global reduction 1 with 39 rules applied. Total rules applied 81 place count 277 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 277 transition count 235
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 96 place count 263 transition count 221
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 263 transition count 221
Applied a total of 110 rules in 20 ms. Remains 263 /319 variables (removed 56) and now considering 221/275 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 263/319 places, 221/275 transitions.
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:58] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 282 transition count 241
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 282 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 282 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 270 transition count 228
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 270 transition count 228
Applied a total of 96 rules in 19 ms. Remains 270 /319 variables (removed 49) and now considering 228/275 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 270/319 places, 228/275 transitions.
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:58] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 177 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 310 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 309 transition count 216
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 260 transition count 216
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 100 place count 260 transition count 161
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 221 place count 194 transition count 161
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 256 place count 159 transition count 126
Iterating global reduction 2 with 35 rules applied. Total rules applied 291 place count 159 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 291 place count 159 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 295 place count 157 transition count 124
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 418 place count 95 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 419 place count 94 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 420 place count 93 transition count 62
Applied a total of 420 rules in 29 ms. Remains 93 /319 variables (removed 226) and now considering 62/275 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 93/319 places, 62/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 279 transition count 238
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 279 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 279 transition count 237
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 93 place count 264 transition count 222
Iterating global reduction 2 with 15 rules applied. Total rules applied 108 place count 264 transition count 222
Applied a total of 108 rules in 19 ms. Remains 264 /319 variables (removed 55) and now considering 222/275 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 264/319 places, 222/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 275 transition count 234
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 275 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 275 transition count 233
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 259 transition count 217
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 259 transition count 217
Applied a total of 118 rules in 19 ms. Remains 259 /319 variables (removed 60) and now considering 217/275 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 259/319 places, 217/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (complete) has 649 edges and 319 vertex of which 315 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 314 transition count 234
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 83 place count 275 transition count 230
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 271 transition count 230
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 87 place count 271 transition count 170
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 218 place count 200 transition count 170
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 252 place count 166 transition count 136
Iterating global reduction 3 with 34 rules applied. Total rules applied 286 place count 166 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 166 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 165 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 289 place count 165 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 291 place count 164 transition count 133
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 413 place count 102 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 414 place count 102 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 415 place count 101 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 416 place count 100 transition count 71
Applied a total of 416 rules in 37 ms. Remains 100 /319 variables (removed 219) and now considering 71/275 (removed 204) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 100/319 places, 71/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 279 transition count 238
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 279 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 279 transition count 237
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 94 place count 263 transition count 221
Iterating global reduction 2 with 16 rules applied. Total rules applied 110 place count 263 transition count 221
Applied a total of 110 rules in 24 ms. Remains 263 /319 variables (removed 56) and now considering 221/275 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 263/319 places, 221/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 278 transition count 237
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 278 transition count 237
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 93 place count 264 transition count 223
Iterating global reduction 1 with 14 rules applied. Total rules applied 107 place count 264 transition count 223
Applied a total of 107 rules in 19 ms. Remains 264 /319 variables (removed 55) and now considering 223/275 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 264/319 places, 223/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 185 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 308 transition count 211
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 254 transition count 211
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 110 place count 254 transition count 156
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 189 transition count 156
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 270 place count 149 transition count 116
Iterating global reduction 2 with 40 rules applied. Total rules applied 310 place count 149 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 310 place count 149 transition count 114
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 315 place count 146 transition count 114
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 445 place count 80 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 446 place count 79 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 447 place count 78 transition count 49
Applied a total of 447 rules in 25 ms. Remains 78 /319 variables (removed 241) and now considering 49/275 (removed 226) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 78/319 places, 49/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 279 transition count 238
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 279 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 279 transition count 237
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 94 place count 263 transition count 221
Iterating global reduction 2 with 16 rules applied. Total rules applied 110 place count 263 transition count 221
Applied a total of 110 rules in 24 ms. Remains 263 /319 variables (removed 56) and now considering 221/275 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 263/319 places, 221/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 275 transition count 234
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 275 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 275 transition count 233
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 259 transition count 217
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 259 transition count 217
Applied a total of 118 rules in 19 ms. Remains 259 /319 variables (removed 60) and now considering 217/275 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 259/319 places, 217/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 186 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 308 transition count 210
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 253 transition count 210
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 112 place count 253 transition count 154
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 235 place count 186 transition count 154
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 274 place count 147 transition count 115
Iterating global reduction 2 with 39 rules applied. Total rules applied 313 place count 147 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 313 place count 147 transition count 113
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 318 place count 144 transition count 113
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 448 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 449 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 450 place count 76 transition count 48
Applied a total of 450 rules in 23 ms. Remains 76 /319 variables (removed 243) and now considering 48/275 (removed 227) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 76/319 places, 48/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 44 steps (13 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 187 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 308 transition count 210
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 253 transition count 210
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 112 place count 253 transition count 154
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 235 place count 186 transition count 154
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 275 place count 146 transition count 114
Iterating global reduction 2 with 40 rules applied. Total rules applied 315 place count 146 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 315 place count 146 transition count 112
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 320 place count 143 transition count 112
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 446 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 447 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 448 place count 77 transition count 49
Applied a total of 448 rules in 38 ms. Remains 77 /319 variables (removed 242) and now considering 49/275 (removed 226) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 77/319 places, 49/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 49 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 177 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 308 transition count 216
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 259 transition count 216
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 100 place count 259 transition count 159
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 225 place count 191 transition count 159
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 260 place count 156 transition count 124
Iterating global reduction 2 with 35 rules applied. Total rules applied 295 place count 156 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 295 place count 156 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 300 place count 153 transition count 122
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 428 place count 88 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 87 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 86 transition count 58
Applied a total of 430 rules in 32 ms. Remains 86 /319 variables (removed 233) and now considering 58/275 (removed 217) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 86/319 places, 58/275 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:59] [INFO ] Input system was already deterministic with 58 transitions.
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:59] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:59] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:02:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 319 places, 275 transitions and 768 arcs took 2 ms.
Total runtime 39417 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-08-CTLCardinality-2023-15

BK_STOP 1717225379969

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1304/ctl_0_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1304/ctl_1_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1304/ctl_2_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1304/ctl_3_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1304/ctl_4_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1304/ctl_5_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1304/ctl_6_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1304/ctl_7_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1304/ctl_8_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1304/ctl_9_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1304/ctl_10_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1304/ctl_11_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1304/ctl_12_
ctl formula name BusinessProcesses-PT-08-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1304/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399600505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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