Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490500025.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 StigmergyCommit-PT-03b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490500025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 359K May 29 14:33 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 StigmergyCommit-PT-03b-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2023-15
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-03b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749051707554

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 15:41:49] [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-04 15:41:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 15:41:50] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2025-06-04 15:41:50] [INFO ] Transformed 1231 places.
[2025-06-04 15:41:50] [INFO ] Transformed 1476 transitions.
[2025-06-04 15:41:50] [INFO ] Found NUPN structural information;
[2025-06-04 15:41:50] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 667 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Support contains 120 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 1142 transition count 1387
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 1142 transition count 1387
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 227 place count 1093 transition count 1338
Iterating global reduction 0 with 49 rules applied. Total rules applied 276 place count 1093 transition count 1338
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 300 place count 1069 transition count 1314
Iterating global reduction 0 with 24 rules applied. Total rules applied 324 place count 1069 transition count 1314
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 344 place count 1049 transition count 1294
Iterating global reduction 0 with 20 rules applied. Total rules applied 364 place count 1049 transition count 1294
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 377 place count 1036 transition count 1281
Iterating global reduction 0 with 13 rules applied. Total rules applied 390 place count 1036 transition count 1281
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 401 place count 1025 transition count 1270
Iterating global reduction 0 with 11 rules applied. Total rules applied 412 place count 1025 transition count 1270
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 422 place count 1015 transition count 1260
Iterating global reduction 0 with 10 rules applied. Total rules applied 432 place count 1015 transition count 1260
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 441 place count 1006 transition count 1251
Iterating global reduction 0 with 9 rules applied. Total rules applied 450 place count 1006 transition count 1251
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 454 place count 1002 transition count 1247
Iterating global reduction 0 with 4 rules applied. Total rules applied 458 place count 1002 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 459 place count 1001 transition count 1246
Iterating global reduction 0 with 1 rules applied. Total rules applied 460 place count 1001 transition count 1246
Applied a total of 460 rules in 1354 ms. Remains 1001 /1231 variables (removed 230) and now considering 1246/1476 (removed 230) transitions.
// Phase 1: matrix 1246 rows 1001 cols
[2025-06-04 15:41:52] [INFO ] Computed 5 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:41:53] [INFO ] Implicit Places using invariants in 1606 ms returned []
[2025-06-04 15:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:41:56] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 3895 ms to find 0 implicit places.
Running 1245 sub problems to find dead transitions.
[2025-06-04 15:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2247 variables, and 0 constraints, problems are : Problem set: 0 solved, 1245 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 1245/1245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2247 variables, and 0 constraints, problems are : Problem set: 0 solved, 1245 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/1245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61027ms problems are : Problem set: 0 solved, 1245 unsolved
Search for dead transitions found 0 dead transitions in 61066ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1231 places, 1246/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66357 ms. Remains : 1001/1231 places, 1246/1476 transitions.
Support contains 120 out of 1001 places after structural reductions.
[2025-06-04 15:42:57] [INFO ] Flatten gal took : 250 ms
[2025-06-04 15:42:58] [INFO ] Flatten gal took : 141 ms
[2025-06-04 15:42:58] [INFO ] Input system was already deterministic with 1246 transitions.
Support contains 115 out of 1001 places (down from 120) after GAL structural reductions.
RANDOM walk for 40000 steps (506 resets) in 2133 ms. (18 steps per ms) remains 38/73 properties
BEST_FIRST walk for 4002 steps (11 resets) in 51 ms. (76 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 56 ms. (70 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 69 ms. (57 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 43 ms. (90 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (9 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 72 ms. (54 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (12 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
[2025-06-04 15:42:59] [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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 928/987 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:43:01] [INFO ] Deduced a trap composed of 346 places in 981 ms of which 411 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:43:03] [INFO ] Deduced a trap composed of 344 places in 1402 ms of which 492 ms to minimize.
Problem AtomicPropp63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:43:04] [INFO ] Deduced a trap composed of 353 places in 778 ms of which 239 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:43:05] [INFO ] Deduced a trap composed of 353 places in 647 ms of which 49 ms to minimize.
SMT process timed out in 5576ms, After SMT, problems are : Problem set: 1 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Graph (trivial) has 897 edges and 1001 vertex of which 64 / 1001 are part of one of the 11 SCC in 10 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 1437 edges and 948 vertex of which 944 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 631 rules applied. Total rules applied 633 place count 944 transition count 546
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 637 rules applied. Total rules applied 1270 place count 317 transition count 536
Reduce places removed 5 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 20 rules applied. Total rules applied 1290 place count 312 transition count 521
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1305 place count 297 transition count 521
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1305 place count 297 transition count 465
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1417 place count 241 transition count 465
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1421 place count 237 transition count 461
Iterating global reduction 4 with 4 rules applied. Total rules applied 1425 place count 237 transition count 461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1425 place count 237 transition count 460
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1427 place count 236 transition count 460
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1429 place count 234 transition count 432
Iterating global reduction 4 with 2 rules applied. Total rules applied 1431 place count 234 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1432 place count 234 transition count 431
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1433 place count 233 transition count 430
Iterating global reduction 5 with 1 rules applied. Total rules applied 1434 place count 233 transition count 430
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1435 place count 232 transition count 429
Iterating global reduction 5 with 1 rules applied. Total rules applied 1436 place count 232 transition count 429
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 1494 place count 203 transition count 400
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1501 place count 203 transition count 393
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1513 place count 191 transition count 296
Iterating global reduction 6 with 12 rules applied. Total rules applied 1525 place count 191 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1529 place count 191 transition count 292
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1531 place count 189 transition count 290
Iterating global reduction 7 with 2 rules applied. Total rules applied 1533 place count 189 transition count 290
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1534 place count 188 transition count 289
Iterating global reduction 7 with 1 rules applied. Total rules applied 1535 place count 188 transition count 289
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 7 with 12 rules applied. Total rules applied 1547 place count 182 transition count 283
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1553 place count 179 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1554 place count 179 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1555 place count 179 transition count 299
Free-agglomeration rule applied 41 times.
Iterating global reduction 8 with 41 rules applied. Total rules applied 1596 place count 179 transition count 258
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 1637 place count 138 transition count 258
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1640 place count 135 transition count 255
Iterating global reduction 9 with 3 rules applied. Total rules applied 1643 place count 135 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 1662 place count 135 transition count 236
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 1666 place count 135 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 135 transition count 234
Applied a total of 1668 rules in 524 ms. Remains 135 /1001 variables (removed 866) and now considering 234/1246 (removed 1012) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 135/1001 places, 234/1246 transitions.
RANDOM walk for 40000 steps (1250 resets) in 573 ms. (69 steps per ms) remains 5/37 properties
BEST_FIRST walk for 40003 steps (246 resets) in 77 ms. (512 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (258 resets) in 60 ms. (655 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (306 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (251 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
// Phase 1: matrix 234 rows 135 cols
[2025-06-04 15:43:06] [INFO ] Computed 5 invariants in 4 ms
[2025-06-04 15:43:06] [INFO ] State equation strengthened by 92 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 234/369 variables, 135/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 92/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 234/369 variables, 135/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 92/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 234 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 520 steps, including 64 resets, run visited all 2 properties in 6 ms. (steps per millisecond=86 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 15:43:06] [INFO ] Flatten gal took : 67 ms
[2025-06-04 15:43:06] [INFO ] Flatten gal took : 59 ms
[2025-06-04 15:43:06] [INFO ] Input system was already deterministic with 1246 transitions.
Computed a total of 185 stabilizing places and 193 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 970 transition count 1215
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 970 transition count 1215
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 86 place count 946 transition count 1191
Iterating global reduction 0 with 24 rules applied. Total rules applied 110 place count 946 transition count 1191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 946 transition count 1190
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 128 place count 929 transition count 1173
Iterating global reduction 1 with 17 rules applied. Total rules applied 145 place count 929 transition count 1173
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 160 place count 914 transition count 1158
Iterating global reduction 1 with 15 rules applied. Total rules applied 175 place count 914 transition count 1158
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 187 place count 902 transition count 1146
Iterating global reduction 1 with 12 rules applied. Total rules applied 199 place count 902 transition count 1146
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 210 place count 891 transition count 1135
Iterating global reduction 1 with 11 rules applied. Total rules applied 221 place count 891 transition count 1135
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 230 place count 882 transition count 1126
Iterating global reduction 1 with 9 rules applied. Total rules applied 239 place count 882 transition count 1126
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 248 place count 873 transition count 1117
Iterating global reduction 1 with 9 rules applied. Total rules applied 257 place count 873 transition count 1117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 258 place count 873 transition count 1116
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 265 place count 866 transition count 1109
Iterating global reduction 2 with 7 rules applied. Total rules applied 272 place count 866 transition count 1109
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 277 place count 861 transition count 1104
Iterating global reduction 2 with 5 rules applied. Total rules applied 282 place count 861 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 861 transition count 1103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 286 place count 858 transition count 1100
Iterating global reduction 3 with 3 rules applied. Total rules applied 289 place count 858 transition count 1100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 292 place count 855 transition count 1097
Iterating global reduction 3 with 3 rules applied. Total rules applied 295 place count 855 transition count 1097
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 298 place count 852 transition count 1094
Iterating global reduction 3 with 3 rules applied. Total rules applied 301 place count 852 transition count 1094
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 304 place count 849 transition count 1091
Iterating global reduction 3 with 3 rules applied. Total rules applied 307 place count 849 transition count 1091
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 310 place count 846 transition count 1088
Iterating global reduction 3 with 3 rules applied. Total rules applied 313 place count 846 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 316 place count 843 transition count 1085
Iterating global reduction 3 with 3 rules applied. Total rules applied 319 place count 843 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 322 place count 840 transition count 1082
Iterating global reduction 3 with 3 rules applied. Total rules applied 325 place count 840 transition count 1082
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 328 place count 837 transition count 1079
Iterating global reduction 3 with 3 rules applied. Total rules applied 331 place count 837 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 837 transition count 1078
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 334 place count 835 transition count 1076
Iterating global reduction 4 with 2 rules applied. Total rules applied 336 place count 835 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 338 place count 833 transition count 1074
Iterating global reduction 4 with 2 rules applied. Total rules applied 340 place count 833 transition count 1074
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 833 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 342 place count 832 transition count 1072
Iterating global reduction 5 with 1 rules applied. Total rules applied 343 place count 832 transition count 1072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 832 transition count 1071
Applied a total of 344 rules in 1010 ms. Remains 832 /1001 variables (removed 169) and now considering 1071/1246 (removed 175) transitions.
// Phase 1: matrix 1071 rows 832 cols
[2025-06-04 15:43:07] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:43:08] [INFO ] Implicit Places using invariants in 685 ms returned []
[2025-06-04 15:43:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:43:10] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
Running 1070 sub problems to find dead transitions.
[2025-06-04 15:43:10] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 831/1903 variables, and 0 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/832 constraints, PredecessorRefiner: 1070/1070 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1070 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 831/1903 variables, and 0 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/832 constraints, PredecessorRefiner: 0/1070 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60473ms problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Starting structural reductions in LTL mode, iteration 1 : 832/1001 places, 1071/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63650 ms. Remains : 832/1001 places, 1071/1246 transitions.
[2025-06-04 15:44:10] [INFO ] Flatten gal took : 65 ms
[2025-06-04 15:44:10] [INFO ] Flatten gal took : 56 ms
[2025-06-04 15:44:10] [INFO ] Input system was already deterministic with 1071 transitions.
[2025-06-04 15:44:10] [INFO ] Flatten gal took : 67 ms
[2025-06-04 15:44:10] [INFO ] Flatten gal took : 50 ms
[2025-06-04 15:44:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality1795798237609438215.gal : 62 ms
[2025-06-04 15:44:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7123657917627911316.ctl : 7 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/CTLCardinality1795798237609438215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7123657917627911316.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,1.0857e+10,26.8932,580556,2,33341,5,1.80499e+06,6,0,4401,2.51932e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:44:41] [INFO ] Flatten gal took : 52 ms
[2025-06-04 15:44:41] [INFO ] Applying decomposition
[2025-06-04 15:44:41] [INFO ] Flatten gal took : 34 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/graph12867165350981369250.txt' '-o' '/tmp/graph12867165350981369250.bin' '-w' '/tmp/graph12867165350981369250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12867165350981369250.bin' '-l' '-1' '-v' '-w' '/tmp/graph12867165350981369250.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:44:41] [INFO ] Decomposing Gal with order
[2025-06-04 15:44:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:44:41] [INFO ] Removed a total of 867 redundant transitions.
[2025-06-04 15:44:41] [INFO ] Flatten gal took : 169 ms
[2025-06-04 15:44:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 21 ms.
[2025-06-04 15:44:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2539051363532127851.gal : 21 ms
[2025-06-04 15:44:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5783504401556595383.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/CTLCardinality2539051363532127851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5783504401556595383.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0857e+10,6.29256,193284,2339,13,331320,1044,1289,1.0491e+06,47,3221,0


Converting to forward existential form...Done !
original formula: A((!(E(EX(((i19.i1.i1.u186.p648==0)||(i33.i1.i1.u335.p1186==1))) U E(((i4.i0.i0.u34.p95==0)||(i16.u156.p563==1)) U ((i29.u279.p964==0)||(...362
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((i10.u140.p451==1)))))))) * !(E(!(!(EG(!((i10.u140.p451==1))))) U (!((!(E(EX(((i19.i1.i1...638
Reverse transition relation is NOT exact ! Due to transitions t32, t80, t170, t260, t350, t403, t406, t440, t462, t584, t617, t709, t790, t797, t800, t803,...651
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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 : 1001/1001 places, 1246/1246 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 973 transition count 1218
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 973 transition count 1218
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 78 place count 951 transition count 1196
Iterating global reduction 0 with 22 rules applied. Total rules applied 100 place count 951 transition count 1196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 951 transition count 1195
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 117 place count 935 transition count 1179
Iterating global reduction 1 with 16 rules applied. Total rules applied 133 place count 935 transition count 1179
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 148 place count 920 transition count 1164
Iterating global reduction 1 with 15 rules applied. Total rules applied 163 place count 920 transition count 1164
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 176 place count 907 transition count 1151
Iterating global reduction 1 with 13 rules applied. Total rules applied 189 place count 907 transition count 1151
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 200 place count 896 transition count 1140
Iterating global reduction 1 with 11 rules applied. Total rules applied 211 place count 896 transition count 1140
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 222 place count 885 transition count 1129
Iterating global reduction 1 with 11 rules applied. Total rules applied 233 place count 885 transition count 1129
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 242 place count 876 transition count 1120
Iterating global reduction 1 with 9 rules applied. Total rules applied 251 place count 876 transition count 1120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 252 place count 876 transition count 1119
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 259 place count 869 transition count 1112
Iterating global reduction 2 with 7 rules applied. Total rules applied 266 place count 869 transition count 1112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 869 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 270 place count 866 transition count 1108
Iterating global reduction 3 with 3 rules applied. Total rules applied 273 place count 866 transition count 1108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 275 place count 864 transition count 1106
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 864 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 863 transition count 1105
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 863 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 862 transition count 1104
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 862 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 282 place count 861 transition count 1103
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 861 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 860 transition count 1102
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 860 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 286 place count 859 transition count 1101
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 859 transition count 1101
Applied a total of 287 rules in 805 ms. Remains 859 /1001 variables (removed 142) and now considering 1101/1246 (removed 145) transitions.
// Phase 1: matrix 1101 rows 859 cols
[2025-06-04 15:45:12] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:45:13] [INFO ] Implicit Places using invariants in 890 ms returned []
[2025-06-04 15:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:45:15] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2726 ms to find 0 implicit places.
Running 1100 sub problems to find dead transitions.
[2025-06-04 15:45:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/1960 variables, and 0 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/859 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 858/1960 variables, and 0 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/859 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 859/1001 places, 1101/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64061 ms. Remains : 859/1001 places, 1101/1246 transitions.
[2025-06-04 15:46:16] [INFO ] Flatten gal took : 53 ms
[2025-06-04 15:46:16] [INFO ] Flatten gal took : 50 ms
[2025-06-04 15:46:16] [INFO ] Input system was already deterministic with 1101 transitions.
[2025-06-04 15:46:16] [INFO ] Flatten gal took : 50 ms
[2025-06-04 15:46:16] [INFO ] Flatten gal took : 50 ms
[2025-06-04 15:46:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality13628206611145949978.gal : 12 ms
[2025-06-04 15:46:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality14884249532513557973.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/CTLCardinality13628206611145949978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14884249532513557973.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.18285e+10,25.3446,516068,2,33221,5,1.65622e+06,6,0,4539,2.12686e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:46:46] [INFO ] Flatten gal took : 28 ms
[2025-06-04 15:46:46] [INFO ] Applying decomposition
[2025-06-04 15:46:46] [INFO ] Flatten gal took : 27 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/graph4901214867844458483.txt' '-o' '/tmp/graph4901214867844458483.bin' '-w' '/tmp/graph4901214867844458483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4901214867844458483.bin' '-l' '-1' '-v' '-w' '/tmp/graph4901214867844458483.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:46:46] [INFO ] Decomposing Gal with order
[2025-06-04 15:46:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:46:46] [INFO ] Removed a total of 870 redundant transitions.
[2025-06-04 15:46:46] [INFO ] Flatten gal took : 79 ms
[2025-06-04 15:46:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2025-06-04 15:46:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2109916248725523960.gal : 10 ms
[2025-06-04 15:46:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12543107621857803072.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/CTLCardinality2109916248725523960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12543107621857803072.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.18285e+10,7.31258,213204,2313,18,368658,1009,1328,1.17674e+06,59,3141,0


Converting to forward existential form...Done !
original formula: A((((i16.u159.p583==0) * E(EG(((i34.i1.i1.u311.p1056==0)||(i25.u226.p785==1))) U (((i26.u234.p823==0)||(i16.u136.p469==1))&&(i3.i0.i1.u22...512
=> equivalent forward existential formula: [((Init * !(EG(!(EG(EX(!(((((i6.u64.p207==0)||(i13.i1.i1.u121.p414==1))||(i16.u148.p542==0))&&(((i21.u190.p662==...893
Reverse transition relation is NOT exact ! Due to transitions t25, t78, t108, t230, t267, t365, t457, t467, t555, t556, t557, t613, t646, t730, t731, t787,...598
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found 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
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 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
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 969 transition count 1214
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 969 transition count 1214
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 89 place count 944 transition count 1189
Iterating global reduction 0 with 25 rules applied. Total rules applied 114 place count 944 transition count 1189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 944 transition count 1188
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 133 place count 926 transition count 1170
Iterating global reduction 1 with 18 rules applied. Total rules applied 151 place count 926 transition count 1170
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 168 place count 909 transition count 1153
Iterating global reduction 1 with 17 rules applied. Total rules applied 185 place count 909 transition count 1153
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 199 place count 895 transition count 1139
Iterating global reduction 1 with 14 rules applied. Total rules applied 213 place count 895 transition count 1139
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 224 place count 884 transition count 1128
Iterating global reduction 1 with 11 rules applied. Total rules applied 235 place count 884 transition count 1128
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 245 place count 874 transition count 1118
Iterating global reduction 1 with 10 rules applied. Total rules applied 255 place count 874 transition count 1118
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 264 place count 865 transition count 1109
Iterating global reduction 1 with 9 rules applied. Total rules applied 273 place count 865 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 274 place count 865 transition count 1108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 281 place count 858 transition count 1101
Iterating global reduction 2 with 7 rules applied. Total rules applied 288 place count 858 transition count 1101
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 292 place count 854 transition count 1097
Iterating global reduction 2 with 4 rules applied. Total rules applied 296 place count 854 transition count 1097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 854 transition count 1096
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 300 place count 851 transition count 1093
Iterating global reduction 3 with 3 rules applied. Total rules applied 303 place count 851 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 304 place count 850 transition count 1092
Iterating global reduction 3 with 1 rules applied. Total rules applied 305 place count 850 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 306 place count 849 transition count 1091
Iterating global reduction 3 with 1 rules applied. Total rules applied 307 place count 849 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 308 place count 848 transition count 1090
Iterating global reduction 3 with 1 rules applied. Total rules applied 309 place count 848 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 310 place count 847 transition count 1089
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 847 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 846 transition count 1088
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 846 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 314 place count 845 transition count 1087
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 845 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 316 place count 844 transition count 1086
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 844 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 843 transition count 1085
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 843 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 842 transition count 1084
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 842 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 322 place count 842 transition count 1083
Applied a total of 322 rules in 914 ms. Remains 842 /1001 variables (removed 159) and now considering 1083/1246 (removed 163) transitions.
// Phase 1: matrix 1083 rows 842 cols
[2025-06-04 15:47:17] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:47:18] [INFO ] Implicit Places using invariants in 560 ms returned []
[2025-06-04 15:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:47:20] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
Running 1082 sub problems to find dead transitions.
[2025-06-04 15:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 841/1925 variables, and 0 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/842 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 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 841/1925 variables, and 0 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/842 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 60460ms
Starting structural reductions in LTL mode, iteration 1 : 842/1001 places, 1083/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63573 ms. Remains : 842/1001 places, 1083/1246 transitions.
[2025-06-04 15:48:20] [INFO ] Flatten gal took : 37 ms
[2025-06-04 15:48:20] [INFO ] Flatten gal took : 38 ms
[2025-06-04 15:48:20] [INFO ] Input system was already deterministic with 1083 transitions.
[2025-06-04 15:48:20] [INFO ] Flatten gal took : 38 ms
[2025-06-04 15:48:20] [INFO ] Flatten gal took : 38 ms
[2025-06-04 15:48:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality13359343430827383261.gal : 10 ms
[2025-06-04 15:48:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5771134894510342519.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/CTLCardinality13359343430827383261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5771134894510342519.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.13292e+10,25.7914,517036,2,27471,5,1.57209e+06,6,0,4453,2.23504e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:48:50] [INFO ] Flatten gal took : 22 ms
[2025-06-04 15:48:50] [INFO ] Applying decomposition
[2025-06-04 15:48:50] [INFO ] Flatten gal took : 23 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/graph17760671765213516927.txt' '-o' '/tmp/graph17760671765213516927.bin' '-w' '/tmp/graph17760671765213516927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17760671765213516927.bin' '-l' '-1' '-v' '-w' '/tmp/graph17760671765213516927.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:48:50] [INFO ] Decomposing Gal with order
[2025-06-04 15:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:48:51] [INFO ] Removed a total of 874 redundant transitions.
[2025-06-04 15:48:51] [INFO ] Flatten gal took : 66 ms
[2025-06-04 15:48:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2025-06-04 15:48:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10954380210032855312.gal : 10 ms
[2025-06-04 15:48:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality5126244949430166075.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/CTLCardinality10954380210032855312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5126244949430166075.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.13292e+10,5.53909,157176,2263,15,285514,971,1281,737702,53,2824,0


Converting to forward existential form...Done !
original formula: AG(((AX((i15.u148.p531==1)) + (i25.u242.p818==1)) + AF(((i0.i1.i2.u67.p223==0) + EF((i24.u234.p792==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((!(EX(!((i15.u148.p531==1)))) + (i25.u242.p818==1)))),!(((i0.i1.i2.u67.p223==0) + E(T...192
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t159, t215, t249, t349, t350, t406, t440, t531, t587, t620, t771, t791, t792, t795...650
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Graph (trivial) has 979 edges and 1001 vertex of which 72 / 1001 are part of one of the 12 SCC in 3 ms
Free SCC test removed 60 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 696 place count 940 transition count 483
Reduce places removed 695 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 706 rules applied. Total rules applied 1402 place count 245 transition count 472
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 1410 place count 240 transition count 469
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1413 place count 237 transition count 469
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1413 place count 237 transition count 418
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1515 place count 186 transition count 418
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1536 place count 165 transition count 397
Iterating global reduction 4 with 21 rules applied. Total rules applied 1557 place count 165 transition count 397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1557 place count 165 transition count 396
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1559 place count 164 transition count 396
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1568 place count 155 transition count 361
Iterating global reduction 4 with 9 rules applied. Total rules applied 1577 place count 155 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1579 place count 155 transition count 359
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1583 place count 151 transition count 355
Iterating global reduction 5 with 4 rules applied. Total rules applied 1587 place count 151 transition count 355
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1591 place count 147 transition count 351
Iterating global reduction 5 with 4 rules applied. Total rules applied 1595 place count 147 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1596 place count 147 transition count 350
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1640 place count 125 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1646 place count 125 transition count 322
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 1666 place count 105 transition count 203
Iterating global reduction 7 with 20 rules applied. Total rules applied 1686 place count 105 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1695 place count 105 transition count 194
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1704 place count 96 transition count 182
Iterating global reduction 8 with 9 rules applied. Total rules applied 1713 place count 96 transition count 182
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1722 place count 87 transition count 170
Iterating global reduction 8 with 9 rules applied. Total rules applied 1731 place count 87 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1736 place count 87 transition count 165
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 1738 place count 86 transition count 164
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1739 place count 85 transition count 159
Iterating global reduction 9 with 1 rules applied. Total rules applied 1740 place count 85 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1741 place count 85 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1746 place count 85 transition count 153
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 10 with 10 rules applied. Total rules applied 1756 place count 80 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1757 place count 79 transition count 147
Applied a total of 1757 rules in 122 ms. Remains 79 /1001 variables (removed 922) and now considering 147/1246 (removed 1099) transitions.
[2025-06-04 15:49:21] [INFO ] Flow matrix only has 141 transitions (discarded 6 similar events)
// Phase 1: matrix 141 rows 79 cols
[2025-06-04 15:49:21] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:49:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-04 15:49:21] [INFO ] Flow matrix only has 141 transitions (discarded 6 similar events)
[2025-06-04 15:49:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:49:21] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:49:21] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:49:21] [INFO ] Redundant transitions in 4 ms returned []
Running 137 sub problems to find dead transitions.
[2025-06-04 15:49:21] [INFO ] Flow matrix only has 141 transitions (discarded 6 similar events)
[2025-06-04 15:49:21] [INFO ] Invariant cache hit.
[2025-06-04 15:49:21] [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/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:23] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:24] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:24] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:24] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:25] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:25] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:25] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:26] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 140/219 variables, 79/97 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 1/220 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 112 constraints, problems are : Problem set: 0 solved, 137 unsolved in 16232 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 140/219 variables, 79/97 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 137/248 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:49:41] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 1/220 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 250 constraints, problems are : Problem set: 0 solved, 137 unsolved in 22024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38294ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 38294ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/1001 places, 147/1246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38664 ms. Remains : 79/1001 places, 147/1246 transitions.
[2025-06-04 15:49:59] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:49:59] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:49:59] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-04 15:49:59] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:49:59] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:49:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5955603293260130214.gal : 2 ms
[2025-06-04 15:49:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3264269220755993534.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/CTLCardinality5955603293260130214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3264269220755993534.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,132072,0.269553,11204,2,2957,5,26297,6,0,454,24733,0


Converting to forward existential form...Done !
original formula: EG(((p524==0) + AG(E(((p889==0) * EG((p38==1))) U (AG(((p1061==0)||(p10==1))) + ((p401==1)&&(p37==0)))))))
=> equivalent forward existential formula: [FwdG(Init,((p524==0) + !(E(TRUE U !(E(((p889==0) * EG((p38==1))) U (!(E(TRUE U !(((p1061==0)||(p10==1))))) + ((...191
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t7, t13, t14, t15, t19, t20, t21, t28, t29, t30, t34, t53, t54, t56, t65, t66, t75, t...346
(forward)formula 0,1,7.08452,173668,1,0,527,871061,326,262,3910,805917,567
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Graph (trivial) has 979 edges and 1001 vertex of which 67 / 1001 are part of one of the 11 SCC in 2 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 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 701 place count 944 transition count 482
Reduce places removed 700 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 713 rules applied. Total rules applied 1414 place count 244 transition count 469
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 1425 place count 238 transition count 464
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1430 place count 233 transition count 464
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1430 place count 233 transition count 413
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1532 place count 182 transition count 413
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1553 place count 161 transition count 392
Iterating global reduction 4 with 21 rules applied. Total rules applied 1574 place count 161 transition count 392
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1583 place count 152 transition count 357
Iterating global reduction 4 with 9 rules applied. Total rules applied 1592 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 1594 place count 152 transition count 355
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1598 place count 148 transition count 351
Iterating global reduction 5 with 4 rules applied. Total rules applied 1602 place count 148 transition count 351
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1606 place count 144 transition count 347
Iterating global reduction 5 with 4 rules applied. Total rules applied 1610 place count 144 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1611 place count 144 transition count 346
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1657 place count 121 transition count 323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1662 place count 121 transition count 318
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1681 place count 102 transition count 207
Iterating global reduction 7 with 19 rules applied. Total rules applied 1700 place count 102 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1709 place count 102 transition count 198
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1719 place count 92 transition count 185
Iterating global reduction 8 with 10 rules applied. Total rules applied 1729 place count 92 transition count 185
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1738 place count 83 transition count 174
Iterating global reduction 8 with 9 rules applied. Total rules applied 1747 place count 83 transition count 174
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1753 place count 83 transition count 168
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 82 transition count 167
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1756 place count 81 transition count 161
Iterating global reduction 9 with 1 rules applied. Total rules applied 1757 place count 81 transition count 161
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 81 transition count 160
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 81 transition count 156
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 77 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1771 place count 76 transition count 151
Applied a total of 1771 rules in 97 ms. Remains 76 /1001 variables (removed 925) and now considering 151/1246 (removed 1095) transitions.
[2025-06-04 15:50:07] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
// Phase 1: matrix 146 rows 76 cols
[2025-06-04 15:50:07] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:50:07] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-04 15:50:07] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-04 15:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:50:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:50:07] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:50:07] [INFO ] Redundant transitions in 8 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-04 15:50:07] [INFO ] Flow matrix only has 146 transitions (discarded 5 similar events)
[2025-06-04 15:50:07] [INFO ] Invariant cache hit.
[2025-06-04 15:50:07] [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, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:09] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:10] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:10] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:10] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:10] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:11] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:11] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:11] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:11] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:12] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:12] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 145/221 variables, 76/98 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:15] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 1/222 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 115 constraints, problems are : Problem set: 0 solved, 142 unsolved in 19744 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 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, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:28] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:28] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:50:29] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 145/221 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 142/259 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 1/222 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 260 constraints, problems are : Problem set: 0 solved, 142 unsolved in 24550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44343ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 44345ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/1001 places, 151/1246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44814 ms. Remains : 76/1001 places, 151/1246 transitions.
[2025-06-04 15:50:51] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:50:51] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:50:51] [INFO ] Input system was already deterministic with 151 transitions.
[2025-06-04 15:50:51] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:50:51] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:50:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12299388054247149197.gal : 1 ms
[2025-06-04 15:50:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12708403911645465905.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/CTLCardinality12299388054247149197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12708403911645465905.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,97920,0.302201,12544,2,3224,5,25903,6,0,447,28225,0


Converting to forward existential form...Done !
original formula: EF((((p303==0) * (!(A((p882==1) U (p697==1))) + (p924==0))) * (EF(((p48==0)&&(p349==1))) + (p1066==1))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * ((p303==0) * (!(!((E(!((p697==1)) U (!((p882==1)) * !((p697==1)))) + EG(!((p697==1)))...366
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t12, t13, t14, t17, t18, t19, t24, t27, t28, t29, t34, t54, t63, t64, t66, t72, t...364
(forward)formula 0,1,7.75087,183664,1,0,536,1.01992e+06,327,236,4111,849023,585
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2025-04 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 : 1001/1001 places, 1246/1246 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 974 transition count 1219
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 974 transition count 1219
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 954 transition count 1199
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 954 transition count 1199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 954 transition count 1198
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 109 place count 940 transition count 1184
Iterating global reduction 1 with 14 rules applied. Total rules applied 123 place count 940 transition count 1184
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 136 place count 927 transition count 1171
Iterating global reduction 1 with 13 rules applied. Total rules applied 149 place count 927 transition count 1171
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 160 place count 916 transition count 1160
Iterating global reduction 1 with 11 rules applied. Total rules applied 171 place count 916 transition count 1160
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 181 place count 906 transition count 1150
Iterating global reduction 1 with 10 rules applied. Total rules applied 191 place count 906 transition count 1150
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 200 place count 897 transition count 1141
Iterating global reduction 1 with 9 rules applied. Total rules applied 209 place count 897 transition count 1141
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 217 place count 889 transition count 1133
Iterating global reduction 1 with 8 rules applied. Total rules applied 225 place count 889 transition count 1133
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 233 place count 881 transition count 1125
Iterating global reduction 1 with 8 rules applied. Total rules applied 241 place count 881 transition count 1125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 246 place count 876 transition count 1120
Iterating global reduction 1 with 5 rules applied. Total rules applied 251 place count 876 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 255 place count 872 transition count 1116
Iterating global reduction 1 with 4 rules applied. Total rules applied 259 place count 872 transition count 1116
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 262 place count 869 transition count 1113
Iterating global reduction 1 with 3 rules applied. Total rules applied 265 place count 869 transition count 1113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 268 place count 866 transition count 1110
Iterating global reduction 1 with 3 rules applied. Total rules applied 271 place count 866 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 274 place count 863 transition count 1107
Iterating global reduction 1 with 3 rules applied. Total rules applied 277 place count 863 transition count 1107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 280 place count 860 transition count 1104
Iterating global reduction 1 with 3 rules applied. Total rules applied 283 place count 860 transition count 1104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 286 place count 857 transition count 1101
Iterating global reduction 1 with 3 rules applied. Total rules applied 289 place count 857 transition count 1101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 292 place count 854 transition count 1098
Iterating global reduction 1 with 3 rules applied. Total rules applied 295 place count 854 transition count 1098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 296 place count 854 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 298 place count 852 transition count 1095
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 852 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 852 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 302 place count 851 transition count 1093
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 851 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 304 place count 850 transition count 1092
Iterating global reduction 3 with 1 rules applied. Total rules applied 305 place count 850 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 306 place count 849 transition count 1091
Iterating global reduction 3 with 1 rules applied. Total rules applied 307 place count 849 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 308 place count 849 transition count 1090
Applied a total of 308 rules in 979 ms. Remains 849 /1001 variables (removed 152) and now considering 1090/1246 (removed 156) transitions.
// Phase 1: matrix 1090 rows 849 cols
[2025-06-04 15:51:00] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:51:01] [INFO ] Implicit Places using invariants in 590 ms returned []
[2025-06-04 15:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:51:02] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
Running 1089 sub problems to find dead transitions.
[2025-06-04 15:51:02] [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 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/1939 variables, and 0 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/849 constraints, PredecessorRefiner: 1089/1089 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1089 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 848/1939 variables, and 0 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/849 constraints, PredecessorRefiner: 0/1089 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Starting structural reductions in LTL mode, iteration 1 : 849/1001 places, 1090/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63451 ms. Remains : 849/1001 places, 1090/1246 transitions.
[2025-06-04 15:52:03] [INFO ] Flatten gal took : 35 ms
[2025-06-04 15:52:03] [INFO ] Flatten gal took : 36 ms
[2025-06-04 15:52:03] [INFO ] Input system was already deterministic with 1090 transitions.
[2025-06-04 15:52:03] [INFO ] Flatten gal took : 46 ms
[2025-06-04 15:52:03] [INFO ] Flatten gal took : 36 ms
[2025-06-04 15:52:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality18079805729499930996.gal : 8 ms
[2025-06-04 15:52:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1049388965209544511.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/CTLCardinality18079805729499930996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1049388965209544511.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.14925e+10,27.589,471164,2,30086,5,1.47234e+06,6,0,4488,1.98257e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:52:33] [INFO ] Flatten gal took : 37 ms
[2025-06-04 15:52:33] [INFO ] Applying decomposition
[2025-06-04 15:52:33] [INFO ] Flatten gal took : 36 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/graph5318526136691465959.txt' '-o' '/tmp/graph5318526136691465959.bin' '-w' '/tmp/graph5318526136691465959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5318526136691465959.bin' '-l' '-1' '-v' '-w' '/tmp/graph5318526136691465959.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:52:33] [INFO ] Decomposing Gal with order
[2025-06-04 15:52:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:52:33] [INFO ] Removed a total of 869 redundant transitions.
[2025-06-04 15:52:33] [INFO ] Flatten gal took : 89 ms
[2025-06-04 15:52:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2025-06-04 15:52:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9242329967781521436.gal : 15 ms
[2025-06-04 15:52:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7240374032704614693.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/CTLCardinality9242329967781521436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7240374032704614693.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14925e+10,6.83717,177252,2225,15,301523,1003,1318,958291,47,3047,0


Converting to forward existential form...Done !
original formula: (E(((AG(!(EG(((i34.u324.p1126==0)||(i0.u15.p38==1))))) + !(EX((i27.u3.p116==1)))) + (AF(AG(((i31.i1.i0.u297.p1015==0)||(i14.u164.p583==1)...492
=> equivalent forward existential formula: ([(EY(FwdU((Init * E(((!(E(TRUE U !(!(EG(((i34.u324.p1126==0)||(i0.u15.p38==1))))))) + !(EX((i27.u3.p116==1)))) ...1041
Reverse transition relation is NOT exact ! Due to transitions t76, t229, t263, t356, t409, t412, t448, t485, t541, t597, t633, t722, t723, t779, t799, t800...677
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 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
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 : 1001/1001 places, 1246/1246 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 968 transition count 1213
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 968 transition count 1213
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 92 place count 942 transition count 1187
Iterating global reduction 0 with 26 rules applied. Total rules applied 118 place count 942 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 942 transition count 1186
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 137 place count 924 transition count 1168
Iterating global reduction 1 with 18 rules applied. Total rules applied 155 place count 924 transition count 1168
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 172 place count 907 transition count 1151
Iterating global reduction 1 with 17 rules applied. Total rules applied 189 place count 907 transition count 1151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 203 place count 893 transition count 1137
Iterating global reduction 1 with 14 rules applied. Total rules applied 217 place count 893 transition count 1137
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 229 place count 881 transition count 1125
Iterating global reduction 1 with 12 rules applied. Total rules applied 241 place count 881 transition count 1125
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 252 place count 870 transition count 1114
Iterating global reduction 1 with 11 rules applied. Total rules applied 263 place count 870 transition count 1114
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 274 place count 859 transition count 1103
Iterating global reduction 1 with 11 rules applied. Total rules applied 285 place count 859 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 286 place count 859 transition count 1102
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 295 place count 850 transition count 1093
Iterating global reduction 2 with 9 rules applied. Total rules applied 304 place count 850 transition count 1093
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 843 transition count 1086
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 843 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 319 place count 843 transition count 1085
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 324 place count 838 transition count 1080
Iterating global reduction 3 with 5 rules applied. Total rules applied 329 place count 838 transition count 1080
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 333 place count 834 transition count 1076
Iterating global reduction 3 with 4 rules applied. Total rules applied 337 place count 834 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 341 place count 830 transition count 1072
Iterating global reduction 3 with 4 rules applied. Total rules applied 345 place count 830 transition count 1072
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 349 place count 826 transition count 1068
Iterating global reduction 3 with 4 rules applied. Total rules applied 353 place count 826 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 357 place count 822 transition count 1064
Iterating global reduction 3 with 4 rules applied. Total rules applied 361 place count 822 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 365 place count 818 transition count 1060
Iterating global reduction 3 with 4 rules applied. Total rules applied 369 place count 818 transition count 1060
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 373 place count 814 transition count 1056
Iterating global reduction 3 with 4 rules applied. Total rules applied 377 place count 814 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 378 place count 814 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 381 place count 811 transition count 1052
Iterating global reduction 4 with 3 rules applied. Total rules applied 384 place count 811 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 387 place count 809 transition count 1049
Iterating global reduction 5 with 2 rules applied. Total rules applied 389 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 391 place count 807 transition count 1047
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 807 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 394 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 806 transition count 1045
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 806 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 397 place count 806 transition count 1044
Applied a total of 397 rules in 1114 ms. Remains 806 /1001 variables (removed 195) and now considering 1044/1246 (removed 202) transitions.
// Phase 1: matrix 1044 rows 806 cols
[2025-06-04 15:53:05] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:53:05] [INFO ] Implicit Places using invariants in 757 ms returned []
[2025-06-04 15:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:53:07] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2025-06-04 15:53:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/1850 variables, and 0 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 1043/1043 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1043 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 805/1850 variables, and 0 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 0/1043 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Starting structural reductions in LTL mode, iteration 1 : 806/1001 places, 1044/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63502 ms. Remains : 806/1001 places, 1044/1246 transitions.
[2025-06-04 15:54:07] [INFO ] Flatten gal took : 33 ms
[2025-06-04 15:54:07] [INFO ] Flatten gal took : 36 ms
[2025-06-04 15:54:07] [INFO ] Input system was already deterministic with 1044 transitions.
[2025-06-04 15:54:07] [INFO ] Flatten gal took : 34 ms
[2025-06-04 15:54:07] [INFO ] Flatten gal took : 44 ms
[2025-06-04 15:54:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality693963723140393107.gal : 6 ms
[2025-06-04 15:54:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4277269678376698815.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/CTLCardinality693963723140393107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4277269678376698815.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 -...282
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.89264e+09,24.4944,451592,2,27078,5,1.35882e+06,6,0,4270,1.95946e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:54:37] [INFO ] Flatten gal took : 20 ms
[2025-06-04 15:54:37] [INFO ] Applying decomposition
[2025-06-04 15:54:37] [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/graph1915152191072745856.txt' '-o' '/tmp/graph1915152191072745856.bin' '-w' '/tmp/graph1915152191072745856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1915152191072745856.bin' '-l' '-1' '-v' '-w' '/tmp/graph1915152191072745856.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:54:37] [INFO ] Decomposing Gal with order
[2025-06-04 15:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:54:38] [INFO ] Removed a total of 858 redundant transitions.
[2025-06-04 15:54:38] [INFO ] Flatten gal took : 51 ms
[2025-06-04 15:54:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2025-06-04 15:54:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8847325176097192465.gal : 9 ms
[2025-06-04 15:54:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality5681425542034809679.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/CTLCardinality8847325176097192465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5681425542034809679.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.89264e+09,7.26536,192012,2052,13,328038,968,1250,1.04994e+06,50,3023,0


Converting to forward existential form...Done !
original formula: EG(EX((EX(AG((i17.u151.p571==1))) + (((i35.i0.i0.u315.p1180==0)||(i11.i1.i0.u105.p363==1)) * (AG(((i22.u167.p815==0)||(i19.i1.i0.u185.p66...192
=> equivalent forward existential formula: [FwdG(Init,EX((EX(!(E(TRUE U !((i17.u151.p571==1))))) + (((i35.i0.i0.u315.p1180==0)||(i11.i1.i0.u105.p363==1)) *...259
Reverse transition relation is NOT exact ! Due to transitions t32, t83, t110, t166, t220, t222, t256, t344, t346, t399, t402, t436, t463, t519, t575, t608,...570
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Graph (trivial) has 984 edges and 1001 vertex of which 74 / 1001 are part of one of the 12 SCC in 2 ms
Free SCC test removed 62 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 701 place count 938 transition count 475
Reduce places removed 700 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 711 rules applied. Total rules applied 1412 place count 238 transition count 464
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1419 place count 233 transition count 462
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1421 place count 231 transition count 462
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1421 place count 231 transition count 412
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1521 place count 181 transition count 412
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 1543 place count 159 transition count 390
Iterating global reduction 4 with 22 rules applied. Total rules applied 1565 place count 159 transition count 390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1565 place count 159 transition count 389
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1567 place count 158 transition count 389
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1576 place count 149 transition count 354
Iterating global reduction 4 with 9 rules applied. Total rules applied 1585 place count 149 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1587 place count 149 transition count 352
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1591 place count 145 transition count 348
Iterating global reduction 5 with 4 rules applied. Total rules applied 1595 place count 145 transition count 348
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1599 place count 141 transition count 344
Iterating global reduction 5 with 4 rules applied. Total rules applied 1603 place count 141 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1604 place count 141 transition count 343
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1648 place count 119 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1654 place count 119 transition count 315
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 1674 place count 99 transition count 202
Iterating global reduction 7 with 20 rules applied. Total rules applied 1694 place count 99 transition count 202
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1702 place count 99 transition count 194
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1712 place count 89 transition count 181
Iterating global reduction 8 with 10 rules applied. Total rules applied 1722 place count 89 transition count 181
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1732 place count 79 transition count 168
Iterating global reduction 8 with 10 rules applied. Total rules applied 1742 place count 79 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1748 place count 79 transition count 162
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 1750 place count 78 transition count 161
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1751 place count 77 transition count 156
Iterating global reduction 9 with 1 rules applied. Total rules applied 1752 place count 77 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1753 place count 77 transition count 155
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 1757 place count 77 transition count 151
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 1765 place count 73 transition count 147
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 1766 place count 73 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1767 place count 72 transition count 146
Applied a total of 1767 rules in 67 ms. Remains 72 /1001 variables (removed 929) and now considering 146/1246 (removed 1100) transitions.
[2025-06-04 15:55:08] [INFO ] Flow matrix only has 141 transitions (discarded 5 similar events)
// Phase 1: matrix 141 rows 72 cols
[2025-06-04 15:55:08] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:55:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-04 15:55:08] [INFO ] Flow matrix only has 141 transitions (discarded 5 similar events)
[2025-06-04 15:55:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:55:08] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:55:08] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:55:08] [INFO ] Redundant transitions in 5 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-04 15:55:08] [INFO ] Flow matrix only has 141 transitions (discarded 5 similar events)
[2025-06-04 15:55:08] [INFO ] Invariant cache hit.
[2025-06-04 15:55:08] [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/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:09] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:09] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:09] [INFO ] Deduced a trap composed of 22 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-04 15:55:10] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:10] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:10] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:10] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:10] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:10] [INFO ] Deduced a trap composed of 30 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-04 15:55:10] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:10] [INFO ] Deduced a trap composed of 23 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-04 15:55:10] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 140/212 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 1/213 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 101 constraints, problems are : Problem set: 0 solved, 136 unsolved in 12406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 140/212 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 136/236 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:55:24] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 238 constraints, problems are : Problem set: 0 solved, 136 unsolved in 20592 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33025ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 33026ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/1001 places, 146/1246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33329 ms. Remains : 72/1001 places, 146/1246 transitions.
[2025-06-04 15:55:41] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:55:41] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:55:41] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-04 15:55:41] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:55:41] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:55:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4819434655174950301.gal : 1 ms
[2025-06-04 15:55:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3426037869849336487.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/CTLCardinality4819434655174950301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3426037869849336487.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,99586,0.422373,14908,2,2887,5,36024,6,0,426,39508,0


Converting to forward existential form...Done !
original formula: EG(AG((AG(EF(((p912==0)&&(p722==1)))) * ((p1022==0)||((p941==0)&&(p887==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((!(E(TRUE U !(E(TRUE U ((p912==0)&&(p722==1)))))) * ((p1022==0)||((p941==0)&&(p887==0)))...170
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t13, t15, t16, t17, t20, t21, t22, t28, t29, t30, t48, t49, t59, t61, t70, t71, t...337
(forward)formula 0,0,5.19949,129740,1,0,322,723007,314,140,3858,415444,356
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 968 transition count 1213
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 968 transition count 1213
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 92 place count 942 transition count 1187
Iterating global reduction 0 with 26 rules applied. Total rules applied 118 place count 942 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 942 transition count 1186
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 139 place count 922 transition count 1166
Iterating global reduction 1 with 20 rules applied. Total rules applied 159 place count 922 transition count 1166
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 178 place count 903 transition count 1147
Iterating global reduction 1 with 19 rules applied. Total rules applied 197 place count 903 transition count 1147
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 213 place count 887 transition count 1131
Iterating global reduction 1 with 16 rules applied. Total rules applied 229 place count 887 transition count 1131
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 243 place count 873 transition count 1117
Iterating global reduction 1 with 14 rules applied. Total rules applied 257 place count 873 transition count 1117
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 270 place count 860 transition count 1104
Iterating global reduction 1 with 13 rules applied. Total rules applied 283 place count 860 transition count 1104
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 296 place count 847 transition count 1091
Iterating global reduction 1 with 13 rules applied. Total rules applied 309 place count 847 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 310 place count 847 transition count 1090
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 321 place count 836 transition count 1079
Iterating global reduction 2 with 11 rules applied. Total rules applied 332 place count 836 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 333 place count 836 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 340 place count 829 transition count 1071
Iterating global reduction 3 with 7 rules applied. Total rules applied 347 place count 829 transition count 1071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 348 place count 829 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 353 place count 824 transition count 1065
Iterating global reduction 4 with 5 rules applied. Total rules applied 358 place count 824 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 362 place count 820 transition count 1061
Iterating global reduction 4 with 4 rules applied. Total rules applied 366 place count 820 transition count 1061
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 370 place count 816 transition count 1057
Iterating global reduction 4 with 4 rules applied. Total rules applied 374 place count 816 transition count 1057
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 378 place count 812 transition count 1053
Iterating global reduction 4 with 4 rules applied. Total rules applied 382 place count 812 transition count 1053
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 386 place count 808 transition count 1049
Iterating global reduction 4 with 4 rules applied. Total rules applied 390 place count 808 transition count 1049
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 394 place count 804 transition count 1045
Iterating global reduction 4 with 4 rules applied. Total rules applied 398 place count 804 transition count 1045
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 402 place count 800 transition count 1041
Iterating global reduction 4 with 4 rules applied. Total rules applied 406 place count 800 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 407 place count 800 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 410 place count 797 transition count 1037
Iterating global reduction 5 with 3 rules applied. Total rules applied 413 place count 797 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 414 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 416 place count 795 transition count 1034
Iterating global reduction 6 with 2 rules applied. Total rules applied 418 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 420 place count 793 transition count 1032
Iterating global reduction 6 with 2 rules applied. Total rules applied 422 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 423 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 424 place count 792 transition count 1030
Iterating global reduction 7 with 1 rules applied. Total rules applied 425 place count 792 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 426 place count 792 transition count 1029
Applied a total of 426 rules in 1142 ms. Remains 792 /1001 variables (removed 209) and now considering 1029/1246 (removed 217) transitions.
// Phase 1: matrix 1029 rows 792 cols
[2025-06-04 15:55:47] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:55:48] [INFO ] Implicit Places using invariants in 538 ms returned []
[2025-06-04 15:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:55:49] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
Running 1028 sub problems to find dead transitions.
[2025-06-04 15:55:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 791/1821 variables, and 0 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 1028/1028 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/1821 variables, and 0 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 0/1028 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 792/1001 places, 1029/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63542 ms. Remains : 792/1001 places, 1029/1246 transitions.
[2025-06-04 15:56:50] [INFO ] Flatten gal took : 33 ms
[2025-06-04 15:56:50] [INFO ] Flatten gal took : 34 ms
[2025-06-04 15:56:50] [INFO ] Input system was already deterministic with 1029 transitions.
[2025-06-04 15:56:50] [INFO ] Flatten gal took : 34 ms
[2025-06-04 15:56:50] [INFO ] Flatten gal took : 43 ms
[2025-06-04 15:56:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15119327524351282708.gal : 6 ms
[2025-06-04 15:56:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality17154433687970916631.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/CTLCardinality15119327524351282708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17154433687970916631.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.55174e+09,23.4859,446828,2,25931,5,1.35985e+06,6,0,4199,1.93906e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 15:57:20] [INFO ] Flatten gal took : 20 ms
[2025-06-04 15:57:20] [INFO ] Applying decomposition
[2025-06-04 15:57:20] [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/graph15708602896252384088.txt' '-o' '/tmp/graph15708602896252384088.bin' '-w' '/tmp/graph15708602896252384088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15708602896252384088.bin' '-l' '-1' '-v' '-w' '/tmp/graph15708602896252384088.weights' '-q' '0' '-e' '0.001'
[2025-06-04 15:57:20] [INFO ] Decomposing Gal with order
[2025-06-04 15:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 15:57:20] [INFO ] Removed a total of 862 redundant transitions.
[2025-06-04 15:57:20] [INFO ] Flatten gal took : 46 ms
[2025-06-04 15:57:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-04 15:57:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5213378997231515341.gal : 9 ms
[2025-06-04 15:57:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality7018710362045191873.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/CTLCardinality5213378997231515341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7018710362045191873.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.55174e+09,13.103,333564,2432,15,566955,919,1211,1.8559e+06,45,2920,0


Converting to forward existential form...Done !
original formula: EF(EX(AG((AG((i18.u169.p636==0)) + ((i23.u190.p688==0)&&(i29.u262.p960==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((!(E(TRUE U !((i18.u169.p636==0)))) + ((i23.u190.p688==0)&&(i29.u262.p960==...173
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t212, t215, t249, t332, t333, t389, t423, t505, t506, t562, t595, t678, t731, t734...594
(forward)formula 0,1,24.35,439676,1,0,629664,919,10163,2.9046e+06,209,3052,2159872
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Graph (trivial) has 984 edges and 1001 vertex of which 67 / 1001 are part of one of the 11 SCC in 3 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 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 702 place count 944 transition count 481
Reduce places removed 701 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 715 rules applied. Total rules applied 1417 place count 243 transition count 467
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 1427 place count 236 transition count 464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1430 place count 233 transition count 464
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1430 place count 233 transition count 413
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1532 place count 182 transition count 413
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 1554 place count 160 transition count 391
Iterating global reduction 4 with 22 rules applied. Total rules applied 1576 place count 160 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1576 place count 160 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1578 place count 159 transition count 390
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1588 place count 149 transition count 354
Iterating global reduction 4 with 10 rules applied. Total rules applied 1598 place count 149 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1600 place count 149 transition count 352
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1604 place count 145 transition count 348
Iterating global reduction 5 with 4 rules applied. Total rules applied 1608 place count 145 transition count 348
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1612 place count 141 transition count 344
Iterating global reduction 5 with 4 rules applied. Total rules applied 1616 place count 141 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1617 place count 141 transition count 343
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1661 place count 119 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1667 place count 119 transition count 315
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 1687 place count 99 transition count 196
Iterating global reduction 7 with 20 rules applied. Total rules applied 1707 place count 99 transition count 196
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1716 place count 99 transition count 187
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1727 place count 88 transition count 173
Iterating global reduction 8 with 11 rules applied. Total rules applied 1738 place count 88 transition count 173
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1749 place count 77 transition count 159
Iterating global reduction 8 with 11 rules applied. Total rules applied 1760 place count 77 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1767 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 1769 place count 76 transition count 151
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1770 place count 75 transition count 146
Iterating global reduction 9 with 1 rules applied. Total rules applied 1771 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 1772 place count 75 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1777 place count 75 transition count 140
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 10 with 10 rules applied. Total rules applied 1787 place count 70 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1788 place count 69 transition count 134
Applied a total of 1788 rules in 78 ms. Remains 69 /1001 variables (removed 932) and now considering 134/1246 (removed 1112) transitions.
[2025-06-04 15:57:45] [INFO ] Flow matrix only has 129 transitions (discarded 5 similar events)
// Phase 1: matrix 129 rows 69 cols
[2025-06-04 15:57:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:45] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 15:57:45] [INFO ] Flow matrix only has 129 transitions (discarded 5 similar events)
[2025-06-04 15:57:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:57:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:57:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:57:45] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2025-06-04 15:57:45] [INFO ] Flow matrix only has 129 transitions (discarded 5 similar events)
[2025-06-04 15:57:45] [INFO ] Invariant cache hit.
[2025-06-04 15:57:45] [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/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:46] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:47] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:48] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:48] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:48] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 128/197 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 98 constraints, problems are : Problem set: 0 solved, 126 unsolved in 12993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:57:59] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 128/197 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 126/224 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:02] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 1/198 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:12] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/198 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (OVERLAPS) 0/198 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 227 constraints, problems are : Problem set: 0 solved, 126 unsolved in 24915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37932ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 37933ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/1001 places, 134/1246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38228 ms. Remains : 69/1001 places, 134/1246 transitions.
[2025-06-04 15:58:23] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:58:23] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:58:23] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-04 15:58:23] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:58:23] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:58:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7220433910933093960.gal : 1 ms
[2025-06-04 15:58:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8131238363784354759.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/CTLCardinality7220433910933093960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8131238363784354759.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,83758,0.250162,12192,2,2603,5,27868,6,0,402,28194,0


Converting to forward existential form...Done !
original formula: (AG(EF(((p65==1)||(p1017==1)))) * AF(((p1207==0)||(p989==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((p65==1)||(p1017==1)))))] = FALSE * [FwdG(Init,!(((p1207==0)||(p989==1))))] = F...160
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t14, t15, t16, t19, t20, t21, t27, t28, t29, t48, t49, t56, t68, t69, t70, t8...331
(forward)formula 0,0,3.86127,98124,1,0,293,522721,293,125,3504,335838,311
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Graph (trivial) has 977 edges and 1001 vertex of which 74 / 1001 are part of one of the 12 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 696 place count 938 transition count 480
Reduce places removed 695 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 706 rules applied. Total rules applied 1402 place count 243 transition count 469
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 1411 place count 238 transition count 465
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1415 place count 234 transition count 465
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1415 place count 234 transition count 417
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1511 place count 186 transition count 417
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1532 place count 165 transition count 396
Iterating global reduction 4 with 21 rules applied. Total rules applied 1553 place count 165 transition count 396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1553 place count 165 transition count 395
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1555 place count 164 transition count 395
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1564 place count 155 transition count 360
Iterating global reduction 4 with 9 rules applied. Total rules applied 1573 place count 155 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1575 place count 155 transition count 358
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1579 place count 151 transition count 354
Iterating global reduction 5 with 4 rules applied. Total rules applied 1583 place count 151 transition count 354
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1587 place count 147 transition count 350
Iterating global reduction 5 with 4 rules applied. Total rules applied 1591 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1592 place count 147 transition count 349
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1638 place count 124 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1643 place count 124 transition count 321
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 1664 place count 103 transition count 200
Iterating global reduction 7 with 21 rules applied. Total rules applied 1685 place count 103 transition count 200
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1693 place count 103 transition count 192
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1704 place count 92 transition count 178
Iterating global reduction 8 with 11 rules applied. Total rules applied 1715 place count 92 transition count 178
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1726 place count 81 transition count 164
Iterating global reduction 8 with 11 rules applied. Total rules applied 1737 place count 81 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1744 place count 81 transition count 157
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 1746 place count 80 transition count 156
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1747 place count 79 transition count 151
Iterating global reduction 9 with 1 rules applied. Total rules applied 1748 place count 79 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1749 place count 79 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1754 place count 79 transition count 145
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 1762 place count 75 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1763 place count 74 transition count 140
Applied a total of 1763 rules in 60 ms. Remains 74 /1001 variables (removed 927) and now considering 140/1246 (removed 1106) transitions.
[2025-06-04 15:58:27] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
// Phase 1: matrix 135 rows 74 cols
[2025-06-04 15:58:27] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:58:27] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 15:58:27] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2025-06-04 15:58:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:58:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 15:58:27] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:58:27] [INFO ] Redundant transitions in 2 ms returned []
Running 131 sub problems to find dead transitions.
[2025-06-04 15:58:27] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2025-06-04 15:58:27] [INFO ] Invariant cache hit.
[2025-06-04 15:58:27] [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/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 4/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:29] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:29] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:29] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:29] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:29] [INFO ] Deduced a trap composed of 20 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-04 15:58:29] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:29] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:29] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:30] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:30] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/208 variables, 74/86 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/209 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:38] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 9 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/209 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 102 constraints, problems are : Problem set: 0 solved, 131 unsolved in 17453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 4/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/208 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 131/232 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:58:48] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 1/209 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 234 constraints, problems are : Problem set: 0 solved, 131 unsolved in 18892 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36382ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 36383ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/1001 places, 140/1246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36698 ms. Remains : 74/1001 places, 140/1246 transitions.
[2025-06-04 15:59:04] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:59:04] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:59:04] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-04 15:59:04] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:59:04] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:59:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11407518305041587785.gal : 1 ms
[2025-06-04 15:59:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality3997200042708163071.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/CTLCardinality11407518305041587785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3997200042708163071.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,124376,0.46506,15228,2,3147,5,40022,6,0,428,41641,0


Converting to forward existential form...Done !
original formula: EG((EG(((AG((p105==0)) * (p398==0)) * (p952==1))) + !(E(AG((((p1122==0)||(p91==1))||(p481==0))) U (p975!=0)))))
=> equivalent forward existential formula: [FwdG(Init,(EG(((!(E(TRUE U !((p105==0)))) * (p398==0)) * (p952==1))) + !(E(!(E(TRUE U !((((p1122==0)||(p91==1))...196
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t7, t15, t16, t17, t20, t23, t24, t30, t31, t32, t55, t56, t63, t64, t73, t74, t75, t...337
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,13.3779,311084,1,0,492,1.66224e+06,316,258,3849,1.31609e+06,505
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 968 transition count 1213
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 968 transition count 1213
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 92 place count 942 transition count 1187
Iterating global reduction 0 with 26 rules applied. Total rules applied 118 place count 942 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 942 transition count 1186
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 137 place count 924 transition count 1168
Iterating global reduction 1 with 18 rules applied. Total rules applied 155 place count 924 transition count 1168
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 173 place count 906 transition count 1150
Iterating global reduction 1 with 18 rules applied. Total rules applied 191 place count 906 transition count 1150
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 206 place count 891 transition count 1135
Iterating global reduction 1 with 15 rules applied. Total rules applied 221 place count 891 transition count 1135
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 234 place count 878 transition count 1122
Iterating global reduction 1 with 13 rules applied. Total rules applied 247 place count 878 transition count 1122
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 259 place count 866 transition count 1110
Iterating global reduction 1 with 12 rules applied. Total rules applied 271 place count 866 transition count 1110
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 282 place count 855 transition count 1099
Iterating global reduction 1 with 11 rules applied. Total rules applied 293 place count 855 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 294 place count 855 transition count 1098
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 303 place count 846 transition count 1089
Iterating global reduction 2 with 9 rules applied. Total rules applied 312 place count 846 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 846 transition count 1088
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 318 place count 841 transition count 1083
Iterating global reduction 3 with 5 rules applied. Total rules applied 323 place count 841 transition count 1083
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 841 transition count 1082
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 327 place count 838 transition count 1079
Iterating global reduction 4 with 3 rules applied. Total rules applied 330 place count 838 transition count 1079
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 333 place count 835 transition count 1076
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 835 transition count 1076
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 339 place count 832 transition count 1073
Iterating global reduction 4 with 3 rules applied. Total rules applied 342 place count 832 transition count 1073
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 345 place count 829 transition count 1070
Iterating global reduction 4 with 3 rules applied. Total rules applied 348 place count 829 transition count 1070
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 351 place count 826 transition count 1067
Iterating global reduction 4 with 3 rules applied. Total rules applied 354 place count 826 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 357 place count 823 transition count 1064
Iterating global reduction 4 with 3 rules applied. Total rules applied 360 place count 823 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 362 place count 821 transition count 1062
Iterating global reduction 4 with 2 rules applied. Total rules applied 364 place count 821 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 366 place count 819 transition count 1060
Iterating global reduction 4 with 2 rules applied. Total rules applied 368 place count 819 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 369 place count 819 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 370 place count 818 transition count 1058
Iterating global reduction 5 with 1 rules applied. Total rules applied 371 place count 818 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 372 place count 817 transition count 1057
Iterating global reduction 5 with 1 rules applied. Total rules applied 373 place count 817 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 374 place count 817 transition count 1056
Applied a total of 374 rules in 727 ms. Remains 817 /1001 variables (removed 184) and now considering 1056/1246 (removed 190) transitions.
// Phase 1: matrix 1056 rows 817 cols
[2025-06-04 15:59:18] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:59:18] [INFO ] Implicit Places using invariants in 523 ms returned []
[2025-06-04 15:59:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:59:20] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
Running 1055 sub problems to find dead transitions.
[2025-06-04 15:59:20] [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 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 816/1873 variables, and 0 constraints, problems are : Problem set: 0 solved, 1055 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 1055/1055 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1055 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/1873 variables, and 0 constraints, problems are : Problem set: 0 solved, 1055 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/1055 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 1055 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Starting structural reductions in LTL mode, iteration 1 : 817/1001 places, 1056/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63002 ms. Remains : 817/1001 places, 1056/1246 transitions.
[2025-06-04 16:00:20] [INFO ] Flatten gal took : 33 ms
[2025-06-04 16:00:20] [INFO ] Flatten gal took : 34 ms
[2025-06-04 16:00:20] [INFO ] Input system was already deterministic with 1056 transitions.
[2025-06-04 16:00:20] [INFO ] Flatten gal took : 34 ms
[2025-06-04 16:00:20] [INFO ] Flatten gal took : 34 ms
[2025-06-04 16:00:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8254148453487745239.gal : 7 ms
[2025-06-04 16:00:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11915852845323692546.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/CTLCardinality8254148453487745239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11915852845323692546.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.04036e+10,25.0584,499968,2,33103,5,1.63044e+06,6,0,4326,2.14263e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:00:50] [INFO ] Flatten gal took : 21 ms
[2025-06-04 16:00:50] [INFO ] Applying decomposition
[2025-06-04 16:00:50] [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/graph18152532303107395701.txt' '-o' '/tmp/graph18152532303107395701.bin' '-w' '/tmp/graph18152532303107395701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18152532303107395701.bin' '-l' '-1' '-v' '-w' '/tmp/graph18152532303107395701.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:00:51] [INFO ] Decomposing Gal with order
[2025-06-04 16:00:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:00:51] [INFO ] Removed a total of 861 redundant transitions.
[2025-06-04 16:00:51] [INFO ] Flatten gal took : 46 ms
[2025-06-04 16:00:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-04 16:00:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality16971797553796298753.gal : 10 ms
[2025-06-04 16:00:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality15452536446838407739.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/CTLCardinality16971797553796298753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15452536446838407739.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.04036e+10,5.68635,162040,2211,15,286185,893,1264,812866,52,2675,0


Converting to forward existential form...Done !
original formula: AG((AG(EF(((i2.i0.i0.u13.p33==0)||(i30.i0.i0.u266.p960==1)))) + (AG(AX((i24.u228.p807==0))) * (!(E(EF((i19.i0.i1.u175.p638==1)) U ((i28.i...286
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(Init,TRUE) * !(!(E(TRUE U !(E(TRUE U ((i2.i0.i0.u13.p33==0)||(i30.i0.i0.u266.p960==1)))))))),TR...488
Reverse transition relation is NOT exact ! Due to transitions t76, t110, t166, t222, t256, t289, t401, t435, t517, t518, t574, t607, t697, t698, t754, t774...628
(forward)formula 0,1,17.8573,421112,1,0,582784,929,9937,2.7986e+06,238,3829,2229146
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 968 transition count 1213
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 968 transition count 1213
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 92 place count 942 transition count 1187
Iterating global reduction 0 with 26 rules applied. Total rules applied 118 place count 942 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 942 transition count 1186
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 138 place count 923 transition count 1167
Iterating global reduction 1 with 19 rules applied. Total rules applied 157 place count 923 transition count 1167
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 174 place count 906 transition count 1150
Iterating global reduction 1 with 17 rules applied. Total rules applied 191 place count 906 transition count 1150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 205 place count 892 transition count 1136
Iterating global reduction 1 with 14 rules applied. Total rules applied 219 place count 892 transition count 1136
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 231 place count 880 transition count 1124
Iterating global reduction 1 with 12 rules applied. Total rules applied 243 place count 880 transition count 1124
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 255 place count 868 transition count 1112
Iterating global reduction 1 with 12 rules applied. Total rules applied 267 place count 868 transition count 1112
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 279 place count 856 transition count 1100
Iterating global reduction 1 with 12 rules applied. Total rules applied 291 place count 856 transition count 1100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 292 place count 856 transition count 1099
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 302 place count 846 transition count 1089
Iterating global reduction 2 with 10 rules applied. Total rules applied 312 place count 846 transition count 1089
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 319 place count 839 transition count 1082
Iterating global reduction 2 with 7 rules applied. Total rules applied 326 place count 839 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 839 transition count 1081
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 332 place count 834 transition count 1076
Iterating global reduction 3 with 5 rules applied. Total rules applied 337 place count 834 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 341 place count 830 transition count 1072
Iterating global reduction 3 with 4 rules applied. Total rules applied 345 place count 830 transition count 1072
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 349 place count 826 transition count 1068
Iterating global reduction 3 with 4 rules applied. Total rules applied 353 place count 826 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 357 place count 822 transition count 1064
Iterating global reduction 3 with 4 rules applied. Total rules applied 361 place count 822 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 365 place count 818 transition count 1060
Iterating global reduction 3 with 4 rules applied. Total rules applied 369 place count 818 transition count 1060
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 373 place count 814 transition count 1056
Iterating global reduction 3 with 4 rules applied. Total rules applied 377 place count 814 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 381 place count 810 transition count 1052
Iterating global reduction 3 with 4 rules applied. Total rules applied 385 place count 810 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 386 place count 810 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 389 place count 807 transition count 1048
Iterating global reduction 4 with 3 rules applied. Total rules applied 392 place count 807 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 393 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 395 place count 805 transition count 1045
Iterating global reduction 5 with 2 rules applied. Total rules applied 397 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 399 place count 803 transition count 1043
Iterating global reduction 5 with 2 rules applied. Total rules applied 401 place count 803 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 402 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 403 place count 802 transition count 1041
Iterating global reduction 6 with 1 rules applied. Total rules applied 404 place count 802 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 405 place count 802 transition count 1040
Applied a total of 405 rules in 1073 ms. Remains 802 /1001 variables (removed 199) and now considering 1040/1246 (removed 206) transitions.
// Phase 1: matrix 1040 rows 802 cols
[2025-06-04 16:01:10] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:01:10] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-06-04 16:01:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:01:11] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
Running 1039 sub problems to find dead transitions.
[2025-06-04 16:01:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 801/1842 variables, and 0 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/1842 variables, and 0 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 0/1039 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 802/1001 places, 1040/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63277 ms. Remains : 802/1001 places, 1040/1246 transitions.
[2025-06-04 16:02:12] [INFO ] Flatten gal took : 32 ms
[2025-06-04 16:02:12] [INFO ] Flatten gal took : 34 ms
[2025-06-04 16:02:12] [INFO ] Input system was already deterministic with 1040 transitions.
[2025-06-04 16:02:12] [INFO ] Flatten gal took : 33 ms
[2025-06-04 16:02:12] [INFO ] Flatten gal took : 33 ms
[2025-06-04 16:02:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality3488593461489766965.gal : 7 ms
[2025-06-04 16:02:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality10466349142140694320.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/CTLCardinality3488593461489766965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10466349142140694320.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.79208e+09,24.0042,476872,2,29814,5,1.52556e+06,6,0,4250,2.05038e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:02:42] [INFO ] Flatten gal took : 20 ms
[2025-06-04 16:02:42] [INFO ] Applying decomposition
[2025-06-04 16:02:42] [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/graph6521107692904470503.txt' '-o' '/tmp/graph6521107692904470503.bin' '-w' '/tmp/graph6521107692904470503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6521107692904470503.bin' '-l' '-1' '-v' '-w' '/tmp/graph6521107692904470503.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:02:42] [INFO ] Decomposing Gal with order
[2025-06-04 16:02:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:02:42] [INFO ] Removed a total of 864 redundant transitions.
[2025-06-04 16:02:42] [INFO ] Flatten gal took : 88 ms
[2025-06-04 16:02:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 16 ms.
[2025-06-04 16:02:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14850601345286720518.gal : 13 ms
[2025-06-04 16:02:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality6952775097799429736.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/CTLCardinality14850601345286720518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6952775097799429736.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.79208e+09,6.97238,194444,2102,15,340014,977,1323,1.02644e+06,45,2888,0


Converting to forward existential form...Done !
original formula: A(EF(EX((i24.i1.i2.u226.p816==0))) U EG(EF(AX(AG((i24.i1.i3.u236.p881==0))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U !(EX(!(!(E(TRUE U !((i24.i1.i3.u236.p881==0))))))))))))) * !(E(!(EG(E(TRUE U !(EX(!...331
Reverse transition relation is NOT exact ! Due to transitions t76, t159, t215, t254, t343, t396, t399, t433, t516, t572, t605, t687, t688, t744, t764, t765...598
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 967 transition count 1212
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 967 transition count 1212
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 95 place count 940 transition count 1185
Iterating global reduction 0 with 27 rules applied. Total rules applied 122 place count 940 transition count 1185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 940 transition count 1184
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 143 place count 920 transition count 1164
Iterating global reduction 1 with 20 rules applied. Total rules applied 163 place count 920 transition count 1164
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 182 place count 901 transition count 1145
Iterating global reduction 1 with 19 rules applied. Total rules applied 201 place count 901 transition count 1145
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 217 place count 885 transition count 1129
Iterating global reduction 1 with 16 rules applied. Total rules applied 233 place count 885 transition count 1129
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 247 place count 871 transition count 1115
Iterating global reduction 1 with 14 rules applied. Total rules applied 261 place count 871 transition count 1115
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 274 place count 858 transition count 1102
Iterating global reduction 1 with 13 rules applied. Total rules applied 287 place count 858 transition count 1102
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 300 place count 845 transition count 1089
Iterating global reduction 1 with 13 rules applied. Total rules applied 313 place count 845 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 314 place count 845 transition count 1088
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 325 place count 834 transition count 1077
Iterating global reduction 2 with 11 rules applied. Total rules applied 336 place count 834 transition count 1077
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 834 transition count 1076
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 344 place count 827 transition count 1069
Iterating global reduction 3 with 7 rules applied. Total rules applied 351 place count 827 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 827 transition count 1068
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 357 place count 822 transition count 1063
Iterating global reduction 4 with 5 rules applied. Total rules applied 362 place count 822 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 366 place count 818 transition count 1059
Iterating global reduction 4 with 4 rules applied. Total rules applied 370 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 374 place count 814 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 378 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 382 place count 810 transition count 1051
Iterating global reduction 4 with 4 rules applied. Total rules applied 386 place count 810 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 390 place count 806 transition count 1047
Iterating global reduction 4 with 4 rules applied. Total rules applied 394 place count 806 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 398 place count 802 transition count 1043
Iterating global reduction 4 with 4 rules applied. Total rules applied 402 place count 802 transition count 1043
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 406 place count 798 transition count 1039
Iterating global reduction 4 with 4 rules applied. Total rules applied 410 place count 798 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 411 place count 798 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 414 place count 795 transition count 1035
Iterating global reduction 5 with 3 rules applied. Total rules applied 417 place count 795 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 418 place count 795 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 419 place count 794 transition count 1033
Iterating global reduction 6 with 1 rules applied. Total rules applied 420 place count 794 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 421 place count 793 transition count 1032
Iterating global reduction 6 with 1 rules applied. Total rules applied 422 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 423 place count 793 transition count 1031
Applied a total of 423 rules in 989 ms. Remains 793 /1001 variables (removed 208) and now considering 1031/1246 (removed 215) transitions.
// Phase 1: matrix 1031 rows 793 cols
[2025-06-04 16:03:14] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:03:14] [INFO ] Implicit Places using invariants in 781 ms returned []
[2025-06-04 16:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:03:16] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
Running 1030 sub problems to find dead transitions.
[2025-06-04 16:03:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 792/1824 variables, and 0 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/793 constraints, PredecessorRefiner: 1030/1030 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1030 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 792/1824 variables, and 0 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/793 constraints, PredecessorRefiner: 0/1030 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 793/1001 places, 1031/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63614 ms. Remains : 793/1001 places, 1031/1246 transitions.
[2025-06-04 16:04:16] [INFO ] Flatten gal took : 32 ms
[2025-06-04 16:04:16] [INFO ] Flatten gal took : 34 ms
[2025-06-04 16:04:16] [INFO ] Input system was already deterministic with 1031 transitions.
[2025-06-04 16:04:16] [INFO ] Flatten gal took : 34 ms
[2025-06-04 16:04:16] [INFO ] Flatten gal took : 35 ms
[2025-06-04 16:04:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality16477835475668072609.gal : 7 ms
[2025-06-04 16:04:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality10485901719823994503.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/CTLCardinality16477835475668072609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10485901719823994503.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.61067e+09,24.8713,455744,2,27373,5,1.38128e+06,6,0,4205,1.94145e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:04:46] [INFO ] Flatten gal took : 20 ms
[2025-06-04 16:04:46] [INFO ] Applying decomposition
[2025-06-04 16:04:46] [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/graph17639854924176606286.txt' '-o' '/tmp/graph17639854924176606286.bin' '-w' '/tmp/graph17639854924176606286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17639854924176606286.bin' '-l' '-1' '-v' '-w' '/tmp/graph17639854924176606286.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:04:47] [INFO ] Decomposing Gal with order
[2025-06-04 16:04:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:04:47] [INFO ] Removed a total of 863 redundant transitions.
[2025-06-04 16:04:47] [INFO ] Flatten gal took : 46 ms
[2025-06-04 16:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-04 16:04:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18003240194714861508.gal : 8 ms
[2025-06-04 16:04:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality6341130073184055979.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/CTLCardinality18003240194714861508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6341130073184055979.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.61067e+09,6.66691,176176,2356,17,302318,930,1286,937462,51,2831,0


Converting to forward existential form...Done !
original formula: EX(AF(!(A(!(((i4.u39.p112==1)||(i23.u228.p841==1))) U ((i31.u290.p1032==0)||(i18.u177.p644==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(!((E(!(((i31.u290.p1032==0)||(i18.u177.p644==1))) U (!(!(((i4.u39.p112==1)||(i23.u228.p841...279
Reverse transition relation is NOT exact ! Due to transitions t76, t103, t215, t249, t336, t392, t426, t509, t562, t565, t598, t679, t681, t737, t757, t758...597
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 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 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1246/1246 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 971 transition count 1216
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 971 transition count 1216
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 86 place count 945 transition count 1190
Iterating global reduction 0 with 26 rules applied. Total rules applied 112 place count 945 transition count 1190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 945 transition count 1189
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 131 place count 927 transition count 1171
Iterating global reduction 1 with 18 rules applied. Total rules applied 149 place count 927 transition count 1171
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 166 place count 910 transition count 1154
Iterating global reduction 1 with 17 rules applied. Total rules applied 183 place count 910 transition count 1154
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 197 place count 896 transition count 1140
Iterating global reduction 1 with 14 rules applied. Total rules applied 211 place count 896 transition count 1140
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 223 place count 884 transition count 1128
Iterating global reduction 1 with 12 rules applied. Total rules applied 235 place count 884 transition count 1128
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 247 place count 872 transition count 1116
Iterating global reduction 1 with 12 rules applied. Total rules applied 259 place count 872 transition count 1116
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 271 place count 860 transition count 1104
Iterating global reduction 1 with 12 rules applied. Total rules applied 283 place count 860 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 284 place count 860 transition count 1103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 294 place count 850 transition count 1093
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 850 transition count 1093
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 843 transition count 1086
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 843 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 319 place count 843 transition count 1085
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 324 place count 838 transition count 1080
Iterating global reduction 3 with 5 rules applied. Total rules applied 329 place count 838 transition count 1080
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 333 place count 834 transition count 1076
Iterating global reduction 3 with 4 rules applied. Total rules applied 337 place count 834 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 341 place count 830 transition count 1072
Iterating global reduction 3 with 4 rules applied. Total rules applied 345 place count 830 transition count 1072
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 349 place count 826 transition count 1068
Iterating global reduction 3 with 4 rules applied. Total rules applied 353 place count 826 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 357 place count 822 transition count 1064
Iterating global reduction 3 with 4 rules applied. Total rules applied 361 place count 822 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 365 place count 818 transition count 1060
Iterating global reduction 3 with 4 rules applied. Total rules applied 369 place count 818 transition count 1060
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 373 place count 814 transition count 1056
Iterating global reduction 3 with 4 rules applied. Total rules applied 377 place count 814 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 378 place count 814 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 381 place count 811 transition count 1052
Iterating global reduction 4 with 3 rules applied. Total rules applied 384 place count 811 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 387 place count 809 transition count 1049
Iterating global reduction 5 with 2 rules applied. Total rules applied 389 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 391 place count 807 transition count 1047
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 807 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 394 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 806 transition count 1045
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 806 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 397 place count 806 transition count 1044
Applied a total of 397 rules in 793 ms. Remains 806 /1001 variables (removed 195) and now considering 1044/1246 (removed 202) transitions.
// Phase 1: matrix 1044 rows 806 cols
[2025-06-04 16:05:17] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:05:18] [INFO ] Implicit Places using invariants in 630 ms returned []
[2025-06-04 16:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:05:19] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2025-06-04 16:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/1850 variables, and 0 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 1043/1043 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1043 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 805/1850 variables, and 0 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 0/1043 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in LTL mode, iteration 1 : 806/1001 places, 1044/1246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63110 ms. Remains : 806/1001 places, 1044/1246 transitions.
[2025-06-04 16:06:20] [INFO ] Flatten gal took : 32 ms
[2025-06-04 16:06:20] [INFO ] Flatten gal took : 35 ms
[2025-06-04 16:06:20] [INFO ] Input system was already deterministic with 1044 transitions.
[2025-06-04 16:06:20] [INFO ] Flatten gal took : 33 ms
[2025-06-04 16:06:20] [INFO ] Flatten gal took : 35 ms
[2025-06-04 16:06:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6335834229074647342.gal : 6 ms
[2025-06-04 16:06:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality15255649147055042857.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/CTLCardinality6335834229074647342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15255649147055042857.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.91621e+09,26.2607,499352,2,28736,5,1.53084e+06,6,0,4270,2.20633e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 16:06:50] [INFO ] Flatten gal took : 20 ms
[2025-06-04 16:06:50] [INFO ] Applying decomposition
[2025-06-04 16:06:50] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11952767721639256876.txt' '-o' '/tmp/graph11952767721639256876.bin' '-w' '/tmp/graph11952767721639256876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11952767721639256876.bin' '-l' '-1' '-v' '-w' '/tmp/graph11952767721639256876.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:06:50] [INFO ] Decomposing Gal with order
[2025-06-04 16:06:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:06:50] [INFO ] Removed a total of 866 redundant transitions.
[2025-06-04 16:06:50] [INFO ] Flatten gal took : 42 ms
[2025-06-04 16:06:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-04 16:06:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality5427835413786074835.gal : 8 ms
[2025-06-04 16:06:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality9315968020944141331.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/CTLCardinality5427835413786074835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9315968020944141331.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.91621e+09,8.70174,243648,2133,17,417418,1078,1305,1.34503e+06,42,3210,0


Converting to forward existential form...Done !
original formula: ((AG(EF(((i15.i1.i1.u342.p1229!=0)&&(i28.u279.p974!=1)))) + EF(!(E(((i9.u114.p388==0)||(i11.u109.p369==1)) U AG((i22.i1.i0.u233.p813==1))...323
=> equivalent forward existential formula: [FwdG(((Init * !((!(E(TRUE U !(E(TRUE U ((i15.i1.i1.u342.p1229!=0)&&(i28.u279.p974!=1)))))) + E(TRUE U !(E(((i9....440
Reverse transition relation is NOT exact ! Due to transitions t24, t77, t161, t162, t216, t218, t255, t345, t401, t435, t462, t574, t607, t690, t691, t747,...605
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 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 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
(forward)formula 0,1,28.8584,710152,1,0,820951,1078,11078,5.80344e+06,217,4026,2671259
FORMULA StigmergyCommit-PT-03b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-04 16:07:19] [INFO ] Flatten gal took : 23 ms
[2025-06-04 16:07:19] [INFO ] Flatten gal took : 23 ms
[2025-06-04 16:07:19] [INFO ] Applying decomposition
[2025-06-04 16:07:19] [INFO ] Flatten gal took : 23 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/graph7187750644587927473.txt' '-o' '/tmp/graph7187750644587927473.bin' '-w' '/tmp/graph7187750644587927473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7187750644587927473.bin' '-l' '-1' '-v' '-w' '/tmp/graph7187750644587927473.weights' '-q' '0' '-e' '0.001'
[2025-06-04 16:07:19] [INFO ] Decomposing Gal with order
[2025-06-04 16:07:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:07:20] [INFO ] Removed a total of 901 redundant transitions.
[2025-06-04 16:07:20] [INFO ] Flatten gal took : 48 ms
[2025-06-04 16:07:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2025-06-04 16:07:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5655445976610740120.gal : 9 ms
[2025-06-04 16:07:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1808253356678085108.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/CTLCardinality5655445976610740120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1808253356678085108.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 7 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.87778e+10,35.0754,854524,2884,17,1.60186e+06,1705,1503,4.19885e+06,55,5914,0


Converting to forward existential form...Done !
original formula: A((!(E(EX(((i20.i1.i1.u213.p648==0)||(i42.i0.i1.u397.p1186==1))) U E(((i2.u37.p95==0)||(i16.u180.p563==1)) U ((i32.u324.p964==0)||(i9.u98...367
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((i9.u148.p451==1)))))))) * !(E(!(!(EG(!((i9.u148.p451==1))))) U (!((!(E(EX(((i20.i1.i1.u...641
Reverse transition relation is NOT exact ! Due to transitions t26, t27, t36, t37, t38, t89, t208, t209, t265, t269, t307, t429, t521, t531, t640, t641, t69...689
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found 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 a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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
Fast SCC detection found an SCC at level 43
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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
Fast SCC detection found an SCC at level 43
ITS-tools command line returned an error code 139
[2025-06-04 16:26:02] [INFO ] Applying decomposition
[2025-06-04 16:26:02] [INFO ] Flatten gal took : 23 ms
[2025-06-04 16:26:02] [INFO ] Decomposing Gal with order
[2025-06-04 16:26:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 16:26:02] [INFO ] Removed a total of 757 redundant transitions.
[2025-06-04 16:26:02] [INFO ] Flatten gal took : 54 ms
[2025-06-04 16:26:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 9 ms.
[2025-06-04 16:26:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16558579036636165125.gal : 5 ms
[2025-06-04 16:26:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality15645561200296693784.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/CTLCardinality16558579036636165125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15645561200296693784.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 7 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.87778e+10,3.47742,88280,109,6722,6673,187636,140,23790,1965,1.22606e+06,0


Converting to forward existential form...Done !
original formula: A((!(E(EX(((i0.i0.u6.p648==0)||(i0.u7.p1186==1))) U E(((i0.i0.i0.u4.p95==0)||(i0.i0.i0.u5.p563==1)) U ((i0.u7.p964==0)||(i0.i0.i0.u5.p312...348
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((i0.i0.i0.u5.p451==1)))))))) * !(E(!(!(EG(!((i0.i0.i0.u5.p451==1))))) U (!((!(E(EX(((i0....618
Reverse transition relation is NOT exact ! Due to transitions t958, i0.u7.t36, i0.u7.t37, i0.u7.t38, i0.u7.t89, i0.u7.t90, i0.u7.t124, i0.u7.t151, i0.u7.t2...1024

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="StigmergyCommit-PT-03b"
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 StigmergyCommit-PT-03b, 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 r226-smll-174903490500025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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