Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600506.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 CO4-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 248K May 29 14:32 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 CO4-PT-17-CTLFireability-2024-12
FORMULA_NAME CO4-PT-17-CTLFireability-2024-13
FORMULA_NAME CO4-PT-17-CTLFireability-2024-14
FORMULA_NAME CO4-PT-17-CTLFireability-2024-15
FORMULA_NAME CO4-PT-17-CTLFireability-2025-00
FORMULA_NAME CO4-PT-17-CTLFireability-2025-01
FORMULA_NAME CO4-PT-17-CTLFireability-2025-02
FORMULA_NAME CO4-PT-17-CTLFireability-2025-03
FORMULA_NAME CO4-PT-17-CTLFireability-2025-04
FORMULA_NAME CO4-PT-17-CTLFireability-2025-05
FORMULA_NAME CO4-PT-17-CTLFireability-2025-06
FORMULA_NAME CO4-PT-17-CTLFireability-2025-07
FORMULA_NAME CO4-PT-17-CTLFireability-2025-08
FORMULA_NAME CO4-PT-17-CTLFireability-2025-09
FORMULA_NAME CO4-PT-17-CTLFireability-2025-10
FORMULA_NAME CO4-PT-17-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748608262170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 12:31:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:31:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:31:03] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-05-30 12:31:03] [INFO ] Transformed 967 places.
[2025-05-30 12:31:03] [INFO ] Transformed 1150 transitions.
[2025-05-30 12:31:03] [INFO ] Found NUPN structural information;
[2025-05-30 12:31:03] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 198 places in 12 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 152 places :
Symmetric choice reduction at 1 with 152 rule applications. Total rules 172 place count 598 transition count 759
Iterating global reduction 1 with 152 rules applied. Total rules applied 324 place count 598 transition count 759
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 332 place count 598 transition count 751
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 405 place count 525 transition count 678
Iterating global reduction 2 with 73 rules applied. Total rules applied 478 place count 525 transition count 678
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 491 place count 512 transition count 664
Iterating global reduction 2 with 13 rules applied. Total rules applied 504 place count 512 transition count 664
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 507 place count 512 transition count 661
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 508 place count 511 transition count 660
Iterating global reduction 3 with 1 rules applied. Total rules applied 509 place count 511 transition count 660
Applied a total of 509 rules in 183 ms. Remains 511 /769 variables (removed 258) and now considering 660/912 (removed 252) transitions.
// Phase 1: matrix 660 rows 511 cols
[2025-05-30 12:31:03] [INFO ] Computed 5 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:31:04] [INFO ] Implicit Places using invariants in 337 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 369 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 510/769 places, 660/912 transitions.
Applied a total of 0 rules in 26 ms. Remains 510 /510 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 593 ms. Remains : 510/769 places, 660/912 transitions.
Support contains 66 out of 510 places after structural reductions.
[2025-05-30 12:31:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:31:04] [INFO ] Flatten gal took : 63 ms
FORMULA CO4-PT-17-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:31:04] [INFO ] Flatten gal took : 32 ms
[2025-05-30 12:31:04] [INFO ] Input system was already deterministic with 660 transitions.
Support contains 60 out of 510 places (down from 66) after GAL structural reductions.
FORMULA CO4-PT-17-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (136 resets) in 2296 ms. (17 steps per ms) remains 30/44 properties
BEST_FIRST walk for 4002 steps (12 resets) in 46 ms. (85 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (19 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (21 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (19 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (19 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
// Phase 1: matrix 660 rows 510 cols
[2025-05-30 12:31:05] [INFO ] Computed 4 invariants in 5 ms
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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 9/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 16/65 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 191/256 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 499/755 variables, 202/271 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 343/1098 variables, 194/465 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 61/1159 variables, 43/508 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1159 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 13 (OVERLAPS) 11/1170 variables, 6/514 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1170 variables, 0/514 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 0/1170 variables, 0/514 constraints. Problems are: Problem set: 1 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 514 constraints, problems are : Problem set: 1 solved, 28 unsolved in 4024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 9/47 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 189/252 variables, 63/67 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 3/70 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 502/754 variables, 203/273 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 25/298 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 344/1098 variables, 195/493 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 61/1159 variables, 43/536 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1159 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 11/1170 variables, 6/542 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 542 constraints, problems are : Problem set: 1 solved, 28 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 28/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9106ms problems are : Problem set: 1 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 660/660 transitions.
Graph (trivial) has 480 edges and 510 vertex of which 2 / 510 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 850 edges and 509 vertex of which 488 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 166 rules applied. Total rules applied 168 place count 488 transition count 475
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 167 rules applied. Total rules applied 335 place count 338 transition count 458
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 351 place count 322 transition count 458
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 351 place count 322 transition count 408
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 451 place count 272 transition count 408
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 453 place count 270 transition count 406
Iterating global reduction 3 with 2 rules applied. Total rules applied 455 place count 270 transition count 406
Performed 73 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 601 place count 197 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 610 place count 197 transition count 314
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 612 place count 196 transition count 313
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 618 place count 190 transition count 307
Iterating global reduction 5 with 6 rules applied. Total rules applied 624 place count 190 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 628 place count 188 transition count 305
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 710 place count 147 transition count 305
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 731 place count 147 transition count 284
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 757 place count 121 transition count 232
Iterating global reduction 6 with 26 rules applied. Total rules applied 783 place count 121 transition count 232
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 798 place count 121 transition count 217
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 800 place count 119 transition count 211
Iterating global reduction 7 with 2 rules applied. Total rules applied 802 place count 119 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 810 place count 119 transition count 203
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 816 place count 119 transition count 197
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 822 place count 113 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 823 place count 113 transition count 196
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 829 place count 113 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 830 place count 113 transition count 195
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 833 place count 113 transition count 195
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 834 place count 113 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 835 place count 113 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 836 place count 112 transition count 192
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 17 edges and 109 vertex of which 3 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 841 place count 107 transition count 191
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 845 place count 106 transition count 188
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 847 place count 104 transition count 185
Iterating global reduction 11 with 2 rules applied. Total rules applied 849 place count 104 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 850 place count 104 transition count 184
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 12 with 8 rules applied. Total rules applied 858 place count 100 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 859 place count 100 transition count 179
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 860 place count 99 transition count 177
Iterating global reduction 13 with 1 rules applied. Total rules applied 861 place count 99 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 865 place count 99 transition count 173
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 867 place count 97 transition count 171
Iterating global reduction 13 with 2 rules applied. Total rules applied 869 place count 97 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 870 place count 97 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 871 place count 97 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 872 place count 97 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 873 place count 96 transition count 168
Applied a total of 873 rules in 157 ms. Remains 96 /510 variables (removed 414) and now considering 168/660 (removed 492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 96/510 places, 168/660 transitions.
RANDOM walk for 40000 steps (2515 resets) in 499 ms. (80 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40004 steps (375 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (355 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2025-05-30 12:31:14] [INFO ] Flow matrix only has 160 transitions (discarded 8 similar events)
// Phase 1: matrix 160 rows 96 cols
[2025-05-30 12:31:14] [INFO ] Computed 1 invariants in 1 ms
[2025-05-30 12:31:14] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/146 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 44/190 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 46/236 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 16/252 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/256 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/256 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/146 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/190 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 46/236 variables, 18/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/252 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/256 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/256 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 897 steps, including 48 resets, run visited all 2 properties in 5 ms. (steps per millisecond=179 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 10 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2025-05-30 12:31:15] [INFO ] Flatten gal took : 25 ms
[2025-05-30 12:31:15] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:31:15] [INFO ] Input system was already deterministic with 660 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 852 edges and 510 vertex of which 507 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 489 transition count 639
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 489 transition count 639
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 479 transition count 627
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 479 transition count 627
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 476 transition count 624
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 476 transition count 624
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 474 transition count 622
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 474 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 74 place count 474 transition count 620
Applied a total of 74 rules in 46 ms. Remains 474 /510 variables (removed 36) and now considering 620/660 (removed 40) transitions.
// Phase 1: matrix 620 rows 474 cols
[2025-05-30 12:31:15] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:31:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 12:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:31:15] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2025-05-30 12:31: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/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:44] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:44] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 474/510 places, 620/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60593 ms. Remains : 474/510 places, 620/660 transitions.
[2025-05-30 12:32:16] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:32:16] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:32:16] [INFO ] Input system was already deterministic with 620 transitions.
[2025-05-30 12:32:16] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:32:16] [INFO ] Flatten gal took : 29 ms
[2025-05-30 12:32:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15056925231299046683.gal : 28 ms
[2025-05-30 12:32:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11948674061963602140.ctl : 3 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/CTLFireability15056925231299046683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11948674061963602140.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.91475e+10,1.40697,48456,2,8725,5,161796,6,0,2512,216150,0


Converting to forward existential form...Done !
original formula: ((EX(EX(EG(((p516==0)||(p878==0))))) + E((p578==1) U AG(((p646==1)||(p9==1))))) + AF(AG((p759==1))))
=> equivalent forward existential formula: [FwdG((Init * !((EX(EX(EG(((p516==0)||(p878==0))))) + E((p578==1) U !(E(TRUE U !(((p646==1)||(p9==1))))))))),!(!...190
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2025-05-30 12:32:46] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:32:46] [INFO ] Applying decomposition
[2025-05-30 12:32:46] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7597444265695171613.txt' '-o' '/tmp/graph7597444265695171613.bin' '-w' '/tmp/graph7597444265695171613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7597444265695171613.bin' '-l' '-1' '-v' '-w' '/tmp/graph7597444265695171613.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:32:46] [INFO ] Decomposing Gal with order
[2025-05-30 12:32:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:32:46] [INFO ] Removed a total of 205 redundant transitions.
[2025-05-30 12:32:46] [INFO ] Flatten gal took : 66 ms
[2025-05-30 12:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 19 ms.
[2025-05-30 12:32:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16525528120546401944.gal : 10 ms
[2025-05-30 12:32:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13116442430888599278.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/CTLFireability16525528120546401944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13116442430888599278.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.91475e+10,0.208592,12612,707,106,16130,1679,1043,27323,104,5705,0


Converting to forward existential form...Done !
original formula: ((EX(EX(EG(((i6.u159.p516==0)||(i6.u159.p878==0))))) + E((i7.u85.p578==1) U AG(((i14.u104.p646==1)||(i0.u3.p9==1))))) + AF(AG((i8.i1.i1.u...170
=> equivalent forward existential formula: [FwdG((Init * !((EX(EX(EG(((i6.u159.p516==0)||(i6.u159.p878==0))))) + E((i7.u85.p578==1) U !(E(TRUE U !(((i14.u1...242
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t45, t73, t231, t248, t326, t540, i0.t244, i1.t456, i1.t450, i1.t352, i1.t321, i1.u...770
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,27.3688,690380,1,0,866560,4236,7387,3.99309e+06,584,20752,665450
FORMULA CO4-PT-17-CTLFireability-2025-00 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 : 510/510 places, 660/660 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 491 transition count 641
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 491 transition count 641
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 483 transition count 631
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 483 transition count 631
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 480 transition count 628
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 480 transition count 628
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 478 transition count 626
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 478 transition count 626
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 478 transition count 624
Applied a total of 66 rules in 54 ms. Remains 478 /510 variables (removed 32) and now considering 624/660 (removed 36) transitions.
// Phase 1: matrix 624 rows 478 cols
[2025-05-30 12:33:14] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 12:33:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:14] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 623 sub problems to find dead transitions.
[2025-05-30 12:33:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (OVERLAPS) 624/1102 variables, 478/482 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:33:44] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:33:44] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 11 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 Real declared 1102/1102 variables, and 484 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/1102 variables, 478/484 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 623/1107 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 1107 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 478/510 places, 624/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 478/510 places, 624/660 transitions.
[2025-05-30 12:34:14] [INFO ] Flatten gal took : 15 ms
[2025-05-30 12:34:14] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:34:14] [INFO ] Input system was already deterministic with 624 transitions.
[2025-05-30 12:34:14] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:34:14] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:34:14] [INFO ] Time to serialize gal into /tmp/CTLFireability71694656712029884.gal : 2 ms
[2025-05-30 12:34:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5937572981942055973.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/CTLFireability71694656712029884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5937572981942055973.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 -...281
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.97159e+10,1.3922,48496,2,8934,5,165183,6,0,2532,216229,0


Converting to forward existential form...Done !
original formula: (EG((AX(AF((p583==0))) * ((((p232==1)&&(p959==1))||(p233==1))||(p220==1)))) + (!(A(((p375==1)&&(p251==1)) U (EG(!(((p961==1)&&(p966==1)))...215
=> equivalent forward existential formula: ([FwdG(Init,(!(EX(!(!(EG(!((p583==0))))))) * ((((p232==1)&&(p959==1))||(p233==1))||(p220==1))))] != FALSE + ([((...683
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t129, t157, t183, t...488
Detected timeout of ITS tools.
[2025-05-30 12:34:44] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:34:44] [INFO ] Applying decomposition
[2025-05-30 12:34:44] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13820139649591880949.txt' '-o' '/tmp/graph13820139649591880949.bin' '-w' '/tmp/graph13820139649591880949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13820139649591880949.bin' '-l' '-1' '-v' '-w' '/tmp/graph13820139649591880949.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:34:44] [INFO ] Decomposing Gal with order
[2025-05-30 12:34:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:34:45] [INFO ] Removed a total of 217 redundant transitions.
[2025-05-30 12:34:45] [INFO ] Flatten gal took : 40 ms
[2025-05-30 12:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 6 ms.
[2025-05-30 12:34:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17532047290220149509.gal : 5 ms
[2025-05-30 12:34:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5739889969826283365.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/CTLFireability17532047290220149509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5739889969826283365.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.97159e+10,0.381666,18040,698,86,26271,1379,1024,53397,93,5178,0


Converting to forward existential form...Done !
original formula: (EG((AX(AF((i7.u88.p583==0))) * ((((i1.u8.p232==1)&&(i18.u175.p959==1))||(i1.u8.p233==1))||(i2.u25.p220==1)))) + (!(A(((i7.u45.p375==1)&&...305
=> equivalent forward existential formula: ([FwdG(Init,(!(EX(!(!(EG(!((i7.u88.p583==0))))))) * ((((i1.u8.p232==1)&&(i18.u175.p959==1))||(i1.u8.p233==1))||(...936
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t193, t197, t214, t218, t219, t226, t231, t237, t248, t352, t371, t542, i0.t244, i1...773
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 2
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 489 transition count 639
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 489 transition count 639
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 480 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 480 transition count 629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 479 transition count 628
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 479 transition count 628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 478 transition count 627
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 478 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 478 transition count 626
Applied a total of 65 rules in 34 ms. Remains 478 /510 variables (removed 32) and now considering 626/660 (removed 34) transitions.
// Phase 1: matrix 626 rows 478 cols
[2025-05-30 12:35:15] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 12:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:15] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 625 sub problems to find dead transitions.
[2025-05-30 12:35: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/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 626/1104 variables, 478/482 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:35:44] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:35:44] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 484 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (OVERLAPS) 626/1104 variables, 478/484 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 625/1109 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 1109 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 478/510 places, 626/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60497 ms. Remains : 478/510 places, 626/660 transitions.
[2025-05-30 12:36:15] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:36:15] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:36:15] [INFO ] Input system was already deterministic with 626 transitions.
[2025-05-30 12:36:15] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:36:15] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11088676037241736186.gal : 3 ms
[2025-05-30 12:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6704943183177815177.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/CTLFireability11088676037241736186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6704943183177815177.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,2.22748e+10,1.30415,46372,2,8820,5,156356,6,0,2534,203442,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG(EF((p901==1))) * EG((AF((p815==1)) * AX((p502==1))))) * ((p597==1)&&(p955==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !(E(TRUE U (p901==1))))) * EG((!(EG(!((p815==1)))) * !(EX(!((p502==1))))))) * (...189
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t38, t39, t43, t44, t47, t131, t16...498
Detected timeout of ITS tools.
[2025-05-30 12:36:45] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:36:45] [INFO ] Applying decomposition
[2025-05-30 12:36:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3311076396516679175.txt' '-o' '/tmp/graph3311076396516679175.bin' '-w' '/tmp/graph3311076396516679175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3311076396516679175.bin' '-l' '-1' '-v' '-w' '/tmp/graph3311076396516679175.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:36:45] [INFO ] Decomposing Gal with order
[2025-05-30 12:36:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:36:45] [INFO ] Removed a total of 207 redundant transitions.
[2025-05-30 12:36:45] [INFO ] Flatten gal took : 39 ms
[2025-05-30 12:36:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 7 ms.
[2025-05-30 12:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7858029891584550056.gal : 13 ms
[2025-05-30 12:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17003041291204991551.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/CTLFireability7858029891584550056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17003041291204991551.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22748e+10,0.285985,13668,693,98,17492,2645,1081,30950,102,9536,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG(EF((i17.u162.p901==1))) * EG((AF((i13.u145.p815==1)) * AX((i6.i0.i2.u91.p502==1))))) * ((i8.u94.p597==1)&&(i17.u169.p955==1)))...157
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !(E(TRUE U (i17.u162.p901==1))))) * EG((!(EG(!((i13.u145.p815==1)))) * !(EX(!((...236
Reverse transition relation is NOT exact ! Due to transitions t18, t47, t136, t202, t212, t253, t358, t377, t488, t546, i0.i0.t439, i0.i0.i0.u24.t449, i1.t...798
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,10.6828,328292,1,0,561983,4377,7613,1.55754e+06,577,22478,449248
FORMULA CO4-PT-17-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 489 transition count 639
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 489 transition count 639
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 479 transition count 628
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 479 transition count 628
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 477 transition count 626
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 477 transition count 626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 476 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 476 transition count 625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 476 transition count 624
Applied a total of 69 rules in 34 ms. Remains 476 /510 variables (removed 34) and now considering 624/660 (removed 36) transitions.
// Phase 1: matrix 624 rows 476 cols
[2025-05-30 12:36:56] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:36:56] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-30 12:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:36:57] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 623 sub problems to find dead transitions.
[2025-05-30 12:36: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/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (OVERLAPS) 624/1100 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:37:26] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:37:26] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 9 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 Real declared 1100/1100 variables, and 482 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/1100 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1100 variables, 623/1105 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 1105 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 476/510 places, 624/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60445 ms. Remains : 476/510 places, 624/660 transitions.
[2025-05-30 12:37:57] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:37:57] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:37:57] [INFO ] Input system was already deterministic with 624 transitions.
[2025-05-30 12:37:57] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:37:57] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:37:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13644444364174943776.gal : 2 ms
[2025-05-30 12:37:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6884116685787463553.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/CTLFireability13644444364174943776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6884116685787463553.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,2.1869e+10,1.2454,45948,2,8961,5,155346,6,0,2524,201080,0


Converting to forward existential form...Done !
original formula: A((AF((AG((p751!=1)) * EG(AX((p149==1))))) * EG((AG((p894==1)) * (AG((p523==1)) + ((p878==1)&&(p882==1)))))) U (((p268==1) + !(AF((p732==...227
=> equivalent forward existential formula: [((Init * !(EG(!((((p268==1) + !(!(EG(!((p732==1)))))) + E(TRUE U (((p663==1)&&(p955==1)) + (!(EX(!((p964==1))))...618
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t42, t43, t46, t131, t162, t1...499
Detected timeout of ITS tools.
[2025-05-30 12:38:27] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:38:27] [INFO ] Applying decomposition
[2025-05-30 12:38:27] [INFO ] Flatten gal took : 10 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/graph12880233414507928079.txt' '-o' '/tmp/graph12880233414507928079.bin' '-w' '/tmp/graph12880233414507928079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12880233414507928079.bin' '-l' '-1' '-v' '-w' '/tmp/graph12880233414507928079.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:38:27] [INFO ] Decomposing Gal with order
[2025-05-30 12:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:38:27] [INFO ] Removed a total of 201 redundant transitions.
[2025-05-30 12:38:27] [INFO ] Flatten gal took : 39 ms
[2025-05-30 12:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 5 ms.
[2025-05-30 12:38:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7784206579095919253.gal : 4 ms
[2025-05-30 12:38:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11855950819093737467.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/CTLFireability7784206579095919253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11855950819093737467.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.1869e+10,0.210349,11876,627,80,14446,1101,1038,23172,116,4140,0


Converting to forward existential form...Done !
original formula: A((AF((AG((i9.u115.p751!=1)) * EG(AX((i1.u13.p149==1))))) * EG((AG((i18.u147.p894==1)) * (AG((i8.u43.p523==1)) + ((i12.u92.p878==1)&&(i19...325
=> equivalent forward existential formula: [((Init * !(EG(!((((i3.u32.p268==1) + !(!(EG(!((i13.u110.p732==1)))))) + E(TRUE U (((i12.u90.p663==1)&&(i18.u155...816
Reverse transition relation is NOT exact ! Due to transitions t18, t46, t69, t131, t198, t253, t326, t331, t357, t376, t507, t545, i0.t504, i0.u7.t511, i1....794
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
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
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 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
(forward)formula 0,1,16.2719,479204,1,0,829036,4078,7428,1.88364e+06,709,23976,780791
FORMULA CO4-PT-17-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 487 transition count 637
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 487 transition count 637
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 476 transition count 624
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 476 transition count 624
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 473 transition count 621
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 473 transition count 621
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 471 transition count 619
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 471 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 471 transition count 617
Applied a total of 80 rules in 43 ms. Remains 471 /510 variables (removed 39) and now considering 617/660 (removed 43) transitions.
// Phase 1: matrix 617 rows 471 cols
[2025-05-30 12:38:43] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:38:43] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-30 12:38:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:38:44] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:38: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/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:39:11] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:39:11] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 471/510 places, 617/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60432 ms. Remains : 471/510 places, 617/660 transitions.
[2025-05-30 12:39:44] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:39:44] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:39:44] [INFO ] Input system was already deterministic with 617 transitions.
[2025-05-30 12:39:44] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:39:44] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:39:44] [INFO ] Time to serialize gal into /tmp/CTLFireability644036154845677876.gal : 2 ms
[2025-05-30 12:39:44] [INFO ] Time to serialize properties into /tmp/CTLFireability18301984189534329170.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/CTLFireability644036154845677876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18301984189534329170.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.87379e+10,1.17576,45520,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AF(E((AF(AG(((p152==1)&&(p878==1)))) + AX(((p576!=1)||(((p232==1)&&(p707==1))&&(p955==1))))) U EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!(E((!(EG(!(!(E(TRUE U !(((p152==1)&&(p878==1)))))))) + !(EX(!(((p576!=1)||(((p232==1)&&(p707==1))&&(...192
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2025-05-30 12:40:14] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:40:14] [INFO ] Applying decomposition
[2025-05-30 12:40:14] [INFO ] Flatten gal took : 10 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/graph17023352383210959293.txt' '-o' '/tmp/graph17023352383210959293.bin' '-w' '/tmp/graph17023352383210959293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17023352383210959293.bin' '-l' '-1' '-v' '-w' '/tmp/graph17023352383210959293.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:40:14] [INFO ] Decomposing Gal with order
[2025-05-30 12:40:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:40:14] [INFO ] Removed a total of 201 redundant transitions.
[2025-05-30 12:40:14] [INFO ] Flatten gal took : 29 ms
[2025-05-30 12:40:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 5 ms.
[2025-05-30 12:40:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14122312989451642498.gal : 4 ms
[2025-05-30 12:40:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5908401059690443711.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/CTLFireability14122312989451642498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5908401059690443711.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.87379e+10,0.261686,14328,608,85,18305,2221,1065,33722,103,8768,0


Converting to forward existential form...Done !
original formula: AF(E((AF(AG(((i2.i0.u15.p152==1)&&(i9.i1.u153.p878==1)))) + AX(((i8.u83.p576!=1)||(((i0.i1.u31.p232==1)&&(i16.i2.u114.p707==1))&&(i18.i0....185
=> equivalent forward existential formula: [FwdG(Init,!(E((!(EG(!(!(E(TRUE U !(((i2.i0.u15.p152==1)&&(i9.i1.u153.p878==1)))))))) + !(EX(!(((i8.u83.p576!=1)...254
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t54, t196, t218, t229, t247, t320, t325, t351, t370, t501, t539, i0.i0.t498, i0.i1....801
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 2
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 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
(forward)formula 0,1,16.1764,409592,1,0,572763,3425,7285,2.06858e+06,547,16307,456255
FORMULA CO4-PT-17-CTLFireability-2025-05 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 : 510/510 places, 660/660 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 487 transition count 637
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 487 transition count 637
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 476 transition count 624
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 476 transition count 624
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 473 transition count 621
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 473 transition count 621
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 471 transition count 619
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 471 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 471 transition count 617
Applied a total of 80 rules in 41 ms. Remains 471 /510 variables (removed 39) and now considering 617/660 (removed 43) transitions.
[2025-05-30 12:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:40:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 12:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:40:31] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:40:58] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:40:59] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 8 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 Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 471/510 places, 617/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60461 ms. Remains : 471/510 places, 617/660 transitions.
[2025-05-30 12:41:31] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:41:31] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:41:31] [INFO ] Input system was already deterministic with 617 transitions.
[2025-05-30 12:41:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:41:31] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:41:31] [INFO ] Time to serialize gal into /tmp/CTLFireability382176830277963473.gal : 2 ms
[2025-05-30 12:41:31] [INFO ] Time to serialize properties into /tmp/CTLFireability319133909723021489.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/CTLFireability382176830277963473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability319133909723021489.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 -...281
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.87379e+10,1.2671,45608,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AF(EG(AX(EX((p232==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(EX((p232==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-05-30 12:42:01] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:42:01] [INFO ] Applying decomposition
[2025-05-30 12:42:01] [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/graph5173238157290025758.txt' '-o' '/tmp/graph5173238157290025758.bin' '-w' '/tmp/graph5173238157290025758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5173238157290025758.bin' '-l' '-1' '-v' '-w' '/tmp/graph5173238157290025758.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:42:01] [INFO ] Decomposing Gal with order
[2025-05-30 12:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:42:01] [INFO ] Removed a total of 224 redundant transitions.
[2025-05-30 12:42:01] [INFO ] Flatten gal took : 34 ms
[2025-05-30 12:42:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2025-05-30 12:42:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3583588170134274657.gal : 5 ms
[2025-05-30 12:42:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7933924423984175245.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/CTLFireability3583588170134274657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7933924423984175245.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.87379e+10,0.236139,13584,755,89,18404,1165,1076,33667,95,4319,0


Converting to forward existential form...Done !
original formula: AF(EG(AX(EX((i2.i0.i1.u30.p232==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(EX((i2.i0.i1.u30.p232==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t196, t206, t247, t351, t370, t501, t539, i0.t498, i0.u8.t505, i1.t442, i1.t432, i2...764
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 487 transition count 637
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 487 transition count 637
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 476 transition count 624
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 476 transition count 624
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 473 transition count 621
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 473 transition count 621
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 471 transition count 619
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 471 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 471 transition count 617
Applied a total of 80 rules in 39 ms. Remains 471 /510 variables (removed 39) and now considering 617/660 (removed 43) transitions.
[2025-05-30 12:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 12:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:31] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:42:59] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:42:59] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 471/510 places, 617/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60478 ms. Remains : 471/510 places, 617/660 transitions.
[2025-05-30 12:43:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:43:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:43:32] [INFO ] Input system was already deterministic with 617 transitions.
[2025-05-30 12:43:32] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:43:32] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:43:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13935251215616380198.gal : 2 ms
[2025-05-30 12:43:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11153295173063742088.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/CTLFireability13935251215616380198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11153295173063742088.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.87379e+10,1.25711,45600,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2025-05-30 12:44:02] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:44:02] [INFO ] Applying decomposition
[2025-05-30 12:44:02] [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/graph11993394310943770342.txt' '-o' '/tmp/graph11993394310943770342.bin' '-w' '/tmp/graph11993394310943770342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11993394310943770342.bin' '-l' '-1' '-v' '-w' '/tmp/graph11993394310943770342.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:44:02] [INFO ] Decomposing Gal with order
[2025-05-30 12:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:44:02] [INFO ] Removed a total of 204 redundant transitions.
[2025-05-30 12:44:02] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 3 ms.
[2025-05-30 12:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1612079222079740420.gal : 3 ms
[2025-05-30 12:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13853761789444274676.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/CTLFireability1612079222079740420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13853761789444274676.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.87379e+10,0.204384,12128,675,89,15218,1212,940,26752,106,4403,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t178, t183, t196, t213, t229, t247, t320, t325, t345, t351, t370, t501, t539, i0.t2...724
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 2
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 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
(forward)formula 0,1,13.9486,348768,1,0,563213,2437,5529,1.96088e+06,512,14537,543653
FORMULA CO4-PT-17-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 490 transition count 640
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 490 transition count 640
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 481 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 481 transition count 629
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 478 transition count 626
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 478 transition count 626
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 476 transition count 624
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 476 transition count 624
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 70 place count 476 transition count 622
Applied a total of 70 rules in 45 ms. Remains 476 /510 variables (removed 34) and now considering 622/660 (removed 38) transitions.
// Phase 1: matrix 622 rows 476 cols
[2025-05-30 12:44:16] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:44:16] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-30 12:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:44:16] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2025-05-30 12:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (OVERLAPS) 622/1098 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:45] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:45] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 482 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/1098 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 621/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 476/510 places, 622/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 476/510 places, 622/660 transitions.
[2025-05-30 12:45:16] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:45:16] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:45:16] [INFO ] Input system was already deterministic with 622 transitions.
[2025-05-30 12:45:16] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:45:16] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:45:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5947295458694976570.gal : 3 ms
[2025-05-30 12:45:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14358531226785237300.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/CTLFireability5947295458694976570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14358531226785237300.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.94553e+10,1.23101,47068,2,8835,5,158997,6,0,2522,207152,0


Converting to forward existential form...Done !
original formula: EG(AX((((p733==0)||(p149==0))||((p515==0)||(((p567==1)&&(p878==1))&&((p89==1)&&(p291==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((((p733==0)||(p149==0))||((p515==0)||(((p567==1)&&(p878==1))&&((p89==1)&&(p291==1)))))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t157, t183, t...488
Detected timeout of ITS tools.
[2025-05-30 12:45:46] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:45:46] [INFO ] Applying decomposition
[2025-05-30 12:45:46] [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/graph6036709270394588787.txt' '-o' '/tmp/graph6036709270394588787.bin' '-w' '/tmp/graph6036709270394588787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6036709270394588787.bin' '-l' '-1' '-v' '-w' '/tmp/graph6036709270394588787.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:45:46] [INFO ] Decomposing Gal with order
[2025-05-30 12:45:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:45:46] [INFO ] Removed a total of 219 redundant transitions.
[2025-05-30 12:45:46] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 4 ms.
[2025-05-30 12:45:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3698821420063610223.gal : 4 ms
[2025-05-30 12:45:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11016315945692813041.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/CTLFireability3698821420063610223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11016315945692813041.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.94553e+10,0.270382,14964,712,94,20273,1299,1117,39606,102,5299,0


Converting to forward existential form...Done !
original formula: EG(AX((((i14.i0.i0.u124.p733==0)||(i2.u15.p149==0))||((i10.u68.p515==0)||(((i8.u81.p567==1)&&(i10.u107.p878==1))&&((i0.u4.p89==1)&&(i3.u3...171
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((((i14.i0.i0.u124.p733==0)||(i2.u15.p149==0))||((i10.u68.p515==0)||(((i8.u81.p567==1)&&(i10.u1...220
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t64, t197, t237, t248, t305, t322, t327, t372, t542, i0.t500, i0.u4.t507, i0.u8.t50...754
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,1,18.2549,438132,1,0,702066,2757,6458,2.64733e+06,491,16133,481951
FORMULA CO4-PT-17-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Graph (trivial) has 542 edges and 510 vertex of which 2 / 510 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 851 edges and 509 vertex of which 506 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 505 transition count 471
Reduce places removed 183 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 186 rules applied. Total rules applied 372 place count 322 transition count 468
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 377 place count 321 transition count 464
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 381 place count 317 transition count 464
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 381 place count 317 transition count 410
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 489 place count 263 transition count 410
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 495 place count 257 transition count 404
Iterating global reduction 4 with 6 rules applied. Total rules applied 501 place count 257 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 501 place count 257 transition count 402
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 505 place count 255 transition count 402
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 507 place count 253 transition count 399
Iterating global reduction 4 with 2 rules applied. Total rules applied 509 place count 253 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 510 place count 253 transition count 398
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 562 place count 227 transition count 372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 565 place count 227 transition count 369
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 571 place count 221 transition count 363
Iterating global reduction 6 with 6 rules applied. Total rules applied 577 place count 221 transition count 363
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 581 place count 219 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 584 place count 219 transition count 358
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 587 place count 218 transition count 356
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 589 place count 217 transition count 355
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 590 place count 216 transition count 354
Iterating global reduction 9 with 1 rules applied. Total rules applied 591 place count 216 transition count 354
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 592 place count 215 transition count 352
Iterating global reduction 9 with 1 rules applied. Total rules applied 593 place count 215 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 594 place count 215 transition count 351
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 10 with 2 rules applied. Total rules applied 596 place count 214 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 609 place count 214 transition count 337
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 8 rules applied. Total rules applied 617 place count 214 transition count 329
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 625 place count 206 transition count 329
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 12 with 2 rules applied. Total rules applied 627 place count 205 transition count 328
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 629 place count 203 transition count 326
Applied a total of 629 rules in 105 ms. Remains 203 /510 variables (removed 307) and now considering 326/660 (removed 334) transitions.
// Phase 1: matrix 326 rows 203 cols
[2025-05-30 12:46:05] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-30 12:46:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:46:05] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:46:05] [INFO ] Redundant transitions in 15 ms returned []
Running 316 sub problems to find dead transitions.
[2025-05-30 12:46:05] [INFO ] Invariant cache hit.
[2025-05-30 12:46:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 325/527 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 1/528 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 1/529 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 0/529 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 208 constraints, problems are : Problem set: 0 solved, 316 unsolved in 28476 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 203/203 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 325/527 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 196/402 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 1/528 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 120/523 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/529 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 524 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 203/203 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58557ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 58557ms
Starting structural reductions in SI_CTL mode, iteration 1 : 203/510 places, 326/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58863 ms. Remains : 203/510 places, 326/660 transitions.
[2025-05-30 12:47:04] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:47:04] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:47:04] [INFO ] Input system was already deterministic with 326 transitions.
[2025-05-30 12:47:04] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:47:04] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:47:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16884014618683313303.gal : 2 ms
[2025-05-30 12:47:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14491695381600855306.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/CTLFireability16884014618683313303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14491695381600855306.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.34217e+08,0.17616,10672,2,1372,5,27425,6,0,1126,20759,0


Converting to forward existential form...Done !
original formula: E(((p718==1)&&(p955==1)) U EG((!(E(AG((p393==1)) U AF((p509==1)))) + ((p964!=1) * AF((p134==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((p718==1)&&(p955==1))),(!(E(!(E(TRUE U !((p393==1)))) U !(EG(!((p509==1)))))) + ((p964!=1) * !(...185
Hit Full ! (commute/partial/dont) 293/32/33
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t72, t79, t84, t105, t114, t122, t174, t199, Intersection with reachable at each st...216
(forward)formula 0,1,26.3466,797868,1,0,977,4.08197e+06,702,596,7285,5.31122e+06,1425
FORMULA CO4-PT-17-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 490 transition count 640
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 490 transition count 640
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 480 transition count 628
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 480 transition count 628
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 477 transition count 625
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 477 transition count 625
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 475 transition count 623
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 475 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 475 transition count 621
Applied a total of 72 rules in 50 ms. Remains 475 /510 variables (removed 35) and now considering 621/660 (removed 39) transitions.
// Phase 1: matrix 621 rows 475 cols
[2025-05-30 12:47:30] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-30 12:47:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:31] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2025-05-30 12:47:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1096 variables, 475/479 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:59] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:59] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 481 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1096 variables, 475/481 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1096 variables, 620/1101 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1101 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 475/510 places, 621/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 475/510 places, 621/660 transitions.
[2025-05-30 12:48:31] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:48:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:48:31] [INFO ] Input system was already deterministic with 621 transitions.
[2025-05-30 12:48:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:48:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:48:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10762703354776476187.gal : 2 ms
[2025-05-30 12:48:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11865269109315179585.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/CTLFireability10762703354776476187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11865269109315179585.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.9343e+10,1.34508,47956,2,8738,5,157994,6,0,2517,216054,0


Converting to forward existential form...Done !
original formula: (E(AG(((AF((p498==1)) + EF(((p626==1)&&(p955==1)))) + (AX((p627==1)) + ((p97==1)&&(p878==1))))) U (p813==1)) + EX(((EX(((p94==1)||(((p274...225
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(((!(EG(!((p498==1)))) + E(TRUE U ((p626==1)&&(p955==1)))) + (!(EX(!((p627==1)))) + ((p...321
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...482
Detected timeout of ITS tools.
[2025-05-30 12:49:01] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:49:01] [INFO ] Applying decomposition
[2025-05-30 12:49:01] [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/graph4833402618849787880.txt' '-o' '/tmp/graph4833402618849787880.bin' '-w' '/tmp/graph4833402618849787880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4833402618849787880.bin' '-l' '-1' '-v' '-w' '/tmp/graph4833402618849787880.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:49:01] [INFO ] Decomposing Gal with order
[2025-05-30 12:49:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:49:01] [INFO ] Removed a total of 221 redundant transitions.
[2025-05-30 12:49:01] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:49:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 3 ms.
[2025-05-30 12:49:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13378536643283728745.gal : 4 ms
[2025-05-30 12:49:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2614881644909643373.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/CTLFireability13378536643283728745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2614881644909643373.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.9343e+10,0.248936,14580,736,94,20351,1273,1073,38978,97,4992,0


Converting to forward existential form...Done !
original formula: (E(AG(((AF((i7.u72.p498==1)) + EF(((i12.u105.p626==1)&&(i19.u174.p955==1)))) + (AX((i12.u105.p627==1)) + ((i1.u7.p97==1)&&(i11.u118.p878=...344
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(((!(EG(!((i7.u72.p498==1)))) + E(TRUE U ((i12.u105.p626==1)&&(i19.u174.p955==1)))) + (...440
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t54, t192, t236, t247, t351, t449, t455, t503, t541, i0.t243, i2.t432, i2.u28.t442,...754
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
(forward)formula 0,0,22.2967,605732,1,0,863654,3595,7430,3.81244e+06,500,15500,621951
FORMULA CO4-PT-17-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 488 transition count 638
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 488 transition count 638
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 477 transition count 625
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 477 transition count 625
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 474 transition count 622
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 474 transition count 622
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 472 transition count 620
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 472 transition count 620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 472 transition count 618
Applied a total of 78 rules in 45 ms. Remains 472 /510 variables (removed 38) and now considering 618/660 (removed 42) transitions.
// Phase 1: matrix 618 rows 472 cols
[2025-05-30 12:49:23] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:24] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-30 12:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:24] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2025-05-30 12:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:49:52] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:49:52] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 9 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 Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 472/510 places, 618/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60493 ms. Remains : 472/510 places, 618/660 transitions.
[2025-05-30 12:50:24] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:50:24] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:50:24] [INFO ] Input system was already deterministic with 618 transitions.
[2025-05-30 12:50:24] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:50:24] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:50:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12570635842505482982.gal : 2 ms
[2025-05-30 12:50:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9021911301143083911.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/CTLFireability12570635842505482982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9021911301143083911.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.88892e+10,1.2457,45680,2,8649,5,152630,6,0,2502,202570,0


Converting to forward existential form...Done !
original formula: EG(EX((EF(EG((p492==0))) + (p113==0))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U EG((p492==0))) + (p113==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...494
Detected timeout of ITS tools.
[2025-05-30 12:50:54] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:50:54] [INFO ] Applying decomposition
[2025-05-30 12:50:54] [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/graph11325057487327115341.txt' '-o' '/tmp/graph11325057487327115341.bin' '-w' '/tmp/graph11325057487327115341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11325057487327115341.bin' '-l' '-1' '-v' '-w' '/tmp/graph11325057487327115341.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:50:54] [INFO ] Decomposing Gal with order
[2025-05-30 12:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:50:54] [INFO ] Removed a total of 205 redundant transitions.
[2025-05-30 12:50:54] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2025-05-30 12:50:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15060930829781694586.gal : 3 ms
[2025-05-30 12:50:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2000068284563379753.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/CTLFireability15060930829781694586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2000068284563379753.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.88892e+10,0.226139,12664,705,93,15621,1209,1111,29433,93,4724,0


Converting to forward existential form...Done !
original formula: EG(EX((EF(EG((i5.u65.p492==0))) + (i0.u7.p113==0))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U EG((i5.u65.p492==0))) + (i0.u7.p113==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t192, t196, t206, t217, t230, t247, t481, t540, i0.u7.t493, i1.t442, i1.t432, i2.t3...815
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 487 transition count 637
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 487 transition count 637
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 476 transition count 624
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 476 transition count 624
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 473 transition count 621
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 473 transition count 621
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 471 transition count 619
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 471 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 471 transition count 617
Applied a total of 80 rules in 44 ms. Remains 471 /510 variables (removed 39) and now considering 617/660 (removed 43) transitions.
// Phase 1: matrix 617 rows 471 cols
[2025-05-30 12:51:24] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:24] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-30 12:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:25] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:51:53] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:51:53] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 471/510 places, 617/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60475 ms. Remains : 471/510 places, 617/660 transitions.
[2025-05-30 12:52:25] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:52:25] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:52:25] [INFO ] Input system was already deterministic with 617 transitions.
[2025-05-30 12:52:25] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:52:25] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:52:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13947834913028095062.gal : 2 ms
[2025-05-30 12:52:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12039211538683382107.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/CTLFireability13947834913028095062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12039211538683382107.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.87379e+10,1.23486,45596,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AX(EX((AG(EF((p435==0))) * ((p729==0)||(p955==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(E(TRUE U !(E(TRUE U (p435==0))))) * ((p729==0)||(p955==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
(forward)formula 0,1,21.9014,604804,1,0,789,2.72014e+06,1256,512,14700,2.23585e+06,1250
FORMULA CO4-PT-17-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 660/660 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 487 transition count 637
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 487 transition count 637
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 476 transition count 624
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 476 transition count 624
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 473 transition count 621
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 473 transition count 621
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 471 transition count 619
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 471 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 471 transition count 617
Applied a total of 80 rules in 33 ms. Remains 471 /510 variables (removed 39) and now considering 617/660 (removed 43) transitions.
[2025-05-30 12:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:52:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-30 12:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:52:47] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:53:15] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:53:15] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 8 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 Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 471/510 places, 617/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60447 ms. Remains : 471/510 places, 617/660 transitions.
[2025-05-30 12:53:47] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:53:47] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:53:47] [INFO ] Input system was already deterministic with 617 transitions.
[2025-05-30 12:53:47] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:53:47] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:53:47] [INFO ] Time to serialize gal into /tmp/CTLFireability750481011251656877.gal : 2 ms
[2025-05-30 12:53:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15659641077752634031.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/CTLFireability750481011251656877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15659641077752634031.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.87379e+10,1.22057,45496,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
(forward)formula 0,1,17.3722,483040,1,0,785,1.7037e+06,1249,509,13542,1.7722e+06,1240
FORMULA CO4-PT-17-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-30 12:54:05] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:54:05] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:54:05] [INFO ] Applying decomposition
[2025-05-30 12:54:05] [INFO ] Flatten gal took : 10 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/graph4808094787941093537.txt' '-o' '/tmp/graph4808094787941093537.bin' '-w' '/tmp/graph4808094787941093537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4808094787941093537.bin' '-l' '-1' '-v' '-w' '/tmp/graph4808094787941093537.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:54:05] [INFO ] Decomposing Gal with order
[2025-05-30 12:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:54:05] [INFO ] Removed a total of 233 redundant transitions.
[2025-05-30 12:54:05] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:54:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2025-05-30 12:54:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3759444418208907934.gal : 4 ms
[2025-05-30 12:54:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15021132173235870469.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/CTLFireability3759444418208907934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15021132173235870469.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09186e+10,0.278772,16184,888,94,22038,1454,1148,45173,93,5308,0


Converting to forward existential form...Done !
original formula: (EG((AX(AF((i9.u108.p583==0))) * ((((i3.u42.p232==1)&&(i19.u197.p959==1))||(i3.u42.p233==1))||(i2.u37.p220==1)))) + (!(A(((i6.u93.p375==1...308
=> equivalent forward existential formula: ([FwdG(Init,(!(EX(!(!(EG(!((i9.u108.p583==0))))))) * ((((i3.u42.p232==1)&&(i19.u197.p959==1))||(i3.u42.p233==1))...939
Reverse transition relation is NOT exact ! Due to transitions t18, t52, t75, t206, t211, t262, t339, t344, t370, t530, t566, i0.t258, i3.t572, i3.t497, i3....850
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 2
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
(forward)formula 0,1,50.7221,1158428,1,0,1.57376e+06,4209,9572,6.88971e+06,552,20549,1158763
FORMULA CO4-PT-17-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EG(AX(EX((i3.u42.p232==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(EX((i3.u42.p232==0))))))))] = FALSE
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
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 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
(forward)formula 1,1,68.2056,1511068,1,0,2.05616e+06,4247,9581,8.35108e+06,553,20826,1627756
FORMULA CO4-PT-17-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX((EF(EG((i7.u82.p492==0))) + (i3.u17.p113==0))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U EG((i7.u82.p492==0))) + (i3.u17.p113==0))))] != FALSE
(forward)formula 2,1,128.227,2200220,1,0,3.12524e+06,4616,2510,1.17628e+07,195,23532,357997
FORMULA CO4-PT-17-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1510686 ms.

BK_STOP 1748609774078

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CO4-PT-17"
export BK_EXAMINATION="CTLFireability"
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 CO4-PT-17, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028600506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-17.tgz
mv CO4-PT-17 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;