Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.2K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 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 49K 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 ShieldRVs-PT-004B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVs-PT-004B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717038790140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 03:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 03:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 03:13:11] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-30 03:13:11] [INFO ] Transformed 163 places.
[2024-05-30 03:13:11] [INFO ] Transformed 183 transitions.
[2024-05-30 03:13:11] [INFO ] Found NUPN structural information;
[2024-05-30 03:13:11] [INFO ] Parsed PT model containing 163 places and 183 transitions and 576 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 85 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 183/183 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 177
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 177
Applied a total of 12 rules in 25 ms. Remains 157 /163 variables (removed 6) and now considering 177/183 (removed 6) transitions.
// Phase 1: matrix 177 rows 157 cols
[2024-05-30 03:13:11] [INFO ] Computed 17 invariants in 18 ms
[2024-05-30 03:13:11] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-30 03:13:11] [INFO ] Invariant cache hit.
[2024-05-30 03:13:11] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 03:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 10 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 2 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:13:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:14] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 6 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:15] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 5 ms to minimize.
[2024-05-30 03:13:16] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:13:17] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-30 03:13:18] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:19] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 2 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-05-30 03:13:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-30 03:13:21] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 17/154 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 2 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:22] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:23] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:24] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:25] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 14/208 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:26] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:27] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:27] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 03:13:27] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:27] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:27] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:27] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:27] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:28] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:28] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-30 03:13:28] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:29] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:29] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:29] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:29] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:30] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:30] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:31] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-05-30 03:13:31] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:31] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-30 03:13:31] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:31] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:31] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 03:13:32] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/157 variables, 16/255 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:33] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 03:13:34] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:34] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 03:13:34] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:34] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:34] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 1 ms to minimize.
[2024-05-30 03:13:34] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:13:34] [INFO ] Deduced a trap composed of 28 places in 18 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/157 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/157 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 20 (OVERLAPS) 177/334 variables, 157/420 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:13:36] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:37] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/334 variables, 19/439 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:13:39] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:40] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:40] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:40] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 1 ms to minimize.
[2024-05-30 03:13:40] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-30 03:13:40] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:40] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/334 variables, 19/458 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:13:41] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 03:13:41] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:13:41] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:13:41] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 1 ms to minimize.
[2024-05-30 03:13:41] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/334 variables, and 464 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 290/290 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 290/307 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:13:43] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 2 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 0 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:45] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-30 03:13:46] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:46] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:46] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 0 ms to minimize.
[2024-05-30 03:13:46] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:46] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:47] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:13:47] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:13:47] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:47] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:47] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:13:47] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:13:47] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 7/365 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:48] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:48] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:13:48] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:13:48] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:13:49] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 12/382 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:50] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 20/402 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:13:51] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:13:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:52] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-30 03:13:53] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:13:53] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:54] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (OVERLAPS) 177/334 variables, 157/567 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/334 variables, 176/743 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:13:57] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:13:58] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:13:58] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:13:58] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:13:59] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:13:59] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:13:59] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:14:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 9/752 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 03:14:08] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 03:14:08] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:14:09] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-30 03:14:09] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/334 variables, and 756 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 406/406 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 157/163 places, 177/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 157/163 places, 177/183 transitions.
Support contains 85 out of 157 places after structural reductions.
[2024-05-30 03:14:12] [INFO ] Flatten gal took : 38 ms
[2024-05-30 03:14:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 03:14:12] [INFO ] Flatten gal took : 30 ms
[2024-05-30 03:14:12] [INFO ] Input system was already deterministic with 177 transitions.
Support contains 82 out of 157 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (207 resets) in 1155 ms. (34 steps per ms) remains 5/58 properties
BEST_FIRST walk for 40003 steps (35 resets) in 145 ms. (273 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 91 ms. (434 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (33 resets) in 63 ms. (625 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2024-05-30 03:14:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/68 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/157 variables, 12/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/334 variables, 157/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 174 constraints, problems are : Problem set: 1 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/157 variables, 14/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 177/334 variables, 157/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 1/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 2/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/334 variables, 1/185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 03:14:13] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/334 variables, 1/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/334 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/334 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 187 constraints, problems are : Problem set: 1 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 721ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 177/177 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 157 transition count 160
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 140 transition count 160
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 140 transition count 140
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 74 place count 120 transition count 140
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 94 place count 100 transition count 120
Iterating global reduction 2 with 20 rules applied. Total rules applied 114 place count 100 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 114 place count 100 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 95 transition count 115
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 190 place count 62 transition count 82
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 202 place count 62 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 61 transition count 81
Applied a total of 203 rules in 38 ms. Remains 61 /157 variables (removed 96) and now considering 81/177 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 61/157 places, 81/177 transitions.
RANDOM walk for 1413 steps (19 resets) in 29 ms. (47 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-30 03:14:13] [INFO ] Flatten gal took : 10 ms
[2024-05-30 03:14:13] [INFO ] Flatten gal took : 10 ms
[2024-05-30 03:14:13] [INFO ] Input system was already deterministic with 177 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 156 transition count 161
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 141 transition count 161
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 30 place count 141 transition count 140
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 72 place count 120 transition count 140
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 93 place count 99 transition count 119
Iterating global reduction 2 with 21 rules applied. Total rules applied 114 place count 99 transition count 119
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 114 place count 99 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 128 place count 92 transition count 112
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 180 place count 66 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 64 transition count 84
Applied a total of 182 rules in 25 ms. Remains 64 /157 variables (removed 93) and now considering 84/177 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 64/157 places, 84/177 transitions.
[2024-05-30 03:14:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:13] [INFO ] Flatten gal took : 5 ms
[2024-05-30 03:14:13] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 139 transition count 159
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 139 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 138 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 138 transition count 158
Applied a total of 38 rules in 12 ms. Remains 138 /157 variables (removed 19) and now considering 158/177 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 138/157 places, 158/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 156 transition count 163
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 143 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 142 transition count 162
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 28 place count 142 transition count 143
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 66 place count 123 transition count 143
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 86 place count 103 transition count 123
Iterating global reduction 3 with 20 rules applied. Total rules applied 106 place count 103 transition count 123
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 106 place count 103 transition count 118
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 116 place count 98 transition count 118
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 174 place count 69 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 68 transition count 88
Applied a total of 175 rules in 20 ms. Remains 68 /157 variables (removed 89) and now considering 88/177 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 68/157 places, 88/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 5 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 5 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 135 transition count 155
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 135 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 134 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 134 transition count 154
Applied a total of 46 rules in 5 ms. Remains 134 /157 variables (removed 23) and now considering 154/177 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 134/157 places, 154/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 141 transition count 161
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 141 transition count 161
Applied a total of 32 rules in 3 ms. Remains 141 /157 variables (removed 16) and now considering 161/177 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 141/157 places, 161/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 157 transition count 162
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 142 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 141 transition count 161
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 32 place count 141 transition count 142
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 70 place count 122 transition count 142
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 89 place count 103 transition count 123
Iterating global reduction 3 with 19 rules applied. Total rules applied 108 place count 103 transition count 123
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 108 place count 103 transition count 115
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 124 place count 95 transition count 115
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 186 place count 64 transition count 84
Applied a total of 186 rules in 14 ms. Remains 64 /157 variables (removed 93) and now considering 84/177 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 64/157 places, 84/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 177/177 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 156 transition count 159
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 139 transition count 159
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 139 transition count 139
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 74 place count 119 transition count 139
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 96 place count 97 transition count 117
Iterating global reduction 2 with 22 rules applied. Total rules applied 118 place count 97 transition count 117
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 118 place count 97 transition count 109
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 134 place count 89 transition count 109
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 194 place count 59 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 57 transition count 77
Applied a total of 196 rules in 15 ms. Remains 57 /157 variables (removed 100) and now considering 77/177 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 57/157 places, 77/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 77 transitions.
RANDOM walk for 116 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 135 transition count 155
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 135 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 134 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 134 transition count 154
Applied a total of 46 rules in 4 ms. Remains 134 /157 variables (removed 23) and now considering 154/177 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 134/157 places, 154/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 156 transition count 160
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 140 transition count 160
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 32 place count 140 transition count 140
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 72 place count 120 transition count 140
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 94 place count 98 transition count 118
Iterating global reduction 2 with 22 rules applied. Total rules applied 116 place count 98 transition count 118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 116 place count 98 transition count 111
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 91 transition count 111
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 190 place count 61 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 59 transition count 79
Applied a total of 192 rules in 14 ms. Remains 59 /157 variables (removed 98) and now considering 79/177 (removed 98) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 59/157 places, 79/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 177/177 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 156 transition count 159
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 139 transition count 159
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 34 place count 139 transition count 141
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 70 place count 121 transition count 141
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 89 place count 102 transition count 122
Iterating global reduction 2 with 19 rules applied. Total rules applied 108 place count 102 transition count 122
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 108 place count 102 transition count 114
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 124 place count 94 transition count 114
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 184 place count 64 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 62 transition count 82
Applied a total of 186 rules in 13 ms. Remains 62 /157 variables (removed 95) and now considering 82/177 (removed 95) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 62/157 places, 82/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 5 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 143 transition count 163
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 143 transition count 163
Applied a total of 28 rules in 3 ms. Remains 143 /157 variables (removed 14) and now considering 163/177 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 143/157 places, 163/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 177/177 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 156 transition count 159
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 139 transition count 159
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 139 transition count 139
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 74 place count 119 transition count 139
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 95 place count 98 transition count 118
Iterating global reduction 2 with 21 rules applied. Total rules applied 116 place count 98 transition count 118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 116 place count 98 transition count 111
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 91 transition count 111
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 192 place count 60 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 58 transition count 78
Applied a total of 194 rules in 11 ms. Remains 58 /157 variables (removed 99) and now considering 78/177 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 58/157 places, 78/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 3 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 138 transition count 158
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 138 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 137 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 137 transition count 157
Applied a total of 40 rules in 4 ms. Remains 137 /157 variables (removed 20) and now considering 157/177 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/157 places, 157/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 139 transition count 159
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 139 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 138 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 138 transition count 158
Applied a total of 38 rules in 4 ms. Remains 138 /157 variables (removed 19) and now considering 158/177 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 138/157 places, 158/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 23 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 177/177 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 138 transition count 158
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 138 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 137 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 137 transition count 157
Applied a total of 40 rules in 3 ms. Remains 137 /157 variables (removed 20) and now considering 157/177 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/157 places, 157/177 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:14:14] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-30 03:14:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 177 transitions and 564 arcs took 2 ms.
Total runtime 63294 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-004B

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1809
MODEL NAME: /home/mcc/execution/411/model
157 places, 177 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-004B-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-004B-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-004B-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-004B-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-004B-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717040855049

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-004B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-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 r355-tall-171683759500761"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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