fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339300121
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Champagne-PT-H09T0R

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ?FFF???TFFFT??TT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Champagne-PT-H09T0R, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.8K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 266K Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-00
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-01
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-02
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-03
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-04
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-05
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-06
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-07
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-08
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-09
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-10
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-11
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-12
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-13
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-14
FORMULA_NAME Champagne-PT-H09T0R-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749328402164

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-07 20:33:23] [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]
[2025-06-07 20:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 20:33:23] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-07 20:33:23] [INFO ] Transformed 979 places.
[2025-06-07 20:33:23] [INFO ] Transformed 1572 transitions.
[2025-06-07 20:33:23] [INFO ] Found NUPN structural information;
[2025-06-07 20:33:23] [INFO ] Parsed PT model containing 979 places and 1572 transitions and 4420 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 153 out of 979 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 979/979 places, 1572/1572 transitions.
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 190 place count 789 transition count 1382
Iterating global reduction 0 with 190 rules applied. Total rules applied 380 place count 789 transition count 1382
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 473 place count 696 transition count 1289
Iterating global reduction 0 with 93 rules applied. Total rules applied 566 place count 696 transition count 1289
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 611 place count 651 transition count 1142
Iterating global reduction 0 with 45 rules applied. Total rules applied 656 place count 651 transition count 1142
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 678 place count 651 transition count 1120
Applied a total of 678 rules in 183 ms. Remains 651 /979 variables (removed 328) and now considering 1120/1572 (removed 452) transitions.
// Phase 1: matrix 1120 rows 651 cols
[2025-06-07 20:33:23] [INFO ] Computed 49 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:33:24] [INFO ] Implicit Places using invariants in 422 ms returned []
[2025-06-07 20:33:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:33:24] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Running 1119 sub problems to find dead transitions.
[2025-06-07 20:33:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/650 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 1 (OVERLAPS) 1/651 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
(s433 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0timeout
)
(s434 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/1771 variables, and 49 constraints, problems are : Problem set: 0 solved, 1119 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/651 constraints, PredecessorRefiner: 1119/1119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/650 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
At refinement iteration 1 (OVERLAPS) 1/651 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:15] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:15] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:15] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:15] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:15] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:16] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:16] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:16] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:16] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:16] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:16] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:16] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:17] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:20] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:20] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:20] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:20] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:20] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:20] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:21] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:21] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:21] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:21] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:21] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:21] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:21] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:22] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:22] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:22] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:22] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:22] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:22] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/651 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/1771 variables, and 89 constraints, problems are : Problem set: 0 solved, 1119 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/651 constraints, PredecessorRefiner: 0/1119 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1119 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 651/979 places, 1120/1572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61549 ms. Remains : 651/979 places, 1120/1572 transitions.
Support contains 153 out of 651 places after structural reductions.
[2025-06-07 20:34:25] [INFO ] Flatten gal took : 88 ms
[2025-06-07 20:34:25] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 20:34:25] [INFO ] Flatten gal took : 52 ms
[2025-06-07 20:34:25] [INFO ] Input system was already deterministic with 1120 transitions.
Support contains 131 out of 651 places (down from 153) after GAL structural reductions.
RANDOM walk for 40000 steps (61 resets) in 2060 ms. (19 steps per ms) remains 10/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
[2025-06-07 20:34:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 294/326 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 325/651 variables, 26/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/651 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1120/1771 variables, 651/700 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1771 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/1771 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1771/1771 variables, and 700 constraints, problems are : Problem set: 0 solved, 10 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 651/651 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 294/326 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:27] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:27] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:27] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:27] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:27] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 325/651 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:28] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:29] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:29] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:29] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1120/1771 variables, 651/719 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1771 variables, 10/729 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:29] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:30] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1771 variables, 12/741 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:31] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:31] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:31] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:31] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:31] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:31] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:31] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:32] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:32] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:32] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:32] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:32] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:32] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:32] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 7 ms to minimize.
SMT process timed out in 5908ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Graph (trivial) has 564 edges and 651 vertex of which 62 / 651 are part of one of the 13 SCC in 4 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 602 transition count 912
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 215 rules applied. Total rules applied 358 place count 460 transition count 839
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 38 rules applied. Total rules applied 396 place count 428 transition count 833
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 406 place count 422 transition count 829
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 408 place count 420 transition count 829
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 408 place count 420 transition count 808
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 450 place count 399 transition count 808
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 494 place count 355 transition count 726
Iterating global reduction 5 with 44 rules applied. Total rules applied 538 place count 355 transition count 726
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 543 place count 355 transition count 721
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 543 place count 355 transition count 708
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 569 place count 342 transition count 708
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 573 place count 338 transition count 672
Iterating global reduction 6 with 4 rules applied. Total rules applied 577 place count 338 transition count 672
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 581 place count 338 transition count 668
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 7 with 278 rules applied. Total rules applied 859 place count 199 transition count 529
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 866 place count 192 transition count 477
Iterating global reduction 7 with 7 rules applied. Total rules applied 873 place count 192 transition count 477
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 880 place count 192 transition count 470
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 886 place count 189 transition count 481
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 888 place count 189 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 891 place count 189 transition count 476
Free-agglomeration rule applied 87 times.
Iterating global reduction 9 with 87 rules applied. Total rules applied 978 place count 189 transition count 389
Reduce places removed 87 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Iterating post reduction 9 with 334 rules applied. Total rules applied 1312 place count 102 transition count 142
Ensure Unique test removed 3 places
Iterating post reduction 10 with 3 rules applied. Total rules applied 1315 place count 99 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1318 place count 99 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1319 place count 98 transition count 138
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 11 with 54 rules applied. Total rules applied 1373 place count 76 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1394 place count 76 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1396 place count 76 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1398 place count 74 transition count 83
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 1402 place count 74 transition count 83
Applied a total of 1402 rules in 205 ms. Remains 74 /651 variables (removed 577) and now considering 83/1120 (removed 1037) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 74/651 places, 83/1120 transitions.
RANDOM walk for 40000 steps (8 resets) in 463 ms. (86 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
[2025-06-07 20:34:33] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 74 cols
[2025-06-07 20:34:33] [INFO ] Computed 24 invariants in 1 ms
[2025-06-07 20:34:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/94 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/99 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 16/115 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/121 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/121 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/124 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/126 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/126 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 6/132 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 2/134 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/134 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/154 variables, and 84 constraints, problems are : Problem set: 0 solved, 6 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 19/24 constraints, State Equation: 64/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/94 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/99 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 16/115 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/121 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/121 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 3/124 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 2/126 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/126 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 6/132 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 2/134 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/134 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 5/139 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 5/144 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:34:33] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/144 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/144 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 10/154 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/154 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 0/154 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 108 constraints, problems are : Problem set: 0 solved, 6 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 752ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 18 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 6 properties in 10 ms.
[2025-06-07 20:34:33] [INFO ] Flatten gal took : 42 ms
[2025-06-07 20:34:33] [INFO ] Flatten gal took : 38 ms
[2025-06-07 20:34:33] [INFO ] Input system was already deterministic with 1120 transitions.
Computed a total of 109 stabilizing places and 109 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 92 place count 559 transition count 990
Iterating global reduction 0 with 92 rules applied. Total rules applied 184 place count 559 transition count 990
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 190 place count 559 transition count 984
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 240 place count 509 transition count 896
Iterating global reduction 1 with 50 rules applied. Total rules applied 290 place count 509 transition count 896
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 299 place count 509 transition count 887
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 327 place count 481 transition count 800
Iterating global reduction 2 with 28 rules applied. Total rules applied 355 place count 481 transition count 800
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 366 place count 481 transition count 789
Applied a total of 366 rules in 34 ms. Remains 481 /651 variables (removed 170) and now considering 789/1120 (removed 331) transitions.
// Phase 1: matrix 789 rows 481 cols
[2025-06-07 20:34:34] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:34:34] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-07 20:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:34:34] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 788 sub problems to find dead transitions.
[2025-06-07 20:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/481 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 789/1270 variables, 481/530 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1270/1270 variables, and 530 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/481 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 789/1270 variables, 481/530 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1270 variables, 788/1318 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1270/1270 variables, and 1318 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 481/651 places, 789/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60713 ms. Remains : 481/651 places, 789/1120 transitions.
[2025-06-07 20:35:34] [INFO ] Flatten gal took : 21 ms
[2025-06-07 20:35:34] [INFO ] Flatten gal took : 21 ms
[2025-06-07 20:35:34] [INFO ] Input system was already deterministic with 789 transitions.
[2025-06-07 20:35:34] [INFO ] Flatten gal took : 20 ms
[2025-06-07 20:35:34] [INFO ] Flatten gal took : 23 ms
[2025-06-07 20:35:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2555072092986680126.gal : 16 ms
[2025-06-07 20:35:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality5190828619708696703.ctl : 5 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2555072092986680126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5190828619708696703.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:36:05] [INFO ] Flatten gal took : 25 ms
[2025-06-07 20:36:05] [INFO ] Applying decomposition
[2025-06-07 20:36:05] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph5085695450799218726.txt' '-o' '/tmp/graph5085695450799218726.bin' '-w' '/tmp/graph5085695450799218726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5085695450799218726.bin' '-l' '-1' '-v' '-w' '/tmp/graph5085695450799218726.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:36:05] [INFO ] Decomposing Gal with order
[2025-06-07 20:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:36:05] [INFO ] Removed a total of 722 redundant transitions.
[2025-06-07 20:36:05] [INFO ] Flatten gal took : 84 ms
[2025-06-07 20:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 22 ms.
[2025-06-07 20:36:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13907260751776812659.gal : 11 ms
[2025-06-07 20:36:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality8564370342326445898.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13907260751776812659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8564370342326445898.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.36827e+46,0.354252,16784,1626,37,24273,826,1113,38409,73,1676,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((AG(((i8.u29.p162!=0)&&(i13.u48.p266!=1))) + AF((i23.u78.p455==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((!(E(TRUE U !(((i8.u29.p162!=0)&&(i13.u48.p266!=1))))) + !(EG(!((i23.u78.p455==1))))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t114, t153, t202, i0.t376, i1.t487, i2.t478, i3.t468, i4.t458, i5.t448, i6.t438, i7.t428, i8....1271
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 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 561 transition count 983
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 561 transition count 983
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 187 place count 561 transition count 976
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 235 place count 513 transition count 901
Iterating global reduction 1 with 48 rules applied. Total rules applied 283 place count 513 transition count 901
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 291 place count 513 transition count 893
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 318 place count 486 transition count 807
Iterating global reduction 2 with 27 rules applied. Total rules applied 345 place count 486 transition count 807
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 356 place count 486 transition count 796
Applied a total of 356 rules in 51 ms. Remains 486 /651 variables (removed 165) and now considering 796/1120 (removed 324) transitions.
// Phase 1: matrix 796 rows 486 cols
[2025-06-07 20:36:35] [INFO ] Computed 49 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:36:35] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-07 20:36:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:36:36] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 795 sub problems to find dead transitions.
[2025-06-07 20:36:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/486 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:36:54] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:36:54] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:36:55] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:36:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:36:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1282 variables, and 54 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/486 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 4 (OVERLAPS) 796/1282 variables, 486/540 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1282 variables, 795/1335 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1282/1282 variables, and 1335 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 486/651 places, 796/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 486/651 places, 796/1120 transitions.
[2025-06-07 20:37:36] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:37:36] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:37:36] [INFO ] Input system was already deterministic with 796 transitions.
[2025-06-07 20:37:36] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:37:36] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:37:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15633065881781316207.gal : 4 ms
[2025-06-07 20:37:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality6739368016188345235.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15633065881781316207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6739368016188345235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:38:06] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:38:06] [INFO ] Applying decomposition
[2025-06-07 20:38:06] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph9282065148895082001.txt' '-o' '/tmp/graph9282065148895082001.bin' '-w' '/tmp/graph9282065148895082001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9282065148895082001.bin' '-l' '-1' '-v' '-w' '/tmp/graph9282065148895082001.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:38:06] [INFO ] Decomposing Gal with order
[2025-06-07 20:38:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:38:06] [INFO ] Removed a total of 721 redundant transitions.
[2025-06-07 20:38:06] [INFO ] Flatten gal took : 36 ms
[2025-06-07 20:38:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 13 ms.
[2025-06-07 20:38:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4866662955696592470.gal : 5 ms
[2025-06-07 20:38:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality18305982769970016646.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4866662955696592470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18305982769970016646.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.69274e+46,0.375308,17100,1339,24,26273,735,1046,36559,57,1452,0


Converting to forward existential form...Done !
original formula: AG((E((i20.u71.p403==0) U (i4.i1.u56.p314==0)) * (AF(((i26.u94.p552==1)&&(i2.u8.p29==0))) + AX(EX((i7.u31.p178==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((i20.u71.p403==0) U (i4.i1.u56.p314==0))))] = FALSE * [(EY((FwdU(Init,TRUE) * !(!(EG(!(...233
Reverse transition relation is NOT exact ! Due to transitions t46, t56, t95, t114, t134, t153, t183, t202, t255, t274, t357, t376, i0.i1.t431, i1.i1.t451, ...1365
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
(forward)formula 0,0,26.9606,736844,1,0,1.45108e+06,735,7051,1.88337e+06,299,1452,1473164
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 93 place count 558 transition count 980
Iterating global reduction 0 with 93 rules applied. Total rules applied 186 place count 558 transition count 980
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 193 place count 558 transition count 973
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 243 place count 508 transition count 885
Iterating global reduction 1 with 50 rules applied. Total rules applied 293 place count 508 transition count 885
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 302 place count 508 transition count 876
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 330 place count 480 transition count 795
Iterating global reduction 2 with 28 rules applied. Total rules applied 358 place count 480 transition count 795
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 368 place count 480 transition count 785
Applied a total of 368 rules in 35 ms. Remains 480 /651 variables (removed 171) and now considering 785/1120 (removed 335) transitions.
// Phase 1: matrix 785 rows 480 cols
[2025-06-07 20:38:33] [INFO ] Computed 49 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:38:33] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-07 20:38:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:38:34] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-06-07 20:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 785/1265 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1265/1265 variables, and 529 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (OVERLAPS) 785/1265 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1265 variables, 784/1313 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1265/1265 variables, and 1313 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 480/651 places, 785/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 480/651 places, 785/1120 transitions.
[2025-06-07 20:39:34] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:39:34] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:39:34] [INFO ] Input system was already deterministic with 785 transitions.
[2025-06-07 20:39:34] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:39:34] [INFO ] Flatten gal took : 20 ms
[2025-06-07 20:39:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality8867743309824793120.gal : 4 ms
[2025-06-07 20:39:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6781240066876838723.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8867743309824793120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6781240066876838723.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:40:04] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:40:04] [INFO ] Applying decomposition
[2025-06-07 20:40:04] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph11466575200743146598.txt' '-o' '/tmp/graph11466575200743146598.bin' '-w' '/tmp/graph11466575200743146598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11466575200743146598.bin' '-l' '-1' '-v' '-w' '/tmp/graph11466575200743146598.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:40:04] [INFO ] Decomposing Gal with order
[2025-06-07 20:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:40:04] [INFO ] Removed a total of 709 redundant transitions.
[2025-06-07 20:40:04] [INFO ] Flatten gal took : 31 ms
[2025-06-07 20:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 12 ms.
[2025-06-07 20:40:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality14431284464744143628.gal : 6 ms
[2025-06-07 20:40:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2332471904133403407.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14431284464744143628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2332471904133403407.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.06261e+46,0.348632,17060,1913,22,26556,742,993,35126,53,1469,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(((i29.i1.u103.p607==1) * EX((i31.u112.p677==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(((i29.i1.u103.p607==1) * EX((i31.u112.p677==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t75, t114, t153, t205, t274, i0.t210, i0.u95.t206, i1.i1.t408, i2.i1.t448, i3.t487, i4.t...1295
(forward)formula 0,0,2.37145,120100,1,0,338564,742,6662,256683,264,1469,785717
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 563 transition count 994
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 563 transition count 994
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 182 place count 563 transition count 988
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 229 place count 516 transition count 903
Iterating global reduction 1 with 47 rules applied. Total rules applied 276 place count 516 transition count 903
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 285 place count 516 transition count 894
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 310 place count 491 transition count 814
Iterating global reduction 2 with 25 rules applied. Total rules applied 335 place count 491 transition count 814
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 345 place count 491 transition count 804
Applied a total of 345 rules in 27 ms. Remains 491 /651 variables (removed 160) and now considering 804/1120 (removed 316) transitions.
// Phase 1: matrix 804 rows 491 cols
[2025-06-07 20:40:07] [INFO ] Computed 49 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:40:07] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-07 20:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:40:07] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 803 sub problems to find dead transitions.
[2025-06-07 20:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 803 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 803 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 804/1295 variables, 491/540 constraints. Problems are: Problem set: 0 solved, 803 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 540 constraints, problems are : Problem set: 0 solved, 803 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 803/803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 803 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 803 unsolved
At refinement iteration 3 (OVERLAPS) 804/1295 variables, 491/540 constraints. Problems are: Problem set: 0 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1295 variables, 803/1343 constraints. Problems are: Problem set: 0 solved, 803 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1343 constraints, problems are : Problem set: 0 solved, 803 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 803/803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 803 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 491/651 places, 804/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60683 ms. Remains : 491/651 places, 804/1120 transitions.
[2025-06-07 20:41:07] [INFO ] Flatten gal took : 18 ms
[2025-06-07 20:41:07] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:41:07] [INFO ] Input system was already deterministic with 804 transitions.
[2025-06-07 20:41:07] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:41:07] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:41:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality18283070682427888764.gal : 4 ms
[2025-06-07 20:41:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2640756580110085336.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18283070682427888764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2640756580110085336.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:41:38] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:41:38] [INFO ] Applying decomposition
[2025-06-07 20:41:38] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6376684948158299924.txt' '-o' '/tmp/graph6376684948158299924.bin' '-w' '/tmp/graph6376684948158299924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6376684948158299924.bin' '-l' '-1' '-v' '-w' '/tmp/graph6376684948158299924.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:41:38] [INFO ] Decomposing Gal with order
[2025-06-07 20:41:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:41:38] [INFO ] Removed a total of 743 redundant transitions.
[2025-06-07 20:41:38] [INFO ] Flatten gal took : 46 ms
[2025-06-07 20:41:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2025-06-07 20:41:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8682023828880368161.gal : 6 ms
[2025-06-07 20:41:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality10896732566467513214.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8682023828880368161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10896732566467513214.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.55666e+46,0.669201,30648,2736,23,43243,683,1064,156055,60,1291,0


Converting to forward existential form...Done !
original formula: EX(E(EF(((i3.u6.p29!=1) * !(EG((i3.u9.p28==1))))) U (!(A(EG(((i35.u124.p703==0)||(i31.u108.p622==1))) U AG(((i32.u114.p634==0)||(i0.u40.p...261
=> equivalent forward existential formula: ([((FwdU(EY(Init),E(TRUE U ((i3.u6.p29!=1) * !(EG((i3.u9.p28==1)))))) * !(!((E(!(!(E(TRUE U !(((i32.u114.p634==0...792
Reverse transition relation is NOT exact ! Due to transitions t46, t75, t114, t156, t209, t279, i0.t395, i1.t435, i2.t475, i3.t496, i4.t485, i5.t465, i6.t4...1221
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 571 transition count 1002
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 571 transition count 1002
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 166 place count 571 transition count 996
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 209 place count 528 transition count 920
Iterating global reduction 1 with 43 rules applied. Total rules applied 252 place count 528 transition count 920
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 258 place count 528 transition count 914
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 283 place count 503 transition count 834
Iterating global reduction 2 with 25 rules applied. Total rules applied 308 place count 503 transition count 834
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 316 place count 503 transition count 826
Applied a total of 316 rules in 37 ms. Remains 503 /651 variables (removed 148) and now considering 826/1120 (removed 294) transitions.
// Phase 1: matrix 826 rows 503 cols
[2025-06-07 20:42:08] [INFO ] Computed 49 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:42:08] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-07 20:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:42:08] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 825 sub problems to find dead transitions.
[2025-06-07 20:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/503 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:27] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:27] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:27] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:27] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:28] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:28] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:29] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:29] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:30] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:30] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/1329 variables, and 59 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 825 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/503 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 4 (OVERLAPS) 826/1329 variables, 503/562 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1329 variables, 825/1387 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:58] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:58] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:59] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:42:59] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:00] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1329 variables, and 1392 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 503/651 places, 826/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60719 ms. Remains : 503/651 places, 826/1120 transitions.
[2025-06-07 20:43:09] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:43:09] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:43:09] [INFO ] Input system was already deterministic with 826 transitions.
[2025-06-07 20:43:09] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:43:09] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:43:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality16906524866338189854.gal : 3 ms
[2025-06-07 20:43:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality16017880531024135927.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16906524866338189854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16017880531024135927.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:43:39] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:43:39] [INFO ] Applying decomposition
[2025-06-07 20:43:39] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14287710982636408367.txt' '-o' '/tmp/graph14287710982636408367.bin' '-w' '/tmp/graph14287710982636408367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14287710982636408367.bin' '-l' '-1' '-v' '-w' '/tmp/graph14287710982636408367.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:43:39] [INFO ] Decomposing Gal with order
[2025-06-07 20:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:43:39] [INFO ] Removed a total of 758 redundant transitions.
[2025-06-07 20:43:39] [INFO ] Flatten gal took : 28 ms
[2025-06-07 20:43:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2025-06-07 20:43:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality15122574051645013422.gal : 5 ms
[2025-06-07 20:43:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality2310125618820674209.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15122574051645013422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2310125618820674209.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.1477e+47,0.880152,35676,1839,29,44987,781,1171,213535,68,1600,0


Converting to forward existential form...Done !
original formula: ((AG(EX(((i28.u106.p594==0)&&(i11.u41.p230==1)))) + AF(!(A(((((i30.u118.p653==1)&&((i31.u121.p674==0)||(i38.u171.p966==1)))&&((i33.u141.p...474
=> equivalent forward existential formula: ([(EY((Init * !((!(E(TRUE U !(EX(((i28.u106.p594==0)&&(i11.u41.p230==1)))))) + !(EG(!(!(!((E(!((!(E(TRUE U !(((i...1333
Reverse transition relation is NOT exact ! Due to transitions t8, t30, t61, t102, t124, t164, t197, t217, t268, t287, t368, t492, i0.t445, i1.t465, i2.t507...1427
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 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 560 transition count 982
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 560 transition count 982
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 189 place count 560 transition count 975
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 237 place count 512 transition count 889
Iterating global reduction 1 with 48 rules applied. Total rules applied 285 place count 512 transition count 889
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 294 place count 512 transition count 880
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 321 place count 485 transition count 805
Iterating global reduction 2 with 27 rules applied. Total rules applied 348 place count 485 transition count 805
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 357 place count 485 transition count 796
Applied a total of 357 rules in 44 ms. Remains 485 /651 variables (removed 166) and now considering 796/1120 (removed 324) transitions.
// Phase 1: matrix 796 rows 485 cols
[2025-06-07 20:44:09] [INFO ] Computed 49 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:44:09] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-07 20:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:44:09] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 795 sub problems to find dead transitions.
[2025-06-07 20:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/485 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (OVERLAPS) 796/1281 variables, 485/534 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/1281 variables, and 534 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/485 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (OVERLAPS) 796/1281 variables, 485/534 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 795/1329 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1281/1281 variables, and 1329 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 485/651 places, 796/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 485/651 places, 796/1120 transitions.
[2025-06-07 20:45:10] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:45:10] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:45:10] [INFO ] Input system was already deterministic with 796 transitions.
[2025-06-07 20:45:10] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:45:10] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:45:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12422879536642122528.gal : 3 ms
[2025-06-07 20:45:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality18044929693927316714.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12422879536642122528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18044929693927316714.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:45:40] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:45:40] [INFO ] Applying decomposition
[2025-06-07 20:45:40] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5627561206944754737.txt' '-o' '/tmp/graph5627561206944754737.bin' '-w' '/tmp/graph5627561206944754737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5627561206944754737.bin' '-l' '-1' '-v' '-w' '/tmp/graph5627561206944754737.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:45:40] [INFO ] Decomposing Gal with order
[2025-06-07 20:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:45:40] [INFO ] Removed a total of 707 redundant transitions.
[2025-06-07 20:45:40] [INFO ] Flatten gal took : 26 ms
[2025-06-07 20:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-06-07 20:45:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8401065186878359633.gal : 5 ms
[2025-06-07 20:45:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17345461331303907518.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8401065186878359633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17345461331303907518.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.53179e+46,0.263746,13988,1211,23,18927,714,1024,26234,59,1317,0


Converting to forward existential form...Done !
original formula: E((i11.u39.p228==1) U A(AF(((i7.u25.p128==0)||(i19.u68.p376==1))) U EX((AG(((i38.i2.u134.p795==0)||(i37.i5.u161.p962==1))) * ((i14.u53.p2...185
=> equivalent forward existential formula: [((FwdU(Init,(i11.u39.p228==1)) * !(EG(!(EX((!(E(TRUE U !(((i38.i2.u134.p795==0)||(i37.i5.u161.p962==1))))) * ((...499
Reverse transition relation is NOT exact ! Due to transitions t75, t115, t154, t203, t376, i0.i1.t413, i1.i1.t492, i2.t483, i3.t473, i4.t463, i5.t453, i6.t...1303
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 569 transition count 1002
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 569 transition count 1002
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 170 place count 569 transition count 996
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 214 place count 525 transition count 924
Iterating global reduction 1 with 44 rules applied. Total rules applied 258 place count 525 transition count 924
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 265 place count 525 transition count 917
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 292 place count 498 transition count 840
Iterating global reduction 2 with 27 rules applied. Total rules applied 319 place count 498 transition count 840
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 329 place count 498 transition count 830
Applied a total of 329 rules in 27 ms. Remains 498 /651 variables (removed 153) and now considering 830/1120 (removed 290) transitions.
// Phase 1: matrix 830 rows 498 cols
[2025-06-07 20:46:10] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:10] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-07 20:46:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:10] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 829 sub problems to find dead transitions.
[2025-06-07 20:46:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 829 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:31] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:31] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:46:32] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 829 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1328 variables, and 52 constraints, problems are : Problem set: 0 solved, 829 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 829/829 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 829 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 4 (OVERLAPS) 830/1328 variables, 498/550 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1328 variables, 829/1379 constraints. Problems are: Problem set: 0 solved, 829 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:02] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:04] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:04] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:04] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:04] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:04] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:04] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:05] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:05] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:05] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:05] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 1390 constraints, problems are : Problem set: 0 solved, 829 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 829/829 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 829 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 498/651 places, 830/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 498/651 places, 830/1120 transitions.
[2025-06-07 20:47:11] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:47:11] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:47:11] [INFO ] Input system was already deterministic with 830 transitions.
[2025-06-07 20:47:11] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:47:11] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:47:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality3641591358952620544.gal : 3 ms
[2025-06-07 20:47:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4915094741049557605.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3641591358952620544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4915094741049557605.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:47:41] [INFO ] Flatten gal took : 20 ms
[2025-06-07 20:47:41] [INFO ] Applying decomposition
[2025-06-07 20:47:41] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15533539908457557086.txt' '-o' '/tmp/graph15533539908457557086.bin' '-w' '/tmp/graph15533539908457557086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15533539908457557086.bin' '-l' '-1' '-v' '-w' '/tmp/graph15533539908457557086.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:47:41] [INFO ] Decomposing Gal with order
[2025-06-07 20:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:47:41] [INFO ] Removed a total of 754 redundant transitions.
[2025-06-07 20:47:41] [INFO ] Flatten gal took : 28 ms
[2025-06-07 20:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2025-06-07 20:47:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7348734633188202686.gal : 6 ms
[2025-06-07 20:47:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4674410356502298421.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7348734633188202686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4674410356502298421.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.2421e+47,0.44886,20536,1960,27,33631,896,1094,45824,64,2051,0


Converting to forward existential form...Done !
original formula: E((((!((((i17.u62.p339==0)||(i1.u9.p44==1))||(i16.u57.p316==0))) + !((AX(!(((i32.i0.u134.p762==0)||(i28.i0.u107.p601==1)))) + AF((((i19.u...572
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,(((!((((i17.u62.p339==0)||(i1.u9.p44==1))||(i16.u57.p316==0))) + !((!(EX(!(!(((i32.i0.u134.p...1977
Reverse transition relation is NOT exact ! Due to transitions t46, t56, t75, t115, t137, t156, t188, t222, t262, t281, t489, i0.t462, i0.u17.t464, i1.t493,...1454
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 0,1,26.2567,631480,1,0,1.18078e+06,907,8764,1.60707e+06,389,2593,1537532
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 92 place count 559 transition count 981
Iterating global reduction 0 with 92 rules applied. Total rules applied 184 place count 559 transition count 981
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 191 place count 559 transition count 974
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 241 place count 509 transition count 886
Iterating global reduction 1 with 50 rules applied. Total rules applied 291 place count 509 transition count 886
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 300 place count 509 transition count 877
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 329 place count 480 transition count 789
Iterating global reduction 2 with 29 rules applied. Total rules applied 358 place count 480 transition count 789
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 369 place count 480 transition count 778
Applied a total of 369 rules in 29 ms. Remains 480 /651 variables (removed 171) and now considering 778/1120 (removed 342) transitions.
// Phase 1: matrix 778 rows 480 cols
[2025-06-07 20:48:07] [INFO ] Computed 49 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:48:07] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 20:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:48:08] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 777 sub problems to find dead transitions.
[2025-06-07 20:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 778/1258 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 529 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 777 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 3 (OVERLAPS) 778/1258 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1258 variables, 777/1306 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1258/1258 variables, and 1306 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 777 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 480/651 places, 778/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60635 ms. Remains : 480/651 places, 778/1120 transitions.
[2025-06-07 20:49:08] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:49:08] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:49:08] [INFO ] Input system was already deterministic with 778 transitions.
[2025-06-07 20:49:08] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:49:08] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:49:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality2287055190842759849.gal : 2 ms
[2025-06-07 20:49:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14101100430015225156.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2287055190842759849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14101100430015225156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:49:38] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:49:38] [INFO ] Applying decomposition
[2025-06-07 20:49:38] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18081955072694378421.txt' '-o' '/tmp/graph18081955072694378421.bin' '-w' '/tmp/graph18081955072694378421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18081955072694378421.bin' '-l' '-1' '-v' '-w' '/tmp/graph18081955072694378421.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:49:38] [INFO ] Decomposing Gal with order
[2025-06-07 20:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:49:38] [INFO ] Removed a total of 701 redundant transitions.
[2025-06-07 20:49:38] [INFO ] Flatten gal took : 25 ms
[2025-06-07 20:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-06-07 20:49:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8137825197577634939.gal : 5 ms
[2025-06-07 20:49:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality54194552417705082.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8137825197577634939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality54194552417705082.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.15397e+46,0.418529,18400,1519,22,26306,676,1056,54398,53,1251,0


Converting to forward existential form...Done !
original formula: AG((((i0.u3.p8==0)||(i6.u25.p137==1)) + (AX(FALSE) * EX((i40.i0.i0.u161.p930==0)))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !(((i0.u3.p8==0)||(i6.u25.p137==1))))) * !(FALSE))] = FALSE * [((FwdU(Init,TRUE) * !(((...233
Reverse transition relation is NOT exact ! Due to transitions t47, t76, t115, t154, t203, t272, i0.t487, i1.t478, i2.t468, i3.t458, i4.t448, i5.t438, i6.u2...1206
(forward)formula 0,0,2.03463,84832,1,0,220539,676,6024,272366,216,1251,428933
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 562 transition count 984
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 562 transition count 984
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 185 place count 562 transition count 977
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 233 place count 514 transition count 891
Iterating global reduction 1 with 48 rules applied. Total rules applied 281 place count 514 transition count 891
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 290 place count 514 transition count 882
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 317 place count 487 transition count 796
Iterating global reduction 2 with 27 rules applied. Total rules applied 344 place count 487 transition count 796
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 355 place count 487 transition count 785
Applied a total of 355 rules in 34 ms. Remains 487 /651 variables (removed 164) and now considering 785/1120 (removed 335) transitions.
// Phase 1: matrix 785 rows 487 cols
[2025-06-07 20:49:40] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:49:40] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-07 20:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:49:41] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-06-07 20:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (OVERLAPS) 785/1272 variables, 487/536 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 536 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (OVERLAPS) 785/1272 variables, 487/536 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1272 variables, 784/1320 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1320 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 487/651 places, 785/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60696 ms. Remains : 487/651 places, 785/1120 transitions.
[2025-06-07 20:50:41] [INFO ] Flatten gal took : 11 ms
[2025-06-07 20:50:41] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:50:41] [INFO ] Input system was already deterministic with 785 transitions.
[2025-06-07 20:50:41] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:50:41] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:50:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16131401322301288302.gal : 4 ms
[2025-06-07 20:50:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5781816707973368879.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16131401322301288302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5781816707973368879.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:51:11] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:51:11] [INFO ] Applying decomposition
[2025-06-07 20:51:11] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15653320825594688612.txt' '-o' '/tmp/graph15653320825594688612.bin' '-w' '/tmp/graph15653320825594688612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15653320825594688612.bin' '-l' '-1' '-v' '-w' '/tmp/graph15653320825594688612.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:51:11] [INFO ] Decomposing Gal with order
[2025-06-07 20:51:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:51:11] [INFO ] Removed a total of 689 redundant transitions.
[2025-06-07 20:51:11] [INFO ] Flatten gal took : 25 ms
[2025-06-07 20:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2025-06-07 20:51:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality9700285711304989479.gal : 5 ms
[2025-06-07 20:51:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality9898526798737602842.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9700285711304989479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9898526798737602842.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4.18126e+46,0.379387,18204,1670,23,29622,800,1012,37465,56,1641,0


Converting to forward existential form...Done !
original formula: EX(!(E((((i1.u9.p40==0)||(i34.u129.p724==1)) * A(((i21.u74.p430==0)||(i39.i1.u157.p897==1)) U (i24.u87.p502==0))) U !(((i15.u54.p286==0)|...179
=> equivalent forward existential formula: [(EY(Init) * !(E((((i1.u9.p40==0)||(i34.u129.p724==1)) * !((E(!((i24.u87.p502==0)) U (!(((i21.u74.p430==0)||(i39...287
Reverse transition relation is NOT exact ! Due to transitions t8, t75, t116, t155, t204, t276, t379, i0.i1.t444, i1.t483, i1.u9.t485, i2.i1.t494, i3.t474, ...1313
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 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
(forward)formula 0,0,14.8337,418972,1,0,881958,800,6889,1.24934e+06,294,1641,1064544
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Graph (trivial) has 595 edges and 651 vertex of which 74 / 651 are part of one of the 14 SCC in 5 ms
Free SCC test removed 60 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 152 place count 590 transition count 901
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 228 rules applied. Total rules applied 380 place count 439 transition count 824
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 415 place count 405 transition count 823
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 418 place count 404 transition count 821
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 419 place count 403 transition count 821
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 419 place count 403 transition count 797
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 467 place count 379 transition count 797
Discarding 57 places :
Symmetric choice reduction at 5 with 57 rule applications. Total rules 524 place count 322 transition count 693
Iterating global reduction 5 with 57 rules applied. Total rules applied 581 place count 322 transition count 693
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 587 place count 322 transition count 687
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 587 place count 322 transition count 670
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 621 place count 305 transition count 670
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 626 place count 300 transition count 634
Iterating global reduction 6 with 5 rules applied. Total rules applied 631 place count 300 transition count 634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 636 place count 300 transition count 629
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 7 with 262 rules applied. Total rules applied 898 place count 169 transition count 498
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 907 place count 160 transition count 432
Iterating global reduction 7 with 9 rules applied. Total rules applied 916 place count 160 transition count 432
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 925 place count 160 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 927 place count 158 transition count 421
Applied a total of 927 rules in 107 ms. Remains 158 /651 variables (removed 493) and now considering 421/1120 (removed 699) transitions.
[2025-06-07 20:51:26] [INFO ] Flow matrix only has 185 transitions (discarded 236 similar events)
// Phase 1: matrix 185 rows 158 cols
[2025-06-07 20:51:26] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:51:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-07 20:51:26] [INFO ] Flow matrix only has 185 transitions (discarded 236 similar events)
[2025-06-07 20:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:51:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-07 20:51:26] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:51:27] [INFO ] Redundant transitions in 29 ms returned []
Running 333 sub problems to find dead transitions.
[2025-06-07 20:51:27] [INFO ] Flow matrix only has 185 transitions (discarded 236 similar events)
[2025-06-07 20:51:27] [INFO ] Invariant cache hit.
[2025-06-07 20:51:27] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 7/158 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 184/342 variables, 158/207 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/343 variables, and 211 constraints, problems are : Problem set: 0 solved, 333 unsolved in 13319 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 158/158 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 7/158 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 184/342 variables, 158/207 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 333/544 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:47] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:51:48] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 9/553 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/343 variables, and 553 constraints, problems are : Problem set: 0 solved, 333 unsolved in 21036 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 158/158 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 34417ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 34417ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/651 places, 421/1120 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34810 ms. Remains : 158/651 places, 421/1120 transitions.
[2025-06-07 20:52:01] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:52:01] [INFO ] Flatten gal took : 10 ms
[2025-06-07 20:52:01] [INFO ] Input system was already deterministic with 421 transitions.
[2025-06-07 20:52:01] [INFO ] Flatten gal took : 10 ms
[2025-06-07 20:52:01] [INFO ] Flatten gal took : 10 ms
[2025-06-07 20:52:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality11548760043771855858.gal : 2 ms
[2025-06-07 20:52:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality16721120282910418860.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11548760043771855858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16721120282910418860.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,8.06398e+23,0.082559,6656,2,308,5,6710,6,0,1038,2940,0


Converting to forward existential form...Done !
original formula: AG(E(((p631==0)||(p498==1)) U ((EF(((p660==1)&&(p260==1))) * EG((((p718==0)||(p835==0))||(p181==1)))) * E((!(((p143==0)||(p660==1))) + E(...226
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p631==0)||(p498==1)) U ((E(TRUE U ((p660==1)&&(p260==1))) * EG((((p718==0)||(p835==0))...292
Reverse transition relation is NOT exact ! Due to transitions t291, t292, t351, Intersection with reachable at each step enabled. (destroyed/reverse/inter...179
(forward)formula 0,0,6.89314,223012,1,0,1852,1.17251e+06,881,955,7120,1.51947e+06,2175
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Graph (trivial) has 607 edges and 651 vertex of which 74 / 651 are part of one of the 14 SCC in 2 ms
Free SCC test removed 60 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 157 place count 591 transition count 897
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 240 rules applied. Total rules applied 397 place count 435 transition count 813
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 434 place count 398 transition count 813
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 434 place count 398 transition count 789
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 482 place count 374 transition count 789
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 538 place count 318 transition count 695
Iterating global reduction 3 with 56 rules applied. Total rules applied 594 place count 318 transition count 695
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 599 place count 318 transition count 690
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 599 place count 318 transition count 673
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 633 place count 301 transition count 673
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 639 place count 295 transition count 630
Iterating global reduction 4 with 6 rules applied. Total rules applied 645 place count 295 transition count 630
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 651 place count 295 transition count 624
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 5 with 268 rules applied. Total rules applied 919 place count 161 transition count 490
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 929 place count 151 transition count 420
Iterating global reduction 5 with 10 rules applied. Total rules applied 939 place count 151 transition count 420
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 949 place count 151 transition count 410
Applied a total of 949 rules in 66 ms. Remains 151 /651 variables (removed 500) and now considering 410/1120 (removed 710) transitions.
[2025-06-07 20:52:08] [INFO ] Flow matrix only has 163 transitions (discarded 247 similar events)
// Phase 1: matrix 163 rows 151 cols
[2025-06-07 20:52:08] [INFO ] Computed 49 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:52:08] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-07 20:52:08] [INFO ] Flow matrix only has 163 transitions (discarded 247 similar events)
[2025-06-07 20:52:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:52:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-07 20:52:08] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:52:08] [INFO ] Redundant transitions in 7 ms returned []
Running 409 sub problems to find dead transitions.
[2025-06-07 20:52:08] [INFO ] Flow matrix only has 163 transitions (discarded 247 similar events)
[2025-06-07 20:52:08] [INFO ] Invariant cache hit.
[2025-06-07 20:52:08] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:52:11] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 162/313 variables, 151/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 38/239 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 1/314 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 240 constraints, problems are : Problem set: 0 solved, 409 unsolved in 23065 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 151/151 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 162/313 variables, 151/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 38/239 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 409/648 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:52:39] [INFO ] Deduced a trap along path composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 650 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 151/151 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53150ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 53150ms
Starting structural reductions in SI_CTL mode, iteration 1 : 151/651 places, 410/1120 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53510 ms. Remains : 151/651 places, 410/1120 transitions.
[2025-06-07 20:53:01] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:53:01] [INFO ] Flatten gal took : 6 ms
[2025-06-07 20:53:01] [INFO ] Input system was already deterministic with 410 transitions.
[2025-06-07 20:53:01] [INFO ] Flatten gal took : 7 ms
[2025-06-07 20:53:02] [INFO ] Flatten gal took : 7 ms
[2025-06-07 20:53:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality4377685564334980252.gal : 1 ms
[2025-06-07 20:53:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality16306799221710967723.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4377685564334980252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16306799221710967723.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.22247e+22,0.097383,6752,2,464,5,9999,6,0,1002,5830,0


Converting to forward existential form...Done !
original formula: !(E((EG((p614==0)) + EG(((p943==0)||(p471==1)))) U ((!(((p892==0)||(p853==1))) * AG((p240==1))) * (A(((p108==0)||(p306==1)) U (p776==1)) ...169
=> equivalent forward existential formula: ([(((FwdU(Init,(EG((p614==0)) + EG(((p943==0)||(p471==1))))) * (!(((p892==0)||(p853==1))) * !(E(TRUE U !((p240==...403
Reverse transition relation is NOT exact ! Due to transitions t12, t20, t24, t409, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
(forward)formula 0,1,9.85179,315516,1,0,1906,1.442e+06,843,930,7111,2.49221e+06,2032
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 571 transition count 999
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 571 transition count 999
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 166 place count 571 transition count 993
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 209 place count 528 transition count 916
Iterating global reduction 1 with 43 rules applied. Total rules applied 252 place count 528 transition count 916
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 259 place count 528 transition count 909
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 283 place count 504 transition count 840
Iterating global reduction 2 with 24 rules applied. Total rules applied 307 place count 504 transition count 840
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 315 place count 504 transition count 832
Applied a total of 315 rules in 35 ms. Remains 504 /651 variables (removed 147) and now considering 832/1120 (removed 288) transitions.
// Phase 1: matrix 832 rows 504 cols
[2025-06-07 20:53:11] [INFO ] Computed 49 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:53:12] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-07 20:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:53:12] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 831 sub problems to find dead transitions.
[2025-06-07 20:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 1/504 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:30] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:31] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:31] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:31] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:31] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:31] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:32] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:32] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:32] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:33] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:33] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:33] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:33] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:37] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:38] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:53:38] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1336 variables, and 72 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 1/504 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 4 (OVERLAPS) 832/1336 variables, 504/576 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 831/1407 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:02] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:03] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:04] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:05] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:05] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:07] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:08] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:09] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:09] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:10] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:10] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:54:10] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1419 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 504/651 places, 832/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 504/651 places, 832/1120 transitions.
[2025-06-07 20:54:12] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:54:12] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:54:12] [INFO ] Input system was already deterministic with 832 transitions.
[2025-06-07 20:54:12] [INFO ] Flatten gal took : 14 ms
[2025-06-07 20:54:12] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:54:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality15913215722531145165.gal : 3 ms
[2025-06-07 20:54:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality4005863029171560152.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15913215722531145165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4005863029171560152.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:54:42] [INFO ] Flatten gal took : 19 ms
[2025-06-07 20:54:42] [INFO ] Applying decomposition
[2025-06-07 20:54:42] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16489715826326209887.txt' '-o' '/tmp/graph16489715826326209887.bin' '-w' '/tmp/graph16489715826326209887.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16489715826326209887.bin' '-l' '-1' '-v' '-w' '/tmp/graph16489715826326209887.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:54:42] [INFO ] Decomposing Gal with order
[2025-06-07 20:54:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:54:42] [INFO ] Removed a total of 764 redundant transitions.
[2025-06-07 20:54:42] [INFO ] Flatten gal took : 27 ms
[2025-06-07 20:54:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2025-06-07 20:54:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7464880888828623796.gal : 4 ms
[2025-06-07 20:54:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5267191900283797317.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7464880888828623796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5267191900283797317.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.28816e+47,0.636846,27348,2604,33,44622,821,1140,94454,70,1817,0


Converting to forward existential form...Done !
original formula: E((AF(E(E(((i8.u36.p193==0)||(i30.i1.u115.p657==1)) U (i17.u63.p308==1)) U (i4.u18.p85==1))) * ((!(E((((i36.i0.u159.p903==0)||(i23.i1.u11...518
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,(!(EG(!(E(E(((i8.u36.p193==0)||(i30.i1.u115.p657==1)) U (i17.u63.p308==1)) U (i4.u18.p85==1)))...576
Reverse transition relation is NOT exact ! Due to transitions t58, t77, t98, t118, t141, t160, t192, t211, t261, t280, t364, t383, i0.i1.t426, i1.u7.t508, ...1459
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
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 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 562 transition count 987
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 562 transition count 987
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 184 place count 562 transition count 981
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 232 place count 514 transition count 896
Iterating global reduction 1 with 48 rules applied. Total rules applied 280 place count 514 transition count 896
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 288 place count 514 transition count 888
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 315 place count 487 transition count 813
Iterating global reduction 2 with 27 rules applied. Total rules applied 342 place count 487 transition count 813
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 352 place count 487 transition count 803
Applied a total of 352 rules in 24 ms. Remains 487 /651 variables (removed 164) and now considering 803/1120 (removed 317) transitions.
// Phase 1: matrix 803 rows 487 cols
[2025-06-07 20:55:12] [INFO ] Computed 49 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:55:13] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-07 20:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:55:13] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 802 sub problems to find dead transitions.
[2025-06-07 20:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 3 (OVERLAPS) 803/1290 variables, 487/536 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1290/1290 variables, and 536 constraints, problems are : Problem set: 0 solved, 802 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 802 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 3 (OVERLAPS) 803/1290 variables, 487/536 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 802/1338 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1290/1290 variables, and 1338 constraints, problems are : Problem set: 0 solved, 802 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 487/651 places, 803/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 487/651 places, 803/1120 transitions.
[2025-06-07 20:56:13] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:56:13] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:56:13] [INFO ] Input system was already deterministic with 803 transitions.
[2025-06-07 20:56:13] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:56:13] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:56:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality264665812328021480.gal : 8 ms
[2025-06-07 20:56:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13110251605140367558.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality264665812328021480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13110251605140367558.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:56:43] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:56:43] [INFO ] Applying decomposition
[2025-06-07 20:56:43] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15806431734406070780.txt' '-o' '/tmp/graph15806431734406070780.bin' '-w' '/tmp/graph15806431734406070780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15806431734406070780.bin' '-l' '-1' '-v' '-w' '/tmp/graph15806431734406070780.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:56:43] [INFO ] Decomposing Gal with order
[2025-06-07 20:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:56:43] [INFO ] Removed a total of 733 redundant transitions.
[2025-06-07 20:56:43] [INFO ] Flatten gal took : 24 ms
[2025-06-07 20:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 9 ms.
[2025-06-07 20:56:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13995457147112711875.gal : 5 ms
[2025-06-07 20:56:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8999421529809501266.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13995457147112711875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8999421529809501266.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.29096e+46,0.596312,27260,2435,24,48984,745,1082,84888,62,1567,0


Converting to forward existential form...Done !
original formula: ((EX(((i21.u84.p475==1)&&(i19.i0.i1.u38.p217==1))) + AG(EX(((((i30.u116.p670==0)||(i36.u144.p833==1)) + (EF((i23.u93.p538==1)) + (i34.u13...288
=> equivalent forward existential formula: [(FwdU(((Init * !(EX(EG((i38.u132.p763==1))))) * !(EX(((i21.u84.p475==1)&&(i19.i0.i1.u38.p217==1))))),TRUE) * !(...354
Reverse transition relation is NOT exact ! Due to transitions t8, t48, t88, t118, t157, t207, t279, t380, i0.t280, i0.u75.t284, i1.t455, i2.t494, i3.t485, ...1232
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 1120/1120 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 562 transition count 984
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 562 transition count 984
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 185 place count 562 transition count 977
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 233 place count 514 transition count 902
Iterating global reduction 1 with 48 rules applied. Total rules applied 281 place count 514 transition count 902
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 289 place count 514 transition count 894
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 317 place count 486 transition count 807
Iterating global reduction 2 with 28 rules applied. Total rules applied 345 place count 486 transition count 807
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 356 place count 486 transition count 796
Applied a total of 356 rules in 24 ms. Remains 486 /651 variables (removed 165) and now considering 796/1120 (removed 324) transitions.
// Phase 1: matrix 796 rows 486 cols
[2025-06-07 20:57:14] [INFO ] Computed 49 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:57:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 20:57:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:57:14] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 795 sub problems to find dead transitions.
[2025-06-07 20:57:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/486 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:57:32] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:57:32] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:57:32] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:57:32] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:57:33] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:57:33] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:57:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1282 variables, and 56 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/486 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 4 (OVERLAPS) 796/1282 variables, 486/542 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1282 variables, 795/1337 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:02] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:02] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:03] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:03] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:04] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:04] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:05] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:58:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1282/1282 variables, and 1346 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 486/651 places, 796/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60638 ms. Remains : 486/651 places, 796/1120 transitions.
[2025-06-07 20:58:14] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:58:14] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:58:14] [INFO ] Input system was already deterministic with 796 transitions.
[2025-06-07 20:58:14] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:58:14] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:58:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12337846548633573695.gal : 3 ms
[2025-06-07 20:58:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4495345831027883984.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12337846548633573695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4495345831027883984.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-07 20:58:44] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:58:44] [INFO ] Applying decomposition
[2025-06-07 20:58:44] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16281425147209184298.txt' '-o' '/tmp/graph16281425147209184298.bin' '-w' '/tmp/graph16281425147209184298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16281425147209184298.bin' '-l' '-1' '-v' '-w' '/tmp/graph16281425147209184298.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:58:44] [INFO ] Decomposing Gal with order
[2025-06-07 20:58:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:58:44] [INFO ] Removed a total of 712 redundant transitions.
[2025-06-07 20:58:44] [INFO ] Flatten gal took : 24 ms
[2025-06-07 20:58:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2025-06-07 20:58:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality18068617770581702169.gal : 4 ms
[2025-06-07 20:58:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12792579107033207129.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18068617770581702169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12792579107033207129.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.57231e+46,0.463025,21944,2322,28,35823,694,1031,57514,57,1406,0


Converting to forward existential form...Done !
original formula: (AX((((i18.i1.u69.p393==0)&&(i20.u93.p524==0)) * !(E((i4.i1.u47.p254==0) U (i18.i0.u70.p401!=0))))) + EF(AX(AG((i20.u90.p541==0)))))
=> equivalent forward existential formula: ([(EY((Init * !(E(TRUE U !(EX(!(!(E(TRUE U !((i20.u90.p541==0))))))))))) * !(((i18.i1.u69.p393==0)&&(i20.u93.p52...306
Reverse transition relation is NOT exact ! Due to transitions t56, t95, t114, t134, t153, t183, t202, t255, t274, t358, t379, t479, i0.i1.t384, i0.i2.t275,...1384
(forward)formula 0,1,2.79507,128440,1,0,321218,694,6608,320366,275,1406,665003
FORMULA Champagne-PT-H09T0R-CTLCardinality-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 20:58:47] [INFO ] Flatten gal took : 20 ms
[2025-06-07 20:58:47] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:58:47] [INFO ] Applying decomposition
[2025-06-07 20:58:47] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph8290120126255077319.txt' '-o' '/tmp/graph8290120126255077319.bin' '-w' '/tmp/graph8290120126255077319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8290120126255077319.bin' '-l' '-1' '-v' '-w' '/tmp/graph8290120126255077319.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:58:47] [INFO ] Decomposing Gal with order
[2025-06-07 20:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:58:47] [INFO ] Removed a total of 995 redundant transitions.
[2025-06-07 20:58:47] [INFO ] Flatten gal took : 33 ms
[2025-06-07 20:58:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 9 ms.
[2025-06-07 20:58:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality2657389692959995617.gal : 6 ms
[2025-06-07 20:58:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13812438116776512350.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2657389692959995617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13812438116776512350.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 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.62922e+52,7.51072,170160,22471,62,264517,1358,1513,781032,104,4216,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((AG(((i7.u38.p162!=0)&&(i13.u71.p266!=1))) + AF((i17.i1.u115.p455==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((!(E(TRUE U !(((i7.u38.p162!=0)&&(i13.u71.p266!=1))))) + !(EG(!((i17.i1.u115.p455==1)))))...168
Reverse transition relation is NOT exact ! Due to transitions t8, t35, t70, t107, t147, t235, t304, t328, t350, t487, i0.t491, i0.u59.t493, i1.i0.t589, i1....2132
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
[2025-06-07 21:27:16] [INFO ] Applying decomposition
[2025-06-07 21:27:16] [INFO ] Flatten gal took : 19 ms
[2025-06-07 21:27:16] [INFO ] Decomposing Gal with order
[2025-06-07 21:27:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:27:16] [INFO ] Removed a total of 792 redundant transitions.
[2025-06-07 21:27:16] [INFO ] Flatten gal took : 31 ms
[2025-06-07 21:27:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 16 ms.
[2025-06-07 21:27:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6159448087512111716.gal : 4 ms
[2025-06-07 21:27:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5781428105408414180.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6159448087512111716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5781428105408414180.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 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.62922e+52,0.950893,36740,1624,880,60885,4101,1169,180485,286,43315,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((AG(((i0.i0.i0.i0.i0.u19.p162!=0)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u34.p266!=1))) + AF((i1.i1.i0.i0.i0.i0.i0.i0.u51.p455==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((!(E(TRUE U !(((i0.i0.i0.i0.i0.u19.p162!=0)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u34.p266!=1))...222
Reverse transition relation is NOT exact ! Due to transitions i0.t487, i0.u23.t491, i0.u23.t493, i0.i0.u22.t504, i0.i0.u22.t508, i0.i0.i0.u21.t521, i0.i0.i...4507

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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Champagne-PT-H09T0R"
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-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H09T0R, 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 r254-tall-174931339300121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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