Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900185.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 StigmergyElection-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-174903490900185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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.8K 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 117K 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 StigmergyElection-PT-03b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-15
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-00
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-01
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-02
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-03
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-04
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-05
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-06
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-07
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-08
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-09
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-10
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749136131976

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 15:08:54] [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-05 15:08:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:08:55] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2025-06-05 15:08:55] [INFO ] Transformed 427 places.
[2025-06-05 15:08:55] [INFO ] Transformed 518 transitions.
[2025-06-05 15:08:55] [INFO ] Found NUPN structural information;
[2025-06-05 15:08:55] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 385 transition count 476
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 385 transition count 476
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 104 place count 365 transition count 456
Iterating global reduction 0 with 20 rules applied. Total rules applied 124 place count 365 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 363 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 363 transition count 454
Applied a total of 128 rules in 186 ms. Remains 363 /427 variables (removed 64) and now considering 454/518 (removed 64) transitions.
// Phase 1: matrix 454 rows 363 cols
[2025-06-05 15:08:55] [INFO ] Computed 4 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:08:56] [INFO ] Implicit Places using invariants in 687 ms returned []
[2025-06-05 15:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:08:57] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2025-06-05 15:08:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:13] [INFO ] Deduced a trap composed of 171 places in 329 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:14] [INFO ] Deduced a trap composed of 171 places in 387 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:14] [INFO ] Deduced a trap composed of 172 places in 411 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:15] [INFO ] Deduced a trap composed of 167 places in 346 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:15] [INFO ] Deduced a trap composed of 168 places in 300 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:16] [INFO ] Deduced a trap composed of 170 places in 329 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:18] [INFO ] Deduced a trap composed of 171 places in 374 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:19] [INFO ] Deduced a trap composed of 175 places in 265 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:22] [INFO ] Deduced a trap composed of 171 places in 434 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:22] [INFO ] Deduced a trap composed of 171 places in 402 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:23] [INFO ] Deduced a trap composed of 171 places in 355 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:23] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:23] [INFO ] Deduced a trap composed of 169 places in 272 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:25] [INFO ] Deduced a trap composed of 174 places in 434 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:25] [INFO ] Deduced a trap composed of 176 places in 351 ms of which 106 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/817 variables, and 19 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:36] [INFO ] Deduced a trap composed of 174 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:36] [INFO ] Deduced a trap composed of 177 places in 251 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:37] [INFO ] Deduced a trap composed of 173 places in 309 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:38] [INFO ] Deduced a trap composed of 179 places in 267 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:43] [INFO ] Deduced a trap composed of 172 places in 318 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/817 variables, and 24 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60449ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Starting structural reductions in LTL mode, iteration 1 : 363/427 places, 454/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62298 ms. Remains : 363/427 places, 454/518 transitions.
Support contains 78 out of 363 places after structural reductions.
[2025-06-05 15:09:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 15:09:58] [INFO ] Flatten gal took : 128 ms
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 15:09:58] [INFO ] Flatten gal took : 60 ms
[2025-06-05 15:09:58] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 72 out of 363 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (536 resets) in 4279 ms. (9 steps per ms) remains 12/44 properties
BEST_FIRST walk for 40003 steps (173 resets) in 358 ms. (111 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40002 steps (99 resets) in 324 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (166 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (164 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (158 resets) in 125 ms. (317 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (165 resets) in 71 ms. (555 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (165 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
[2025-06-05 15:10:00] [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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 350/363 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 454/817 variables, 363/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/817 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 367 constraints, problems are : Problem set: 0 solved, 4 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 350/363 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:01] [INFO ] Deduced a trap composed of 167 places in 353 ms of which 112 ms to minimize.
Problem AtomicPropp13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:01] [INFO ] Deduced a trap composed of 168 places in 321 ms of which 85 ms to minimize.
Problem AtomicPropp30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:01] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:02] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 454/817 variables, 363/371 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 2/373 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/373 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/817 variables, 0/373 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 373 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2634ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 250 ms.
Support contains 5 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 454/454 transitions.
Graph (trivial) has 362 edges and 363 vertex of which 52 / 363 are part of one of the 9 SCC in 6 ms
Free SCC test removed 43 places
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 527 edges and 320 vertex of which 314 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 224 rules applied. Total rules applied 226 place count 314 transition count 170
Reduce places removed 221 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 231 rules applied. Total rules applied 457 place count 93 transition count 160
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 464 place count 88 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 466 place count 86 transition count 158
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 466 place count 86 transition count 146
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 490 place count 74 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 494 place count 70 transition count 142
Iterating global reduction 4 with 4 rules applied. Total rules applied 498 place count 70 transition count 142
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 498 place count 70 transition count 140
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 502 place count 68 transition count 140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 503 place count 67 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 504 place count 67 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 505 place count 67 transition count 130
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 529 place count 55 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 533 place count 55 transition count 114
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 541 place count 47 transition count 80
Iterating global reduction 6 with 8 rules applied. Total rules applied 549 place count 47 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 553 place count 47 transition count 76
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 554 place count 46 transition count 75
Iterating global reduction 7 with 1 rules applied. Total rules applied 555 place count 46 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 561 place count 43 transition count 72
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 562 place count 42 transition count 71
Iterating global reduction 7 with 1 rules applied. Total rules applied 563 place count 42 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 569 place count 39 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 570 place count 39 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 574 place count 39 transition count 68
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 591 place count 39 transition count 51
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 611 place count 22 transition count 48
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 614 place count 19 transition count 45
Iterating global reduction 9 with 3 rules applied. Total rules applied 617 place count 19 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 623 place count 19 transition count 39
Applied a total of 623 rules in 140 ms. Remains 19 /363 variables (removed 344) and now considering 39/454 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 19/363 places, 39/454 transitions.
RANDOM walk for 1381 steps (103 resets) in 48 ms. (28 steps per ms) remains 0/2 properties
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2025-06-05 15:10:03] [INFO ] Flatten gal took : 44 ms
[2025-06-05 15:10:03] [INFO ] Flatten gal took : 47 ms
[2025-06-05 15:10:03] [INFO ] Input system was already deterministic with 454 transitions.
Computed a total of 45 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 347 transition count 438
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 347 transition count 438
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 341 transition count 432
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 432
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 338 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 336 transition count 427
Applied a total of 54 rules in 78 ms. Remains 336 /363 variables (removed 27) and now considering 427/454 (removed 27) transitions.
// Phase 1: matrix 427 rows 336 cols
[2025-06-05 15:10:03] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:10:03] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-05 15:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:10:04] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-05 15:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:19] [INFO ] Deduced a trap composed of 162 places in 348 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:19] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:19] [INFO ] Deduced a trap composed of 164 places in 272 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:20] [INFO ] Deduced a trap composed of 165 places in 298 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:21] [INFO ] Deduced a trap composed of 163 places in 291 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:21] [INFO ] Deduced a trap composed of 163 places in 255 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:22] [INFO ] Deduced a trap composed of 164 places in 376 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:22] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:23] [INFO ] Deduced a trap composed of 165 places in 357 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:24] [INFO ] Deduced a trap composed of 163 places in 326 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:25] [INFO ] Deduced a trap composed of 164 places in 339 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:25] [INFO ] Deduced a trap composed of 164 places in 361 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:25] [INFO ] Deduced a trap composed of 164 places in 355 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:26] [INFO ] Deduced a trap composed of 164 places in 358 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:26] [INFO ] Deduced a trap composed of 164 places in 343 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:26] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:30] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/763 variables, and 21 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/763 variables, 336/357 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 426/783 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:55] [INFO ] Deduced a trap composed of 165 places in 256 ms of which 45 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 784 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 336/363 places, 427/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61030 ms. Remains : 336/363 places, 427/454 transitions.
[2025-06-05 15:11:04] [INFO ] Flatten gal took : 39 ms
[2025-06-05 15:11:04] [INFO ] Flatten gal took : 39 ms
[2025-06-05 15:11:04] [INFO ] Input system was already deterministic with 427 transitions.
[2025-06-05 15:11:04] [INFO ] Flatten gal took : 36 ms
[2025-06-05 15:11:04] [INFO ] Flatten gal took : 35 ms
[2025-06-05 15:11:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11086781819295165700.gal : 29 ms
[2025-06-05 15:11:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality17687719075731660697.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/CTLCardinality11086781819295165700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17687719075731660697.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.05034e+07,2.32904,51300,2,6823,5,160725,6,0,1773,232335,0


Converting to forward existential form...Done !
original formula: AF(EX((AG(EF((p75==1))) * EF(EG(((p371==0)&&(p303==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(E(TRUE U !(E(TRUE U (p75==1))))) * E(TRUE U EG(((p371==0)&&(p303==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t95, t96, t97, t130, t131, t133, t150, t159, t193, t194, t195, t228, t229, t231, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:11:34] [INFO ] Flatten gal took : 40 ms
[2025-06-05 15:11:34] [INFO ] Applying decomposition
[2025-06-05 15:11:34] [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/graph653351104216103604.txt' '-o' '/tmp/graph653351104216103604.bin' '-w' '/tmp/graph653351104216103604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph653351104216103604.bin' '-l' '-1' '-v' '-w' '/tmp/graph653351104216103604.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:11:35] [INFO ] Decomposing Gal with order
[2025-06-05 15:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:11:35] [INFO ] Removed a total of 325 redundant transitions.
[2025-06-05 15:11:35] [INFO ] Flatten gal took : 108 ms
[2025-06-05 15:11:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 31 ms.
[2025-06-05 15:11:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality3060366396453571908.gal : 21 ms
[2025-06-05 15:11:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality915974378232150076.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/CTLCardinality3060366396453571908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality915974378232150076.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05034e+07,0.267537,8248,602,20,7195,481,742,8300,76,1168,0


Converting to forward existential form...Done !
original formula: AF(EX((AG(EF((i5.i0.u23.p75==1))) * EF(EG(((i23.i0.u111.p371==0)&&(i18.i1.u87.p303==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(E(TRUE U !(E(TRUE U (i5.i0.u23.p75==1))))) * E(TRUE U EG(((i23.i0.u111.p371==0)&&(i18.i1.u87....179
Reverse transition relation is NOT exact ! Due to transitions t51, t95, t97, t131, t133, t150, t195, t228, t229, t231, t247, t292, t325, t326, t328, t345, ...385
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,2.5381,72248,1,0,143653,731,5949,198930,361,2025,492814
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Graph (trivial) has 357 edges and 363 vertex of which 52 / 363 are part of one of the 9 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 319 transition count 191
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 220 rules applied. Total rules applied 435 place count 105 transition count 185
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 442 place count 102 transition count 181
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 446 place count 98 transition count 181
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 446 place count 98 transition count 171
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 466 place count 88 transition count 171
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 471 place count 83 transition count 166
Iterating global reduction 4 with 5 rules applied. Total rules applied 476 place count 83 transition count 166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 476 place count 83 transition count 165
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 478 place count 82 transition count 165
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 479 place count 81 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 480 place count 81 transition count 156
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 500 place count 71 transition count 146
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 509 place count 62 transition count 112
Iterating global reduction 4 with 9 rules applied. Total rules applied 518 place count 62 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 521 place count 62 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 522 place count 61 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 523 place count 61 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 524 place count 60 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 525 place count 60 transition count 105
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 5 with 2 rules applied. Total rules applied 527 place count 59 transition count 104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 528 place count 58 transition count 99
Iterating global reduction 5 with 1 rules applied. Total rules applied 529 place count 58 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 58 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 534 place count 58 transition count 94
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 6 with 8 rules applied. Total rules applied 542 place count 54 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 543 place count 53 transition count 89
Applied a total of 543 rules in 67 ms. Remains 53 /363 variables (removed 310) and now considering 89/454 (removed 365) transitions.
[2025-06-05 15:11:38] [INFO ] Flow matrix only has 83 transitions (discarded 6 similar events)
// Phase 1: matrix 83 rows 53 cols
[2025-06-05 15:11:38] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:11:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 15:11:38] [INFO ] Flow matrix only has 83 transitions (discarded 6 similar events)
[2025-06-05 15:11:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:11:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:11:38] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:11:38] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-05 15:11:38] [INFO ] Flow matrix only has 83 transitions (discarded 6 similar events)
[2025-06-05 15:11:38] [INFO ] Invariant cache hit.
[2025-06-05 15:11:38] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:38] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:38] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:39] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:39] [INFO ] Deduced a trap composed of 27 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-05 15:11:39] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:39] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:39] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:39] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:39] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 82/135 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:41] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:41] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:41] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 1/136 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/136 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/136 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 74 constraints, problems are : Problem set: 0 solved, 82 unsolved in 7136 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 82/135 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 82/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/136 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 156 constraints, problems are : Problem set: 0 solved, 82 unsolved in 6856 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14013ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 14014ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/363 places, 89/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14279 ms. Remains : 53/363 places, 89/454 transitions.
[2025-06-05 15:11:52] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:11:52] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:11:52] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-05 15:11:52] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:11:52] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:11:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3458957561166805527.gal : 1 ms
[2025-06-05 15:11:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5066532545585327062.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/CTLCardinality3458957561166805527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5066532545585327062.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,6484,0.070437,5304,2,916,5,5516,6,0,293,5472,0


Converting to forward existential form...Done !
original formula: EG(E(A(!(((p179==1)||(p199==1))) U !(((p365==0)||(p160==1)))) U (EF(!(AF((p79==1)))) * !((((p48!=1)||(p261==0))||(p327==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!((E(!(!(((p365==0)||(p160==1)))) U (!(!(((p179==1)||(p199==1)))) * !(!(((p365==0)||(p160==1)))))) ...279
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t7, t12, t18, t19, t26, t29, t45, t48, t49, t64, t77, t78, t79, t80, t81, t82, t8...261
(forward)formula 0,0,2.37024,66508,1,0,573,384626,216,276,2139,330036,661
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 347 transition count 438
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 347 transition count 438
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 341 transition count 432
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 432
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 338 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 336 transition count 427
Applied a total of 54 rules in 40 ms. Remains 336 /363 variables (removed 27) and now considering 427/454 (removed 27) transitions.
// Phase 1: matrix 427 rows 336 cols
[2025-06-05 15:11:54] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:11:54] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-05 15:11:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:11:55] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-05 15:11:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:11] [INFO ] Deduced a trap composed of 162 places in 347 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:11] [INFO ] Deduced a trap composed of 163 places in 277 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:12] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:13] [INFO ] Deduced a trap composed of 163 places in 265 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:13] [INFO ] Deduced a trap composed of 163 places in 328 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:14] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:14] [INFO ] Deduced a trap composed of 165 places in 348 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:15] [INFO ] Deduced a trap composed of 164 places in 271 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:15] [INFO ] Deduced a trap composed of 163 places in 302 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:16] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:16] [INFO ] Deduced a trap composed of 164 places in 281 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:17] [INFO ] Deduced a trap composed of 164 places in 325 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:17] [INFO ] Deduced a trap composed of 164 places in 323 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:18] [INFO ] Deduced a trap composed of 163 places in 240 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/763 variables, and 18 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/763 variables, 336/354 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 426/780 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:49] [INFO ] Deduced a trap composed of 165 places in 315 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:52] [INFO ] Deduced a trap composed of 165 places in 303 ms of which 51 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 782 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 336/363 places, 427/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 336/363 places, 427/454 transitions.
[2025-06-05 15:12:55] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:12:55] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:12:55] [INFO ] Input system was already deterministic with 427 transitions.
[2025-06-05 15:12:55] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:12:55] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:12:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1611050352976280175.gal : 4 ms
[2025-06-05 15:12:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1381253257617254088.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/CTLCardinality1611050352976280175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1381253257617254088.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.05015e+07,2.39932,52156,2,6720,5,162165,6,0,1773,239603,0


Converting to forward existential form...Done !
original formula: EG((((p346==1) + EG((EF((p305==0)) * !(A((p4==1) U (p405==1)))))) + EX(((((p304==0)&&(p391==1))&&(p406==0))||(p152==1)))))
=> equivalent forward existential formula: [FwdG(Init,(((p346==1) + EG((E(TRUE U (p305==0)) * !(!((E(!((p405==1)) U (!((p4==1)) * !((p405==1)))) + EG(!((p4...236
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:13:25] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:13:25] [INFO ] Applying decomposition
[2025-06-05 15:13:25] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17529074996313453824.txt' '-o' '/tmp/graph17529074996313453824.bin' '-w' '/tmp/graph17529074996313453824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17529074996313453824.bin' '-l' '-1' '-v' '-w' '/tmp/graph17529074996313453824.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:13:25] [INFO ] Decomposing Gal with order
[2025-06-05 15:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:13:25] [INFO ] Removed a total of 345 redundant transitions.
[2025-06-05 15:13:25] [INFO ] Flatten gal took : 52 ms
[2025-06-05 15:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 23 ms.
[2025-06-05 15:13:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12968327550907057528.gal : 10 ms
[2025-06-05 15:13:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality7311161777172755991.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/CTLCardinality12968327550907057528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7311161777172755991.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.05015e+07,0.312191,9092,743,20,8793,463,710,10507,67,1022,0


Converting to forward existential form...Done !
original formula: EG((((i20.i1.u106.p346==1) + EG((EF((i18.i2.u93.p305==0)) * !(A((i0.i1.u3.p4==1) U (i24.i1.u124.p405==1)))))) + EX(((((i18.i2.u92.p304==0...226
=> equivalent forward existential formula: [FwdG(Init,(((i20.i1.u106.p346==1) + EG((E(TRUE U (i18.i2.u93.p305==0)) * !(!((E(!((i24.i1.u124.p405==1)) U (!((...346
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t129, t130, t132, t192, t194, t228, t230, t246, t291, t325, t326, t328, t345, t346,...388
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found 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
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found 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
(forward)formula 0,0,8.22918,208772,1,0,431489,564,5113,593933,319,1650,901080
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Graph (trivial) has 367 edges and 363 vertex of which 54 / 363 are part of one of the 9 SCC in 2 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 317 transition count 177
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 231 rules applied. Total rules applied 457 place count 92 transition count 171
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 461 place count 89 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 462 place count 88 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 462 place count 88 transition count 160
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 482 place count 78 transition count 160
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 486 place count 74 transition count 156
Iterating global reduction 4 with 4 rules applied. Total rules applied 490 place count 74 transition count 156
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 512 place count 63 transition count 145
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 523 place count 52 transition count 102
Iterating global reduction 4 with 11 rules applied. Total rules applied 534 place count 52 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 538 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 541 place count 49 transition count 92
Iterating global reduction 5 with 3 rules applied. Total rules applied 544 place count 49 transition count 92
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 547 place count 46 transition count 86
Iterating global reduction 5 with 3 rules applied. Total rules applied 550 place count 46 transition count 86
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 5 with 2 rules applied. Total rules applied 552 place count 45 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 553 place count 44 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 554 place count 44 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 555 place count 44 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 558 place count 44 transition count 78
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 564 place count 41 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 40 transition count 74
Applied a total of 565 rules in 70 ms. Remains 40 /363 variables (removed 323) and now considering 74/454 (removed 380) transitions.
[2025-06-05 15:13:34] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
// Phase 1: matrix 70 rows 40 cols
[2025-06-05 15:13:34] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-05 15:13:34] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
[2025-06-05 15:13:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:13:34] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:13:34] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2025-06-05 15:13:34] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
[2025-06-05 15:13:34] [INFO ] Invariant cache hit.
[2025-06-05 15:13:34] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:35] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:35] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:35] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:35] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:35] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:36] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:36] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:36] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 69/109 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:37] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 60 constraints, problems are : Problem set: 0 solved, 67 unsolved in 5703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:40] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 69/109 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 67/127 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 128 constraints, problems are : Problem set: 0 solved, 67 unsolved in 4927 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10646ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 10647ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/363 places, 74/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10915 ms. Remains : 40/363 places, 74/454 transitions.
[2025-06-05 15:13:45] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:13:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:13:45] [INFO ] Input system was already deterministic with 74 transitions.
[2025-06-05 15:13:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:13:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:13:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17420466865469209098.gal : 1 ms
[2025-06-05 15:13:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11196407997279548997.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/CTLCardinality17420466865469209098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11196407997279548997.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,3196,0.063323,4932,2,671,5,3939,6,0,228,4279,0


Converting to forward existential form...Done !
original formula: EF(AG(((p48==0)||(p366==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p48==0)||(p366==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t11, t12, t18, t19, t25, t35, t36, t37, t43, t52, t53, t66, t67, t68, t69, t70, ...252
(forward)formula 0,1,0.736009,16948,1,0,170,75137,165,76,1752,51600,181
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 347 transition count 438
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 347 transition count 438
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 341 transition count 432
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 432
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 338 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 336 transition count 427
Applied a total of 54 rules in 65 ms. Remains 336 /363 variables (removed 27) and now considering 427/454 (removed 27) transitions.
// Phase 1: matrix 427 rows 336 cols
[2025-06-05 15:13:45] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:46] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-05 15:13:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:46] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-05 15:13:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:02] [INFO ] Deduced a trap composed of 162 places in 358 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:02] [INFO ] Deduced a trap composed of 163 places in 286 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:03] [INFO ] Deduced a trap composed of 164 places in 289 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:04] [INFO ] Deduced a trap composed of 163 places in 240 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:04] [INFO ] Deduced a trap composed of 163 places in 323 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:05] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:05] [INFO ] Deduced a trap composed of 165 places in 317 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:05] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:06] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:07] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:07] [INFO ] Deduced a trap composed of 164 places in 264 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:08] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:08] [INFO ] Deduced a trap composed of 163 places in 269 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:08] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/763 variables, and 18 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:26] [INFO ] Deduced a trap composed of 165 places in 352 ms of which 76 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/355 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 426/781 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:46] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 782 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 336/363 places, 427/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 336/363 places, 427/454 transitions.
[2025-06-05 15:14:46] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:14:46] [INFO ] Flatten gal took : 16 ms
[2025-06-05 15:14:46] [INFO ] Input system was already deterministic with 427 transitions.
[2025-06-05 15:14:46] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:14:46] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:14:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2858817775300116839.gal : 4 ms
[2025-06-05 15:14:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1864039058293738730.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/CTLCardinality2858817775300116839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1864039058293738730.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.05015e+07,2.44838,53092,2,6492,5,162191,6,0,1773,242982,0


Converting to forward existential form...Done !
original formula: AX(A(EF(!(EG((p322==1)))) U ((p17==1) + !((((AF((p78==1)) + (p410==0)) + ((p91==0)||(p5==1))) * AX((p396==0)))))))
=> equivalent forward existential formula: ([((((FwdU(EY(Init),!(((p17==1) + !((((!(EG(!((p78==1)))) + (p410==0)) + ((p91==0)||(p5==1))) * !(EX(!((p396==0)...431
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:15:16] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:15:16] [INFO ] Applying decomposition
[2025-06-05 15:15:16] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2753546559403510341.txt' '-o' '/tmp/graph2753546559403510341.bin' '-w' '/tmp/graph2753546559403510341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2753546559403510341.bin' '-l' '-1' '-v' '-w' '/tmp/graph2753546559403510341.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:15:16] [INFO ] Decomposing Gal with order
[2025-06-05 15:15:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:15:17] [INFO ] Removed a total of 343 redundant transitions.
[2025-06-05 15:15:17] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:15:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-05 15:15:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality3766248945633213923.gal : 4 ms
[2025-06-05 15:15:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5851180138480418387.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/CTLCardinality3766248945633213923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5851180138480418387.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.05015e+07,0.196846,8452,585,20,7447,343,763,8368,65,642,0


Converting to forward existential form...Done !
original formula: AX(A(EF(!(EG((i3.i2.u100.p322==1)))) U ((i0.i1.u3.p17==1) + !((((AF((i5.i1.u22.p78==1)) + (i25.i1.u127.p410==0)) + ((i6.i1.u28.p91==0)||(...205
=> equivalent forward existential formula: ([((((FwdU(EY(Init),!(((i0.i1.u3.p17==1) + !((((!(EG(!((i5.i1.u22.p78==1)))) + (i25.i1.u127.p410==0)) + ((i6.i1....628
Reverse transition relation is NOT exact ! Due to transitions t51, t95, t96, t129, t132, t149, t193, t194, t228, t230, t246, t291, t324, t325, t329, t345, ...381
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,6.19812,182276,1,0,374459,535,5454,540285,311,1356,932837
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Graph (trivial) has 355 edges and 363 vertex of which 54 / 363 are part of one of the 9 SCC in 2 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 317 transition count 192
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 214 rules applied. Total rules applied 425 place count 107 transition count 188
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 432 place count 105 transition count 183
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 437 place count 100 transition count 183
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 437 place count 100 transition count 172
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 459 place count 89 transition count 172
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 463 place count 85 transition count 168
Iterating global reduction 4 with 4 rules applied. Total rules applied 467 place count 85 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 467 place count 85 transition count 167
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 469 place count 84 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 470 place count 83 transition count 158
Iterating global reduction 4 with 1 rules applied. Total rules applied 471 place count 83 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 472 place count 83 transition count 157
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 492 place count 73 transition count 147
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 500 place count 65 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 508 place count 65 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 511 place count 65 transition count 113
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 513 place count 63 transition count 109
Iterating global reduction 6 with 2 rules applied. Total rules applied 515 place count 63 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 516 place count 62 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 517 place count 62 transition count 107
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 6 with 2 rules applied. Total rules applied 519 place count 61 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 520 place count 60 transition count 101
Iterating global reduction 6 with 1 rules applied. Total rules applied 521 place count 60 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 522 place count 60 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 525 place count 60 transition count 97
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 531 place count 57 transition count 94
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 532 place count 57 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 533 place count 56 transition count 93
Applied a total of 533 rules in 41 ms. Remains 56 /363 variables (removed 307) and now considering 93/454 (removed 361) transitions.
[2025-06-05 15:15:23] [INFO ] Flow matrix only has 88 transitions (discarded 5 similar events)
// Phase 1: matrix 88 rows 56 cols
[2025-06-05 15:15:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:15:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 15:15:23] [INFO ] Flow matrix only has 88 transitions (discarded 5 similar events)
[2025-06-05 15:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:15:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:15:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:15:23] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-05 15:15:23] [INFO ] Flow matrix only has 88 transitions (discarded 5 similar events)
[2025-06-05 15:15:23] [INFO ] Invariant cache hit.
[2025-06-05 15:15:23] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 3/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:24] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:24] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:24] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:24] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:24] [INFO ] Deduced a trap composed of 24 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-05 15:15:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:25] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:25] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:25] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:25] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:26] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:26] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 87/143 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:28] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 79 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7747 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 3/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 87/143 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 87/165 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 167 constraints, problems are : Problem set: 0 solved, 87 unsolved in 10257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18023ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 18023ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/363 places, 93/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18286 ms. Remains : 56/363 places, 93/454 transitions.
[2025-06-05 15:15:41] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:15:41] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:15:41] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-05 15:15:41] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:15:41] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:15:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11615786014569897920.gal : 1 ms
[2025-06-05 15:15:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality13662469145923733853.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/CTLCardinality11615786014569897920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13662469145923733853.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,7266,0.066702,5744,2,1142,5,6751,6,0,310,7585,0


Converting to forward existential form...Done !
original formula: AG((EG((E(((p228==0)||(p107==1)) U (p166==1)) + (p173==0))) + ((p6==0)&&(((p131==0)||(p116==0))||((p166==0)||(p293==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p6==0)&&(((p131==0)||(p116==0))||((p166==0)||(p293==1)))))) * !(EG((E(((p228==0)||(p107...198
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t5, t18, t25, t38, t44, t47, t48, t62, t63, t78, t81, t82, t83, t85, t86, t87, t9...266
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.47326,65508,1,0,406,374060,211,230,2306,323946,444
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 349 transition count 440
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 349 transition count 440
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 344 transition count 435
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 344 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 342 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 342 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 341 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 341 transition count 432
Applied a total of 44 rules in 60 ms. Remains 341 /363 variables (removed 22) and now considering 432/454 (removed 22) transitions.
// Phase 1: matrix 432 rows 341 cols
[2025-06-05 15:15:44] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:15:44] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-05 15:15:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:15:44] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2025-06-05 15:15:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:56] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:56] [INFO ] Deduced a trap composed of 163 places in 304 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:56] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:57] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 164 places in 361 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 165 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:59] [INFO ] Deduced a trap composed of 169 places in 297 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:00] [INFO ] Deduced a trap composed of 164 places in 312 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:01] [INFO ] Deduced a trap composed of 164 places in 385 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:01] [INFO ] Deduced a trap composed of 164 places in 293 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:01] [INFO ] Deduced a trap composed of 163 places in 357 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:02] [INFO ] Deduced a trap composed of 163 places in 224 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:03] [INFO ] Deduced a trap composed of 165 places in 260 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:04] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:05] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/773 variables, and 20 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/773 variables, 341/361 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 431/792 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:38] [INFO ] Deduced a trap composed of 164 places in 294 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:43] [INFO ] Deduced a trap composed of 170 places in 282 ms of which 51 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 794 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 341/363 places, 432/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 341/363 places, 432/454 transitions.
[2025-06-05 15:16:44] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:16:44] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:16:45] [INFO ] Input system was already deterministic with 432 transitions.
[2025-06-05 15:16:45] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:16:45] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:16:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality9350340314930976635.gal : 4 ms
[2025-06-05 15:16:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9710183227233720602.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/CTLCardinality9350340314930976635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9710183227233720602.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.0776e+07,2.68446,55376,2,6676,5,171331,6,0,1798,252913,0


Converting to forward existential form...Done !
original formula: AX(AX((AX((p150==0)) * (AX((p190==1)) + ((p22==0)&&(p19==1))))))
=> equivalent forward existential formula: ([(EY(EY(EY(Init))) * !((p150==0)))] = FALSE * [(EY((EY(EY(Init)) * !(((p22==0)&&(p19==1))))) * !((p190==1)))] =...162
(forward)formula 0,0,2.76008,55376,1,0,13,171331,11,4,2317,252913,5
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 346 transition count 437
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 346 transition count 437
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 340 transition count 431
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 335 transition count 426
Applied a total of 56 rules in 36 ms. Remains 335 /363 variables (removed 28) and now considering 426/454 (removed 28) transitions.
// Phase 1: matrix 426 rows 335 cols
[2025-06-05 15:16:47] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:16:48] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-05 15:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:16:48] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-05 15:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:02] [INFO ] Deduced a trap composed of 162 places in 313 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:03] [INFO ] Deduced a trap composed of 163 places in 291 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:04] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:05] [INFO ] Deduced a trap composed of 162 places in 386 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:05] [INFO ] Deduced a trap composed of 163 places in 331 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:06] [INFO ] Deduced a trap composed of 163 places in 392 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:06] [INFO ] Deduced a trap composed of 163 places in 393 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:07] [INFO ] Deduced a trap composed of 164 places in 331 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:08] [INFO ] Deduced a trap composed of 163 places in 332 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:08] [INFO ] Deduced a trap composed of 164 places in 332 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:09] [INFO ] Deduced a trap composed of 163 places in 316 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:09] [INFO ] Deduced a trap composed of 163 places in 224 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:10] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:13] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:15] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:15] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 49 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 335/761 variables, and 20 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/761 variables, 425/780 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:37] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:37] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 30 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 782 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 335/363 places, 426/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 335/363 places, 426/454 transitions.
[2025-06-05 15:17:48] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:17:48] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:17:48] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-05 15:17:48] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:17:48] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:17:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6930825372924568787.gal : 4 ms
[2025-06-05 15:17:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17060135661354183691.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/CTLCardinality6930825372924568787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17060135661354183691.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.04368e+07,2.40677,52972,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: EG(AX(A(AF(!(((p35==0)||(p370==1)))) U EX(EG((p368==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((E(!(EX(EG((p368==1)))) U (!(!(EG(!(!(((p35==0)||(p370==1))))))) * !(EX(EG((p368==1)))))) + ...195
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:18:18] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:18:18] [INFO ] Applying decomposition
[2025-06-05 15:18:18] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16782717526395221922.txt' '-o' '/tmp/graph16782717526395221922.bin' '-w' '/tmp/graph16782717526395221922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16782717526395221922.bin' '-l' '-1' '-v' '-w' '/tmp/graph16782717526395221922.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:18:18] [INFO ] Decomposing Gal with order
[2025-06-05 15:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:18:18] [INFO ] Removed a total of 315 redundant transitions.
[2025-06-05 15:18:18] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2025-06-05 15:18:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6975016202338609063.gal : 4 ms
[2025-06-05 15:18:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality12497645046601148232.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/CTLCardinality6975016202338609063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12497645046601148232.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.04368e+07,0.156007,7996,556,18,6663,459,692,7554,59,1010,0


Converting to forward existential form...Done !
original formula: EG(AX(A(AF(!(((i1.i1.u8.p35==0)||(i16.i2.u109.p370==1)))) U EX(EG((i16.i2.u109.p368==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((E(!(EX(EG((i16.i2.u109.p368==1)))) U (!(!(EG(!(!(((i1.i1.u8.p35==0)||(i16.i2.u109.p370==1))...252
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t129, t130, t132, t149, t194, t227, t228, t230, t246, t291, t324, t325, t327, t344,...376
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,8.63567,239292,1,0,461274,477,5063,752474,310,1201,1052863
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 347 transition count 438
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 347 transition count 438
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 341 transition count 432
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 432
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 338 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 336 transition count 427
Applied a total of 54 rules in 37 ms. Remains 336 /363 variables (removed 27) and now considering 427/454 (removed 27) transitions.
// Phase 1: matrix 427 rows 336 cols
[2025-06-05 15:18:27] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:18:27] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-05 15:18:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:18:28] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-05 15:18:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:43] [INFO ] Deduced a trap composed of 162 places in 332 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:44] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:44] [INFO ] Deduced a trap composed of 165 places in 263 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:45] [INFO ] Deduced a trap composed of 163 places in 248 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:46] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:46] [INFO ] Deduced a trap composed of 163 places in 227 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:46] [INFO ] Deduced a trap composed of 164 places in 328 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:48] [INFO ] Deduced a trap composed of 163 places in 361 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:48] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:49] [INFO ] Deduced a trap composed of 165 places in 378 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:49] [INFO ] Deduced a trap composed of 164 places in 382 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:49] [INFO ] Deduced a trap composed of 164 places in 290 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:50] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:50] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:50] [INFO ] Deduced a trap composed of 164 places in 344 ms of which 73 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:55] [INFO ] Deduced a trap composed of 165 places in 205 ms of which 50 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/763 variables, and 20 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:05] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:07] [INFO ] Deduced a trap composed of 164 places in 309 ms of which 68 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 426/784 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 784 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 336/363 places, 427/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60867 ms. Remains : 336/363 places, 427/454 transitions.
[2025-06-05 15:19:28] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:19:28] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:19:28] [INFO ] Input system was already deterministic with 427 transitions.
[2025-06-05 15:19:28] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:19:28] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:19:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6982506650968138970.gal : 4 ms
[2025-06-05 15:19:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1982584731639883074.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/CTLCardinality6982506650968138970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1982584731639883074.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.04977e+07,2.65723,54380,2,6512,5,165559,6,0,1773,248571,0


Converting to forward existential form...Done !
original formula: AG(EX((AF((p206==1)) * ((AG((p334==0)) + (p310==0)) + (p51==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(EG(!((p206==1)))) * ((!(E(TRUE U !((p334==0)))) + (p310==0)) + (p51==1))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:19:58] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:19:58] [INFO ] Applying decomposition
[2025-06-05 15:19:58] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16887649870962100948.txt' '-o' '/tmp/graph16887649870962100948.bin' '-w' '/tmp/graph16887649870962100948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16887649870962100948.bin' '-l' '-1' '-v' '-w' '/tmp/graph16887649870962100948.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:19:58] [INFO ] Decomposing Gal with order
[2025-06-05 15:19:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:19:58] [INFO ] Removed a total of 326 redundant transitions.
[2025-06-05 15:19:58] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2025-06-05 15:19:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17211737592055497953.gal : 4 ms
[2025-06-05 15:19:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality12915365977565468456.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/CTLCardinality17211737592055497953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12915365977565468456.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.04977e+07,0.179102,7724,658,28,6243,494,627,7625,69,1176,0


Converting to forward existential form...Done !
original formula: AG(EX((AF((i11.u57.p206==1)) * ((AG((i16.i2.u96.p334==0)) + (i21.i0.u89.p310==0)) + (i2.i2.u16.p51==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(EG(!((i11.u57.p206==1)))) * ((!(E(TRUE U !((i16.i2.u96.p334==0)))) + (i21.i0.u89.p31...196
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t130, t194, t227, t228, t230, t246, t291, t324, t325, t327, t344, t345, t347, i3.t2...396
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,3.27288,102700,1,0,201077,580,4788,295128,330,1539,525166
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Graph (trivial) has 356 edges and 363 vertex of which 52 / 363 are part of one of the 9 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 213 place count 319 transition count 193
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 218 rules applied. Total rules applied 431 place count 107 transition count 187
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 440 place count 104 transition count 181
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 446 place count 98 transition count 181
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 446 place count 98 transition count 172
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 464 place count 89 transition count 172
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 469 place count 84 transition count 167
Iterating global reduction 4 with 5 rules applied. Total rules applied 474 place count 84 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 474 place count 84 transition count 166
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 476 place count 83 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 477 place count 82 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 478 place count 82 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 479 place count 82 transition count 156
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 499 place count 72 transition count 146
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 508 place count 63 transition count 114
Iterating global reduction 5 with 9 rules applied. Total rules applied 517 place count 63 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 520 place count 63 transition count 111
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 522 place count 61 transition count 107
Iterating global reduction 6 with 2 rules applied. Total rules applied 524 place count 61 transition count 107
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 526 place count 59 transition count 103
Iterating global reduction 6 with 2 rules applied. Total rules applied 528 place count 59 transition count 103
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 6 with 2 rules applied. Total rules applied 530 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 531 place count 57 transition count 98
Iterating global reduction 6 with 1 rules applied. Total rules applied 532 place count 57 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 533 place count 57 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 536 place count 57 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 542 place count 54 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 543 place count 54 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 544 place count 53 transition count 90
Applied a total of 544 rules in 34 ms. Remains 53 /363 variables (removed 310) and now considering 90/454 (removed 364) transitions.
[2025-06-05 15:20:02] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 53 cols
[2025-06-05 15:20:02] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 15:20:02] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
[2025-06-05 15:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:20:02] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:20:02] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-05 15:20:02] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
[2025-06-05 15:20:02] [INFO ] Invariant cache hit.
[2025-06-05 15:20:02] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:02] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:02] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:03] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:03] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:03] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:03] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:03] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 70 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5972 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:08] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:08] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 84/137 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 84/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 1/138 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:11] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/138 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 157 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12254ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 12254ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/363 places, 90/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12451 ms. Remains : 53/363 places, 90/454 transitions.
[2025-06-05 15:20:14] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:20:14] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:20:14] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-05 15:20:14] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:20:14] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:20:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10915890031982940366.gal : 1 ms
[2025-06-05 15:20:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality18163423108234360061.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/CTLCardinality10915890031982940366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18163423108234360061.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,6548,0.074054,6116,2,843,5,7659,6,0,295,9780,0


Converting to forward existential form...Done !
original formula: EF(AG(A((((p228==0)||(p189==1))||((p314==1)||(!((p200==1)||(p298==0))))) U A((p321==1) U A((p191==0) U (p407==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!((E(!(!((E(!((p407==0)) U (!((p191==0)) * !((p407==0)))) + EG(!((p407==...960
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t8, t9, t17, t21, t22, t27, t39, t45, t47, t62, t75, t76, t77, t82, t83, t84, t85...255
(forward)formula 0,1,0.336554,14308,1,0,216,44110,213,94,2088,40093,255
FORMULA StigmergyElection-PT-03b-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 347 transition count 438
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 347 transition count 438
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 342 transition count 433
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 342 transition count 433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 339 transition count 430
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 337 transition count 428
Applied a total of 52 rules in 33 ms. Remains 337 /363 variables (removed 26) and now considering 428/454 (removed 26) transitions.
// Phase 1: matrix 428 rows 337 cols
[2025-06-05 15:20:14] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:15] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-06-05 15:20:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:15] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-05 15:20:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:27] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:28] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:28] [INFO ] Deduced a trap composed of 163 places in 196 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:29] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:29] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:30] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:30] [INFO ] Deduced a trap composed of 165 places in 322 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:30] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:31] [INFO ] Deduced a trap composed of 164 places in 360 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:32] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:32] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:33] [INFO ] Deduced a trap composed of 164 places in 278 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:33] [INFO ] Deduced a trap composed of 165 places in 251 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:33] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:38] [INFO ] Deduced a trap composed of 165 places in 276 ms of which 50 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 337/765 variables, and 19 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 428/765 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 427/783 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:21:07] [INFO ] Deduced a trap composed of 164 places in 295 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:21:14] [INFO ] Deduced a trap composed of 165 places in 366 ms of which 83 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/765 variables, and 785 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 337/363 places, 428/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60864 ms. Remains : 337/363 places, 428/454 transitions.
[2025-06-05 15:21:15] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:21:15] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:21:15] [INFO ] Input system was already deterministic with 428 transitions.
[2025-06-05 15:21:15] [INFO ] Flatten gal took : 19 ms
[2025-06-05 15:21:15] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:21:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality15187213629736263347.gal : 4 ms
[2025-06-05 15:21:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality18299124607987672303.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/CTLCardinality15187213629736263347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18299124607987672303.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.05662e+07,2.64067,53044,2,6532,5,161452,6,0,1778,242125,0


Converting to forward existential form...Done !
original formula: (AX(EX((EG((p159==0)) * ((p288==0)||(p353==1))))) * EF(EX(((p318==0) + AX((p170==0))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX((EG((p159==0)) * ((p288==0)||(p353==1))))))] = FALSE * [(Init * !(E(TRUE U EX(((p318==0) + !(...187
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t131, t132, t134, t151, t160, t194, t195, t196, t229, t230, t232, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:21:45] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:21:45] [INFO ] Applying decomposition
[2025-06-05 15:21:45] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13866035109253046783.txt' '-o' '/tmp/graph13866035109253046783.bin' '-w' '/tmp/graph13866035109253046783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13866035109253046783.bin' '-l' '-1' '-v' '-w' '/tmp/graph13866035109253046783.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:21:46] [INFO ] Decomposing Gal with order
[2025-06-05 15:21:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:21:46] [INFO ] Removed a total of 338 redundant transitions.
[2025-06-05 15:21:46] [INFO ] Flatten gal took : 27 ms
[2025-06-05 15:21:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2025-06-05 15:21:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality18052987302420377712.gal : 4 ms
[2025-06-05 15:21:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1478532971028596955.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/CTLCardinality18052987302420377712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1478532971028596955.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.05662e+07,0.126998,7408,612,22,5433,411,645,6527,62,939,0


Converting to forward existential form...Done !
original formula: (AX(EX((EG((i7.i0.u43.p159==0)) * ((i15.i0.u85.p288==0)||(i18.i1.u108.p353==1))))) * EF(EX(((i17.i1.u98.p318==0) + AX((i8.i1.u51.p170==0)...160
=> equivalent forward existential formula: ([(EY(Init) * !(EX((EG((i7.i0.u43.p159==0)) * ((i15.i0.u85.p288==0)||(i18.i1.u108.p353==1))))))] = FALSE * [(Ini...241
Reverse transition relation is NOT exact ! Due to transitions t95, t96, t132, t134, t196, t229, t230, t232, t293, t326, t327, t329, t346, t347, t349, i2.i2...413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
(forward)formula 0,1,3.08008,96240,1,0,183959,504,4763,317260,290,1263,415453
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 346 transition count 437
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 346 transition count 437
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 340 transition count 431
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 335 transition count 426
Applied a total of 56 rules in 36 ms. Remains 335 /363 variables (removed 28) and now considering 426/454 (removed 28) transitions.
// Phase 1: matrix 426 rows 335 cols
[2025-06-05 15:21:49] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:21:49] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-05 15:21:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:21:49] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-05 15:21:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:01] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:01] [INFO ] Deduced a trap composed of 163 places in 263 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:02] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:03] [INFO ] Deduced a trap composed of 162 places in 259 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:03] [INFO ] Deduced a trap composed of 163 places in 229 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:03] [INFO ] Deduced a trap composed of 163 places in 267 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:04] [INFO ] Deduced a trap composed of 163 places in 269 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:04] [INFO ] Deduced a trap composed of 164 places in 313 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:05] [INFO ] Deduced a trap composed of 163 places in 235 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:06] [INFO ] Deduced a trap composed of 164 places in 300 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:06] [INFO ] Deduced a trap composed of 163 places in 319 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:06] [INFO ] Deduced a trap composed of 163 places in 218 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:08] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:11] [INFO ] Deduced a trap composed of 165 places in 306 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:13] [INFO ] Deduced a trap composed of 163 places in 246 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:14] [INFO ] Deduced a trap composed of 165 places in 313 ms of which 81 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 335/761 variables, and 20 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/761 variables, 425/780 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:42] [INFO ] Deduced a trap composed of 164 places in 388 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:42] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 782 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 335/363 places, 426/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60645 ms. Remains : 335/363 places, 426/454 transitions.
[2025-06-05 15:22:49] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:22:49] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:22:49] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-05 15:22:49] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:22:49] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:22:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality5442395790809427578.gal : 4 ms
[2025-06-05 15:22:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1081046073312680257.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/CTLCardinality5442395790809427578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1081046073312680257.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.04368e+07,2.53079,53040,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: AX(A(!(((p386==1)&&(!((p90==0)||(p173==1))))) U !(((p26==0)||(p250==1)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),!(!(((p26==0)||(p250==1))))) * (!(!(((p386==1)&&(!((p90==0)||(p173==1)))))) * !(!(((p26==0)||(p...232
Hit Full ! (commute/partial/dont) 414/0/12
(forward)formula 0,0,26.3857,572608,1,0,96,2.89915e+06,19,4,8621,2.72444e+06,92
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Graph (trivial) has 367 edges and 363 vertex of which 51 / 363 are part of one of the 8 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 319 transition count 179
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 231 rules applied. Total rules applied 457 place count 94 transition count 173
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 461 place count 91 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 462 place count 90 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 462 place count 90 transition count 161
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 484 place count 79 transition count 161
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 488 place count 75 transition count 157
Iterating global reduction 4 with 4 rules applied. Total rules applied 492 place count 75 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 492 place count 75 transition count 156
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 494 place count 74 transition count 156
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 495 place count 73 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 496 place count 73 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 497 place count 73 transition count 146
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 517 place count 63 transition count 136
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 528 place count 52 transition count 98
Iterating global reduction 5 with 11 rules applied. Total rules applied 539 place count 52 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 543 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 546 place count 49 transition count 88
Iterating global reduction 6 with 3 rules applied. Total rules applied 549 place count 49 transition count 88
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 552 place count 46 transition count 82
Iterating global reduction 6 with 3 rules applied. Total rules applied 555 place count 46 transition count 82
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 6 with 2 rules applied. Total rules applied 557 place count 45 transition count 81
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 558 place count 44 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 559 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 560 place count 44 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 563 place count 44 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 569 place count 41 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 570 place count 40 transition count 70
Applied a total of 570 rules in 30 ms. Remains 40 /363 variables (removed 323) and now considering 70/454 (removed 384) transitions.
[2025-06-05 15:23:16] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 40 cols
[2025-06-05 15:23:16] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:23:16] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-05 15:23:16] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2025-06-05 15:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:23:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:23:16] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:23:16] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-05 15:23:16] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2025-06-05 15:23:16] [INFO ] Invariant cache hit.
[2025-06-05 15:23:16] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:17] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:17] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:17] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:17] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 65/105 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:19] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/106 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 57 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3790 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 65/105 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 63/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:21] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 121 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7224ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7225ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/363 places, 70/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7430 ms. Remains : 40/363 places, 70/454 transitions.
[2025-06-05 15:23:23] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:23:23] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:23:23] [INFO ] Input system was already deterministic with 70 transitions.
[2025-06-05 15:23:23] [INFO ] Flatten gal took : 1 ms
[2025-06-05 15:23:23] [INFO ] Flatten gal took : 1 ms
[2025-06-05 15:23:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality17785017737881946887.gal : 1 ms
[2025-06-05 15:23:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4889300876167241485.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/CTLCardinality17785017737881946887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4889300876167241485.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,3082,0.034874,4768,2,625,5,3546,6,0,224,3452,0


Converting to forward existential form...Done !
original formula: EG(((p101==0)||(p310==1)))
=> equivalent forward existential formula: [FwdG(Init,((p101==0)||(p310==1)))] != FALSE
Hit Full ! (commute/partial/dont) 66/0/4
(forward)formula 0,1,0.151156,8736,1,0,19,21466,19,4,1240,21286,18
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 363/363 places, 454/454 transitions.
Graph (trivial) has 364 edges and 363 vertex of which 45 / 363 are part of one of the 8 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 227 rules applied. Total rules applied 228 place count 325 transition count 185
Reduce places removed 227 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 235 rules applied. Total rules applied 463 place count 98 transition count 177
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 469 place count 94 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 471 place count 92 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 471 place count 92 transition count 163
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 495 place count 80 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 499 place count 76 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 503 place count 76 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 503 place count 76 transition count 158
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 505 place count 75 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 506 place count 74 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 74 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 508 place count 74 transition count 148
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 528 place count 64 transition count 138
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 536 place count 56 transition count 105
Iterating global reduction 5 with 8 rules applied. Total rules applied 544 place count 56 transition count 105
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 549 place count 56 transition count 100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 550 place count 55 transition count 98
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 55 transition count 98
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 552 place count 54 transition count 96
Iterating global reduction 6 with 1 rules applied. Total rules applied 553 place count 54 transition count 96
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 6 with 2 rules applied. Total rules applied 555 place count 53 transition count 95
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 556 place count 52 transition count 90
Iterating global reduction 6 with 1 rules applied. Total rules applied 557 place count 52 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 558 place count 52 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 562 place count 52 transition count 85
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 7 with 8 rules applied. Total rules applied 570 place count 48 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 571 place count 47 transition count 80
Applied a total of 571 rules in 24 ms. Remains 47 /363 variables (removed 316) and now considering 80/454 (removed 374) transitions.
[2025-06-05 15:23:24] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
// Phase 1: matrix 75 rows 47 cols
[2025-06-05 15:23:24] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:23:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 15:23:24] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2025-06-05 15:23:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:23:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:23:24] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:23:24] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2025-06-05 15:23:24] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2025-06-05 15:23:24] [INFO ] Invariant cache hit.
[2025-06-05 15:23:24] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:24] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:24] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:24] [INFO ] Deduced a trap composed of 16 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-05 15:23:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:25] [INFO ] Deduced a trap composed of 20 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-05 15:23:25] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:25] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:25] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:25] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 74/121 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/122 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 67 constraints, problems are : Problem set: 0 solved, 73 unsolved in 5739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 73/139 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:31] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/122 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 6808 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12556ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 12558ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/363 places, 80/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12744 ms. Remains : 47/363 places, 80/454 transitions.
[2025-06-05 15:23:36] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:23:36] [INFO ] Flatten gal took : 1 ms
[2025-06-05 15:23:36] [INFO ] Input system was already deterministic with 80 transitions.
[2025-06-05 15:23:36] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:23:36] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:23:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality12110859557572759401.gal : 0 ms
[2025-06-05 15:23:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality11196754132956145843.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/CTLCardinality12110859557572759401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11196754132956145843.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,3770,0.053363,5416,2,908,5,5499,6,0,261,6267,0


Converting to forward existential form...Done !
original formula: AF((EF(EG((p67==0))) + ((p149==0)&&(p105==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EG((p67==0))) + ((p149==0)&&(p105==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t7, t14, t15, t20, t38, t39, t52, t54, t55, t68, t69, t70, t71, t73, t74, t75...255
(forward)formula 0,1,0.906371,29996,1,0,280,139403,186,128,1941,130894,312
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 15:23:37] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:23:37] [INFO ] Flatten gal took : 14 ms
Total runtime 883269 ms.

BK_STOP 1749137017946

--------------------
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="StigmergyElection-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 StigmergyElection-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-174903490900185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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