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-171620399800585.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-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 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 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716337050562

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 00:17:31] [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-22 00:17:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:17:32] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-22 00:17:32] [INFO ] Transformed 717 places.
[2024-05-22 00:17:32] [INFO ] Transformed 642 transitions.
[2024-05-22 00:17:32] [INFO ] Found NUPN structural information;
[2024-05-22 00:17:32] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 15 places in 17 ms
Reduce places removed 15 places and 15 transitions.
Support contains 89 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 92 place count 610 transition count 543
Iterating global reduction 1 with 84 rules applied. Total rules applied 176 place count 610 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 177 place count 610 transition count 542
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 218 place count 569 transition count 501
Iterating global reduction 2 with 41 rules applied. Total rules applied 259 place count 569 transition count 501
Applied a total of 259 rules in 160 ms. Remains 569 /702 variables (removed 133) and now considering 501/627 (removed 126) transitions.
// Phase 1: matrix 501 rows 569 cols
[2024-05-22 00:17:32] [INFO ] Computed 106 invariants in 31 ms
[2024-05-22 00:17:32] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-22 00:17:32] [INFO ] Invariant cache hit.
[2024-05-22 00:17:33] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:17:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 120 places in 164 ms of which 23 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 5 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 4 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 7 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 5 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 17 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 5 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 114 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
SMT process timed out in 30252ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 30291ms
Starting structural reductions in LTL mode, iteration 1 : 569/702 places, 501/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31461 ms. Remains : 569/702 places, 501/627 transitions.
Support contains 89 out of 569 places after structural reductions.
[2024-05-22 00:18:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:18:04] [INFO ] Flatten gal took : 86 ms
FORMULA BusinessProcesses-PT-18-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:18:04] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:18:04] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 81 out of 569 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (207 resets) in 1526 ms. (26 steps per ms) remains 22/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 99 ms. (40 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
[2024-05-22 00:18:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 211/245 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 188/433 variables, 48/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 120/553 variables, 39/104 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/555 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 492/1047 variables, 555/661 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 9 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:07] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:07] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:18:07] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:18:07] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:07] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:18:07] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 110 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 105 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1047 variables, 20/681 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 5108ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 261 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 563 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 563 transition count 423
Reduce places removed 70 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 73 rules applied. Total rules applied 145 place count 493 transition count 420
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 148 place count 490 transition count 420
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 148 place count 490 transition count 315
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 229 rules applied. Total rules applied 377 place count 366 transition count 315
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 395 place count 348 transition count 297
Iterating global reduction 3 with 18 rules applied. Total rules applied 413 place count 348 transition count 297
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 667 place count 220 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 669 place count 219 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 670 place count 219 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 671 place count 218 transition count 173
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 675 place count 218 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 676 place count 217 transition count 172
Applied a total of 676 rules in 146 ms. Remains 217 /569 variables (removed 352) and now considering 172/501 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 217/569 places, 172/501 transitions.
RANDOM walk for 40000 steps (1530 resets) in 1289 ms. (31 steps per ms) remains 4/22 properties
BEST_FIRST walk for 40002 steps (489 resets) in 185 ms. (215 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (631 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (632 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (652 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
// Phase 1: matrix 172 rows 217 cols
[2024-05-22 00:18:10] [INFO ] Computed 85 invariants in 6 ms
[2024-05-22 00:18:10] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/94 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/97 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 42/139 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/142 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 166/308 variables, 142/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 78/386 variables, 72/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 25/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/388 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/388 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/389 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/389 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 307 constraints, problems are : Problem set: 0 solved, 3 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 217/217 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/94 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/97 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 7 (OVERLAPS) 42/139 variables, 17/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/142 variables, 3/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 166/308 variables, 142/194 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 5/199 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 2/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 78/386 variables, 72/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 25/298 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/388 variables, 8/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/388 variables, 2/308 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/388 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/389 variables, 1/309 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/389 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/389 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/389 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 310 constraints, problems are : Problem set: 1 solved, 2 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 217/217 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 530ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 172/172 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 217 transition count 168
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 213 transition count 168
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 8 place count 213 transition count 157
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 36 place count 196 transition count 157
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 191 transition count 152
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 191 transition count 152
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 67 place count 180 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 179 transition count 141
Applied a total of 68 rules in 32 ms. Remains 179 /217 variables (removed 38) and now considering 141/172 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 179/217 places, 141/172 transitions.
RANDOM walk for 40000 steps (2181 resets) in 504 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1284 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1218 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 65241 steps, run visited all 2 properties in 474 ms. (steps per millisecond=137 )
Probabilistic random walk after 65241 steps, saw 27019 distinct states, run finished after 482 ms. (steps per millisecond=135 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-22 00:18:12] [INFO ] Flatten gal took : 48 ms
[2024-05-22 00:18:12] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:18:12] [INFO ] Input system was already deterministic with 501 transitions.
Computed a total of 512 stabilizing places and 454 stable transitions
Graph (complete) has 1256 edges and 569 vertex of which 568 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1249 edges and 564 vertex of which 563 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 414
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 483 transition count 414
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 160 place count 483 transition count 297
Deduced a syphon composed of 117 places in 2 ms
Ensure Unique test removed 25 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 419 place count 341 transition count 297
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 445 place count 315 transition count 271
Ensure Unique test removed 1 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 472 place count 314 transition count 271
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 740 place count 179 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 742 place count 177 transition count 137
Applied a total of 742 rules in 66 ms. Remains 177 /569 variables (removed 392) and now considering 137/501 (removed 364) transitions.
// Phase 1: matrix 137 rows 177 cols
[2024-05-22 00:18:12] [INFO ] Computed 77 invariants in 4 ms
[2024-05-22 00:18:12] [INFO ] Implicit Places using invariants in 151 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 155 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/569 places, 137/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 228 ms. Remains : 150/569 places, 137/501 transitions.
[2024-05-22 00:18:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:18:12] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:18:12] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:18:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:18:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:18:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16768467884638599191.gal : 5 ms
[2024-05-22 00:18:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality17231120608154979824.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/CTLCardinality16768467884638599191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17231120608154979824.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.
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,556992,0.114064,8372,2,1695,5,13142,6,0,735,9592,0


Converting to forward existential form...Done !
original formula: EF(EG(AG((p650==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((p650==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t24, t36, t37, t38, t39, t80, t81, t82, t83, t85, t86, t87, t88, t89, t97, t100, t103, t1...265
(forward)formula 0,0,0.637528,25132,1,0,173,101633,265,95,5535,60647,252
FORMULA BusinessProcesses-PT-18-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 72 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-22 00:18:13] [INFO ] Computed 106 invariants in 13 ms
[2024-05-22 00:18:13] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 00:18:13] [INFO ] Invariant cache hit.
[2024-05-22 00:18:14] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:18:20] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:18:21] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:18:21] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:18:21] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:18:21] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:18:21] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:18:21] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:22] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:18:22] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:18:22] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:18:22] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:18:22] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:18:22] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:23] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:18:23] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:18:23] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:18:23] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:18:23] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:23] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:18:23] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 4 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:28] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:18:29] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:18:30] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 448 unsolved
[2024-05-22 00:18:30] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:18:30] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:18:30] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:18:30] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 88 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 127 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:18:41] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:18:42] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 2 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 27 solved, 435 unsolved
Search for dead transitions found 27 dead transitions in 30181ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/569 places, 436/501 transitions.
Applied a total of 0 rules in 14 ms. Remains 531 /531 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31132 ms. Remains : 531/569 places, 436/501 transitions.
[2024-05-22 00:18:44] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:18:44] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:18:44] [INFO ] Input system was already deterministic with 436 transitions.
[2024-05-22 00:18:44] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:18:44] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:18:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13050357813932750927.gal : 5 ms
[2024-05-22 00:18:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17500046388932595493.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/CTLCardinality13050357813932750927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17500046388932595493.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-22 00:19:14] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:19:14] [INFO ] Applying decomposition
[2024-05-22 00:19:14] [INFO ] Flatten gal took : 33 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/graph14570987279177722742.txt' '-o' '/tmp/graph14570987279177722742.bin' '-w' '/tmp/graph14570987279177722742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14570987279177722742.bin' '-l' '-1' '-v' '-w' '/tmp/graph14570987279177722742.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:19:15] [INFO ] Decomposing Gal with order
[2024-05-22 00:19:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:19:15] [INFO ] Removed a total of 163 redundant transitions.
[2024-05-22 00:19:15] [INFO ] Flatten gal took : 66 ms
[2024-05-22 00:19:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 17 ms.
[2024-05-22 00:19:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality16871589745958682332.gal : 10 ms
[2024-05-22 00:19:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality2615720070814411462.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/CTLCardinality16871589745958682332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2615720070814411462.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,5.95506e+30,1.30807,44816,3594,46,82404,613,1099,115669,61,1609,0


Converting to forward existential form...Done !
original formula: (AX(EF(((AX((i13.i1.u136.p472==0)) * (i14.u131.p448==0)) * (i11.i1.u173.p677==1)))) + AF((!(A(AG((i1.u170.p660==1)) U (i12.i2.u94.p297!=0...192
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(E(TRUE U ((!(EX(!((i13.i1.u136.p472==0)))) * (i14.u131.p448==0)) * (i11.i1.u173.p677==1))...351
Reverse transition relation is NOT exact ! Due to transitions t5, t279, t295, t303, t311, t347, t364, t367, t413, t418, t420, t422, t423, t425, t427, t431,...1464
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 537 transition count 469
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 536 transition count 468
Applied a total of 66 rules in 36 ms. Remains 536 /569 variables (removed 33) and now considering 468/501 (removed 33) transitions.
// Phase 1: matrix 468 rows 536 cols
[2024-05-22 00:19:45] [INFO ] Computed 106 invariants in 14 ms
[2024-05-22 00:19:45] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 00:19:45] [INFO ] Invariant cache hit.
[2024-05-22 00:19:46] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:19:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 5 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 118 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 2 ms to minimize.
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 20/126 constraints. Problems are: Problem set: 14 solved, 453 unsolved
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 4 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 4 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 4 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 5 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 453 unsolved
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/166 constraints. Problems are: Problem set: 14 solved, 453 unsolved
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 5 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 100 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/186 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/206 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 119 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 20 solved, 447 unsolved
Search for dead transitions found 20 dead transitions in 30207ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 536/569 places, 448/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 536 /536 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31101 ms. Remains : 536/569 places, 448/501 transitions.
[2024-05-22 00:20:16] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:20:16] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:20:16] [INFO ] Input system was already deterministic with 448 transitions.
[2024-05-22 00:20:16] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:20:16] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:20:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2689068042127907197.gal : 15 ms
[2024-05-22 00:20:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15295343024808209019.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/CTLCardinality2689068042127907197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15295343024808209019.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-22 00:20:46] [INFO ] Flatten gal took : 33 ms
[2024-05-22 00:20:46] [INFO ] Applying decomposition
[2024-05-22 00:20:46] [INFO ] Flatten gal took : 18 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/graph10924643469675501536.txt' '-o' '/tmp/graph10924643469675501536.bin' '-w' '/tmp/graph10924643469675501536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10924643469675501536.bin' '-l' '-1' '-v' '-w' '/tmp/graph10924643469675501536.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:46] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:46] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-22 00:20:46] [INFO ] Flatten gal took : 56 ms
[2024-05-22 00:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 21 ms.
[2024-05-22 00:20:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality4826540076109916018.gal : 14 ms
[2024-05-22 00:20:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6855799040690230718.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/CTLCardinality4826540076109916018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6855799040690230718.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 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,6.19327e+30,3.47892,94964,7649,58,158440,619,1120,386412,61,1558,0


Converting to forward existential form...Done !
original formula: (AF((AF(!(A((i18.i0.u184.p708==1) U (i7.i1.u90.p296==1)))) + EF(((EX(((i17.u148.p540==0)||(i15.i1.u138.p491==1))) + (i11.u125.p433==0)) +...299
=> equivalent forward existential formula: ([FwdG(Init,!((!(EG(!(!(!((E(!((i7.i1.u90.p296==1)) U (!((i18.i0.u184.p708==1)) * !((i7.i1.u90.p296==1)))) + EG(...457
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t7, t284, t296, t304, t312, t316, t352, t369, t372, t426, t430, t432, t434, t437, t43...1468
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 536 transition count 468
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 75 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
// Phase 1: matrix 467 rows 535 cols
[2024-05-22 00:21:17] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:21:17] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-22 00:21:17] [INFO ] Invariant cache hit.
[2024-05-22 00:21:18] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-22 00:21:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/535 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 124 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 124 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 3 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/166 constraints. Problems are: Problem set: 21 solved, 445 unsolved
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 124 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 121 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/186 constraints. Problems are: Problem set: 21 solved, 445 unsolved
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 119 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 20/206 constraints. Problems are: Problem set: 26 solved, 440 unsolved
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
SMT process timed out in 30145ms, After SMT, problems are : Problem set: 26 solved, 440 unsolved
Search for dead transitions found 26 dead transitions in 30151ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 535/569 places, 441/501 transitions.
Applied a total of 0 rules in 8 ms. Remains 535 /535 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31223 ms. Remains : 535/569 places, 441/501 transitions.
[2024-05-22 00:21:48] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:21:48] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:21:48] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-22 00:21:48] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:21:48] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:21:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality758893882381050937.gal : 2 ms
[2024-05-22 00:21:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11396281624470294738.ctl : 12 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/CTLCardinality758893882381050937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11396281624470294738.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-22 00:22:18] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:22:18] [INFO ] Applying decomposition
[2024-05-22 00:22:18] [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/graph7849492848724512397.txt' '-o' '/tmp/graph7849492848724512397.bin' '-w' '/tmp/graph7849492848724512397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7849492848724512397.bin' '-l' '-1' '-v' '-w' '/tmp/graph7849492848724512397.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:18] [INFO ] Removed a total of 165 redundant transitions.
[2024-05-22 00:22:18] [INFO ] Flatten gal took : 69 ms
[2024-05-22 00:22:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 00:22:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality13756492380352815260.gal : 8 ms
[2024-05-22 00:22:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15441124414248912112.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/CTLCardinality13756492380352815260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15441124414248912112.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,5.95507e+30,1.29365,36468,3742,45,60301,660,1123,120529,51,1580,0


Converting to forward existential form...Done !
original formula: (EG(A((i19.u180.p640==1) U (i19.u147.p531==1))) + EF(((((AG(((i2.i1.u124.p405==0)||(i7.i2.u163.p145==1))) + EX(((i3.u39.p114==0)||(i19.u1...356
=> equivalent forward existential formula: ([FwdG(Init,!((E(!((i19.u147.p531==1)) U (!((i19.u180.p640==1)) * !((i19.u147.p531==1)))) + EG(!((i19.u147.p531=...509
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t7, t283, t295, t299, t307, t351, t368, t371, t418, t419, t423, t425, t427, t428, t43...1496
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 542 transition count 474
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 542 transition count 474
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 533 transition count 465
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 59 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
// Phase 1: matrix 464 rows 532 cols
[2024-05-22 00:22:48] [INFO ] Computed 106 invariants in 26 ms
[2024-05-22 00:22:49] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 00:22:49] [INFO ] Invariant cache hit.
[2024-05-22 00:22:49] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-05-22 00:22:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:22:59] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:23:02] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:02] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:02] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:02] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:03] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 115 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:04] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:23:05] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:06] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/166 constraints. Problems are: Problem set: 10 solved, 453 unsolved
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 7 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 6 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/186 constraints. Problems are: Problem set: 16 solved, 447 unsolved
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/206 constraints. Problems are: Problem set: 16 solved, 447 unsolved
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 16 solved, 447 unsolved
Search for dead transitions found 16 dead transitions in 30177ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 532/569 places, 448/501 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31063 ms. Remains : 532/569 places, 448/501 transitions.
[2024-05-22 00:23:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:23:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:23:19] [INFO ] Input system was already deterministic with 448 transitions.
[2024-05-22 00:23:19] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:19] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12531485562769444348.gal : 2 ms
[2024-05-22 00:23:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality10747227328171351098.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/CTLCardinality12531485562769444348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10747227328171351098.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-22 00:23:50] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:23:50] [INFO ] Applying decomposition
[2024-05-22 00:23:50] [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/graph17041171597640560570.txt' '-o' '/tmp/graph17041171597640560570.bin' '-w' '/tmp/graph17041171597640560570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17041171597640560570.bin' '-l' '-1' '-v' '-w' '/tmp/graph17041171597640560570.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:23:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:23:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:23:50] [INFO ] Removed a total of 211 redundant transitions.
[2024-05-22 00:23:50] [INFO ] Flatten gal took : 38 ms
[2024-05-22 00:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 20 ms.
[2024-05-22 00:23:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16213910878505471421.gal : 17 ms
[2024-05-22 00:23:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality18048237640147031687.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/CTLCardinality16213910878505471421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18048237640147031687.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,6.18062e+30,1.41967,38784,3418,53,64898,543,1157,158130,54,1244,0


Converting to forward existential form...Done !
original formula: AG(EF(!(A(EX((i9.i0.u5.p12==1)) U AX(((i10.i2.u137.p469==0)||(i2.i0.u69.p201==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!(EX(!(((i10.i2.u137.p469==0)||(i2.i0.u69.p201==1)))))) U (!(EX((i9.i0.u...307
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t280, t292, t304, t308, t348, t368, t425, t430, t432, t434, t435, t437, t439, t44...1438
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 1
Fast SCC detection found an 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 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
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 1
Fast SCC detection found an 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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 285 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1249 edges and 564 vertex of which 563 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 562 transition count 416
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 485 transition count 416
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 156 place count 485 transition count 299
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 415 place count 343 transition count 299
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 440 place count 318 transition count 274
Ensure Unique test removed 1 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 466 place count 317 transition count 274
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 732 place count 183 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 733 place count 182 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 734 place count 181 transition count 141
Applied a total of 734 rules in 41 ms. Remains 181 /569 variables (removed 388) and now considering 141/501 (removed 360) transitions.
// Phase 1: matrix 141 rows 181 cols
[2024-05-22 00:24:20] [INFO ] Computed 77 invariants in 1 ms
[2024-05-22 00:24:20] [INFO ] Implicit Places using invariants in 174 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 175 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/569 places, 141/501 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 221 ms. Remains : 154/569 places, 141/501 transitions.
[2024-05-22 00:24:20] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:24:20] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:24:20] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 00:24:20] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:24:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:24:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality2781071795478378745.gal : 1 ms
[2024-05-22 00:24:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality4234235380681963832.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/CTLCardinality2781071795478378745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4234235380681963832.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,1.17619e+06,0.184919,9820,2,1951,5,17540,6,0,754,15348,0


Converting to forward existential form...Done !
original formula: AF(EG((EF((p572==1)) * ((p167==0) + AF((p368==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((E(TRUE U (p572==1)) * ((p167==0) + !(EG(!((p368==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t26, t39, t40, t41, t42, t84, t85, t86, t87, t89, t90, t91, t92, t93, t94, t102, t105, t1...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.91694,67480,1,0,282,411627,285,158,5813,282521,388
FORMULA BusinessProcesses-PT-18-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 538 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 67 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
// Phase 1: matrix 470 rows 538 cols
[2024-05-22 00:24:22] [INFO ] Computed 106 invariants in 5 ms
[2024-05-22 00:24:22] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-22 00:24:22] [INFO ] Invariant cache hit.
[2024-05-22 00:24:23] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-22 00:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 20/126 constraints. Problems are: Problem set: 17 solved, 452 unsolved
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/146 constraints. Problems are: Problem set: 17 solved, 452 unsolved
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/166 constraints. Problems are: Problem set: 17 solved, 452 unsolved
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/186 constraints. Problems are: Problem set: 17 solved, 452 unsolved
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/206 constraints. Problems are: Problem set: 17 solved, 452 unsolved
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 17 solved, 452 unsolved
Search for dead transitions found 17 dead transitions in 30187ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/569 places, 453/501 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31090 ms. Remains : 538/569 places, 453/501 transitions.
[2024-05-22 00:24:53] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:24:53] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:24:53] [INFO ] Input system was already deterministic with 453 transitions.
[2024-05-22 00:24:53] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:24:53] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:24:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15599383828349693069.gal : 5 ms
[2024-05-22 00:24:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality2934152437351354497.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/CTLCardinality15599383828349693069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2934152437351354497.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-22 00:25:23] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:25:23] [INFO ] Applying decomposition
[2024-05-22 00:25:23] [INFO ] Flatten gal took : 19 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/graph2587804967386990892.txt' '-o' '/tmp/graph2587804967386990892.bin' '-w' '/tmp/graph2587804967386990892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2587804967386990892.bin' '-l' '-1' '-v' '-w' '/tmp/graph2587804967386990892.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:25:23] [INFO ] Decomposing Gal with order
[2024-05-22 00:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:25:23] [INFO ] Removed a total of 207 redundant transitions.
[2024-05-22 00:25:23] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2024-05-22 00:25:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7777533473904321084.gal : 7 ms
[2024-05-22 00:25:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9483584424463224339.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/CTLCardinality7777533473904321084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9483584424463224339.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 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.95582e+30,2.13758,75232,5302,46,128839,626,1147,244535,59,1859,0


Converting to forward existential form...Done !
original formula: (E(((AF((EX(((i16.i1.u113.p357==0)||(i12.i1.u67.p202==1))) * !(((i19.u167.p637==0)||(i17.i0.u16.p41==1))))) + EX((((i9.u31.p90==0)||(i18....308
=> equivalent forward existential formula: ([(FwdU(Init,((!(EG(!((EX(((i16.i1.u113.p357==0)||(i12.i1.u67.p202==1))) * !(((i19.u167.p637==0)||(i17.i0.u16.p4...384
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t7, t298, t310, t318, t354, t374, t430, t431, t435, t437, t439, t440, t442, t444, t44...1516
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 470
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 61 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
// Phase 1: matrix 470 rows 538 cols
[2024-05-22 00:25:54] [INFO ] Computed 106 invariants in 9 ms
[2024-05-22 00:25:54] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 00:25:54] [INFO ] Invariant cache hit.
[2024-05-22 00:25:55] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-22 00:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 5 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 122 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 5 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 124 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 124 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 103 places in 169 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 122 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/186 constraints. Problems are: Problem set: 4 solved, 465 unsolved
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/206 constraints. Problems are: Problem set: 4 solved, 465 unsolved
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 3 ms to minimize.
SMT process timed out in 30247ms, After SMT, problems are : Problem set: 4 solved, 465 unsolved
Search for dead transitions found 4 dead transitions in 30251ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/569 places, 466/501 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31177 ms. Remains : 538/569 places, 466/501 transitions.
[2024-05-22 00:26:25] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:26:25] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:26:25] [INFO ] Input system was already deterministic with 466 transitions.
[2024-05-22 00:26:25] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:26:25] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:26:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15923148799115179037.gal : 2 ms
[2024-05-22 00:26:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12670126897933036812.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/CTLCardinality15923148799115179037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12670126897933036812.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-22 00:26:55] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:26:55] [INFO ] Applying decomposition
[2024-05-22 00:26:55] [INFO ] Flatten gal took : 9 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/graph6928027003105511983.txt' '-o' '/tmp/graph6928027003105511983.bin' '-w' '/tmp/graph6928027003105511983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6928027003105511983.bin' '-l' '-1' '-v' '-w' '/tmp/graph6928027003105511983.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:26:55] [INFO ] Decomposing Gal with order
[2024-05-22 00:26:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:26:55] [INFO ] Removed a total of 267 redundant transitions.
[2024-05-22 00:26:55] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:26:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 00:26:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8874749378317484381.gal : 4 ms
[2024-05-22 00:26:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1952236691140478485.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/CTLCardinality8874749378317484381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1952236691140478485.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 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,1.04947e+31,2.34174,67716,5052,54,119139,484,1223,247779,55,1350,0


Converting to forward existential form...Done !
original formula: (EF((((i3.i0.u13.p30==0)||(i14.i1.u138.p481==1)) * ((EX(((i4.i1.u32.p90==0)||(i16.u147.p527==1))) * AG(((i13.i0.u127.p608==1)||(i11.i0.u1...242
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((i3.i0.u13.p30==0)||(i14.i1.u138.p481==1)) * ((EX(((i4.i1.u32.p90==0)||(i16.u147.p527==1)...336
(forward)formula 0,0,2.35293,67716,1,0,119139,484,1232,247779,60,1350,1136
FORMULA BusinessProcesses-PT-18-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 538 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 65 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
// Phase 1: matrix 470 rows 538 cols
[2024-05-22 00:26:58] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:26:58] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 00:26:58] [INFO ] Invariant cache hit.
[2024-05-22 00:26:58] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-22 00:26:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 124 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:08] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 20/126 constraints. Problems are: Problem set: 11 solved, 458 unsolved
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 15 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 105 places in 169 ms of which 2 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 5 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 3 ms to minimize.
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/146 constraints. Problems are: Problem set: 19 solved, 450 unsolved
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/166 constraints. Problems are: Problem set: 19 solved, 450 unsolved
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 119 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 119 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:27:20] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/186 constraints. Problems are: Problem set: 19 solved, 450 unsolved
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:27:24] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:27:25] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/206 constraints. Problems are: Problem set: 19 solved, 450 unsolved
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1008 variables, and 221 constraints, problems are : Problem set: 19 solved, 450 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 19 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 19 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 19 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 65/106 constraints. Problems are: Problem set: 19 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 115/221 constraints. Problems are: Problem set: 19 solved, 450 unsolved
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/241 constraints. Problems are: Problem set: 21 solved, 448 unsolved
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 1 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 122 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/261 constraints. Problems are: Problem set: 21 solved, 448 unsolved
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 122 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 119 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/281 constraints. Problems are: Problem set: 21 solved, 448 unsolved
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 99 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/301 constraints. Problems are: Problem set: 27 solved, 442 unsolved
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 102 places in 209 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 120 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/321 constraints. Problems are: Problem set: 27 solved, 442 unsolved
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/341 constraints. Problems are: Problem set: 27 solved, 442 unsolved
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/361 constraints. Problems are: Problem set: 27 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1008 variables, and 361 constraints, problems are : Problem set: 27 solved, 442 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 0/469 constraints, Known Traps: 255/255 constraints]
After SMT, in 60131ms problems are : Problem set: 27 solved, 442 unsolved
Search for dead transitions found 27 dead transitions in 60136ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/569 places, 443/501 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61049 ms. Remains : 538/569 places, 443/501 transitions.
[2024-05-22 00:27:59] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:27:59] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:27:59] [INFO ] Input system was already deterministic with 443 transitions.
[2024-05-22 00:27:59] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:27:59] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:27:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8785361345574794350.gal : 3 ms
[2024-05-22 00:27:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality15659044577370770424.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/CTLCardinality8785361345574794350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15659044577370770424.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-22 00:28:29] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:28:29] [INFO ] Applying decomposition
[2024-05-22 00:28:29] [INFO ] Flatten gal took : 17 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/graph4527953728174618234.txt' '-o' '/tmp/graph4527953728174618234.bin' '-w' '/tmp/graph4527953728174618234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4527953728174618234.bin' '-l' '-1' '-v' '-w' '/tmp/graph4527953728174618234.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:28:29] [INFO ] Decomposing Gal with order
[2024-05-22 00:28:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:28:29] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-22 00:28:29] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:28:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 6 ms.
[2024-05-22 00:28:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17655920005875611899.gal : 5 ms
[2024-05-22 00:28:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3386954492846517690.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/CTLCardinality17655920005875611899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3386954492846517690.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,6.32958e+30,5.14358,139364,8322,43,272005,511,1125,444706,56,1233,0


Converting to forward existential form...Done !
original formula: EF((AG(((i13.i0.u96.p305==0)||(i12.i2.u137.p471==1))) * !(E((i18.u155.p554!=1) U A(EX(((i17.i2.u127.p434==0)||(i13.i1.u135.p461==1))) U (...197
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !(((i13.i0.u96.p305==0)||(i12.i2.u137.p471==1)))))) * !(E((i18.u155.p554!=1) U !...366
Reverse transition relation is NOT exact ! Due to transitions t5, t302, t310, t318, t354, t371, t374, t421, t425, t427, t429, t432, t434, t438, i0.i0.u91.t...1513
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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 33 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-22 00:28:59] [INFO ] Computed 106 invariants in 9 ms
[2024-05-22 00:28:59] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-22 00:28:59] [INFO ] Invariant cache hit.
[2024-05-22 00:29:00] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:29:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 117 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 448 unsolved
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 119 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 127 places in 118 ms of which 4 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 120 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 126 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 6 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:29:30] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:29:30] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/226 constraints. Problems are: Problem set: 27 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/994 variables, and 226 constraints, problems are : Problem set: 27 solved, 435 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 27 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 27 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 27 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 27 solved, 435 unsolved
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 120/226 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/246 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 127 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/266 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:29:41] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:29:41] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:41] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:41] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:41] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:29:41] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 85 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/286 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:29:44] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/306 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/326 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 113 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/346 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
SMT process timed out in 60201ms, After SMT, problems are : Problem set: 31 solved, 431 unsolved
Search for dead transitions found 31 dead transitions in 60207ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/569 places, 432/501 transitions.
Applied a total of 0 rules in 12 ms. Remains 531 /531 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61077 ms. Remains : 531/569 places, 432/501 transitions.
[2024-05-22 00:30:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:30:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:30:00] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-22 00:30:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:30:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:30:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13607677135259518497.gal : 2 ms
[2024-05-22 00:30:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality695970944639954498.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/CTLCardinality13607677135259518497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality695970944639954498.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-22 00:30:30] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:30:30] [INFO ] Applying decomposition
[2024-05-22 00:30:30] [INFO ] Flatten gal took : 19 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/graph13848906032274420518.txt' '-o' '/tmp/graph13848906032274420518.bin' '-w' '/tmp/graph13848906032274420518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13848906032274420518.bin' '-l' '-1' '-v' '-w' '/tmp/graph13848906032274420518.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:30:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:30] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-22 00:30:30] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 19 ms.
[2024-05-22 00:30:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality47517542836774032.gal : 5 ms
[2024-05-22 00:30:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality16558112980182679764.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/CTLCardinality47517542836774032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16558112980182679764.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 -...261
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.95506e+30,1.64224,59688,3350,49,110095,564,1147,219776,55,1462,0


Converting to forward existential form...Done !
original formula: EF(EX((i8.i1.u177.p690==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (i8.i1.u177.p690==1))] != FALSE
(forward)formula 0,1,1.80097,59952,1,0,110095,564,1648,219776,73,1462,48022
FORMULA BusinessProcesses-PT-18-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1249 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 414
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 483 transition count 414
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 160 place count 483 transition count 298
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 417 place count 342 transition count 298
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 444 place count 315 transition count 271
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 472 place count 314 transition count 271
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 740 place count 179 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 742 place count 177 transition count 137
Applied a total of 742 rules in 102 ms. Remains 177 /569 variables (removed 392) and now considering 137/501 (removed 364) transitions.
// Phase 1: matrix 137 rows 177 cols
[2024-05-22 00:30:32] [INFO ] Computed 77 invariants in 1 ms
[2024-05-22 00:30:33] [INFO ] Implicit Places using invariants in 290 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 292 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/569 places, 137/501 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 398 ms. Remains : 150/569 places, 137/501 transitions.
[2024-05-22 00:30:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:30:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:30:33] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:30:33] [INFO ] Flatten gal took : 8 ms
RANDOM walk for 11 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-18-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:30:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:30:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13506984804240171337.gal : 2 ms
[2024-05-22 00:30:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3725121799850032190.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13506984804240171337.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3725121799850032190.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 536 transition count 468
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 57 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
// Phase 1: matrix 467 rows 535 cols
[2024-05-22 00:30:33] [INFO ] Computed 106 invariants in 7 ms
[2024-05-22 00:30:33] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-22 00:30:33] [INFO ] Invariant cache hit.
[2024-05-22 00:30:34] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-22 00:30:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/535 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:30:40] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:40] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:30:40] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:30:40] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:30:41] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 127 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 99 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 91 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 2 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 7 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 5 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 2 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 126 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 95 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 105 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 439 unsolved
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 119 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 122 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:31:02] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:02] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:31:02] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:31:02] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:31:02] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:31:02] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:31:02] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 439 unsolved
[2024-05-22 00:31:03] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:31:03] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:31:03] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:03] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 3 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 2 ms to minimize.
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 27 solved, 439 unsolved
Search for dead transitions found 27 dead transitions in 30172ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 535/569 places, 440/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 535 /535 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31331 ms. Remains : 535/569 places, 440/501 transitions.
[2024-05-22 00:31:04] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:31:04] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:31:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:31:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:31:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality10520811602586970362.gal : 2 ms
[2024-05-22 00:31:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality17476445917490495651.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/CTLCardinality10520811602586970362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17476445917490495651.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-22 00:31:34] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:31:34] [INFO ] Applying decomposition
[2024-05-22 00:31:34] [INFO ] Flatten gal took : 15 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/graph13020825736787537392.txt' '-o' '/tmp/graph13020825736787537392.bin' '-w' '/tmp/graph13020825736787537392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13020825736787537392.bin' '-l' '-1' '-v' '-w' '/tmp/graph13020825736787537392.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:31:34] [INFO ] Decomposing Gal with order
[2024-05-22 00:31:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:31:34] [INFO ] Removed a total of 161 redundant transitions.
[2024-05-22 00:31:34] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-05-22 00:31:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11412209762097671279.gal : 4 ms
[2024-05-22 00:31:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality18015748502991947255.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/CTLCardinality11412209762097671279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18015748502991947255.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,6.0865e+30,2.50481,68324,6028,44,106375,519,1106,236800,56,1295,0


Converting to forward existential form...Done !
original formula: (EF(((AF((i18.u149.p534==0)) + (i16.i0.u121.p404==0)) * EX((i7.i0.u82.p250==1)))) * EF((i16.i1.u124.p406==1)))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((!(EG(!((i18.u149.p534==0)))) + (i16.i0.u121.p404==0)) * EX((i7.i0.u82.p250==1))))),TRU...192
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t283, t295, t299, t303, t315, t351, t368, t371, t422, t424, t426, t429, t431, i0.i0.u...1445
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 1
Fast SCC detection found an 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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 55 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-22 00:32:04] [INFO ] Computed 106 invariants in 9 ms
[2024-05-22 00:32:05] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-22 00:32:05] [INFO ] Invariant cache hit.
[2024-05-22 00:32:05] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:32:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 125 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:14] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 448 unsolved
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 121 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 102 places in 213 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 96 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 90 places in 209 ms of which 5 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 104 places in 217 ms of which 4 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:32:24] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:32:24] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:32:24] [INFO ] Deduced a trap composed of 119 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:32:24] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:24] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:32:25] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:32:25] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:32:25] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:32:25] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 5 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 103 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 86 places in 183 ms of which 4 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 5 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 4 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:32:34] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:32:35] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:32:35] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:32:35] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:32:35] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:32:35] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 27 solved, 435 unsolved
Search for dead transitions found 27 dead transitions in 30182ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/569 places, 436/501 transitions.
Applied a total of 0 rules in 10 ms. Remains 531 /531 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30981 ms. Remains : 531/569 places, 436/501 transitions.
[2024-05-22 00:32:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:32:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:32:35] [INFO ] Input system was already deterministic with 436 transitions.
[2024-05-22 00:32:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:32:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:32:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality11059604813988740475.gal : 1 ms
[2024-05-22 00:32:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9759443590427793820.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/CTLCardinality11059604813988740475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9759443590427793820.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-22 00:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:05] [INFO ] Applying decomposition
[2024-05-22 00:33:05] [INFO ] Flatten gal took : 9 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/graph1804937040273515963.txt' '-o' '/tmp/graph1804937040273515963.bin' '-w' '/tmp/graph1804937040273515963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1804937040273515963.bin' '-l' '-1' '-v' '-w' '/tmp/graph1804937040273515963.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:33:06] [INFO ] Decomposing Gal with order
[2024-05-22 00:33:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:33:06] [INFO ] Removed a total of 168 redundant transitions.
[2024-05-22 00:33:06] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:33:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2024-05-22 00:33:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4575480222873798484.gal : 18 ms
[2024-05-22 00:33:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6619617433080990418.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/CTLCardinality4575480222873798484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6619617433080990418.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 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.95506e+30,0.786709,27100,3381,48,49230,448,1095,74280,49,1088,0


Converting to forward existential form...Done !
original formula: EF(!(EF(EX(((i9.i2.u160.p595==0)||(i12.i1.u92.p289==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(((i9.i2.u160.p595==0)||(i12.i1.u92.p289==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t279, t295, t299, t303, t311, t347, t364, t367, t413, t414, t418, t420, t423, t425, t...1422
(forward)formula 0,1,3.78437,137980,1,0,309007,500,7233,407679,269,1417,821758
FORMULA BusinessProcesses-PT-18-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 69 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
[2024-05-22 00:33:10] [INFO ] Invariant cache hit.
[2024-05-22 00:33:10] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-22 00:33:10] [INFO ] Invariant cache hit.
[2024-05-22 00:33:10] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:33:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 117 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:19] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 448 unsolved
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 116 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 121 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 123 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 5 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:33:31] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:33:31] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:33:34] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/226 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
SMT process timed out in 30230ms, After SMT, problems are : Problem set: 31 solved, 431 unsolved
Search for dead transitions found 31 dead transitions in 30236ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/569 places, 432/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 531 /531 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31186 ms. Remains : 531/569 places, 432/501 transitions.
[2024-05-22 00:33:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:41] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-22 00:33:41] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:33:41] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:33:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality13162494566360589584.gal : 4 ms
[2024-05-22 00:33:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality73253389701029482.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/CTLCardinality13162494566360589584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality73253389701029482.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-22 00:34:11] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:34:11] [INFO ] Applying decomposition
[2024-05-22 00:34:11] [INFO ] Flatten gal took : 16 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/graph7532527397506633276.txt' '-o' '/tmp/graph7532527397506633276.bin' '-w' '/tmp/graph7532527397506633276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7532527397506633276.bin' '-l' '-1' '-v' '-w' '/tmp/graph7532527397506633276.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:34:11] [INFO ] Decomposing Gal with order
[2024-05-22 00:34:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:34:11] [INFO ] Removed a total of 147 redundant transitions.
[2024-05-22 00:34:11] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:34:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-22 00:34:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5543425389893791205.gal : 4 ms
[2024-05-22 00:34:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7442789227381265329.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/CTLCardinality5543425389893791205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7442789227381265329.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 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.95506e+30,1.60491,57804,5390,42,110398,534,913,192087,50,1197,0


Converting to forward existential form...Done !
original formula: EF(AX(A(AX((i6.u14.p31==1)) U EX(((i1.u86.p262==1)||(i10.u67.p199==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!(EX(((i1.u86.p262==1)||(i10.u67.p199==1)))) U (!(!(EX(!((i6.u14.p31==1))))) * !...267
Reverse transition relation is NOT exact ! Due to transitions t279, t291, t299, t303, t311, t347, t364, t367, t409, t410, t414, t416, t418, t419, t421, t42...1335
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 542 transition count 474
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 542 transition count 474
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 533 transition count 465
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 70 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
// Phase 1: matrix 464 rows 532 cols
[2024-05-22 00:34:41] [INFO ] Computed 106 invariants in 5 ms
[2024-05-22 00:34:41] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-22 00:34:41] [INFO ] Invariant cache hit.
[2024-05-22 00:34:42] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-05-22 00:34:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 121 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 121 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/126 constraints. Problems are: Problem set: 13 solved, 450 unsolved
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/146 constraints. Problems are: Problem set: 21 solved, 442 unsolved
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/166 constraints. Problems are: Problem set: 21 solved, 442 unsolved
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:35:00] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:01] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:01] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:01] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:35:01] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 2 ms to minimize.
Problem TDEAD397 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD429 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 436 unsolved
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:35:05] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:35:07] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:35:07] [INFO ] Deduced a trap composed of 117 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:07] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:35:07] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:07] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:35:07] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 3 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/206 constraints. Problems are: Problem set: 32 solved, 431 unsolved
[2024-05-22 00:35:08] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:35:08] [INFO ] Deduced a trap composed of 116 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:35:08] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:35:08] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:35:09] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:35:09] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:35:09] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:35:09] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:09] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:35:09] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 2 ms to minimize.
Problem TDEAD381 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 20/226 constraints. Problems are: Problem set: 33 solved, 430 unsolved
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 2 ms to minimize.
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 33 solved, 430 unsolved
Search for dead transitions found 33 dead transitions in 30123ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 532/569 places, 431/501 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 531 transition count 431
Applied a total of 1 rules in 11 ms. Remains 531 /532 variables (removed 1) and now considering 431/431 (removed 0) transitions.
// Phase 1: matrix 431 rows 531 cols
[2024-05-22 00:35:12] [INFO ] Computed 111 invariants in 3 ms
[2024-05-22 00:35:12] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-22 00:35:12] [INFO ] Invariant cache hit.
[2024-05-22 00:35:13] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [119, 120]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 865 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 529/569 places, 431/501 transitions.
Applied a total of 0 rules in 10 ms. Remains 529 /529 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31909 ms. Remains : 529/569 places, 431/501 transitions.
[2024-05-22 00:35:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:35:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:35:13] [INFO ] Input system was already deterministic with 431 transitions.
[2024-05-22 00:35:13] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:35:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:35:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17446619588083008620.gal : 2 ms
[2024-05-22 00:35:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12105604766831952874.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/CTLCardinality17446619588083008620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12105604766831952874.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-22 00:35:43] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:35:43] [INFO ] Applying decomposition
[2024-05-22 00:35:43] [INFO ] Flatten gal took : 19 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/graph14959274912505886184.txt' '-o' '/tmp/graph14959274912505886184.bin' '-w' '/tmp/graph14959274912505886184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14959274912505886184.bin' '-l' '-1' '-v' '-w' '/tmp/graph14959274912505886184.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:35:43] [INFO ] Decomposing Gal with order
[2024-05-22 00:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:35:43] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-22 00:35:43] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:35:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2024-05-22 00:35:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality8702696181198527699.gal : 11 ms
[2024-05-22 00:35:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8406134270214088136.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/CTLCardinality8702696181198527699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8406134270214088136.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 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.95507e+30,1.66546,52360,3796,44,100652,450,1019,162924,52,1044,0


Converting to forward existential form...Done !
original formula: EX(AG(((AX(EG(((i12.i0.u73.p222==0)||(i11.i0.u67.p202==1)))) + AX((i9.i3.u160.p696==1))) + (EG(EX((i19.i1.u93.p295==1))) + (EF((i9.i4.u52...214
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((!(EX(!(EG(((i12.i0.u73.p222==0)||(i11.i0.u67.p202==1)))))) + !(EX(!((i9.i3.u160.p696...289
Reverse transition relation is NOT exact ! Due to transitions t280, t292, t296, t304, t312, t348, t368, t409, t413, t415, t417, t418, t420, t422, t426, i0....1440
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 a local SCC at level 1
Fast SCC detection found an 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 a local 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
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
[2024-05-22 00:36:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:36:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:36:13] [INFO ] Applying decomposition
[2024-05-22 00:36:13] [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/graph6475815027102509662.txt' '-o' '/tmp/graph6475815027102509662.bin' '-w' '/tmp/graph6475815027102509662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6475815027102509662.bin' '-l' '-1' '-v' '-w' '/tmp/graph6475815027102509662.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:36:13] [INFO ] Decomposing Gal with order
[2024-05-22 00:36:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:36:13] [INFO ] Removed a total of 284 redundant transitions.
[2024-05-22 00:36:13] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2024-05-22 00:36:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3779196718563645192.gal : 5 ms
[2024-05-22 00:36:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13869573402939484983.ctl : 13 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/CTLCardinality3779196718563645192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13869573402939484983.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 9 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,1.24276e+31,6.48401,168040,8372,61,309351,782,1282,641511,67,2190,0


Converting to forward existential form...Done !
original formula: (AX(EF(((AX((i4.i3.u145.p472==0)) * (i16.i0.u138.p448==0)) * (i17.i0.u197.p677==1)))) + AF((!(A(AG((i3.i0.u192.p660==1)) U (i17.i1.u95.p2...198
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(E(TRUE U ((!(EX(!((i4.i3.u145.p472==0)))) * (i16.i0.u138.p448==0)) * (i17.i0.u197.p677==1...357
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t335, t343, t347, t404, t482, t484, t486, t489, t491, i0.u65.t266, i0.u66.t26...1798
Detected timeout of ITS tools.
[2024-05-22 01:02:27] [INFO ] Applying decomposition
[2024-05-22 01:02:27] [INFO ] Flatten gal took : 24 ms
[2024-05-22 01:02:27] [INFO ] Decomposing Gal with order
[2024-05-22 01:02:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:02:27] [INFO ] Removed a total of 135 redundant transitions.
[2024-05-22 01:02:27] [INFO ] Flatten gal took : 31 ms
[2024-05-22 01:02:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 118 ms.
[2024-05-22 01:02:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality17813727956407075243.gal : 8 ms
[2024-05-22 01:02:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality3781426079020710563.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/CTLCardinality17813727956407075243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3781426079020710563.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 01:09:37] [INFO ] Flatten gal took : 23 ms
[2024-05-22 01:09:37] [INFO ] Input system was already deterministic with 501 transitions.
[2024-05-22 01:09:37] [INFO ] Transformed 569 places.
[2024-05-22 01:09:37] [INFO ] Transformed 501 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:10:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14423507327519326505.gal : 3 ms
[2024-05-22 01:10:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality3687481060551081530.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/CTLCardinality14423507327519326505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3687481060551081530.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../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-18"
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-18, 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-171620399800585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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