Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334332667

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:32:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:32:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:32:14] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-21 23:32:14] [INFO ] Transformed 403 places.
[2024-05-21 23:32:14] [INFO ] Transformed 374 transitions.
[2024-05-21 23:32:14] [INFO ] Found NUPN structural information;
[2024-05-21 23:32:14] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 42 place count 361 transition count 333
Iterating global reduction 1 with 41 rules applied. Total rules applied 83 place count 361 transition count 333
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 96 place count 348 transition count 320
Iterating global reduction 1 with 13 rules applied. Total rules applied 109 place count 348 transition count 320
Applied a total of 109 rules in 84 ms. Remains 348 /403 variables (removed 55) and now considering 320/374 (removed 54) transitions.
// Phase 1: matrix 320 rows 348 cols
[2024-05-21 23:32:14] [INFO ] Computed 64 invariants in 26 ms
[2024-05-21 23:32:14] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-21 23:32:14] [INFO ] Invariant cache hit.
[2024-05-21 23:32:15] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-21 23:32:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/348 variables, 35/63 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 29 ms to minimize.
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 11 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 9 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 14 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 3 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 4 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 4 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 60 places in 1853 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 4 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 3 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 20/184 constraints. Problems are: Problem set: 3 solved, 316 unsolved
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 4 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 4 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 20/204 constraints. Problems are: Problem set: 3 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 348/668 variables, and 204 constraints, problems are : Problem set: 3 solved, 316 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/348 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 3 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 28/28 constraints. Problems are: Problem set: 3 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/348 variables, 35/63 constraints. Problems are: Problem set: 3 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 1/64 constraints. Problems are: Problem set: 3 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 140/204 constraints. Problems are: Problem set: 3 solved, 316 unsolved
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 5 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 6 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 4 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 4 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 5 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 6 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 4 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 6 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 2 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 20/224 constraints. Problems are: Problem set: 11 solved, 308 unsolved
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 3 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 5 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 4 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 20/244 constraints. Problems are: Problem set: 11 solved, 308 unsolved
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 20/264 constraints. Problems are: Problem set: 11 solved, 308 unsolved
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 20/284 constraints. Problems are: Problem set: 11 solved, 308 unsolved
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 4 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 20/304 constraints. Problems are: Problem set: 11 solved, 308 unsolved
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 4 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 20/324 constraints. Problems are: Problem set: 11 solved, 308 unsolved
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 4 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 20/344 constraints. Problems are: Problem set: 11 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/668 variables, and 344 constraints, problems are : Problem set: 11 solved, 308 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/348 constraints, PredecessorRefiner: 0/319 constraints, Known Traps: 280/280 constraints]
After SMT, in 60226ms problems are : Problem set: 11 solved, 308 unsolved
Search for dead transitions found 11 dead transitions in 60257ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 348/403 places, 309/374 transitions.
Applied a total of 0 rules in 7 ms. Remains 348 /348 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61063 ms. Remains : 348/403 places, 309/374 transitions.
Support contains 83 out of 348 places after structural reductions.
[2024-05-21 23:33:15] [INFO ] Flatten gal took : 74 ms
[2024-05-21 23:33:15] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:33:15] [INFO ] Input system was already deterministic with 309 transitions.
RANDOM walk for 40000 steps (416 resets) in 1809 ms. (22 steps per ms) remains 2/47 properties
BEST_FIRST walk for 40004 steps (84 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
// Phase 1: matrix 309 rows 348 cols
[2024-05-21 23:33:16] [INFO ] Computed 64 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/225 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/342 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/345 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 307/652 variables, 345/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/652 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/657 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/657 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 412 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/225 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 117/342 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/345 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 307/652 variables, 345/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/652 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/652 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/657 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/657 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/657 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 657/657 variables, and 444 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3173 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 30/30 constraints]
After SMT, in 3573ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 228 ms.
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 165 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 757 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 341 transition count 260
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 301 transition count 260
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 82 place count 301 transition count 194
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 224 place count 225 transition count 194
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 241 place count 208 transition count 177
Iterating global reduction 2 with 17 rules applied. Total rules applied 258 place count 208 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 258 place count 208 transition count 175
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 262 place count 206 transition count 175
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 411 place count 130 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 413 place count 129 transition count 105
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 415 place count 129 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 417 place count 127 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 418 place count 127 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 419 place count 126 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 420 place count 125 transition count 102
Applied a total of 420 rules in 82 ms. Remains 125 /348 variables (removed 223) and now considering 102/309 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 125/348 places, 102/309 transitions.
RANDOM walk for 40000 steps (2131 resets) in 379 ms. (105 steps per ms) remains 0/2 properties
[2024-05-21 23:33:20] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:33:20] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:33:20] [INFO ] Input system was already deterministic with 309 transitions.
Computed a total of 211 stabilizing places and 202 stable transitions
Graph (complete) has 765 edges and 348 vertex of which 347 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 171 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 340 transition count 257
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 297 transition count 257
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 88 place count 297 transition count 190
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 232 place count 220 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 250 place count 202 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 268 place count 202 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 202 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 200 transition count 170
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 425 place count 122 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 121 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 427 place count 120 transition count 94
Applied a total of 427 rules in 45 ms. Remains 120 /348 variables (removed 228) and now considering 94/309 (removed 215) transitions.
// Phase 1: matrix 94 rows 120 cols
[2024-05-21 23:33:20] [INFO ] Computed 50 invariants in 4 ms
[2024-05-21 23:33:20] [INFO ] Implicit Places using invariants in 107 ms returned [0, 1, 2, 10, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 110 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/348 places, 94/309 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 162 ms. Remains : 110/348 places, 94/309 transitions.
[2024-05-21 23:33:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:20] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-21 23:33:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:33:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:33:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11218822077100438625.gal : 4 ms
[2024-05-21 23:33:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6150528097545253456.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11218822077100438625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6150528097545253456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81971e+06,1.53673,50872,2,9868,5,231241,6,0,535,189880,0


Converting to forward existential form...Done !
original formula: EF(AG((p205==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p205==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t41, t42, t43, t44, t45, t55, t62, t63, t73, t74, t75, t77, t79, t80, t81...266
(forward)formula 0,1,8.02654,172088,1,0,157,1.00766e+06,184,67,3851,510655,176
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 328 transition count 289
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 328 transition count 289
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 319 transition count 280
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 319 transition count 280
Applied a total of 58 rules in 39 ms. Remains 319 /348 variables (removed 29) and now considering 280/309 (removed 29) transitions.
// Phase 1: matrix 280 rows 319 cols
[2024-05-21 23:33:29] [INFO ] Computed 64 invariants in 6 ms
[2024-05-21 23:33:29] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 23:33:29] [INFO ] Invariant cache hit.
[2024-05-21 23:33:29] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-21 23:33:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 1/319 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 4 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/104 constraints. Problems are: Problem set: 12 solved, 267 unsolved
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/124 constraints. Problems are: Problem set: 19 solved, 260 unsolved
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 20/144 constraints. Problems are: Problem set: 23 solved, 256 unsolved
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 20/164 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 20/184 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 4 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 20/204 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 20/224 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/599 variables, and 230 constraints, problems are : Problem set: 25 solved, 254 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 166/166 constraints]
Escalating to Integer solving :Problem set: 25 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 28/28 constraints. Problems are: Problem set: 25 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 0/28 constraints. Problems are: Problem set: 25 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/319 variables, 34/62 constraints. Problems are: Problem set: 25 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 2/64 constraints. Problems are: Problem set: 25 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 166/230 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/250 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 5 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 4 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/270 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 13/283 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 20/303 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 18/321 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 6/327 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 2/329 constraints. Problems are: Problem set: 25 solved, 254 unsolved
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 60223ms, After SMT, problems are : Problem set: 25 solved, 254 unsolved
Search for dead transitions found 25 dead transitions in 60232ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 319/348 places, 255/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 255
Applied a total of 3 rules in 6 ms. Remains 316 /319 variables (removed 3) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 316 cols
[2024-05-21 23:34:30] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 23:34:30] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 23:34:30] [INFO ] Invariant cache hit.
[2024-05-21 23:34:30] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 316/348 places, 255/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61372 ms. Remains : 316/348 places, 255/309 transitions.
[2024-05-21 23:34:30] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:34:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:34:30] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-21 23:34:30] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:34:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:34:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality6939638047387737779.gal : 9 ms
[2024-05-21 23:34:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8555421148998456995.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6939638047387737779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8555421148998456995.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:35:00] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:35:00] [INFO ] Applying decomposition
[2024-05-21 23:35:00] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17865004408118886120.txt' '-o' '/tmp/graph17865004408118886120.bin' '-w' '/tmp/graph17865004408118886120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17865004408118886120.bin' '-l' '-1' '-v' '-w' '/tmp/graph17865004408118886120.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:00] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:00] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-21 23:35:00] [INFO ] Flatten gal took : 66 ms
[2024-05-21 23:35:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-21 23:35:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality11635653526869524037.gal : 8 ms
[2024-05-21 23:35:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality12733437991488982244.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11635653526869524037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12733437991488982244.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.07184e+18,2.31664,67620,3804,44,109898,617,686,261032,65,1478,0


Converting to forward existential form...Done !
original formula: AX((AG(EF(((i12.u67.p202==0)&&(i14.i0.u58.p174==1)))) * ((i15.u89.p321==0)||(i2.u47.p142==1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U ((i12.u67.p202==0)&&(i14.i0.u58.p174==1)))))] = FALSE * [(EY(Init) * !(((i15...199
Reverse transition relation is NOT exact ! Due to transitions t7, t137, t155, t163, t167, t173, t183, t210, t214, t236, t238, t245, t246, t247, t250, i0.u7...860
(forward)formula 0,0,7.77979,213876,1,0,398465,881,4901,772780,339,2280,878664
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 327 transition count 288
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 327 transition count 288
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 317 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 317 transition count 278
Applied a total of 62 rules in 27 ms. Remains 317 /348 variables (removed 31) and now considering 278/309 (removed 31) transitions.
// Phase 1: matrix 278 rows 317 cols
[2024-05-21 23:35:08] [INFO ] Computed 64 invariants in 9 ms
[2024-05-21 23:35:09] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 23:35:09] [INFO ] Invariant cache hit.
[2024-05-21 23:35:09] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2024-05-21 23:35:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 5 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 5 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/104 constraints. Problems are: Problem set: 4 solved, 273 unsolved
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/124 constraints. Problems are: Problem set: 5 solved, 272 unsolved
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/144 constraints. Problems are: Problem set: 5 solved, 272 unsolved
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 4 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/164 constraints. Problems are: Problem set: 15 solved, 262 unsolved
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/184 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:35:31] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:31] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 3 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/204 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 20/224 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
SMT process timed out in 30148ms, After SMT, problems are : Problem set: 18 solved, 259 unsolved
Search for dead transitions found 18 dead transitions in 30153ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/348 places, 260/309 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 260
Applied a total of 1 rules in 5 ms. Remains 316 /317 variables (removed 1) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 316 cols
[2024-05-21 23:35:39] [INFO ] Computed 66 invariants in 4 ms
[2024-05-21 23:35:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:35:39] [INFO ] Invariant cache hit.
[2024-05-21 23:35:39] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [76, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 430 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 314/348 places, 260/309 transitions.
Applied a total of 0 rules in 4 ms. Remains 314 /314 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31035 ms. Remains : 314/348 places, 260/309 transitions.
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:35:39] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:35:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality15361151042456328533.gal : 2 ms
[2024-05-21 23:35:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality15547695231601902628.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15361151042456328533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15547695231601902628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:36:10] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:36:10] [INFO ] Applying decomposition
[2024-05-21 23:36:10] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18146297138373348703.txt' '-o' '/tmp/graph18146297138373348703.bin' '-w' '/tmp/graph18146297138373348703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18146297138373348703.bin' '-l' '-1' '-v' '-w' '/tmp/graph18146297138373348703.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:10] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:10] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-21 23:36:10] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-21 23:36:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12544534023249775560.gal : 5 ms
[2024-05-21 23:36:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality14412162275617859853.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12544534023249775560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14412162275617859853.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 330 transition count 291
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 330 transition count 291
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 321 transition count 282
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 321 transition count 282
Applied a total of 54 rules in 19 ms. Remains 321 /348 variables (removed 27) and now considering 282/309 (removed 27) transitions.
// Phase 1: matrix 282 rows 321 cols
[2024-05-21 23:36:40] [INFO ] Computed 64 invariants in 5 ms
[2024-05-21 23:36:40] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 23:36:40] [INFO ] Invariant cache hit.
[2024-05-21 23:36:40] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-21 23:36:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 33/59 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 5 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/104 constraints. Problems are: Problem set: 9 solved, 272 unsolved
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 20/124 constraints. Problems are: Problem set: 11 solved, 270 unsolved
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 20/144 constraints. Problems are: Problem set: 11 solved, 270 unsolved
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 20/164 constraints. Problems are: Problem set: 12 solved, 269 unsolved
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 20/184 constraints. Problems are: Problem set: 18 solved, 263 unsolved
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 20/204 constraints. Problems are: Problem set: 21 solved, 260 unsolved
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 5 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
Problem TDEAD255 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 20/224 constraints. Problems are: Problem set: 22 solved, 259 unsolved
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 321/603 variables, and 231 constraints, problems are : Problem set: 22 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/321 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 167/167 constraints]
Escalating to Integer solving :Problem set: 22 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 26/26 constraints. Problems are: Problem set: 22 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/26 constraints. Problems are: Problem set: 22 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 33/59 constraints. Problems are: Problem set: 22 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 5/64 constraints. Problems are: Problem set: 22 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 167/231 constraints. Problems are: Problem set: 22 solved, 259 unsolved
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/251 constraints. Problems are: Problem set: 22 solved, 259 unsolved
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 4 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 20/271 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 20/291 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 1 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 5 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 3 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 20/311 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 3 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 4 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 4 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 4 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 20/331 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
Problem TDEAD253 is UNSAT
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 4 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 4 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 12/343 constraints. Problems are: Problem set: 25 solved, 256 unsolved
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/603 variables, and 344 constraints, problems are : Problem set: 25 solved, 256 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/321 constraints, PredecessorRefiner: 0/281 constraints, Known Traps: 280/280 constraints]
After SMT, in 60091ms problems are : Problem set: 25 solved, 256 unsolved
Search for dead transitions found 25 dead transitions in 60096ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 321/348 places, 257/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 318 transition count 257
Applied a total of 3 rules in 5 ms. Remains 318 /321 variables (removed 3) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 318 cols
[2024-05-21 23:37:40] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 23:37:40] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 23:37:40] [INFO ] Invariant cache hit.
[2024-05-21 23:37:41] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 318/348 places, 257/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61027 ms. Remains : 318/348 places, 257/309 transitions.
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:37:41] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:37:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17127731631383777211.gal : 2 ms
[2024-05-21 23:37:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality996185119760408559.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17127731631383777211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality996185119760408559.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:38:11] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:38:11] [INFO ] Applying decomposition
[2024-05-21 23:38:11] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2651808557411381100.txt' '-o' '/tmp/graph2651808557411381100.bin' '-w' '/tmp/graph2651808557411381100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2651808557411381100.bin' '-l' '-1' '-v' '-w' '/tmp/graph2651808557411381100.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:11] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:11] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-21 23:38:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:38:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5431809149700745738.gal : 3 ms
[2024-05-21 23:38:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17695893131137500490.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5431809149700745738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17695893131137500490.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00111e+18,28.1636,603500,41943,38,1.25611e+06,579,735,1.62887e+06,56,1630,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 169 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 340 transition count 259
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 299 transition count 259
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 84 place count 299 transition count 190
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 232 place count 220 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 250 place count 202 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 268 place count 202 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 202 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 200 transition count 170
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 419 place count 125 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 124 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 123 transition count 97
Applied a total of 421 rules in 27 ms. Remains 123 /348 variables (removed 225) and now considering 97/309 (removed 212) transitions.
// Phase 1: matrix 97 rows 123 cols
[2024-05-21 23:38:41] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 23:38:41] [INFO ] Implicit Places using invariants in 124 ms returned [44, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 125 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 121/348 places, 97/309 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 160 ms. Remains : 121/348 places, 97/309 transitions.
[2024-05-21 23:38:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:38:41] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-21 23:38:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7312627026368714319.gal : 2 ms
[2024-05-21 23:38:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1111055653951096603.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7312627026368714319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1111055653951096603.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.5662e+07,0.463783,24776,2,3701,5,131003,6,0,581,72116,0


Converting to forward existential form...Done !
original formula: AG(EF(((p31==0)||(p144==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p31==0)||(p144==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t43, t44, t45, t46, t47, t57, t58, t65, t66, t75, t78, t79, t81, t83...281
(forward)formula 0,1,1.59542,58440,1,0,162,345740,189,66,4215,141226,178
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 164 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 340 transition count 259
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 299 transition count 259
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 84 place count 299 transition count 194
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 223 place count 225 transition count 194
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 239 place count 209 transition count 178
Iterating global reduction 2 with 16 rules applied. Total rules applied 255 place count 209 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 255 place count 209 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 257 place count 208 transition count 177
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 406 place count 132 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 131 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 408 place count 130 transition count 103
Applied a total of 408 rules in 54 ms. Remains 130 /348 variables (removed 218) and now considering 103/309 (removed 206) transitions.
// Phase 1: matrix 103 rows 130 cols
[2024-05-21 23:38:43] [INFO ] Computed 51 invariants in 1 ms
[2024-05-21 23:38:43] [INFO ] Implicit Places using invariants in 129 ms returned [39, 40, 41, 42, 43, 44, 45]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 134 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 123/348 places, 103/309 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 194 ms. Remains : 123/348 places, 103/309 transitions.
[2024-05-21 23:38:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:43] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-21 23:38:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:38:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:38:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality7117619105366349957.gal : 1 ms
[2024-05-21 23:38:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14502659639370485867.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7117619105366349957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14502659639370485867.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.01454e+07,1.23691,42464,2,8973,5,227438,6,0,594,133591,0


Converting to forward existential form...Done !
original formula: EF(AG((!(E((p184==0) U (p103!=1))) * (EG(((p263==0)||(p348==1))) + ((p350==0)&&((p78==0)||(p255==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E((p184==0) U (p103!=1))) * (EG(((p263==0)||(p348==1))) + ((p350==0)&&((p78=...187
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t9, t29, t30, t31, t32, t33, t56, t57, t58, t59, t60, t63, t64, t70, t71, t73, t74, t...299
(forward)formula 0,0,13.3909,386580,1,0,344,2.40278e+06,213,159,4340,2.0509e+06,381
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 329 transition count 290
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 329 transition count 290
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 321 transition count 282
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 321 transition count 282
Applied a total of 54 rules in 9 ms. Remains 321 /348 variables (removed 27) and now considering 282/309 (removed 27) transitions.
// Phase 1: matrix 282 rows 321 cols
[2024-05-21 23:38:57] [INFO ] Computed 64 invariants in 3 ms
[2024-05-21 23:38:57] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 23:38:57] [INFO ] Invariant cache hit.
[2024-05-21 23:38:57] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-21 23:38:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/104 constraints. Problems are: Problem set: 15 solved, 266 unsolved
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 20/124 constraints. Problems are: Problem set: 15 solved, 266 unsolved
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 4 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 20/144 constraints. Problems are: Problem set: 17 solved, 264 unsolved
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 20/164 constraints. Problems are: Problem set: 21 solved, 260 unsolved
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 20/184 constraints. Problems are: Problem set: 21 solved, 260 unsolved
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 20/204 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
Problem TDEAD240 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 20/224 constraints. Problems are: Problem set: 25 solved, 256 unsolved
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 25 solved, 256 unsolved
Search for dead transitions found 25 dead transitions in 30143ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 321/348 places, 257/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 318 transition count 257
Applied a total of 3 rules in 4 ms. Remains 318 /321 variables (removed 3) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 318 cols
[2024-05-21 23:39:27] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:39:27] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:39:27] [INFO ] Invariant cache hit.
[2024-05-21 23:39:28] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 318/348 places, 257/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31102 ms. Remains : 318/348 places, 257/309 transitions.
[2024-05-21 23:39:28] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:39:28] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:39:28] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-21 23:39:28] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:39:28] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:39:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality17980425923009417594.gal : 3 ms
[2024-05-21 23:39:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality15433945466166440680.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17980425923009417594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15433945466166440680.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:39:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:58] [INFO ] Applying decomposition
[2024-05-21 23:39:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11754676355642144326.txt' '-o' '/tmp/graph11754676355642144326.bin' '-w' '/tmp/graph11754676355642144326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11754676355642144326.bin' '-l' '-1' '-v' '-w' '/tmp/graph11754676355642144326.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:58] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:39:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:39:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:39:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4445503472324892118.gal : 4 ms
[2024-05-21 23:39:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15145045617683872327.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4445503472324892118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15145045617683872327.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95838e+18,2.97514,77476,6397,47,149152,837,689,269025,63,1836,0


Converting to forward existential form...Done !
original formula: (EF(AX(((((i6.i1.u73.p232==0)||(i16.u98.p362==1)) * EX((i17.i0.u29.p102==0))) + ((i16.u112.p399==1) * EG((i16.u91.p331==1)))))) * EF((((i...210
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U !(EX(!(((((i6.i1.u73.p232==0)||(i16.u98.p362==1)) * EX((i17.i0.u29.p102==0))) + ((i16.u1...274
Reverse transition relation is NOT exact ! Due to transitions t7, t115, t139, t157, t169, t181, t185, t212, t216, t237, t238, t240, t247, t248, t249, t252,...893
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,19.5687,471604,1,0,1.00813e+06,1392,5243,1.50389e+06,357,3419,1914103
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 330 transition count 291
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 330 transition count 291
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 322 transition count 283
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 322 transition count 283
Applied a total of 52 rules in 9 ms. Remains 322 /348 variables (removed 26) and now considering 283/309 (removed 26) transitions.
// Phase 1: matrix 283 rows 322 cols
[2024-05-21 23:40:18] [INFO ] Computed 64 invariants in 4 ms
[2024-05-21 23:40:18] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 23:40:18] [INFO ] Invariant cache hit.
[2024-05-21 23:40:18] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-21 23:40:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/322 variables, 35/63 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 9 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/104 constraints. Problems are: Problem set: 8 solved, 274 unsolved
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/124 constraints. Problems are: Problem set: 22 solved, 260 unsolved
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 10 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 20/144 constraints. Problems are: Problem set: 22 solved, 260 unsolved
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
Problem TDEAD248 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 20/164 constraints. Problems are: Problem set: 23 solved, 259 unsolved
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 20/184 constraints. Problems are: Problem set: 23 solved, 259 unsolved
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 20/204 constraints. Problems are: Problem set: 23 solved, 259 unsolved
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 20/224 constraints. Problems are: Problem set: 24 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/605 variables, and 224 constraints, problems are : Problem set: 24 solved, 258 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/322 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 24 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 28/28 constraints. Problems are: Problem set: 24 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 24 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/322 variables, 35/63 constraints. Problems are: Problem set: 24 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/64 constraints. Problems are: Problem set: 24 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 160/224 constraints. Problems are: Problem set: 24 solved, 258 unsolved
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/244 constraints. Problems are: Problem set: 25 solved, 257 unsolved
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/264 constraints. Problems are: Problem set: 25 solved, 257 unsolved
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 20/284 constraints. Problems are: Problem set: 25 solved, 257 unsolved
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 13/297 constraints. Problems are: Problem set: 25 solved, 257 unsolved
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 6/303 constraints. Problems are: Problem set: 25 solved, 257 unsolved
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 4/307 constraints. Problems are: Problem set: 25 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/605 variables, and 307 constraints, problems are : Problem set: 25 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/322 constraints, PredecessorRefiner: 0/282 constraints, Known Traps: 243/243 constraints]
After SMT, in 60074ms problems are : Problem set: 25 solved, 257 unsolved
Search for dead transitions found 25 dead transitions in 60077ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 322/348 places, 258/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 319 transition count 258
Applied a total of 3 rules in 5 ms. Remains 319 /322 variables (removed 3) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 319 cols
[2024-05-21 23:41:18] [INFO ] Computed 70 invariants in 4 ms
[2024-05-21 23:41:18] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 23:41:18] [INFO ] Invariant cache hit.
[2024-05-21 23:41:18] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 319/348 places, 258/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60931 ms. Remains : 319/348 places, 258/309 transitions.
[2024-05-21 23:41:18] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:18] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:19] [INFO ] Input system was already deterministic with 258 transitions.
[2024-05-21 23:41:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:41:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:41:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5501677435354166488.gal : 2 ms
[2024-05-21 23:41:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15090481203619239839.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5501677435354166488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15090481203619239839.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:41:49] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:41:49] [INFO ] Applying decomposition
[2024-05-21 23:41:49] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9097747949422378479.txt' '-o' '/tmp/graph9097747949422378479.bin' '-w' '/tmp/graph9097747949422378479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9097747949422378479.bin' '-l' '-1' '-v' '-w' '/tmp/graph9097747949422378479.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:49] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:49] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 23:41:49] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:41:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:41:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7430302683023629430.gal : 8 ms
[2024-05-21 23:41:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16194482092781244709.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7430302683023629430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16194482092781244709.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.23383e+18,2.87853,80872,6480,40,142523,800,691,250445,65,2037,0


Converting to forward existential form...Done !
original formula: (AX(EF((i8.u28.p87==1))) * AF(AG((EF((((i17.u108.p390==0)||(i17.u86.p299==1))&&(i10.i1.u56.p165==1))) + E((i17.u83.p278!=1) U (i9.u94.p92...164
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (i8.u28.p87==1))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !((E(TRUE U (((i17.u108.p390==0)|...255
Reverse transition relation is NOT exact ! Due to transitions t7, t138, t158, t170, t176, t213, t217, t238, t239, t241, t248, t249, t253, i0.u47.t129, i0.u...871
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 333 transition count 294
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 333 transition count 294
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 326 transition count 287
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 326 transition count 287
Applied a total of 44 rules in 10 ms. Remains 326 /348 variables (removed 22) and now considering 287/309 (removed 22) transitions.
// Phase 1: matrix 287 rows 326 cols
[2024-05-21 23:42:19] [INFO ] Computed 64 invariants in 5 ms
[2024-05-21 23:42:19] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 23:42:19] [INFO ] Invariant cache hit.
[2024-05-21 23:42:19] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-21 23:42:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 3 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 20/124 constraints. Problems are: Problem set: 13 solved, 273 unsolved
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 20/144 constraints. Problems are: Problem set: 16 solved, 270 unsolved
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 4 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
Problem TDEAD237 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 20/164 constraints. Problems are: Problem set: 21 solved, 265 unsolved
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 20/184 constraints. Problems are: Problem set: 21 solved, 265 unsolved
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 20/204 constraints. Problems are: Problem set: 24 solved, 262 unsolved
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 20/224 constraints. Problems are: Problem set: 24 solved, 262 unsolved
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:42:49] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/613 variables, and 236 constraints, problems are : Problem set: 24 solved, 262 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/326 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 172/172 constraints]
Escalating to Integer solving :Problem set: 24 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 28/28 constraints. Problems are: Problem set: 24 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/28 constraints. Problems are: Problem set: 24 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 34/62 constraints. Problems are: Problem set: 24 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 2/64 constraints. Problems are: Problem set: 24 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 172/236 constraints. Problems are: Problem set: 24 solved, 262 unsolved
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
Problem TDEAD240 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 20/256 constraints. Problems are: Problem set: 25 solved, 261 unsolved
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 20/276 constraints. Problems are: Problem set: 25 solved, 261 unsolved
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 20/296 constraints. Problems are: Problem set: 25 solved, 261 unsolved
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 13/309 constraints. Problems are: Problem set: 25 solved, 261 unsolved
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 10/319 constraints. Problems are: Problem set: 25 solved, 261 unsolved
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/324 constraints. Problems are: Problem set: 25 solved, 261 unsolved
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 4/328 constraints. Problems are: Problem set: 25 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/613 variables, and 328 constraints, problems are : Problem set: 25 solved, 261 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/326 constraints, PredecessorRefiner: 0/286 constraints, Known Traps: 264/264 constraints]
After SMT, in 60094ms problems are : Problem set: 25 solved, 261 unsolved
Search for dead transitions found 25 dead transitions in 60099ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 326/348 places, 262/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 323 transition count 262
Applied a total of 3 rules in 8 ms. Remains 323 /326 variables (removed 3) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 323 cols
[2024-05-21 23:43:19] [INFO ] Computed 70 invariants in 8 ms
[2024-05-21 23:43:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 23:43:19] [INFO ] Invariant cache hit.
[2024-05-21 23:43:20] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 323/348 places, 262/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61062 ms. Remains : 323/348 places, 262/309 transitions.
[2024-05-21 23:43:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:43:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:43:20] [INFO ] Input system was already deterministic with 262 transitions.
[2024-05-21 23:43:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:43:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:43:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16719575919728490054.gal : 3 ms
[2024-05-21 23:43:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality3230860241856738606.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16719575919728490054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3230860241856738606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:43:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:43:50] [INFO ] Applying decomposition
[2024-05-21 23:43:50] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14121278175331230456.txt' '-o' '/tmp/graph14121278175331230456.bin' '-w' '/tmp/graph14121278175331230456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14121278175331230456.bin' '-l' '-1' '-v' '-w' '/tmp/graph14121278175331230456.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:50] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:50] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-21 23:43:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:43:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality18032312714947982114.gal : 3 ms
[2024-05-21 23:43:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality16251954099992382907.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18032312714947982114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16251954099992382907.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.54262e+18,2.99347,79072,7745,48,138952,702,706,257872,64,2159,0


Converting to forward existential form...Done !
original formula: E(AG((E(!(((i7.i1.u73.p223==0)&&(i4.i0.u12.p35==0))) U ((i18.u113.p390==0)&&(((i11.u42.p124==0)||(i2.u47.p140==1))||(i18.u86.p332==1)))) ...406
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((E(!(((i7.i1.u73.p223==0)&&(i4.i0.u12.p35==0))) U ((i18.u113.p390==0)&&(((i11.u42.p124=...476
Reverse transition relation is NOT exact ! Due to transitions t118, t142, t160, t174, t186, t190, t217, t221, t242, t245, t252, t253, t254, t257, i0.u53.t1...936
(forward)formula 0,1,17.3147,444656,1,0,932456,919,5160,1.34861e+06,319,3299,2418693
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 170 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 340 transition count 257
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 297 transition count 257
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 88 place count 297 transition count 190
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 232 place count 220 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 250 place count 202 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 268 place count 202 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 202 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 200 transition count 170
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 421 place count 124 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 123 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 423 place count 122 transition count 96
Applied a total of 423 rules in 21 ms. Remains 122 /348 variables (removed 226) and now considering 96/309 (removed 213) transitions.
// Phase 1: matrix 96 rows 122 cols
[2024-05-21 23:44:07] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 23:44:08] [INFO ] Implicit Places using invariants in 111 ms returned [0, 1, 2, 10, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 112 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 112/348 places, 96/309 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 136 ms. Remains : 112/348 places, 96/309 transitions.
[2024-05-21 23:44:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:44:08] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:44:08] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 23:44:08] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:44:08] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:44:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13162998749191476183.gal : 1 ms
[2024-05-21 23:44:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality4551974685654235628.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13162998749191476183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4551974685654235628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.32131e+06,0.668718,18576,2,2609,5,93757,6,0,544,50732,0


Converting to forward existential form...Done !
original formula: AG(A((p242==0) U !(EF((p381==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U (p381==1))))) * !((p242==0))),TRUE) * (p381==1))] = FALSE * [FwdG(Fwd...204
Reverse transition relation is NOT exact ! Due to transitions t4, t17, t18, t19, t20, t21, t42, t43, t44, t45, t46, t56, t63, t64, t65, t75, t76, t77, t79,...280
(forward)formula 0,0,1.4911,33764,1,0,165,202692,193,71,4003,86056,186
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 327 transition count 288
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 327 transition count 288
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 317 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 317 transition count 278
Applied a total of 62 rules in 24 ms. Remains 317 /348 variables (removed 31) and now considering 278/309 (removed 31) transitions.
// Phase 1: matrix 278 rows 317 cols
[2024-05-21 23:44:09] [INFO ] Computed 64 invariants in 4 ms
[2024-05-21 23:44:09] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 23:44:09] [INFO ] Invariant cache hit.
[2024-05-21 23:44:10] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2024-05-21 23:44:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/104 constraints. Problems are: Problem set: 4 solved, 273 unsolved
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/124 constraints. Problems are: Problem set: 5 solved, 272 unsolved
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/144 constraints. Problems are: Problem set: 5 solved, 272 unsolved
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 4 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/164 constraints. Problems are: Problem set: 15 solved, 262 unsolved
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:27] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/184 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 4 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/204 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/595 variables, and 223 constraints, problems are : Problem set: 18 solved, 259 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 159/159 constraints]
Escalating to Integer solving :Problem set: 18 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 25/25 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/25 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/58 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/64 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 159/223 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/243 constraints. Problems are: Problem set: 22 solved, 255 unsolved
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 7 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/263 constraints. Problems are: Problem set: 22 solved, 255 unsolved
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/283 constraints. Problems are: Problem set: 22 solved, 255 unsolved
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:44:52] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 15/298 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 7/305 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 2/307 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:00] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 4/311 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 12/323 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:07] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/326 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/595 variables, and 329 constraints, problems are : Problem set: 25 solved, 252 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/277 constraints, Known Traps: 265/265 constraints]
After SMT, in 60097ms problems are : Problem set: 25 solved, 252 unsolved
Search for dead transitions found 25 dead transitions in 60102ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/348 places, 253/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 314 transition count 253
Applied a total of 3 rules in 5 ms. Remains 314 /317 variables (removed 3) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 314 cols
[2024-05-21 23:45:10] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:45:10] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 23:45:10] [INFO ] Invariant cache hit.
[2024-05-21 23:45:10] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 314/348 places, 253/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60979 ms. Remains : 314/348 places, 253/309 transitions.
[2024-05-21 23:45:10] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:45:10] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:45:10] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-21 23:45:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:45:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:45:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality689271529788162573.gal : 2 ms
[2024-05-21 23:45:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality5021756982815860344.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality689271529788162573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5021756982815860344.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:45:40] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:45:40] [INFO ] Applying decomposition
[2024-05-21 23:45:40] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1966228351770212086.txt' '-o' '/tmp/graph1966228351770212086.bin' '-w' '/tmp/graph1966228351770212086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1966228351770212086.bin' '-l' '-1' '-v' '-w' '/tmp/graph1966228351770212086.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:45:40] [INFO ] Decomposing Gal with order
[2024-05-21 23:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:45:40] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 23:45:40] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 23:45:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality16755658256730897864.gal : 3 ms
[2024-05-21 23:45:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9632994730608021921.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16755658256730897864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9632994730608021921.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95625e+18,5.02565,117248,6715,30,206745,458,645,377951,50,1340,0


Converting to forward existential form...Done !
original formula: A(AG(!((!(((i11.u73.p230==0)||(i12.u65.p192==1))) * EG((i2.u8.p21==1))))) U EX(AF((AG((i16.u112.p330==0)) * (AF((i0.i0.u99.p361==1)) + AF...181
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(EG(!((!(E(TRUE U !((i16.u112.p330==0)))) * (!(EG(!((i0.i0.u99.p361==1)))) + !(EG(!((i1.i0....532
Reverse transition relation is NOT exact ! Due to transitions t7, t135, t153, t165, t171, t208, t212, t234, t236, t243, t244, t245, t248, i0.i0.t111, i0.i0...837
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 331 transition count 292
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 331 transition count 292
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 323 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 323 transition count 284
Applied a total of 50 rules in 16 ms. Remains 323 /348 variables (removed 25) and now considering 284/309 (removed 25) transitions.
// Phase 1: matrix 284 rows 323 cols
[2024-05-21 23:46:10] [INFO ] Computed 64 invariants in 3 ms
[2024-05-21 23:46:10] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:46:11] [INFO ] Invariant cache hit.
[2024-05-21 23:46:11] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-21 23:46:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-21 23:46:16] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 20/104 constraints. Problems are: Problem set: 11 solved, 272 unsolved
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
Problem TDEAD248 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 20/124 constraints. Problems are: Problem set: 13 solved, 270 unsolved
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 20/144 constraints. Problems are: Problem set: 19 solved, 264 unsolved
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 20/164 constraints. Problems are: Problem set: 19 solved, 264 unsolved
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 20/184 constraints. Problems are: Problem set: 23 solved, 260 unsolved
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 20/204 constraints. Problems are: Problem set: 24 solved, 259 unsolved
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
Problem TDEAD254 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 20/224 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 20/244 constraints. Problems are: Problem set: 25 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 323/607 variables, and 244 constraints, problems are : Problem set: 25 solved, 258 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/323 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 25 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 28/28 constraints. Problems are: Problem set: 25 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/28 constraints. Problems are: Problem set: 25 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 34/62 constraints. Problems are: Problem set: 25 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 2/64 constraints. Problems are: Problem set: 25 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 180/244 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 20/264 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 20/284 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 20/304 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 20/324 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 20/344 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:01] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 20/364 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 12/376 constraints. Problems are: Problem set: 25 solved, 258 unsolved
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/607 variables, and 383 constraints, problems are : Problem set: 25 solved, 258 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/323 constraints, PredecessorRefiner: 0/283 constraints, Known Traps: 319/319 constraints]
After SMT, in 60086ms problems are : Problem set: 25 solved, 258 unsolved
Search for dead transitions found 25 dead transitions in 60090ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 323/348 places, 259/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 259
Applied a total of 3 rules in 11 ms. Remains 320 /323 variables (removed 3) and now considering 259/259 (removed 0) transitions.
// Phase 1: matrix 259 rows 320 cols
[2024-05-21 23:47:11] [INFO ] Computed 70 invariants in 4 ms
[2024-05-21 23:47:11] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:47:11] [INFO ] Invariant cache hit.
[2024-05-21 23:47:11] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 320/348 places, 259/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60938 ms. Remains : 320/348 places, 259/309 transitions.
[2024-05-21 23:47:11] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:11] [INFO ] Input system was already deterministic with 259 transitions.
[2024-05-21 23:47:11] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality4300097771761964181.gal : 2 ms
[2024-05-21 23:47:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality11631446921406298569.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4300097771761964181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11631446921406298569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:47:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:47:41] [INFO ] Applying decomposition
[2024-05-21 23:47:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14798144950773500317.txt' '-o' '/tmp/graph14798144950773500317.bin' '-w' '/tmp/graph14798144950773500317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14798144950773500317.bin' '-l' '-1' '-v' '-w' '/tmp/graph14798144950773500317.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:41] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:41] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-21 23:47:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 23:47:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4055521289187644278.gal : 3 ms
[2024-05-21 23:47:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality12610255075826084265.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4055521289187644278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12610255075826084265.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.23454e+18,4.12461,139016,5546,37,272707,486,699,358223,54,1377,0


Converting to forward existential form...Done !
original formula: AG(((((i17.u101.p358==0)||(i5.i0.u7.p18==1)) + (!(A(((i4.u88.p298==0)||(i5.i1.u65.p186==1)) U ((i17.u90.p310==0)||(i17.u84.p294==1)))) + ...208
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !(((i15.u71.p214==0)||(i1.u51.p151==1)))) * !(((i17.u101.p358==0)||(i5.i0.u7.p18==1)))...376
Reverse transition relation is NOT exact ! Due to transitions t7, t117, t141, t159, t167, t171, t177, t187, t214, t218, t239, t242, t249, t251, i0.i0.u53.t...893
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,23.6183,540296,1,0,1.28509e+06,486,3976,1.28874e+06,260,1377,1581729
FORMULA BusinessProcesses-PT-09-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 327 transition count 288
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 327 transition count 288
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 317 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 317 transition count 278
Applied a total of 62 rules in 10 ms. Remains 317 /348 variables (removed 31) and now considering 278/309 (removed 31) transitions.
// Phase 1: matrix 278 rows 317 cols
[2024-05-21 23:48:05] [INFO ] Computed 64 invariants in 5 ms
[2024-05-21 23:48:05] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 23:48:05] [INFO ] Invariant cache hit.
[2024-05-21 23:48:06] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2024-05-21 23:48:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/104 constraints. Problems are: Problem set: 4 solved, 273 unsolved
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 6 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 4 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/124 constraints. Problems are: Problem set: 5 solved, 272 unsolved
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 5 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/144 constraints. Problems are: Problem set: 5 solved, 272 unsolved
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/164 constraints. Problems are: Problem set: 15 solved, 262 unsolved
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/184 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:29] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/204 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:32] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:33] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:35] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 20/224 constraints. Problems are: Problem set: 18 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/595 variables, and 224 constraints, problems are : Problem set: 18 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 18 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 25/25 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/25 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/58 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/64 constraints. Problems are: Problem set: 18 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 160/224 constraints. Problems are: Problem set: 18 solved, 259 unsolved
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/244 constraints. Problems are: Problem set: 24 solved, 253 unsolved
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/264 constraints. Problems are: Problem set: 24 solved, 253 unsolved
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:48] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 3 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 13/277 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 4 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/297 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 5/302 constraints. Problems are: Problem set: 25 solved, 252 unsolved
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/595 variables, and 303 constraints, problems are : Problem set: 25 solved, 252 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/277 constraints, Known Traps: 239/239 constraints]
After SMT, in 60069ms problems are : Problem set: 25 solved, 252 unsolved
Search for dead transitions found 25 dead transitions in 60071ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/348 places, 253/309 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 314 transition count 253
Applied a total of 3 rules in 5 ms. Remains 314 /317 variables (removed 3) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 314 cols
[2024-05-21 23:49:06] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 23:49:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 23:49:06] [INFO ] Invariant cache hit.
[2024-05-21 23:49:06] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 314/348 places, 253/309 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60928 ms. Remains : 314/348 places, 253/309 transitions.
[2024-05-21 23:49:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:49:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:49:06] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-21 23:49:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:49:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:49:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16567725254453950861.gal : 2 ms
[2024-05-21 23:49:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2945644604985809182.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16567725254453950861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2945644604985809182.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:49:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:49:36] [INFO ] Applying decomposition
[2024-05-21 23:49:36] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13693967554715306211.txt' '-o' '/tmp/graph13693967554715306211.bin' '-w' '/tmp/graph13693967554715306211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13693967554715306211.bin' '-l' '-1' '-v' '-w' '/tmp/graph13693967554715306211.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:36] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-21 23:49:36] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:49:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:49:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9093946390621475147.gal : 4 ms
[2024-05-21 23:49:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12000035711478489223.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9093946390621475147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12000035711478489223.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95625e+18,20.2916,413168,32806,46,847249,798,704,1.04086e+06,68,1679,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 171 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 340 transition count 258
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 298 transition count 258
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 86 place count 298 transition count 190
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 231 place count 221 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 249 place count 203 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 267 place count 203 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 267 place count 203 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 201 transition count 170
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 424 place count 123 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 122 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 121 transition count 94
Applied a total of 426 rules in 62 ms. Remains 121 /348 variables (removed 227) and now considering 94/309 (removed 215) transitions.
// Phase 1: matrix 94 rows 121 cols
[2024-05-21 23:50:06] [INFO ] Computed 51 invariants in 2 ms
[2024-05-21 23:50:07] [INFO ] Implicit Places using invariants in 165 ms returned [0, 1, 2, 10, 36, 37, 38, 39, 42, 43, 95]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 166 ms to find 11 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/348 places, 94/309 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 244 ms. Remains : 110/348 places, 94/309 transitions.
[2024-05-21 23:50:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:50:07] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:50:07] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-21 23:50:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:50:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:50:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality12100366760002842650.gal : 1 ms
[2024-05-21 23:50:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2633405620215776469.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12100366760002842650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2633405620215776469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.98733e+06,1.51015,50104,2,12241,5,210027,6,0,535,197082,0


Converting to forward existential form...Done !
original formula: AG(EF((p147==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p147==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t41, t42, t43, t44, t45, t55, t62, t63, t73, t74, t75, t77, t79, t80, t81...266
(forward)formula 0,0,7.62362,163020,1,0,159,793429,183,69,3835,441825,180
FORMULA BusinessProcesses-PT-09-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2024-05-21 23:50:14] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:50:14] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:50:14] [INFO ] Applying decomposition
[2024-05-21 23:50:14] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6128539063609825190.txt' '-o' '/tmp/graph6128539063609825190.bin' '-w' '/tmp/graph6128539063609825190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6128539063609825190.bin' '-l' '-1' '-v' '-w' '/tmp/graph6128539063609825190.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:14] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:15] [INFO ] Removed a total of 185 redundant transitions.
[2024-05-21 23:50:15] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:50:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:50:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5430070606861515388.gal : 3 ms
[2024-05-21 23:50:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality5562620902114328781.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5430070606861515388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5562620902114328781.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44138e+18,5.21909,129696,5381,43,233886,527,792,482922,66,1490,0


Converting to forward existential form...Done !
original formula: EX(EX(EF(AG(((i14.u91.p288==0)&&(i12.u121.p386==1))))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !(E(TRUE U !(((i14.u91.p288==0)&&(i12.u121.p386==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t8, t29, t161, t196, t202, t212, t243, t292, t299, i0.t137, i0.u50.t148, i0.u52.t144,...1015
(forward)formula 0,0,9.80082,203352,1,0,398446,527,5028,989212,292,1490,857651
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(E(A((AG(((i13.u100.p382==0)||(i11.u79.p239==1))) * (((i5.i0.i0.u14.p37==0)||(i12.u33.p100==1))||((i7.u23.p64==0)||(i5.i1.i0.u64.p182==...502
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(!((!((E(!(((i0.u2.p6==0)||(i0.u54.p157==1))) U (!(((i3.u7.p17==0)||(i12.u104.p340==1))) * ...1236
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 1,1,70.9137,1294128,1,0,1.94697e+06,527,5909,6.6168e+06,343,1505,2480545
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AX(EF((i12.u30.p87==1))) * AF(AG((EF((((i12.u122.p390==0)||(i15.u94.p299==1))&&(i9.u57.p165==1))) + E((i15.u90.p278!=1) U (i12.u27.p92!=...162
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (i12.u30.p87==1))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !((E(TRUE U (((i12.u122.p390==0)...253
(forward)formula 2,1,103.611,1968928,1,0,2.95918e+06,527,5935,9.39797e+06,344,1526,4048756
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: A(AG(!((!(((i11.u77.p230==0)||(i4.u68.p192==1))) * EG((i3.u8.p21==1))))) U EX(AF((AG((i13.u102.p330==0)) * (AF((i0.u112.p361==1)) + AF((i...175
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(EG(!((!(E(TRUE U !((i13.u102.p330==0)))) * (!(EG(!((i0.u112.p361==1)))) + !(EG(!((i0.u51.p...516
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 3,0,281.281,2469336,1,0,3.58628e+06,527,2703,1.27138e+07,169,1531,2874963
FORMULA BusinessProcesses-PT-09-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
(forward)formula 4,0,281.347,2469864,1,0,3.58758e+06,527,2703,1.27157e+07,169,1531,2875464
FORMULA BusinessProcesses-PT-09-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 1363162 ms.

BK_STOP 1716335697297

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-09, 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 r048-tajo-171620399700513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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