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

About the Execution of LTSMin+red for ShieldIIPs-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
392.972 64125.00 89073.00 229.10 [undef] Cannot compute

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.r528-tall-171683760300057.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 ltsminxred
Input is ShieldIIPs-PT-004B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760300057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 66K 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 ShieldIIPs-PT-004B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPs-PT-004B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717223625152

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:33:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:33:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:33:46] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 06:33:46] [INFO ] Transformed 243 places.
[2024-06-01 06:33:46] [INFO ] Transformed 239 transitions.
[2024-06-01 06:33:46] [INFO ] Found NUPN structural information;
[2024-06-01 06:33:46] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 123 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 238 transition count 234
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 238 transition count 234
Applied a total of 10 rules in 30 ms. Remains 238 /243 variables (removed 5) and now considering 234/239 (removed 5) transitions.
// Phase 1: matrix 234 rows 238 cols
[2024-06-01 06:33:46] [INFO ] Computed 37 invariants in 18 ms
[2024-06-01 06:33:46] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 06:33:46] [INFO ] Invariant cache hit.
[2024-06-01 06:33:47] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-06-01 06:33:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 12 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 4 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:33:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 2 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:33:56] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:33:58] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:33:58] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:33:58] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:33:58] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:33:59] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:33:59] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:33:59] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:33:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:33:59] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:00] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:00] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:34:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:01] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:03] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:03] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:34:03] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:34:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:34:03] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:04] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:34:04] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:34:05] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:05] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:06] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 2 ms to minimize.
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:34:08] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:09] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:14] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:15] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:34:15] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:34:15] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/472 variables, and 168 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 131/131 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 131/168 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:22] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:22] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:34:23] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:34:24] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:34:24] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:34:24] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:34:24] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:25] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:25] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:34:25] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:25] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:27] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:34:27] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:34:27] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:27] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:27] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:27] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:28] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 38 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 15/255 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 2 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 52 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 19/294 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 8/302 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 19/321 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:40] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/472 variables, and 356 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 0/233 constraints, Known Traps: 319/319 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 238/243 places, 234/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 238/243 places, 234/239 transitions.
Support contains 123 out of 238 places after structural reductions.
[2024-06-01 06:34:47] [INFO ] Flatten gal took : 39 ms
[2024-06-01 06:34:47] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:34:47] [INFO ] Input system was already deterministic with 234 transitions.
Support contains 121 out of 238 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (68 resets) in 1169 ms. (34 steps per ms) remains 1/79 properties
BEST_FIRST walk for 5034 steps (0 resets) in 42 ms. (117 steps per ms) remains 0/1 properties
[2024-06-01 06:34:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:34:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 234 transitions.
Computed a total of 61 stabilizing places and 61 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 237 transition count 214
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 218 transition count 214
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 38 place count 218 transition count 193
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 80 place count 197 transition count 193
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 103 place count 174 transition count 170
Iterating global reduction 2 with 23 rules applied. Total rules applied 126 place count 174 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 126 place count 174 transition count 160
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 146 place count 164 transition count 160
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 254 place count 110 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 108 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 107 transition count 104
Applied a total of 257 rules in 63 ms. Remains 107 /238 variables (removed 131) and now considering 104/234 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 107/238 places, 104/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 212
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 212
Applied a total of 44 rules in 8 ms. Remains 216 /238 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 216/238 places, 212/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 212
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 212
Applied a total of 44 rules in 10 ms. Remains 216 /238 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 216/238 places, 212/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 215 transition count 211
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 215 transition count 211
Applied a total of 46 rules in 7 ms. Remains 215 /238 variables (removed 23) and now considering 211/234 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 215/238 places, 211/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 219 transition count 215
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 219 transition count 215
Applied a total of 38 rules in 7 ms. Remains 219 /238 variables (removed 19) and now considering 215/234 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 219/238 places, 215/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 237 transition count 214
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 218 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 217 transition count 213
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 40 place count 217 transition count 192
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 82 place count 196 transition count 192
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 106 place count 172 transition count 168
Iterating global reduction 3 with 24 rules applied. Total rules applied 130 place count 172 transition count 168
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 130 place count 172 transition count 157
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 152 place count 161 transition count 157
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 262 place count 106 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 104 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 103 transition count 100
Applied a total of 265 rules in 34 ms. Remains 103 /238 variables (removed 135) and now considering 100/234 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 103/238 places, 100/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 234/234 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 237 transition count 213
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 217 transition count 213
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 40 place count 217 transition count 193
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 197 transition count 193
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 103 place count 174 transition count 170
Iterating global reduction 2 with 23 rules applied. Total rules applied 126 place count 174 transition count 170
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 126 place count 174 transition count 159
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 148 place count 163 transition count 159
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 256 place count 109 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 258 place count 107 transition count 103
Applied a total of 258 rules in 26 ms. Remains 107 /238 variables (removed 131) and now considering 103/234 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 107/238 places, 103/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 237 transition count 216
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 220 transition count 216
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 34 place count 220 transition count 196
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 74 place count 200 transition count 196
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 93 place count 181 transition count 177
Iterating global reduction 2 with 19 rules applied. Total rules applied 112 place count 181 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 112 place count 181 transition count 167
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 132 place count 171 transition count 167
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 238 place count 118 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 116 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 115 transition count 112
Applied a total of 241 rules in 30 ms. Remains 115 /238 variables (removed 123) and now considering 112/234 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 115/238 places, 112/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 220 transition count 216
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 220 transition count 216
Applied a total of 36 rules in 7 ms. Remains 220 /238 variables (removed 18) and now considering 216/234 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 220/238 places, 216/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 234/234 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 237 transition count 213
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 217 transition count 213
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 40 place count 217 transition count 192
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 196 transition count 192
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 106 place count 172 transition count 168
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 172 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 130 place count 172 transition count 158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 150 place count 162 transition count 158
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 268 place count 103 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 270 place count 101 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 100 transition count 97
Applied a total of 271 rules in 23 ms. Remains 100 /238 variables (removed 138) and now considering 97/234 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 100/238 places, 97/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 212
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 212
Applied a total of 44 rules in 10 ms. Remains 216 /238 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 216/238 places, 212/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 222 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 222 transition count 218
Applied a total of 32 rules in 6 ms. Remains 222 /238 variables (removed 16) and now considering 218/234 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 222/238 places, 218/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 234/234 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 237 transition count 215
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 219 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 218 transition count 214
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 38 place count 218 transition count 194
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 78 place count 198 transition count 194
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 101 place count 175 transition count 171
Iterating global reduction 3 with 23 rules applied. Total rules applied 124 place count 175 transition count 171
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 124 place count 175 transition count 161
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 144 place count 165 transition count 161
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 260 place count 107 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 106 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 105 transition count 102
Applied a total of 262 rules in 24 ms. Remains 105 /238 variables (removed 133) and now considering 102/234 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 105/238 places, 102/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 212
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 212
Applied a total of 44 rules in 7 ms. Remains 216 /238 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 216/238 places, 212/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 237 transition count 216
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 220 transition count 216
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 34 place count 220 transition count 197
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 72 place count 201 transition count 197
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 94 place count 179 transition count 175
Iterating global reduction 2 with 22 rules applied. Total rules applied 116 place count 179 transition count 175
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 116 place count 179 transition count 167
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 132 place count 171 transition count 167
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 244 place count 115 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 113 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 247 place count 112 transition count 109
Applied a total of 247 rules in 22 ms. Remains 112 /238 variables (removed 126) and now considering 109/234 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 112/238 places, 109/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 234/234 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 212
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 212
Applied a total of 44 rules in 7 ms. Remains 216 /238 variables (removed 22) and now considering 212/234 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 216/238 places, 212/234 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:34:48] [INFO ] Input system was already deterministic with 212 transitions.
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:34:48] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:34:48] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 06:34:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 238 places, 234 transitions and 708 arcs took 2 ms.
Total runtime 62615 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 : ShieldIIPs-PT-004B-CTLCardinality-2024-00
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-01
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-03
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-05
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-07
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-08
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2023-14
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLCardinality-2023-15

BK_STOP 1717223689277

--------------------
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 ShieldIIPs-PT-004B-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1467/ctl_0_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1467/ctl_1_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1467/ctl_2_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1467/ctl_3_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1467/ctl_4_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1467/ctl_5_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1467/ctl_6_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1467/ctl_7_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1467/ctl_8_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1467/ctl_9_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1467/ctl_10_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1467/ctl_11_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1467/ctl_12_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1467/ctl_13_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1467/ctl_14_
ctl formula name ShieldIIPs-PT-004B-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1467/ctl_15_
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="ShieldIIPs-PT-004B"
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 ShieldIIPs-PT-004B, 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 r528-tall-171683760300057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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