Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900433.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 MedleyB-PT-B02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 253K 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 MedleyB-PT-B02-CTLCardinality-2025-00
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-01
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-02
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-03
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-04
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-05
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-06
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-07
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-08
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-09
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-10
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-11
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-12
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-13
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-14
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749386224722

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-08 12:37:05] [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-08 12:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:37:06] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-06-08 12:37:06] [INFO ] Transformed 1227 places.
[2025-06-08 12:37:06] [INFO ] Transformed 1472 transitions.
[2025-06-08 12:37:06] [INFO ] Found NUPN structural information;
[2025-06-08 12:37:06] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 2 formulas.
FORMULA MedleyB-PT-B02-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-CTLCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 1145 transition count 1390
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 1145 transition count 1390
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 212 place count 1097 transition count 1342
Iterating global reduction 0 with 48 rules applied. Total rules applied 260 place count 1097 transition count 1342
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 285 place count 1072 transition count 1317
Iterating global reduction 0 with 25 rules applied. Total rules applied 310 place count 1072 transition count 1317
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 324 place count 1058 transition count 1303
Iterating global reduction 0 with 14 rules applied. Total rules applied 338 place count 1058 transition count 1303
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 351 place count 1045 transition count 1290
Iterating global reduction 0 with 13 rules applied. Total rules applied 364 place count 1045 transition count 1290
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 376 place count 1033 transition count 1278
Iterating global reduction 0 with 12 rules applied. Total rules applied 388 place count 1033 transition count 1278
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 399 place count 1022 transition count 1267
Iterating global reduction 0 with 11 rules applied. Total rules applied 410 place count 1022 transition count 1267
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 421 place count 1011 transition count 1256
Iterating global reduction 0 with 11 rules applied. Total rules applied 432 place count 1011 transition count 1256
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 438 place count 1005 transition count 1250
Iterating global reduction 0 with 6 rules applied. Total rules applied 444 place count 1005 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 445 place count 1004 transition count 1249
Iterating global reduction 0 with 1 rules applied. Total rules applied 446 place count 1004 transition count 1249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 447 place count 1003 transition count 1248
Iterating global reduction 0 with 1 rules applied. Total rules applied 448 place count 1003 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 449 place count 1002 transition count 1247
Iterating global reduction 0 with 1 rules applied. Total rules applied 450 place count 1002 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 451 place count 1001 transition count 1246
Iterating global reduction 0 with 1 rules applied. Total rules applied 452 place count 1001 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 453 place count 1000 transition count 1245
Iterating global reduction 0 with 1 rules applied. Total rules applied 454 place count 1000 transition count 1245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 455 place count 999 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 456 place count 999 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 457 place count 998 transition count 1243
Iterating global reduction 0 with 1 rules applied. Total rules applied 458 place count 998 transition count 1243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 459 place count 997 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 460 place count 997 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 461 place count 996 transition count 1241
Iterating global reduction 0 with 1 rules applied. Total rules applied 462 place count 996 transition count 1241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 463 place count 995 transition count 1240
Iterating global reduction 0 with 1 rules applied. Total rules applied 464 place count 995 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 465 place count 994 transition count 1239
Iterating global reduction 0 with 1 rules applied. Total rules applied 466 place count 994 transition count 1239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 467 place count 993 transition count 1238
Iterating global reduction 0 with 1 rules applied. Total rules applied 468 place count 993 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 469 place count 992 transition count 1237
Iterating global reduction 0 with 1 rules applied. Total rules applied 470 place count 992 transition count 1237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 471 place count 992 transition count 1236
Applied a total of 471 rules in 1302 ms. Remains 992 /1227 variables (removed 235) and now considering 1236/1472 (removed 236) transitions.
// Phase 1: matrix 1236 rows 992 cols
[2025-06-08 12:37:07] [INFO ] Computed 5 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:37:08] [INFO ] Implicit Places using invariants in 784 ms returned []
[2025-06-08 12:37:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:37:09] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
Running 1235 sub problems to find dead transitions.
[2025-06-08 12:37:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 991/2228 variables, and 0 constraints, problems are : Problem set: 0 solved, 1235 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 1235/1235 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1235 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/2228 variables, and 0 constraints, problems are : Problem set: 0 solved, 1235 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 0/1235 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 1235 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 992/1227 places, 1236/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63985 ms. Remains : 992/1227 places, 1236/1472 transitions.
Support contains 117 out of 992 places after structural reductions.
[2025-06-08 12:38:10] [INFO ] Flatten gal took : 189 ms
[2025-06-08 12:38:10] [INFO ] Flatten gal took : 110 ms
[2025-06-08 12:38:11] [INFO ] Input system was already deterministic with 1236 transitions.
Support contains 96 out of 992 places (down from 117) after GAL structural reductions.
RANDOM walk for 40000 steps (511 resets) in 1529 ms. (26 steps per ms) remains 35/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (9 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (11 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (10 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 40 ms. (97 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (9 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (11 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
[2025-06-08 12:38:11] [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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 915/978 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/978 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 14/992 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/992 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1236/2228 variables, 992/997 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2228 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2228/2228 variables, and 997 constraints, problems are : Problem set: 0 solved, 35 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 992/992 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 915/978 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:17] [INFO ] Deduced a trap composed of 313 places in 629 ms of which 332 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:18] [INFO ] Deduced a trap composed of 355 places in 544 ms of which 256 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:19] [INFO ] Deduced a trap composed of 317 places in 501 ms of which 229 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:19] [INFO ] Deduced a trap composed of 318 places in 339 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:20] [INFO ] Deduced a trap composed of 348 places in 554 ms of which 280 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:20] [INFO ] Deduced a trap composed of 317 places in 226 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:20] [INFO ] Deduced a trap composed of 318 places in 339 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:21] [INFO ] Deduced a trap composed of 342 places in 555 ms of which 268 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:22] [INFO ] Deduced a trap composed of 340 places in 597 ms of which 326 ms to minimize.
SMT process timed out in 10416ms, After SMT, problems are : Problem set: 1 solved, 34 unsolved
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Graph (trivial) has 870 edges and 992 vertex of which 50 / 992 are part of one of the 9 SCC in 4 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 1436 edges and 951 vertex of which 948 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 625 rules applied. Total rules applied 627 place count 948 transition count 557
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 630 rules applied. Total rules applied 1257 place count 325 transition count 550
Reduce places removed 3 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 27 rules applied. Total rules applied 1284 place count 322 transition count 526
Reduce places removed 24 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 26 rules applied. Total rules applied 1310 place count 298 transition count 524
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1311 place count 297 transition count 524
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1311 place count 297 transition count 475
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1409 place count 248 transition count 475
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1414 place count 243 transition count 470
Iterating global reduction 5 with 5 rules applied. Total rules applied 1419 place count 243 transition count 470
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1423 place count 239 transition count 440
Iterating global reduction 5 with 4 rules applied. Total rules applied 1427 place count 239 transition count 440
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1485 place count 210 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1486 place count 210 transition count 410
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1502 place count 194 transition count 291
Iterating global reduction 6 with 16 rules applied. Total rules applied 1518 place count 194 transition count 291
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1525 place count 194 transition count 284
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1529 place count 190 transition count 280
Iterating global reduction 7 with 4 rules applied. Total rules applied 1533 place count 190 transition count 280
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1535 place count 188 transition count 278
Iterating global reduction 7 with 2 rules applied. Total rules applied 1537 place count 188 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1538 place count 188 transition count 277
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1546 place count 184 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1552 place count 181 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1557 place count 181 transition count 278
Free-agglomeration rule applied 37 times.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1594 place count 181 transition count 241
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 1631 place count 144 transition count 241
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1632 place count 143 transition count 240
Iterating global reduction 9 with 1 rules applied. Total rules applied 1633 place count 143 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1639 place count 143 transition count 234
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1643 place count 143 transition count 234
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 1646 place count 143 transition count 231
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1647 place count 143 transition count 231
Applied a total of 1647 rules in 179 ms. Remains 143 /992 variables (removed 849) and now considering 231/1236 (removed 1005) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 143/992 places, 231/1236 transitions.
RANDOM walk for 40000 steps (1433 resets) in 710 ms. (56 steps per ms) remains 9/34 properties
BEST_FIRST walk for 40002 steps (332 resets) in 103 ms. (384 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (310 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (331 resets) in 88 ms. (449 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (336 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (341 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (338 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (336 resets) in 42 ms. (930 steps per ms) remains 4/5 properties
// Phase 1: matrix 231 rows 143 cols
[2025-06-08 12:38:22] [INFO ] Computed 4 invariants in 2 ms
[2025-06-08 12:38:22] [INFO ] State equation strengthened by 84 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 188/294 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 64/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 23/317 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 29/346 variables, 14/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 18/364 variables, 9/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/364 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 7/371 variables, 5/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/374 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/374 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/374 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/374 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 231 constraints, problems are : Problem set: 0 solved, 4 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 143/143 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:23] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 188/294 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 64/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 23/317 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 13/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:23] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 29/346 variables, 14/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 18/364 variables, 9/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 7/371 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/371 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/371 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 3/374 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/374 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/374 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/374 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 237 constraints, problems are : Problem set: 0 solved, 4 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 143/143 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1242ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 143 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 47 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-06-08 12:38:24] [INFO ] Flatten gal took : 48 ms
[2025-06-08 12:38:24] [INFO ] Flatten gal took : 43 ms
[2025-06-08 12:38:24] [INFO ] Input system was already deterministic with 1236 transitions.
Computed a total of 185 stabilizing places and 193 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Graph (trivial) has 976 edges and 992 vertex of which 70 / 992 are part of one of the 12 SCC in 2 ms
Free SCC test removed 58 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 710 transitions
Trivial Post-agglo rules discarded 710 transitions
Performed 710 trivial Post agglomeration. Transition count delta: 710
Iterating post reduction 0 with 710 rules applied. Total rules applied 711 place count 933 transition count 459
Reduce places removed 710 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 719 rules applied. Total rules applied 1430 place count 223 transition count 450
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1436 place count 219 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1438 place count 217 transition count 448
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 1438 place count 217 transition count 405
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1524 place count 174 transition count 405
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1539 place count 159 transition count 390
Iterating global reduction 4 with 15 rules applied. Total rules applied 1554 place count 159 transition count 390
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1561 place count 152 transition count 357
Iterating global reduction 4 with 7 rules applied. Total rules applied 1568 place count 152 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1570 place count 152 transition count 355
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1573 place count 149 transition count 352
Iterating global reduction 5 with 3 rules applied. Total rules applied 1576 place count 149 transition count 352
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1579 place count 146 transition count 349
Iterating global reduction 5 with 3 rules applied. Total rules applied 1582 place count 146 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1584 place count 146 transition count 347
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1634 place count 121 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1640 place count 121 transition count 316
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1662 place count 99 transition count 194
Iterating global reduction 7 with 22 rules applied. Total rules applied 1684 place count 99 transition count 194
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1693 place count 99 transition count 185
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1704 place count 88 transition count 171
Iterating global reduction 8 with 11 rules applied. Total rules applied 1715 place count 88 transition count 171
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1726 place count 77 transition count 157
Iterating global reduction 8 with 11 rules applied. Total rules applied 1737 place count 77 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1742 place count 77 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1744 place count 76 transition count 151
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1745 place count 75 transition count 146
Iterating global reduction 9 with 1 rules applied. Total rules applied 1746 place count 75 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1747 place count 75 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1751 place count 75 transition count 141
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1759 place count 71 transition count 137
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1760 place count 71 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1761 place count 70 transition count 136
Applied a total of 1761 rules in 76 ms. Remains 70 /992 variables (removed 922) and now considering 136/1236 (removed 1100) transitions.
[2025-06-08 12:38:24] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 70 cols
[2025-06-08 12:38:24] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-08 12:38:24] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:38:24] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:38:24] [INFO ] Redundant transitions in 3 ms returned []
Running 127 sub problems to find dead transitions.
[2025-06-08 12:38:24] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-08 12:38:24] [INFO ] Invariant cache hit.
[2025-06-08 12:38:24] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 19 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-08 12:38:25] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:25] [INFO ] Deduced a trap composed of 23 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-08 12:38:25] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:26] [INFO ] Deduced a trap composed of 27 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-08 12:38:26] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 130/200 variables, 70/86 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:30] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/201 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 102 constraints, problems are : Problem set: 0 solved, 127 unsolved in 9191 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 130/200 variables, 70/87 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 127/228 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:35] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 1/201 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 230 constraints, problems are : Problem set: 0 solved, 127 unsolved in 12823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22051ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 22053ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/992 places, 136/1236 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22309 ms. Remains : 70/992 places, 136/1236 transitions.
[2025-06-08 12:38:46] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:38:46] [INFO ] Flatten gal took : 6 ms
[2025-06-08 12:38:46] [INFO ] Input system was already deterministic with 136 transitions.
[2025-06-08 12:38:46] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:38:46] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:38:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1132834858656237400.gal : 4 ms
[2025-06-08 12:38:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality18053335993191702789.ctl : 6 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/CTLCardinality1132834858656237400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18053335993191702789.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,97454,0.332853,14884,2,2845,5,36305,6,0,408,39088,0


Converting to forward existential form...Done !
original formula: AG(AF((((p210==1)||((p1001!=0)&&(p96!=1)))||((p781!=0)&&(p376!=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p210==1)||((p1001!=0)&&(p96!=1)))||((p781!=0)&&(p376!=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 126/14/10
(forward)formula 0,0,2.00017,55528,1,0,31,201076,20,3,2617,228796,29
FORMULA MedleyB-PT-B02-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 958 transition count 1202
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 958 transition count 1202
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 90 place count 936 transition count 1180
Iterating global reduction 0 with 22 rules applied. Total rules applied 112 place count 936 transition count 1180
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 129 place count 919 transition count 1163
Iterating global reduction 0 with 17 rules applied. Total rules applied 146 place count 919 transition count 1163
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 159 place count 906 transition count 1150
Iterating global reduction 0 with 13 rules applied. Total rules applied 172 place count 906 transition count 1150
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 183 place count 895 transition count 1139
Iterating global reduction 0 with 11 rules applied. Total rules applied 194 place count 895 transition count 1139
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 204 place count 885 transition count 1129
Iterating global reduction 0 with 10 rules applied. Total rules applied 214 place count 885 transition count 1129
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 224 place count 875 transition count 1119
Iterating global reduction 0 with 10 rules applied. Total rules applied 234 place count 875 transition count 1119
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 240 place count 869 transition count 1113
Iterating global reduction 0 with 6 rules applied. Total rules applied 246 place count 869 transition count 1113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 248 place count 869 transition count 1111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 252 place count 865 transition count 1107
Iterating global reduction 1 with 4 rules applied. Total rules applied 256 place count 865 transition count 1107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 259 place count 862 transition count 1104
Iterating global reduction 1 with 3 rules applied. Total rules applied 262 place count 862 transition count 1104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 265 place count 859 transition count 1101
Iterating global reduction 1 with 3 rules applied. Total rules applied 268 place count 859 transition count 1101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 271 place count 856 transition count 1098
Iterating global reduction 1 with 3 rules applied. Total rules applied 274 place count 856 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 276 place count 854 transition count 1096
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 854 transition count 1096
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 280 place count 852 transition count 1094
Iterating global reduction 1 with 2 rules applied. Total rules applied 282 place count 852 transition count 1094
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 284 place count 850 transition count 1092
Iterating global reduction 1 with 2 rules applied. Total rules applied 286 place count 850 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 288 place count 848 transition count 1090
Iterating global reduction 1 with 2 rules applied. Total rules applied 290 place count 848 transition count 1090
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 292 place count 846 transition count 1088
Iterating global reduction 1 with 2 rules applied. Total rules applied 294 place count 846 transition count 1088
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 296 place count 844 transition count 1086
Iterating global reduction 1 with 2 rules applied. Total rules applied 298 place count 844 transition count 1086
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 300 place count 842 transition count 1084
Iterating global reduction 1 with 2 rules applied. Total rules applied 302 place count 842 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 303 place count 842 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 304 place count 841 transition count 1082
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 841 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 306 place count 840 transition count 1081
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 840 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 839 transition count 1080
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 839 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 310 place count 839 transition count 1079
Applied a total of 310 rules in 624 ms. Remains 839 /992 variables (removed 153) and now considering 1079/1236 (removed 157) transitions.
// Phase 1: matrix 1079 rows 839 cols
[2025-06-08 12:38:49] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:49] [INFO ] Implicit Places using invariants in 447 ms returned []
[2025-06-08 12:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:50] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
Running 1078 sub problems to find dead transitions.
[2025-06-08 12:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/838 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1078 unsolved
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 1078 unsolved
Search for dead transitions found 0 dead transitions in 30274ms
Starting structural reductions in LTL mode, iteration 1 : 839/992 places, 1079/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32263 ms. Remains : 839/992 places, 1079/1236 transitions.
[2025-06-08 12:39:21] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:39:21] [INFO ] Flatten gal took : 25 ms
[2025-06-08 12:39:21] [INFO ] Input system was already deterministic with 1079 transitions.
[2025-06-08 12:39:21] [INFO ] Flatten gal took : 26 ms
[2025-06-08 12:39:21] [INFO ] Flatten gal took : 26 ms
[2025-06-08 12:39:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14331212524987031541.gal : 9 ms
[2025-06-08 12:39:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6749063186150140337.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/CTLCardinality14331212524987031541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6749063186150140337.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,1.08985e+10,25.591,536592,2,32633,5,1.73384e+06,6,0,4437,2.25847e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:39:51] [INFO ] Flatten gal took : 28 ms
[2025-06-08 12:39:51] [INFO ] Applying decomposition
[2025-06-08 12:39:51] [INFO ] Flatten gal took : 28 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/graph1284681754386855304.txt' '-o' '/tmp/graph1284681754386855304.bin' '-w' '/tmp/graph1284681754386855304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1284681754386855304.bin' '-l' '-1' '-v' '-w' '/tmp/graph1284681754386855304.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:39:51] [INFO ] Decomposing Gal with order
[2025-06-08 12:39:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:39:51] [INFO ] Removed a total of 864 redundant transitions.
[2025-06-08 12:39:51] [INFO ] Flatten gal took : 114 ms
[2025-06-08 12:39:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2025-06-08 12:39:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15047424878233575719.gal : 17 ms
[2025-06-08 12:39:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2407294384970934866.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/CTLCardinality15047424878233575719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2407294384970934866.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,1.08985e+10,6.01571,196016,2248,18,342132,1045,1304,1.0281e+06,53,3125,0


Converting to forward existential form...Done !
original formula: EF(((EF(((i23.u207.p697==0)||(i35.u331.p1160==1))) * (!(E((i31.i1.i0.u282.p965==0) U ((i29.u319.p1077==0)||(i28.u247.p875==1)))) + EX((i1...437
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (E(TRUE U ((i23.u207.p697==0)||(i35.u331.p1160==1))) * (!(E((i31.i1.i0.u282.p965==0) ...690
Reverse transition relation is NOT exact ! Due to transitions t24, t79, t171, t172, t228, t268, t351, t352, t406, t408, t442, t526, t582, t615, t716, t717,...604
(forward)formula 0,1,8.88127,196016,1,0,342132,1045,10310,1.0281e+06,250,3125,1311542
FORMULA MedleyB-PT-B02-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Graph (trivial) has 953 edges and 992 vertex of which 67 / 992 are part of one of the 12 SCC in 4 ms
Free SCC test removed 55 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 683 transitions
Trivial Post-agglo rules discarded 683 transitions
Performed 683 trivial Post agglomeration. Transition count delta: 683
Iterating post reduction 0 with 683 rules applied. Total rules applied 684 place count 936 transition count 491
Reduce places removed 683 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 693 rules applied. Total rules applied 1377 place count 253 transition count 481
Reduce places removed 4 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 16 rules applied. Total rules applied 1393 place count 249 transition count 469
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1405 place count 237 transition count 469
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1405 place count 237 transition count 428
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1487 place count 196 transition count 428
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1501 place count 182 transition count 414
Iterating global reduction 4 with 14 rules applied. Total rules applied 1515 place count 182 transition count 414
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1522 place count 175 transition count 407
Iterating global reduction 4 with 7 rules applied. Total rules applied 1529 place count 175 transition count 407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1530 place count 175 transition count 406
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1533 place count 172 transition count 403
Iterating global reduction 5 with 3 rules applied. Total rules applied 1536 place count 172 transition count 403
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1537 place count 171 transition count 402
Iterating global reduction 5 with 1 rules applied. Total rules applied 1538 place count 171 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1539 place count 171 transition count 401
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1589 place count 146 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1593 place count 146 transition count 372
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 1613 place count 126 transition count 235
Iterating global reduction 7 with 20 rules applied. Total rules applied 1633 place count 126 transition count 235
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1639 place count 126 transition count 229
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1649 place count 116 transition count 217
Iterating global reduction 8 with 10 rules applied. Total rules applied 1659 place count 116 transition count 217
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1669 place count 106 transition count 205
Iterating global reduction 8 with 10 rules applied. Total rules applied 1679 place count 106 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1683 place count 106 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1685 place count 105 transition count 200
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1686 place count 104 transition count 194
Iterating global reduction 9 with 1 rules applied. Total rules applied 1687 place count 104 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1688 place count 104 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 1694 place count 104 transition count 187
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 1706 place count 98 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1707 place count 97 transition count 180
Applied a total of 1707 rules in 73 ms. Remains 97 /992 variables (removed 895) and now considering 180/1236 (removed 1056) transitions.
[2025-06-08 12:40:00] [INFO ] Flow matrix only has 173 transitions (discarded 7 similar events)
// Phase 1: matrix 173 rows 97 cols
[2025-06-08 12:40:00] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:01] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-08 12:40:01] [INFO ] Flow matrix only has 173 transitions (discarded 7 similar events)
[2025-06-08 12:40:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:40:01] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:40:01] [INFO ] Redundant transitions in 7 ms returned []
Running 170 sub problems to find dead transitions.
[2025-06-08 12:40:01] [INFO ] Flow matrix only has 173 transitions (discarded 7 similar events)
[2025-06-08 12:40:01] [INFO ] Invariant cache hit.
[2025-06-08 12:40:01] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 4/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:02] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:02] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:02] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:02] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:02] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:03] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:03] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:03] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:03] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:03] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:03] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 172/269 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:05] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:05] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:06] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:06] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:06] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:06] [INFO ] Deduced a trap composed of 37 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-08 12:40:06] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:07] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 1/270 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (OVERLAPS) 0/270 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 133 constraints, problems are : Problem set: 0 solved, 170 unsolved in 15117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 4/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:17] [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-08 12:40:17] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:17] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 172/269 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 170/305 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:20] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 1/270 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:29] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:33] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:44] [INFO ] Deduced a trap composed of 38 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-08 12:40:44] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/270 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 311 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45166ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 45166ms
Starting structural reductions in SI_CTL mode, iteration 1 : 97/992 places, 180/1236 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45610 ms. Remains : 97/992 places, 180/1236 transitions.
[2025-06-08 12:40:46] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:40:46] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:40:46] [INFO ] Input system was already deterministic with 180 transitions.
[2025-06-08 12:40:46] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:40:46] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:40:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality18433958362182239374.gal : 2 ms
[2025-06-08 12:40:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality2558524930810515915.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/CTLCardinality18433958362182239374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2558524930810515915.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,267334,0.301913,15668,2,4003,5,40576,6,0,558,38196,0


Converting to forward existential form...Done !
original formula: E(!(AG(((AG(((p1068==0)||(p867==1))) + (p687==0)) + (p984==1)))) U (!(((p1034==0)||(p71==1))) + EG((((!((p896==0)||(p481==1)))||(!((p605=...274
=> equivalent forward existential formula: ([(FwdU(Init,!(!(E(TRUE U !(((!(E(TRUE U !(((p1068==0)||(p867==1))))) + (p687==0)) + (p984==1))))))) * !(((p1034...455
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t6, t18, t19, t20, t30, t33, t37, t38, t45, t48, t49, t50, t58, t75, t82, t83, t85, t...376
(forward)formula 0,1,10.7349,309792,1,0,463,1.67882e+06,382,240,4582,1.31364e+06,513
FORMULA MedleyB-PT-B02-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 958 transition count 1202
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 958 transition count 1202
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 93 place count 933 transition count 1177
Iterating global reduction 0 with 25 rules applied. Total rules applied 118 place count 933 transition count 1177
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 137 place count 914 transition count 1158
Iterating global reduction 0 with 19 rules applied. Total rules applied 156 place count 914 transition count 1158
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 171 place count 899 transition count 1143
Iterating global reduction 0 with 15 rules applied. Total rules applied 186 place count 899 transition count 1143
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 198 place count 887 transition count 1131
Iterating global reduction 0 with 12 rules applied. Total rules applied 210 place count 887 transition count 1131
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 220 place count 877 transition count 1121
Iterating global reduction 0 with 10 rules applied. Total rules applied 230 place count 877 transition count 1121
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 240 place count 867 transition count 1111
Iterating global reduction 0 with 10 rules applied. Total rules applied 250 place count 867 transition count 1111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 257 place count 860 transition count 1104
Iterating global reduction 0 with 7 rules applied. Total rules applied 264 place count 860 transition count 1104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 266 place count 860 transition count 1102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 271 place count 855 transition count 1097
Iterating global reduction 1 with 5 rules applied. Total rules applied 276 place count 855 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 277 place count 854 transition count 1096
Iterating global reduction 1 with 1 rules applied. Total rules applied 278 place count 854 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 279 place count 853 transition count 1095
Iterating global reduction 1 with 1 rules applied. Total rules applied 280 place count 853 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 281 place count 852 transition count 1094
Iterating global reduction 1 with 1 rules applied. Total rules applied 282 place count 852 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 283 place count 851 transition count 1093
Iterating global reduction 1 with 1 rules applied. Total rules applied 284 place count 851 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 285 place count 850 transition count 1092
Iterating global reduction 1 with 1 rules applied. Total rules applied 286 place count 850 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 287 place count 849 transition count 1091
Iterating global reduction 1 with 1 rules applied. Total rules applied 288 place count 849 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 289 place count 848 transition count 1090
Iterating global reduction 1 with 1 rules applied. Total rules applied 290 place count 848 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 847 transition count 1089
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 847 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 846 transition count 1088
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 846 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 295 place count 845 transition count 1087
Iterating global reduction 1 with 1 rules applied. Total rules applied 296 place count 845 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 297 place count 844 transition count 1086
Iterating global reduction 1 with 1 rules applied. Total rules applied 298 place count 844 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 299 place count 843 transition count 1085
Iterating global reduction 1 with 1 rules applied. Total rules applied 300 place count 843 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 301 place count 842 transition count 1084
Iterating global reduction 1 with 1 rules applied. Total rules applied 302 place count 842 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 303 place count 842 transition count 1083
Applied a total of 303 rules in 589 ms. Remains 842 /992 variables (removed 150) and now considering 1083/1236 (removed 153) transitions.
// Phase 1: matrix 1083 rows 842 cols
[2025-06-08 12:40:58] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:58] [INFO ] Implicit Places using invariants in 433 ms returned []
[2025-06-08 12:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:59] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
Running 1082 sub problems to find dead transitions.
[2025-06-08 12:40:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/841 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
SMT process timed out in 30225ms, After SMT, problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 30232ms
Starting structural reductions in LTL mode, iteration 1 : 842/992 places, 1083/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32172 ms. Remains : 842/992 places, 1083/1236 transitions.
[2025-06-08 12:41:29] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:41:29] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:41:29] [INFO ] Input system was already deterministic with 1083 transitions.
[2025-06-08 12:41:29] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:41:29] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:41:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7094438686787200969.gal : 5 ms
[2025-06-08 12:41:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality10537327138048225445.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/CTLCardinality7094438686787200969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10537327138048225445.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,1.12248e+10,24.0423,619332,2,34100,5,1.96287e+06,6,0,4453,2.68171e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:41:59] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:41:59] [INFO ] Applying decomposition
[2025-06-08 12:41:59] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15168059350828364874.txt' '-o' '/tmp/graph15168059350828364874.bin' '-w' '/tmp/graph15168059350828364874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15168059350828364874.bin' '-l' '-1' '-v' '-w' '/tmp/graph15168059350828364874.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:41:59] [INFO ] Decomposing Gal with order
[2025-06-08 12:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:42:00] [INFO ] Removed a total of 864 redundant transitions.
[2025-06-08 12:42:00] [INFO ] Flatten gal took : 51 ms
[2025-06-08 12:42:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 13 ms.
[2025-06-08 12:42:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13987337999916604661.gal : 10 ms
[2025-06-08 12:42:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality11357573254708310977.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/CTLCardinality13987337999916604661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11357573254708310977.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,1.12248e+10,7.31914,253340,2565,16,316668,1084,1263,1.92997e+06,44,3111,0


Converting to forward existential form...Done !
original formula: ((AG(AX(A((i15.u164.p535==0) U ((i6.u66.p217==0)||(i26.u251.p867==1))))) + !(E(EX(((i37.u336.p1173==0)||(i10.u150.p489==1))) U (EF(((i15....437
=> equivalent forward existential formula: ([(((Init * !((!(E(TRUE U !(!(EX(!(!((E(!(((i6.u66.p217==0)||(i26.u251.p867==1))) U (!((i15.u164.p535==0)) * !((...1182
Reverse transition relation is NOT exact ! Due to transitions t77, t108, t164, t220, t254, t282, t338, t428, t531, t587, t620, t637, t718, t794, t795, t798...652
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found 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 a local 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 : 992/992 places, 1236/1236 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 954 transition count 1198
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 954 transition count 1198
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 102 place count 928 transition count 1172
Iterating global reduction 0 with 26 rules applied. Total rules applied 128 place count 928 transition count 1172
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 148 place count 908 transition count 1152
Iterating global reduction 0 with 20 rules applied. Total rules applied 168 place count 908 transition count 1152
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 185 place count 891 transition count 1135
Iterating global reduction 0 with 17 rules applied. Total rules applied 202 place count 891 transition count 1135
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 217 place count 876 transition count 1120
Iterating global reduction 0 with 15 rules applied. Total rules applied 232 place count 876 transition count 1120
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 246 place count 862 transition count 1106
Iterating global reduction 0 with 14 rules applied. Total rules applied 260 place count 862 transition count 1106
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 274 place count 848 transition count 1092
Iterating global reduction 0 with 14 rules applied. Total rules applied 288 place count 848 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 289 place count 848 transition count 1091
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 298 place count 839 transition count 1082
Iterating global reduction 1 with 9 rules applied. Total rules applied 307 place count 839 transition count 1082
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 309 place count 839 transition count 1080
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 316 place count 832 transition count 1073
Iterating global reduction 2 with 7 rules applied. Total rules applied 323 place count 832 transition count 1073
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 326 place count 829 transition count 1070
Iterating global reduction 2 with 3 rules applied. Total rules applied 329 place count 829 transition count 1070
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 332 place count 826 transition count 1067
Iterating global reduction 2 with 3 rules applied. Total rules applied 335 place count 826 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 338 place count 823 transition count 1064
Iterating global reduction 2 with 3 rules applied. Total rules applied 341 place count 823 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 344 place count 820 transition count 1061
Iterating global reduction 2 with 3 rules applied. Total rules applied 347 place count 820 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 350 place count 817 transition count 1058
Iterating global reduction 2 with 3 rules applied. Total rules applied 353 place count 817 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 356 place count 814 transition count 1055
Iterating global reduction 2 with 3 rules applied. Total rules applied 359 place count 814 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 362 place count 811 transition count 1052
Iterating global reduction 2 with 3 rules applied. Total rules applied 365 place count 811 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 368 place count 808 transition count 1049
Iterating global reduction 2 with 3 rules applied. Total rules applied 371 place count 808 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 374 place count 805 transition count 1046
Iterating global reduction 2 with 3 rules applied. Total rules applied 377 place count 805 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 380 place count 802 transition count 1043
Iterating global reduction 2 with 3 rules applied. Total rules applied 383 place count 802 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 384 place count 802 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 386 place count 800 transition count 1040
Iterating global reduction 3 with 2 rules applied. Total rules applied 388 place count 800 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 390 place count 798 transition count 1038
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 798 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 394 place count 796 transition count 1036
Iterating global reduction 3 with 2 rules applied. Total rules applied 396 place count 796 transition count 1036
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 398 place count 796 transition count 1034
Applied a total of 398 rules in 600 ms. Remains 796 /992 variables (removed 196) and now considering 1034/1236 (removed 202) transitions.
// Phase 1: matrix 1034 rows 796 cols
[2025-06-08 12:42:30] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:42:31] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-06-08 12:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:42:31] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 1033 sub problems to find dead transitions.
[2025-06-08 12:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
SMT process timed out in 30252ms, After SMT, problems are : Problem set: 0 solved, 1033 unsolved
Search for dead transitions found 0 dead transitions in 30258ms
Starting structural reductions in LTL mode, iteration 1 : 796/992 places, 1034/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32082 ms. Remains : 796/992 places, 1034/1236 transitions.
[2025-06-08 12:43:02] [INFO ] Flatten gal took : 23 ms
[2025-06-08 12:43:02] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:43:02] [INFO ] Input system was already deterministic with 1034 transitions.
[2025-06-08 12:43:02] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:43:02] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:43:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality11705115365791789447.gal : 5 ms
[2025-06-08 12:43:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8334601395874646468.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/CTLCardinality11705115365791789447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8334601395874646468.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,9.63734e+09,26.2709,487084,2,31707,5,1.57887e+06,6,0,4220,2.11142e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:43:32] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:43:32] [INFO ] Applying decomposition
[2025-06-08 12:43:32] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9993160533336689219.txt' '-o' '/tmp/graph9993160533336689219.bin' '-w' '/tmp/graph9993160533336689219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9993160533336689219.bin' '-l' '-1' '-v' '-w' '/tmp/graph9993160533336689219.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:43:32] [INFO ] Decomposing Gal with order
[2025-06-08 12:43:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:43:32] [INFO ] Removed a total of 865 redundant transitions.
[2025-06-08 12:43:32] [INFO ] Flatten gal took : 44 ms
[2025-06-08 12:43:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2025-06-08 12:43:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality10760792630841820318.gal : 7 ms
[2025-06-08 12:43:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4540566065300038585.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/CTLCardinality10760792630841820318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4540566065300038585.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,9.63734e+09,6.2904,191584,2233,15,330240,999,1312,1.03255e+06,47,3139,0


Converting to forward existential form...Done !
original formula: AG(E(!(A((AF((i31.u280.p1009==1)) + AX((i12.u101.p352==0))) U (((i33.i0.i1.u294.p1046==0)||(i27.u233.p887==1))||(i10.u88.p318!=0)))) U (E...361
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!((E(!((((i33.i0.i1.u294.p1046==0)||(i27.u233.p887==1))||(i10.u88.p318!=0))) U (!((!(E...616
Reverse transition relation is NOT exact ! Due to transitions t76, t162, t215, t220, t253, t335, t391, t425, t512, t566, t568, t601, t683, t759, t760, t763...595
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 952 transition count 1196
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 952 transition count 1196
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 107 place count 925 transition count 1169
Iterating global reduction 0 with 27 rules applied. Total rules applied 134 place count 925 transition count 1169
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 155 place count 904 transition count 1148
Iterating global reduction 0 with 21 rules applied. Total rules applied 176 place count 904 transition count 1148
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 193 place count 887 transition count 1131
Iterating global reduction 0 with 17 rules applied. Total rules applied 210 place count 887 transition count 1131
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 225 place count 872 transition count 1116
Iterating global reduction 0 with 15 rules applied. Total rules applied 240 place count 872 transition count 1116
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 253 place count 859 transition count 1103
Iterating global reduction 0 with 13 rules applied. Total rules applied 266 place count 859 transition count 1103
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 279 place count 846 transition count 1090
Iterating global reduction 0 with 13 rules applied. Total rules applied 292 place count 846 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 293 place count 846 transition count 1089
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 302 place count 837 transition count 1080
Iterating global reduction 1 with 9 rules applied. Total rules applied 311 place count 837 transition count 1080
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 314 place count 837 transition count 1077
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 831 transition count 1071
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 831 transition count 1071
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 328 place count 829 transition count 1069
Iterating global reduction 2 with 2 rules applied. Total rules applied 330 place count 829 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 332 place count 827 transition count 1067
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 827 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 825 transition count 1065
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 825 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 340 place count 823 transition count 1063
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 823 transition count 1063
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 344 place count 821 transition count 1061
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 821 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 348 place count 819 transition count 1059
Iterating global reduction 2 with 2 rules applied. Total rules applied 350 place count 819 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 352 place count 817 transition count 1057
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 817 transition count 1057
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 356 place count 815 transition count 1055
Iterating global reduction 2 with 2 rules applied. Total rules applied 358 place count 815 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 360 place count 813 transition count 1053
Iterating global reduction 2 with 2 rules applied. Total rules applied 362 place count 813 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 364 place count 811 transition count 1051
Iterating global reduction 2 with 2 rules applied. Total rules applied 366 place count 811 transition count 1051
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 811 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 368 place count 810 transition count 1049
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 810 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 370 place count 809 transition count 1048
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 809 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 372 place count 808 transition count 1047
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 808 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 374 place count 808 transition count 1046
Applied a total of 374 rules in 573 ms. Remains 808 /992 variables (removed 184) and now considering 1046/1236 (removed 190) transitions.
// Phase 1: matrix 1046 rows 808 cols
[2025-06-08 12:44:03] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:03] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-06-08 12:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:04] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 1045 sub problems to find dead transitions.
[2025-06-08 12:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/807 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
SMT process timed out in 30224ms, After SMT, problems are : Problem set: 0 solved, 1045 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in LTL mode, iteration 1 : 808/992 places, 1046/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32132 ms. Remains : 808/992 places, 1046/1236 transitions.
[2025-06-08 12:44:34] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:44:34] [INFO ] Flatten gal took : 28 ms
[2025-06-08 12:44:34] [INFO ] Input system was already deterministic with 1046 transitions.
[2025-06-08 12:44:35] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:44:35] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:44:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality11165367801315873140.gal : 5 ms
[2025-06-08 12:44:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14789373613847061015.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/CTLCardinality11165367801315873140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14789373613847061015.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,1.0058e+10,27.0039,541124,2,31784,5,1.6926e+06,6,0,4280,2.34379e+06,0


Converting to forward existential form...Done !
original formula: EF(EX(EF((p217==1))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p217==1))] != FALSE
(forward)formula 0,1,29.9095,541124,1,0,8,1.6926e+06,9,1,9033,2.34379e+06,4
FORMULA MedleyB-PT-B02-CTLCardinality-2025-06 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 : 992/992 places, 1236/1236 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 951 transition count 1195
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 951 transition count 1195
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 110 place count 923 transition count 1167
Iterating global reduction 0 with 28 rules applied. Total rules applied 138 place count 923 transition count 1167
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 160 place count 901 transition count 1145
Iterating global reduction 0 with 22 rules applied. Total rules applied 182 place count 901 transition count 1145
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 200 place count 883 transition count 1127
Iterating global reduction 0 with 18 rules applied. Total rules applied 218 place count 883 transition count 1127
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 233 place count 868 transition count 1112
Iterating global reduction 0 with 15 rules applied. Total rules applied 248 place count 868 transition count 1112
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 261 place count 855 transition count 1099
Iterating global reduction 0 with 13 rules applied. Total rules applied 274 place count 855 transition count 1099
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 287 place count 842 transition count 1086
Iterating global reduction 0 with 13 rules applied. Total rules applied 300 place count 842 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 301 place count 842 transition count 1085
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 310 place count 833 transition count 1076
Iterating global reduction 1 with 9 rules applied. Total rules applied 319 place count 833 transition count 1076
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 321 place count 833 transition count 1074
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 328 place count 826 transition count 1067
Iterating global reduction 2 with 7 rules applied. Total rules applied 335 place count 826 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 338 place count 823 transition count 1064
Iterating global reduction 2 with 3 rules applied. Total rules applied 341 place count 823 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 344 place count 820 transition count 1061
Iterating global reduction 2 with 3 rules applied. Total rules applied 347 place count 820 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 350 place count 817 transition count 1058
Iterating global reduction 2 with 3 rules applied. Total rules applied 353 place count 817 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 356 place count 814 transition count 1055
Iterating global reduction 2 with 3 rules applied. Total rules applied 359 place count 814 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 362 place count 811 transition count 1052
Iterating global reduction 2 with 3 rules applied. Total rules applied 365 place count 811 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 368 place count 808 transition count 1049
Iterating global reduction 2 with 3 rules applied. Total rules applied 371 place count 808 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 374 place count 805 transition count 1046
Iterating global reduction 2 with 3 rules applied. Total rules applied 377 place count 805 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 380 place count 802 transition count 1043
Iterating global reduction 2 with 3 rules applied. Total rules applied 383 place count 802 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 386 place count 799 transition count 1040
Iterating global reduction 2 with 3 rules applied. Total rules applied 389 place count 799 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 392 place count 796 transition count 1037
Iterating global reduction 2 with 3 rules applied. Total rules applied 395 place count 796 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 796 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 398 place count 794 transition count 1034
Iterating global reduction 3 with 2 rules applied. Total rules applied 400 place count 794 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 402 place count 792 transition count 1032
Iterating global reduction 3 with 2 rules applied. Total rules applied 404 place count 792 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 406 place count 790 transition count 1030
Iterating global reduction 3 with 2 rules applied. Total rules applied 408 place count 790 transition count 1030
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 410 place count 790 transition count 1028
Applied a total of 410 rules in 579 ms. Remains 790 /992 variables (removed 202) and now considering 1028/1236 (removed 208) transitions.
// Phase 1: matrix 1028 rows 790 cols
[2025-06-08 12:45:05] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:45:06] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-08 12:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:45:06] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
Running 1027 sub problems to find dead transitions.
[2025-06-08 12:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
SMT process timed out in 30235ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 30243ms
Starting structural reductions in LTL mode, iteration 1 : 790/992 places, 1028/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32015 ms. Remains : 790/992 places, 1028/1236 transitions.
[2025-06-08 12:45:37] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:45:37] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:45:37] [INFO ] Input system was already deterministic with 1028 transitions.
[2025-06-08 12:45:37] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:45:37] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:45:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality6160914683832896414.gal : 3 ms
[2025-06-08 12:45:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality6494749087159862013.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/CTLCardinality6160914683832896414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6494749087159862013.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.
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,9.51699e+09,21.5821,451120,2,24990,5,1.35869e+06,6,0,4190,1.96901e+06,0


Converting to forward existential form...Done !
original formula: E((p977==1) U E(AG(((AX((p847==0)) + AF((p470==1))) + AG(((p599==0)||(p997==1))))) U (p31==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(p977==1)),!(E(TRUE U !(((!(EX(!((p847==0)))) + !(EG(!((p470==1))))) + !(E(TRUE U !(((p599==0)|...196
Hit Full ! (commute/partial/dont) 1026/0/2
Detected timeout of ITS tools.
[2025-06-08 12:46:07] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:46:07] [INFO ] Applying decomposition
[2025-06-08 12:46:07] [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/graph7612346598421685820.txt' '-o' '/tmp/graph7612346598421685820.bin' '-w' '/tmp/graph7612346598421685820.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7612346598421685820.bin' '-l' '-1' '-v' '-w' '/tmp/graph7612346598421685820.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:46:07] [INFO ] Decomposing Gal with order
[2025-06-08 12:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:46:07] [INFO ] Removed a total of 859 redundant transitions.
[2025-06-08 12:46:07] [INFO ] Flatten gal took : 79 ms
[2025-06-08 12:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-06-08 12:46:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality18306471942489193012.gal : 23 ms
[2025-06-08 12:46:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality1963256423706146294.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/CTLCardinality18306471942489193012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1963256423706146294.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,9.51699e+09,5.463,195836,2197,14,329311,983,1309,1.09983e+06,47,2966,0


Converting to forward existential form...Done !
original formula: E((i0.u268.p977==1) U E(AG(((AX((i23.u214.p847==0)) + AF((i14.u138.p470==1))) + AG(((i17.u152.p599==0)||(i0.u273.p997==1))))) U (i2.u11.p...163
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(i0.u268.p977==1)),!(E(TRUE U !(((!(EX(!((i23.u214.p847==0)))) + !(EG(!((i14.u138.p470==1))))) ...246
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t333, t334, t390, t424, t505, t506, t562, t595, t733, t753, t754, t757...603
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 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 a local 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 SI_CTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Graph (trivial) has 983 edges and 992 vertex of which 70 / 992 are part of one of the 12 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 717 transitions
Trivial Post-agglo rules discarded 717 transitions
Performed 717 trivial Post agglomeration. Transition count delta: 717
Iterating post reduction 0 with 717 rules applied. Total rules applied 718 place count 933 transition count 452
Reduce places removed 717 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 727 rules applied. Total rules applied 1445 place count 216 transition count 442
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1449 place count 212 transition count 442
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 1449 place count 212 transition count 399
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 1535 place count 169 transition count 399
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1551 place count 153 transition count 383
Iterating global reduction 3 with 16 rules applied. Total rules applied 1567 place count 153 transition count 383
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1575 place count 145 transition count 349
Iterating global reduction 3 with 8 rules applied. Total rules applied 1583 place count 145 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1585 place count 145 transition count 347
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1588 place count 142 transition count 344
Iterating global reduction 4 with 3 rules applied. Total rules applied 1591 place count 142 transition count 344
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1594 place count 139 transition count 341
Iterating global reduction 4 with 3 rules applied. Total rules applied 1597 place count 139 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1599 place count 139 transition count 339
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1649 place count 114 transition count 314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1654 place count 114 transition count 309
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1676 place count 92 transition count 187
Iterating global reduction 6 with 22 rules applied. Total rules applied 1698 place count 92 transition count 187
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1708 place count 92 transition count 177
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1720 place count 80 transition count 161
Iterating global reduction 7 with 12 rules applied. Total rules applied 1732 place count 80 transition count 161
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1744 place count 68 transition count 145
Iterating global reduction 7 with 12 rules applied. Total rules applied 1756 place count 68 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1761 place count 68 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1763 place count 67 transition count 139
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1764 place count 66 transition count 135
Iterating global reduction 8 with 1 rules applied. Total rules applied 1765 place count 66 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1766 place count 66 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1770 place count 66 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1778 place count 62 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1779 place count 61 transition count 125
Applied a total of 1779 rules in 45 ms. Remains 61 /992 variables (removed 931) and now considering 125/1236 (removed 1111) transitions.
[2025-06-08 12:46:37] [INFO ] Flow matrix only has 120 transitions (discarded 5 similar events)
// Phase 1: matrix 120 rows 61 cols
[2025-06-08 12:46:37] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:37] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-08 12:46:37] [INFO ] Flow matrix only has 120 transitions (discarded 5 similar events)
[2025-06-08 12:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:46:38] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:46:38] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-08 12:46:38] [INFO ] Flow matrix only has 120 transitions (discarded 5 similar events)
[2025-06-08 12:46:38] [INFO ] Invariant cache hit.
[2025-06-08 12:46:38] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:38] [INFO ] Deduced a trap composed of 15 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-08 12:46:38] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:38] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:38] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:38] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 21 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-08 12:46:39] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:46:39] [INFO ] Deduced a trap composed of 24 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-08 12:46:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 119/180 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/181 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 94 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 119/180 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 116/209 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/181 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 210 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7992 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13685ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 13685ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/992 places, 125/1236 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14034 ms. Remains : 61/992 places, 125/1236 transitions.
[2025-06-08 12:46:51] [INFO ] Flatten gal took : 6 ms
[2025-06-08 12:46:51] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:46:51] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-08 12:46:51] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:46:51] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:46:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16041663362483786714.gal : 0 ms
[2025-06-08 12:46:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16855062486561248473.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16041663362483786714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16855062486561248473.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (4280 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (570 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16855062486561248473.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 940
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :940 after 1300
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1300 after 9278
Finished probabilistic random walk after 15165 steps, run visited all 1 properties in 83 ms. (steps per millisecond=182 )
Probabilistic random walk after 15165 steps, saw 4658 distinct states, run finished after 101 ms. (steps per millisecond=150 ) properties seen :1
FORMULA MedleyB-PT-B02-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 952 transition count 1196
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 952 transition count 1196
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 108 place count 924 transition count 1168
Iterating global reduction 0 with 28 rules applied. Total rules applied 136 place count 924 transition count 1168
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 158 place count 902 transition count 1146
Iterating global reduction 0 with 22 rules applied. Total rules applied 180 place count 902 transition count 1146
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 198 place count 884 transition count 1128
Iterating global reduction 0 with 18 rules applied. Total rules applied 216 place count 884 transition count 1128
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 232 place count 868 transition count 1112
Iterating global reduction 0 with 16 rules applied. Total rules applied 248 place count 868 transition count 1112
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 262 place count 854 transition count 1098
Iterating global reduction 0 with 14 rules applied. Total rules applied 276 place count 854 transition count 1098
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 289 place count 841 transition count 1085
Iterating global reduction 0 with 13 rules applied. Total rules applied 302 place count 841 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 303 place count 841 transition count 1084
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 312 place count 832 transition count 1075
Iterating global reduction 1 with 9 rules applied. Total rules applied 321 place count 832 transition count 1075
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 323 place count 832 transition count 1073
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 825 transition count 1066
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 825 transition count 1066
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 340 place count 822 transition count 1063
Iterating global reduction 2 with 3 rules applied. Total rules applied 343 place count 822 transition count 1063
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 346 place count 819 transition count 1060
Iterating global reduction 2 with 3 rules applied. Total rules applied 349 place count 819 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 352 place count 816 transition count 1057
Iterating global reduction 2 with 3 rules applied. Total rules applied 355 place count 816 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 358 place count 813 transition count 1054
Iterating global reduction 2 with 3 rules applied. Total rules applied 361 place count 813 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 364 place count 810 transition count 1051
Iterating global reduction 2 with 3 rules applied. Total rules applied 367 place count 810 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 370 place count 807 transition count 1048
Iterating global reduction 2 with 3 rules applied. Total rules applied 373 place count 807 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 376 place count 804 transition count 1045
Iterating global reduction 2 with 3 rules applied. Total rules applied 379 place count 804 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 382 place count 801 transition count 1042
Iterating global reduction 2 with 3 rules applied. Total rules applied 385 place count 801 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 388 place count 798 transition count 1039
Iterating global reduction 2 with 3 rules applied. Total rules applied 391 place count 798 transition count 1039
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 394 place count 795 transition count 1036
Iterating global reduction 2 with 3 rules applied. Total rules applied 397 place count 795 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 795 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 400 place count 793 transition count 1033
Iterating global reduction 3 with 2 rules applied. Total rules applied 402 place count 793 transition count 1033
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 404 place count 791 transition count 1031
Iterating global reduction 3 with 2 rules applied. Total rules applied 406 place count 791 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 407 place count 790 transition count 1030
Iterating global reduction 3 with 1 rules applied. Total rules applied 408 place count 790 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 409 place count 790 transition count 1029
Applied a total of 409 rules in 582 ms. Remains 790 /992 variables (removed 202) and now considering 1029/1236 (removed 207) transitions.
// Phase 1: matrix 1029 rows 790 cols
[2025-06-08 12:46:52] [INFO ] Computed 5 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:52] [INFO ] Implicit Places using invariants in 389 ms returned []
[2025-06-08 12:46:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:46:53] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Running 1028 sub problems to find dead transitions.
[2025-06-08 12:46:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
SMT process timed out in 30235ms, After SMT, problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 30236ms
Starting structural reductions in LTL mode, iteration 1 : 790/992 places, 1029/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31987 ms. Remains : 790/992 places, 1029/1236 transitions.
[2025-06-08 12:47:24] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:47:24] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:47:24] [INFO ] Input system was already deterministic with 1029 transitions.
[2025-06-08 12:47:24] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:47:24] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:47:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13371082754957913740.gal : 4 ms
[2025-06-08 12:47:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12860626972576821338.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/CTLCardinality13371082754957913740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12860626972576821338.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,9.51699e+09,19.1842,459804,2,26946,5,1.39693e+06,6,0,4191,1.98866e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:47:54] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:47:54] [INFO ] Applying decomposition
[2025-06-08 12:47:54] [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/graph10787178308353992187.txt' '-o' '/tmp/graph10787178308353992187.bin' '-w' '/tmp/graph10787178308353992187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10787178308353992187.bin' '-l' '-1' '-v' '-w' '/tmp/graph10787178308353992187.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:47:54] [INFO ] Decomposing Gal with order
[2025-06-08 12:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:47:54] [INFO ] Removed a total of 856 redundant transitions.
[2025-06-08 12:47:54] [INFO ] Flatten gal took : 81 ms
[2025-06-08 12:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-06-08 12:47:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7776286781611821555.gal : 23 ms
[2025-06-08 12:47:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality5928009980559185954.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/CTLCardinality7776286781611821555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5928009980559185954.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,9.51699e+09,7.81472,272320,2257,15,490031,1033,1252,1.37472e+06,49,3108,0


Converting to forward existential form...Done !
original formula: A(((i5.u64.p238==0)||(i5.u52.p144==1)) U EG(!(AX(!(EF(((i34.u310.p1169==0)||(i5.u65.p247==1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(!(EX(!(!(E(TRUE U ((i34.u310.p1169==0)||(i5.u65.p247==1))))))))))))) * !(E(!(EG(!(!(EX(!(!...344
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t386, t420, t502, t558, t591, t678, t679, t735, t755, t756, t759, t762...603
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 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 a local 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
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 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 a local 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 SI_CTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Graph (trivial) has 981 edges and 992 vertex of which 70 / 992 are part of one of the 12 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 714 transitions
Trivial Post-agglo rules discarded 714 transitions
Performed 714 trivial Post agglomeration. Transition count delta: 714
Iterating post reduction 0 with 714 rules applied. Total rules applied 715 place count 933 transition count 455
Reduce places removed 714 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 724 rules applied. Total rules applied 1439 place count 219 transition count 445
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1444 place count 215 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1445 place count 214 transition count 444
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 1445 place count 214 transition count 401
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1531 place count 171 transition count 401
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1547 place count 155 transition count 385
Iterating global reduction 4 with 16 rules applied. Total rules applied 1563 place count 155 transition count 385
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1571 place count 147 transition count 351
Iterating global reduction 4 with 8 rules applied. Total rules applied 1579 place count 147 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1581 place count 147 transition count 349
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1584 place count 144 transition count 346
Iterating global reduction 5 with 3 rules applied. Total rules applied 1587 place count 144 transition count 346
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1590 place count 141 transition count 343
Iterating global reduction 5 with 3 rules applied. Total rules applied 1593 place count 141 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1595 place count 141 transition count 341
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1645 place count 116 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1650 place count 116 transition count 311
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1672 place count 94 transition count 189
Iterating global reduction 7 with 22 rules applied. Total rules applied 1694 place count 94 transition count 189
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1704 place count 94 transition count 179
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1715 place count 83 transition count 165
Iterating global reduction 8 with 11 rules applied. Total rules applied 1726 place count 83 transition count 165
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1737 place count 72 transition count 151
Iterating global reduction 8 with 11 rules applied. Total rules applied 1748 place count 72 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1753 place count 72 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1755 place count 71 transition count 145
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1756 place count 70 transition count 140
Iterating global reduction 9 with 1 rules applied. Total rules applied 1757 place count 70 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1758 place count 70 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1762 place count 70 transition count 135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1770 place count 66 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1771 place count 65 transition count 130
Applied a total of 1771 rules in 40 ms. Remains 65 /992 variables (removed 927) and now considering 130/1236 (removed 1106) transitions.
[2025-06-08 12:48:24] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
// Phase 1: matrix 125 rows 65 cols
[2025-06-08 12:48:24] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:24] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-08 12:48:24] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2025-06-08 12:48:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:48:24] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:48:24] [INFO ] Redundant transitions in 1 ms returned []
Running 121 sub problems to find dead transitions.
[2025-06-08 12:48:24] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2025-06-08 12:48:24] [INFO ] Invariant cache hit.
[2025-06-08 12:48:24] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:25] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:25] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:25] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:25] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:25] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:26] [INFO ] Deduced a trap composed of 21 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-08 12:48:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 124/189 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 1/190 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/190 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 91 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:33] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 124/189 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 121/213 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:48:35] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 1/190 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 215 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9906 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18107ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 18107ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/992 places, 130/1236 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18439 ms. Remains : 65/992 places, 130/1236 transitions.
[2025-06-08 12:48:43] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:48:43] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:48:43] [INFO ] Input system was already deterministic with 130 transitions.
[2025-06-08 12:48:43] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:48:43] [INFO ] Flatten gal took : 5 ms
[2025-06-08 12:48:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9249231655743476167.gal : 1 ms
[2025-06-08 12:48:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14269423281294286581.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/CTLCardinality9249231655743476167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14269423281294286581.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,64958,0.231071,11904,2,2681,5,26819,6,0,382,27356,0


Converting to forward existential form...Done !
original formula: AF(((p19==0)&&(p1148==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p19==0)&&(p1148==1))))] = FALSE
Hit Full ! (commute/partial/dont) 126/0/4
(forward)formula 0,0,1.01749,37524,1,0,26,139293,20,4,2489,122721,25
FORMULA MedleyB-PT-B02-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 951 transition count 1195
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 951 transition count 1195
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 110 place count 923 transition count 1167
Iterating global reduction 0 with 28 rules applied. Total rules applied 138 place count 923 transition count 1167
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 160 place count 901 transition count 1145
Iterating global reduction 0 with 22 rules applied. Total rules applied 182 place count 901 transition count 1145
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 200 place count 883 transition count 1127
Iterating global reduction 0 with 18 rules applied. Total rules applied 218 place count 883 transition count 1127
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 234 place count 867 transition count 1111
Iterating global reduction 0 with 16 rules applied. Total rules applied 250 place count 867 transition count 1111
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 264 place count 853 transition count 1097
Iterating global reduction 0 with 14 rules applied. Total rules applied 278 place count 853 transition count 1097
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 292 place count 839 transition count 1083
Iterating global reduction 0 with 14 rules applied. Total rules applied 306 place count 839 transition count 1083
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 307 place count 839 transition count 1082
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 317 place count 829 transition count 1072
Iterating global reduction 1 with 10 rules applied. Total rules applied 327 place count 829 transition count 1072
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 330 place count 829 transition count 1069
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 337 place count 822 transition count 1062
Iterating global reduction 2 with 7 rules applied. Total rules applied 344 place count 822 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 347 place count 819 transition count 1059
Iterating global reduction 2 with 3 rules applied. Total rules applied 350 place count 819 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 353 place count 816 transition count 1056
Iterating global reduction 2 with 3 rules applied. Total rules applied 356 place count 816 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 359 place count 813 transition count 1053
Iterating global reduction 2 with 3 rules applied. Total rules applied 362 place count 813 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 365 place count 810 transition count 1050
Iterating global reduction 2 with 3 rules applied. Total rules applied 368 place count 810 transition count 1050
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 371 place count 807 transition count 1047
Iterating global reduction 2 with 3 rules applied. Total rules applied 374 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 377 place count 804 transition count 1044
Iterating global reduction 2 with 3 rules applied. Total rules applied 380 place count 804 transition count 1044
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 383 place count 801 transition count 1041
Iterating global reduction 2 with 3 rules applied. Total rules applied 386 place count 801 transition count 1041
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 389 place count 798 transition count 1038
Iterating global reduction 2 with 3 rules applied. Total rules applied 392 place count 798 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 395 place count 795 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 398 place count 795 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 401 place count 792 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 404 place count 792 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 405 place count 792 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 407 place count 790 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 409 place count 790 transition count 1029
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 411 place count 788 transition count 1027
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 788 transition count 1027
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 415 place count 786 transition count 1025
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 786 transition count 1025
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 419 place count 786 transition count 1023
Applied a total of 419 rules in 552 ms. Remains 786 /992 variables (removed 206) and now considering 1023/1236 (removed 213) transitions.
// Phase 1: matrix 1023 rows 786 cols
[2025-06-08 12:48:44] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:45] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-06-08 12:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:45] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2025-06-08 12:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30209ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30210ms
Starting structural reductions in LTL mode, iteration 1 : 786/992 places, 1023/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32104 ms. Remains : 786/992 places, 1023/1236 transitions.
[2025-06-08 12:49:16] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:49:16] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:49:16] [INFO ] Input system was already deterministic with 1023 transitions.
[2025-06-08 12:49:16] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:49:16] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:49:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality11533704069258552731.gal : 3 ms
[2025-06-08 12:49:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality9477630228476142083.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/CTLCardinality11533704069258552731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9477630228476142083.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,9.39677e+09,19.2948,462828,2,26952,5,1.40378e+06,6,0,4169,1.9933e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:49:46] [INFO ] Flatten gal took : 20 ms
[2025-06-08 12:49:46] [INFO ] Applying decomposition
[2025-06-08 12:49:46] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2857452067000081766.txt' '-o' '/tmp/graph2857452067000081766.bin' '-w' '/tmp/graph2857452067000081766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2857452067000081766.bin' '-l' '-1' '-v' '-w' '/tmp/graph2857452067000081766.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:49:46] [INFO ] Decomposing Gal with order
[2025-06-08 12:49:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:49:46] [INFO ] Removed a total of 853 redundant transitions.
[2025-06-08 12:49:46] [INFO ] Flatten gal took : 37 ms
[2025-06-08 12:49:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2025-06-08 12:49:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11137846202355144927.gal : 6 ms
[2025-06-08 12:49:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6290274879178003219.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/CTLCardinality11137846202355144927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6290274879178003219.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,9.39677e+09,3.6385,137680,2032,17,249803,885,1225,671133,50,2703,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t248, t330, t420, t502, t558, t591, t618, t673, t729, t749, t750, t753, t756, t759...592
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 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 SI_CTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Graph (trivial) has 975 edges and 992 vertex of which 68 / 992 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 709 transitions
Trivial Post-agglo rules discarded 709 transitions
Performed 709 trivial Post agglomeration. Transition count delta: 709
Iterating post reduction 0 with 709 rules applied. Total rules applied 710 place count 935 transition count 463
Reduce places removed 709 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 719 rules applied. Total rules applied 1429 place count 226 transition count 453
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1435 place count 222 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1437 place count 220 transition count 451
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1437 place count 220 transition count 407
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1525 place count 176 transition count 407
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1540 place count 161 transition count 392
Iterating global reduction 4 with 15 rules applied. Total rules applied 1555 place count 161 transition count 392
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1562 place count 154 transition count 359
Iterating global reduction 4 with 7 rules applied. Total rules applied 1569 place count 154 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1571 place count 154 transition count 357
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1573 place count 152 transition count 355
Iterating global reduction 5 with 2 rules applied. Total rules applied 1575 place count 152 transition count 355
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1577 place count 150 transition count 353
Iterating global reduction 5 with 2 rules applied. Total rules applied 1579 place count 150 transition count 353
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1629 place count 125 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1635 place count 125 transition count 322
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1656 place count 104 transition count 202
Iterating global reduction 6 with 21 rules applied. Total rules applied 1677 place count 104 transition count 202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1686 place count 104 transition count 193
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1696 place count 94 transition count 180
Iterating global reduction 7 with 10 rules applied. Total rules applied 1706 place count 94 transition count 180
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1716 place count 84 transition count 167
Iterating global reduction 7 with 10 rules applied. Total rules applied 1726 place count 84 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1730 place count 84 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1732 place count 83 transition count 162
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1733 place count 82 transition count 157
Iterating global reduction 8 with 1 rules applied. Total rules applied 1734 place count 82 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1735 place count 82 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1740 place count 82 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1750 place count 77 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1751 place count 76 transition count 145
Applied a total of 1751 rules in 54 ms. Remains 76 /992 variables (removed 916) and now considering 145/1236 (removed 1091) transitions.
[2025-06-08 12:50:16] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
// Phase 1: matrix 139 rows 76 cols
[2025-06-08 12:50:16] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:16] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-08 12:50:16] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-08 12:50:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:50:17] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:50:17] [INFO ] Redundant transitions in 1 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-08 12:50:17] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-08 12:50:17] [INFO ] Invariant cache hit.
[2025-06-08 12:50:17] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:17] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [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-08 12:50:18] [INFO ] Deduced a trap composed of 25 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-08 12:50:18] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:18] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:19] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 138/214 variables, 76/93 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/215 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 108 constraints, problems are : Problem set: 0 solved, 133 unsolved in 8119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:25] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:25] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 138/214 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 133/242 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:50:27] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 1/215 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 244 constraints, problems are : Problem set: 0 solved, 133 unsolved in 14655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22813ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 22814ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/992 places, 145/1236 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23233 ms. Remains : 76/992 places, 145/1236 transitions.
[2025-06-08 12:50:39] [INFO ] Flatten gal took : 6 ms
[2025-06-08 12:50:39] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:50:39] [INFO ] Input system was already deterministic with 145 transitions.
[2025-06-08 12:50:39] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:50:39] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:50:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality4214100779632497750.gal : 1 ms
[2025-06-08 12:50:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality1724674629770047724.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/CTLCardinality4214100779632497750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1724674629770047724.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.
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,101370,0.201017,13116,2,2900,5,30096,6,0,440,31505,0


Converting to forward existential form...Done !
original formula: A(((p875==0)||(p80==1)) U A((p570!=1) U EG(((p728==0)||(p283==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EG(((p728==0)||(p283==1)))) U (!((p570!=1)) * !(EG(((p728==0)||(p283==1)))))) + EG(!(EG(...488
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t12, t13, t14, t23, t24, t25, t30, t33, t34, t35, t42, t45, t54, t58, t59, t63, t...346
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.55223,269252,1,0,679,1.6191e+06,318,335,3793,1.17968e+06,728
FORMULA MedleyB-PT-B02-CTLCardinality-2025-13 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 : 992/992 places, 1236/1236 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 954 transition count 1198
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 954 transition count 1198
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 101 place count 929 transition count 1173
Iterating global reduction 0 with 25 rules applied. Total rules applied 126 place count 929 transition count 1173
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 146 place count 909 transition count 1153
Iterating global reduction 0 with 20 rules applied. Total rules applied 166 place count 909 transition count 1153
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 182 place count 893 transition count 1137
Iterating global reduction 0 with 16 rules applied. Total rules applied 198 place count 893 transition count 1137
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 212 place count 879 transition count 1123
Iterating global reduction 0 with 14 rules applied. Total rules applied 226 place count 879 transition count 1123
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 238 place count 867 transition count 1111
Iterating global reduction 0 with 12 rules applied. Total rules applied 250 place count 867 transition count 1111
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 262 place count 855 transition count 1099
Iterating global reduction 0 with 12 rules applied. Total rules applied 274 place count 855 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 275 place count 855 transition count 1098
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 283 place count 847 transition count 1090
Iterating global reduction 1 with 8 rules applied. Total rules applied 291 place count 847 transition count 1090
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 294 place count 847 transition count 1087
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 299 place count 842 transition count 1082
Iterating global reduction 2 with 5 rules applied. Total rules applied 304 place count 842 transition count 1082
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 306 place count 840 transition count 1080
Iterating global reduction 2 with 2 rules applied. Total rules applied 308 place count 840 transition count 1080
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 310 place count 838 transition count 1078
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 838 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 313 place count 837 transition count 1077
Iterating global reduction 2 with 1 rules applied. Total rules applied 314 place count 837 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 315 place count 836 transition count 1076
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 836 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 317 place count 835 transition count 1075
Iterating global reduction 2 with 1 rules applied. Total rules applied 318 place count 835 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 319 place count 834 transition count 1074
Iterating global reduction 2 with 1 rules applied. Total rules applied 320 place count 834 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 321 place count 833 transition count 1073
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 833 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 323 place count 832 transition count 1072
Iterating global reduction 2 with 1 rules applied. Total rules applied 324 place count 832 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 831 transition count 1071
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 831 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 830 transition count 1070
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 830 transition count 1070
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 329 place count 830 transition count 1069
Applied a total of 329 rules in 511 ms. Remains 830 /992 variables (removed 162) and now considering 1069/1236 (removed 167) transitions.
// Phase 1: matrix 1069 rows 830 cols
[2025-06-08 12:50:49] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:49] [INFO ] Implicit Places using invariants in 543 ms returned []
[2025-06-08 12:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:50] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
Running 1068 sub problems to find dead transitions.
[2025-06-08 12:50:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/829 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
SMT process timed out in 30229ms, After SMT, problems are : Problem set: 0 solved, 1068 unsolved
Search for dead transitions found 0 dead transitions in 30230ms
Starting structural reductions in LTL mode, iteration 1 : 830/992 places, 1069/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32232 ms. Remains : 830/992 places, 1069/1236 transitions.
[2025-06-08 12:51:20] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:51:20] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:51:20] [INFO ] Input system was already deterministic with 1069 transitions.
[2025-06-08 12:51:20] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:51:20] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:51:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality13816179572242533943.gal : 4 ms
[2025-06-08 12:51:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality13409661257682982556.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/CTLCardinality13816179572242533943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13409661257682982556.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,1.06372e+10,24.2153,509608,2,31732,5,1.63825e+06,6,0,4391,2.16096e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:51:51] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:51:51] [INFO ] Applying decomposition
[2025-06-08 12:51:51] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3726843341073540376.txt' '-o' '/tmp/graph3726843341073540376.bin' '-w' '/tmp/graph3726843341073540376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3726843341073540376.bin' '-l' '-1' '-v' '-w' '/tmp/graph3726843341073540376.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:51:51] [INFO ] Decomposing Gal with order
[2025-06-08 12:51:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:51:51] [INFO ] Removed a total of 861 redundant transitions.
[2025-06-08 12:51:51] [INFO ] Flatten gal took : 41 ms
[2025-06-08 12:51:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2025-06-08 12:51:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10571570502460629259.gal : 7 ms
[2025-06-08 12:51:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3916210754204304842.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/CTLCardinality10571570502460629259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3916210754204304842.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,1.06372e+10,5.07445,165928,2173,18,308638,955,1248,797366,46,2969,0


Converting to forward existential form...Done !
original formula: E(AF(EX(TRUE)) U (!((A(((i34.u317.p1120==0)||(i19.u198.p689==1)) U EG(((i4.u37.p99==0)||(i1.u10.p31==1)))) * ((i6.u61.p228==0)||(i6.u54.p...246
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!(EX(TRUE))))) * !((!((E(!(EG(((i4.u37.p99==0)||(i1.u10.p31==1)))) U (!(((i34.u317.p1120==0)||...403
Reverse transition relation is NOT exact ! Due to transitions t16, t78, t95, t175, t231, t265, t292, t403, t443, t579, t581, t614, t706, t782, t783, t789, ...582
(forward)formula 0,0,7.93758,168616,1,0,308638,955,9824,797366,207,2969,1319383
FORMULA MedleyB-PT-B02-CTLCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1236/1236 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 953 transition count 1197
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 953 transition count 1197
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 104 place count 927 transition count 1171
Iterating global reduction 0 with 26 rules applied. Total rules applied 130 place count 927 transition count 1171
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 150 place count 907 transition count 1151
Iterating global reduction 0 with 20 rules applied. Total rules applied 170 place count 907 transition count 1151
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 187 place count 890 transition count 1134
Iterating global reduction 0 with 17 rules applied. Total rules applied 204 place count 890 transition count 1134
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 219 place count 875 transition count 1119
Iterating global reduction 0 with 15 rules applied. Total rules applied 234 place count 875 transition count 1119
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 247 place count 862 transition count 1106
Iterating global reduction 0 with 13 rules applied. Total rules applied 260 place count 862 transition count 1106
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 272 place count 850 transition count 1094
Iterating global reduction 0 with 12 rules applied. Total rules applied 284 place count 850 transition count 1094
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 285 place count 850 transition count 1093
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 294 place count 841 transition count 1084
Iterating global reduction 1 with 9 rules applied. Total rules applied 303 place count 841 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 304 place count 841 transition count 1083
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 834 transition count 1076
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 834 transition count 1076
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 321 place count 831 transition count 1073
Iterating global reduction 2 with 3 rules applied. Total rules applied 324 place count 831 transition count 1073
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 327 place count 828 transition count 1070
Iterating global reduction 2 with 3 rules applied. Total rules applied 330 place count 828 transition count 1070
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 333 place count 825 transition count 1067
Iterating global reduction 2 with 3 rules applied. Total rules applied 336 place count 825 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 822 transition count 1064
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 822 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 345 place count 819 transition count 1061
Iterating global reduction 2 with 3 rules applied. Total rules applied 348 place count 819 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 351 place count 816 transition count 1058
Iterating global reduction 2 with 3 rules applied. Total rules applied 354 place count 816 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 357 place count 813 transition count 1055
Iterating global reduction 2 with 3 rules applied. Total rules applied 360 place count 813 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 363 place count 810 transition count 1052
Iterating global reduction 2 with 3 rules applied. Total rules applied 366 place count 810 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 369 place count 807 transition count 1049
Iterating global reduction 2 with 3 rules applied. Total rules applied 372 place count 807 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 375 place count 804 transition count 1046
Iterating global reduction 2 with 3 rules applied. Total rules applied 378 place count 804 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 379 place count 804 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 381 place count 802 transition count 1043
Iterating global reduction 3 with 2 rules applied. Total rules applied 383 place count 802 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 385 place count 800 transition count 1041
Iterating global reduction 3 with 2 rules applied. Total rules applied 387 place count 800 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 389 place count 798 transition count 1039
Iterating global reduction 3 with 2 rules applied. Total rules applied 391 place count 798 transition count 1039
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 393 place count 798 transition count 1037
Applied a total of 393 rules in 584 ms. Remains 798 /992 variables (removed 194) and now considering 1037/1236 (removed 199) transitions.
// Phase 1: matrix 1037 rows 798 cols
[2025-06-08 12:51:59] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:52:00] [INFO ] Implicit Places using invariants in 443 ms returned []
[2025-06-08 12:52:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:52:01] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Running 1036 sub problems to find dead transitions.
[2025-06-08 12:52:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/797 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Starting structural reductions in LTL mode, iteration 1 : 798/992 places, 1037/1236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32115 ms. Remains : 798/992 places, 1037/1236 transitions.
[2025-06-08 12:52:31] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:52:31] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:52:31] [INFO ] Input system was already deterministic with 1037 transitions.
[2025-06-08 12:52:31] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:52:31] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:52:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality6680617362641950519.gal : 3 ms
[2025-06-08 12:52:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13425592266977115823.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/CTLCardinality6680617362641950519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13425592266977115823.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,9.7164e+09,21.7369,451616,2,25878,5,1.35865e+06,6,0,4231,1.93941e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:53:01] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:53:01] [INFO ] Applying decomposition
[2025-06-08 12:53:01] [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/graph11282002487139579754.txt' '-o' '/tmp/graph11282002487139579754.bin' '-w' '/tmp/graph11282002487139579754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11282002487139579754.bin' '-l' '-1' '-v' '-w' '/tmp/graph11282002487139579754.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:53:01] [INFO ] Decomposing Gal with order
[2025-06-08 12:53:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:53:01] [INFO ] Removed a total of 866 redundant transitions.
[2025-06-08 12:53:01] [INFO ] Flatten gal took : 35 ms
[2025-06-08 12:53:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2025-06-08 12:53:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality6420306831519167350.gal : 5 ms
[2025-06-08 12:53:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality12163519105843782031.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/CTLCardinality6420306831519167350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12163519105843782031.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,9.7164e+09,10.4577,323952,2266,15,596968,890,1276,1.58916e+06,47,2864,0


Converting to forward existential form...Done !
original formula: A(EX(TRUE) U E(!(((((i2.i0.i0.u22.p53==1)&&(i20.u200.p688==0))||(i0.u3.p7==1))||(i16.u155.p549==0))) U ((i18.u172.p604==1)&&((i32.u256.p9...189
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(((((i2.i0.i0.u22.p53==1)&&(i20.u200.p688==0))||(i0.u3.p7==1))||(i16.u155.p549==0))) U ((i18...580
Reverse transition relation is NOT exact ! Due to transitions t76, t214, t248, t275, t386, t420, t504, t593, t682, t683, t740, t741, t761, t762, t765, t768...597
Detected timeout of ITS tools.
[2025-06-08 12:53:31] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:53:31] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:53:31] [INFO ] Applying decomposition
[2025-06-08 12:53:31] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17850575067500432964.txt' '-o' '/tmp/graph17850575067500432964.bin' '-w' '/tmp/graph17850575067500432964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17850575067500432964.bin' '-l' '-1' '-v' '-w' '/tmp/graph17850575067500432964.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:53:31] [INFO ] Decomposing Gal with order
[2025-06-08 12:53:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:53:32] [INFO ] Removed a total of 883 redundant transitions.
[2025-06-08 12:53:32] [INFO ] Flatten gal took : 69 ms
[2025-06-08 12:53:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2025-06-08 12:53:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13466906634236363306.gal : 9 ms
[2025-06-08 12:53:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5517991109681295556.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13466906634236363306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5517991109681295556.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,1.72298e+10,12.6406,436576,2949,15,686110,1431,1525,2.69257e+06,51,5199,0


Converting to forward existential form...Done !
original formula: ((AG(AX(A((i17.i1.i3.u192.p535==0) U ((i6.u85.p217==0)||(i28.u290.p867==1))))) + !(E(EX(((i40.u394.p1173==0)||(i17.i0.i2.u178.p489==1))) ...463
=> equivalent forward existential formula: ([(((Init * !((!(E(TRUE U !(!(EX(!(!((E(!(((i6.u85.p217==0)||(i28.u290.p867==1))) U (!((i17.i1.i3.u192.p535==0))...1240
Reverse transition relation is NOT exact ! Due to transitions t17, t26, t82, t106, t144, t200, t259, t298, t393, t394, t448, t452, t491, t603, t605, t662, ...629
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 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 a local SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
(forward)formula 0,1,375.716,4230352,1,0,4.54755e+06,2103,5530,3.72338e+07,135,11666,3931325
FORMULA MedleyB-PT-B02-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(E(!(A((AF((i34.i1.i0.u345.p1009==1)) + AX((i13.u133.p352==0))) U (((i36.u358.p1046==0)||(i30.i1.i0.u299.p887==1))||(i11.u120.p318!=0))...380
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!((E(!((((i36.u358.p1046==0)||(i30.i1.i0.u299.p887==1))||(i11.u120.p318!=0))) U (!((!(...637
(forward)formula 1,0,1041.36,5907668,1,0,6.11078e+06,2103,2501,5.48475e+07,84,11666,1
FORMULA MedleyB-PT-B02-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((i31.u333.p977==1) U E(AG(((AX((i27.u284.p847==0)) + AF((i17.i0.i1.u176.p470==1))) + AG(((i20.u201.p599==0)||(i31.u340.p997==1))))) U (...177
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(i31.u333.p977==1)),!(E(TRUE U !(((!(EX(!((i27.u284.p847==0)))) + !(EG(!((i17.i0.i1.u176.p470==...260
(forward)formula 2,1,1386.05,6525140,1,0,6.11078e+06,2103,8434,6.54667e+07,162,11666,4696137
FORMULA MedleyB-PT-B02-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((i7.i1.i3.u93.p238==0)||(i7.i1.i0.u62.p144==1)) U EG(!(AX(!(EF(((i39.u392.p1169==0)||(i7.i2.i1.u97.p247==1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(!(EX(!(!(E(TRUE U ((i39.u392.p1169==0)||(i7.i2.i1.u97.p247==1))))))))))))) * !(E(!(EG(!(!(...374
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 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 a local SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Detected timeout of ITS tools.
[2025-06-08 13:19:00] [INFO ] Applying decomposition
[2025-06-08 13:19:00] [INFO ] Flatten gal took : 46 ms
[2025-06-08 13:19:00] [INFO ] Decomposing Gal with order
[2025-06-08 13:19:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:19:00] [INFO ] Removed a total of 754 redundant transitions.
[2025-06-08 13:19:00] [INFO ] Flatten gal took : 45 ms
[2025-06-08 13:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 5 ms.
[2025-06-08 13:19:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9812987363406301381.gal : 4 ms
[2025-06-08 13:19:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14186033794885057783.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/CTLCardinality9812987363406301381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14186033794885057783.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 3 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.72298e+10,2.26046,72240,113,6184,7700,156749,140,24930,2016,922630,0


Converting to forward existential form...Done !
original formula: A(((i0.i0.i0.u4.p238==0)||(i0.i0.i0.u4.p144==1)) U EG(!(AX(!(EF(((i0.u7.p1169==0)||(i0.i0.i0.u4.p247==1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(!(EX(!(!(E(TRUE U ((i0.u7.p1169==0)||(i0.i0.i0.u4.p247==1))))))))))))) * !(E(!(EG(!(!(EX(!...360
Reverse transition relation is NOT exact ! Due to transitions t958, i0.u7.t70, i0.u7.t82, i0.u7.t91, i0.u7.t106, i0.u7.t119, i0.u7.t129, i0.u7.t136, i0.u7....899
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 1
Fast SCC detection found an SCC at level 2

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="MedleyB-PT-B02"
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 MedleyB-PT-B02, 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-174931339900433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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