About the Execution of ITS-Tools for CloudReconfiguration-PT-301
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1151118.00 | 0.00 | 0.00 | FFFTFFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028000212.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 CloudReconfiguration-PT-301, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028000212
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-301-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-301-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748581709038
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-301
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 05:08:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 05:08:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 05:08:30] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-05-30 05:08:30] [INFO ] Transformed 2584 places.
[2025-05-30 05:08:30] [INFO ] Transformed 3094 transitions.
[2025-05-30 05:08:30] [INFO ] Found NUPN structural information;
[2025-05-30 05:08:30] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-301-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 511 places :
Symmetric choice reduction at 0 with 511 rule applications. Total rules 511 place count 2073 transition count 2583
Iterating global reduction 0 with 511 rules applied. Total rules applied 1022 place count 2073 transition count 2583
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1051 place count 2073 transition count 2554
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1290 place count 1834 transition count 2315
Iterating global reduction 1 with 239 rules applied. Total rules applied 1529 place count 1834 transition count 2315
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 1616 place count 1747 transition count 2228
Iterating global reduction 1 with 87 rules applied. Total rules applied 1703 place count 1747 transition count 2228
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1720 place count 1747 transition count 2211
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1766 place count 1701 transition count 2165
Iterating global reduction 2 with 46 rules applied. Total rules applied 1812 place count 1701 transition count 2165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1820 place count 1701 transition count 2157
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1857 place count 1664 transition count 2116
Iterating global reduction 3 with 37 rules applied. Total rules applied 1894 place count 1664 transition count 2116
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1919 place count 1639 transition count 2091
Iterating global reduction 3 with 25 rules applied. Total rules applied 1944 place count 1639 transition count 2091
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1966 place count 1617 transition count 2069
Iterating global reduction 3 with 22 rules applied. Total rules applied 1988 place count 1617 transition count 2069
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2010 place count 1595 transition count 2047
Iterating global reduction 3 with 22 rules applied. Total rules applied 2032 place count 1595 transition count 2047
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2050 place count 1577 transition count 2017
Iterating global reduction 3 with 18 rules applied. Total rules applied 2068 place count 1577 transition count 2017
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2072 place count 1573 transition count 2011
Iterating global reduction 3 with 4 rules applied. Total rules applied 2076 place count 1573 transition count 2011
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2080 place count 1569 transition count 2007
Iterating global reduction 3 with 4 rules applied. Total rules applied 2084 place count 1569 transition count 2007
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2086 place count 1569 transition count 2005
Applied a total of 2086 rules in 1500 ms. Remains 1569 /2584 variables (removed 1015) and now considering 2005/3094 (removed 1089) transitions.
// Phase 1: matrix 2005 rows 1569 cols
[2025-05-30 05:08:32] [INFO ] Computed 4 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:08:32] [INFO ] Implicit Places using invariants in 456 ms returned []
[2025-05-30 05:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:08:33] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Running 2004 sub problems to find dead transitions.
[2025-05-30 05:08:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1568 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2004 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1568/3574 variables, and 4 constraints, problems are : Problem set: 0 solved, 2004 unsolved in 30073 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1569 constraints, PredecessorRefiner: 2004/2004 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2004 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1568 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2004 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(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 0)
(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 0)
(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 1)
(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 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(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 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 1)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1568/3574 variables, and 4 constraints, problems are : Problem set: 0 solved, 2004 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1569 constraints, PredecessorRefiner: 0/2004 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60694ms problems are : Problem set: 0 solved, 2004 unsolved
Search for dead transitions found 0 dead transitions in 60718ms
Starting structural reductions in LTL mode, iteration 1 : 1569/2584 places, 2005/3094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63813 ms. Remains : 1569/2584 places, 2005/3094 transitions.
Support contains 42 out of 1569 places after structural reductions.
[2025-05-30 05:09:34] [INFO ] Flatten gal took : 120 ms
[2025-05-30 05:09:34] [INFO ] Flatten gal took : 72 ms
[2025-05-30 05:09:35] [INFO ] Input system was already deterministic with 2005 transitions.
Support contains 40 out of 1569 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (309 resets) in 1178 ms. (33 steps per ms) remains 25/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
[2025-05-30 05:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1531/1558 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1558 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1995/3553 variables, 1558/1562 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3553 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 2/3555 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3555 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 2/3557 variables, 1/1564 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3557 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 2/3559 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3559/3574 variables, and 1565 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1561/1569 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1531/1558 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1558 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1995/3553 variables, 1558/1562 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3553 variables, 25/1587 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3553 variables, 0/1587 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 2/3555 variables, 1/1588 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3555/3574 variables, and 1588 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1559/1569 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 1569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1858 edges and 1569 vertex of which 676 / 1569 are part of one of the 65 SCC in 7 ms
Free SCC test removed 611 places
Drop transitions (Empty/Sink Transition effects.) removed 770 transitions
Reduce isomorphic transitions removed 770 transitions.
Graph (complete) has 1408 edges and 958 vertex of which 949 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 514 rules applied. Total rules applied 516 place count 949 transition count 717
Reduce places removed 507 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 559 rules applied. Total rules applied 1075 place count 442 transition count 665
Reduce places removed 33 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 42 rules applied. Total rules applied 1117 place count 409 transition count 656
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 1128 place count 400 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1129 place count 399 transition count 654
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 45 Pre rules applied. Total rules applied 1129 place count 399 transition count 609
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1219 place count 354 transition count 609
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1227 place count 346 transition count 599
Iterating global reduction 5 with 8 rules applied. Total rules applied 1235 place count 346 transition count 599
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 5 with 1 rules applied. Total rules applied 1236 place count 346 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1237 place count 345 transition count 598
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1237 place count 345 transition count 597
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1239 place count 344 transition count 597
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1244 place count 339 transition count 592
Iterating global reduction 7 with 5 rules applied. Total rules applied 1249 place count 339 transition count 592
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1254 place count 339 transition count 587
Performed 169 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 8 with 338 rules applied. Total rules applied 1592 place count 170 transition count 323
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1617 place count 170 transition count 298
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1621 place count 166 transition count 294
Iterating global reduction 9 with 4 rules applied. Total rules applied 1625 place count 166 transition count 294
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1626 place count 165 transition count 293
Iterating global reduction 9 with 1 rules applied. Total rules applied 1627 place count 165 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1628 place count 165 transition count 292
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1646 place count 156 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1655 place count 156 transition count 273
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 11 with 2 rules applied. Total rules applied 1657 place count 155 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1659 place count 155 transition count 270
Performed 30 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 1719 place count 125 transition count 302
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 12 with 23 rules applied. Total rules applied 1742 place count 125 transition count 279
Discarding 15 places :
Symmetric choice reduction at 13 with 15 rule applications. Total rules 1757 place count 110 transition count 249
Iterating global reduction 13 with 15 rules applied. Total rules applied 1772 place count 110 transition count 249
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1777 place count 110 transition count 244
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1781 place count 106 transition count 236
Iterating global reduction 14 with 4 rules applied. Total rules applied 1785 place count 106 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1788 place count 106 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 15 with 11 rules applied. Total rules applied 1799 place count 106 transition count 222
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 15 with 2 rules applied. Total rules applied 1801 place count 105 transition count 221
Free-agglomeration rule applied 12 times.
Iterating global reduction 15 with 12 rules applied. Total rules applied 1813 place count 105 transition count 209
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 14 rules applied. Total rules applied 1827 place count 93 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1829 place count 93 transition count 205
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 1836 place count 93 transition count 205
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1838 place count 93 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1839 place count 93 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1840 place count 92 transition count 203
Applied a total of 1840 rules in 167 ms. Remains 92 /1569 variables (removed 1477) and now considering 203/2005 (removed 1802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 92/1569 places, 203/2005 transitions.
RANDOM walk for 40000 steps (679 resets) in 588 ms. (67 steps per ms) remains 0/25 properties
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2182 edges and 1569 vertex of which 1560 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U (G((F(p2)||G(p3))) U p4)))'
Support contains 5 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1907 edges and 1569 vertex of which 695 / 1569 are part of one of the 63 SCC in 4 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1442 edges and 937 vertex of which 928 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 512 rules applied. Total rules applied 514 place count 927 transition count 752
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 537 rules applied. Total rules applied 1051 place count 415 transition count 727
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1064 place count 403 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1065 place count 402 transition count 726
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1065 place count 402 transition count 682
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1153 place count 358 transition count 682
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1169 place count 342 transition count 656
Iterating global reduction 4 with 16 rules applied. Total rules applied 1185 place count 342 transition count 656
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 4 with 2 rules applied. Total rules applied 1187 place count 342 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1188 place count 341 transition count 654
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1198 place count 331 transition count 640
Iterating global reduction 6 with 10 rules applied. Total rules applied 1208 place count 331 transition count 640
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 1215 place count 331 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1216 place count 330 transition count 633
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1218 place count 328 transition count 629
Iterating global reduction 8 with 2 rules applied. Total rules applied 1220 place count 328 transition count 629
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1222 place count 326 transition count 625
Iterating global reduction 8 with 2 rules applied. Total rules applied 1224 place count 326 transition count 625
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1226 place count 324 transition count 621
Iterating global reduction 8 with 2 rules applied. Total rules applied 1228 place count 324 transition count 621
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1230 place count 322 transition count 617
Iterating global reduction 8 with 2 rules applied. Total rules applied 1232 place count 322 transition count 617
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1234 place count 320 transition count 613
Iterating global reduction 8 with 2 rules applied. Total rules applied 1236 place count 320 transition count 613
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1237 place count 319 transition count 606
Iterating global reduction 8 with 1 rules applied. Total rules applied 1238 place count 319 transition count 606
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 8 with 1 rules applied. Total rules applied 1239 place count 319 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1240 place count 318 transition count 605
Performed 154 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 10 with 308 rules applied. Total rules applied 1548 place count 164 transition count 359
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1558 place count 164 transition count 349
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1563 place count 159 transition count 343
Iterating global reduction 11 with 5 rules applied. Total rules applied 1568 place count 159 transition count 343
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1569 place count 158 transition count 342
Iterating global reduction 11 with 1 rules applied. Total rules applied 1570 place count 158 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1571 place count 158 transition count 341
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 1589 place count 149 transition count 331
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 1596 place count 149 transition count 324
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1597 place count 148 transition count 320
Iterating global reduction 13 with 1 rules applied. Total rules applied 1598 place count 148 transition count 320
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 13 with 2 rules applied. Total rules applied 1600 place count 147 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1602 place count 147 transition count 317
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1636 place count 130 transition count 351
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1653 place count 130 transition count 334
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1662 place count 121 transition count 316
Iterating global reduction 15 with 9 rules applied. Total rules applied 1671 place count 121 transition count 316
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1677 place count 121 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 16 with 36 rules applied. Total rules applied 1713 place count 121 transition count 274
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1715 place count 121 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1716 place count 121 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1717 place count 120 transition count 272
Applied a total of 1717 rules in 160 ms. Remains 120 /1569 variables (removed 1449) and now considering 272/2005 (removed 1733) transitions.
[2025-05-30 05:09:46] [INFO ] Flow matrix only has 215 transitions (discarded 57 similar events)
// Phase 1: matrix 215 rows 120 cols
[2025-05-30 05:09:46] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:09:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 05:09:46] [INFO ] Flow matrix only has 215 transitions (discarded 57 similar events)
[2025-05-30 05:09:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:09:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 05:09:47] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 05:09:47] [INFO ] Redundant transitions in 13 ms returned []
Running 271 sub problems to find dead transitions.
[2025-05-30 05:09:47] [INFO ] Flow matrix only has 215 transitions (discarded 57 similar events)
[2025-05-30 05:09:47] [INFO ] Invariant cache hit.
[2025-05-30 05:09:47] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 214/333 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 1/334 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 1/335 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 123 constraints, problems are : Problem set: 0 solved, 271 unsolved in 17390 ms.
Refiners :[State Equation: 120/120 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 214/333 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 271/392 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 1/334 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/335 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 394 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30018 ms.
Refiners :[State Equation: 120/120 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47493ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 47494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/1569 places, 272/2005 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47843 ms. Remains : 120/1569 places, 272/2005 transitions.
Stuttering acceptance computed with spot in 580 ms :[(NOT p4), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p4), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) p0 (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p4))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-00 finished in 48502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1916 edges and 1569 vertex of which 695 / 1569 are part of one of the 63 SCC in 2 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1442 edges and 937 vertex of which 928 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 514 transitions
Trivial Post-agglo rules discarded 514 transitions
Performed 514 trivial Post agglomeration. Transition count delta: 514
Iterating post reduction 0 with 514 rules applied. Total rules applied 516 place count 927 transition count 750
Reduce places removed 514 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 539 rules applied. Total rules applied 1055 place count 413 transition count 725
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1067 place count 401 transition count 725
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1067 place count 401 transition count 681
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1155 place count 357 transition count 681
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1174 place count 338 transition count 650
Iterating global reduction 3 with 19 rules applied. Total rules applied 1193 place count 338 transition count 650
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 3 with 2 rules applied. Total rules applied 1195 place count 338 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1196 place count 337 transition count 648
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1196 place count 337 transition count 647
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1198 place count 336 transition count 647
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1208 place count 326 transition count 633
Iterating global reduction 5 with 10 rules applied. Total rules applied 1218 place count 326 transition count 633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 7 rules applied. Total rules applied 1225 place count 326 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1226 place count 325 transition count 626
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1228 place count 323 transition count 622
Iterating global reduction 7 with 2 rules applied. Total rules applied 1230 place count 323 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1232 place count 321 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1234 place count 321 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1236 place count 319 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1238 place count 319 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1240 place count 317 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1242 place count 317 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1244 place count 315 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1246 place count 315 transition count 606
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1247 place count 314 transition count 599
Iterating global reduction 7 with 1 rules applied. Total rules applied 1248 place count 314 transition count 599
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 1 rules applied. Total rules applied 1249 place count 314 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1250 place count 313 transition count 598
Performed 155 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 9 with 310 rules applied. Total rules applied 1560 place count 158 transition count 348
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1569 place count 158 transition count 339
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1574 place count 153 transition count 333
Iterating global reduction 10 with 5 rules applied. Total rules applied 1579 place count 153 transition count 333
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1580 place count 152 transition count 332
Iterating global reduction 10 with 1 rules applied. Total rules applied 1581 place count 152 transition count 332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1582 place count 152 transition count 331
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1602 place count 142 transition count 320
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1611 place count 142 transition count 311
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1612 place count 141 transition count 307
Iterating global reduction 12 with 1 rules applied. Total rules applied 1613 place count 141 transition count 307
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 1615 place count 140 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1617 place count 140 transition count 304
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 1651 place count 123 transition count 338
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 1667 place count 123 transition count 322
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1676 place count 114 transition count 304
Iterating global reduction 14 with 9 rules applied. Total rules applied 1685 place count 114 transition count 304
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1690 place count 114 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1726 place count 114 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1727 place count 113 transition count 262
Applied a total of 1727 rules in 120 ms. Remains 113 /1569 variables (removed 1456) and now considering 262/2005 (removed 1743) transitions.
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 113 cols
[2025-05-30 05:10:35] [INFO ] Computed 0 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2025-05-30 05:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 05:10:35] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [8, 43, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 168 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1569 places, 262/2005 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 259
Applied a total of 3 rules in 12 ms. Remains 107 /110 variables (removed 3) and now considering 259/262 (removed 3) transitions.
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
// Phase 1: matrix 202 rows 107 cols
[2025-05-30 05:10:35] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2025-05-30 05:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 05:10:35] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1569 places, 259/2005 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 417 ms. Remains : 107/1569 places, 259/2005 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-01 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 1 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1916 edges and 1569 vertex of which 695 / 1569 are part of one of the 63 SCC in 3 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1442 edges and 937 vertex of which 928 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 514 transitions
Trivial Post-agglo rules discarded 514 transitions
Performed 514 trivial Post agglomeration. Transition count delta: 514
Iterating post reduction 0 with 514 rules applied. Total rules applied 516 place count 927 transition count 750
Reduce places removed 514 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 539 rules applied. Total rules applied 1055 place count 413 transition count 725
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1067 place count 401 transition count 725
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1067 place count 401 transition count 681
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1155 place count 357 transition count 681
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1174 place count 338 transition count 650
Iterating global reduction 3 with 19 rules applied. Total rules applied 1193 place count 338 transition count 650
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 3 with 2 rules applied. Total rules applied 1195 place count 338 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1196 place count 337 transition count 648
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1196 place count 337 transition count 647
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1198 place count 336 transition count 647
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1208 place count 326 transition count 633
Iterating global reduction 5 with 10 rules applied. Total rules applied 1218 place count 326 transition count 633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 7 rules applied. Total rules applied 1225 place count 326 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1226 place count 325 transition count 626
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1228 place count 323 transition count 622
Iterating global reduction 7 with 2 rules applied. Total rules applied 1230 place count 323 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1232 place count 321 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1234 place count 321 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1236 place count 319 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1238 place count 319 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1240 place count 317 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1242 place count 317 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1244 place count 315 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1246 place count 315 transition count 606
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1247 place count 314 transition count 599
Iterating global reduction 7 with 1 rules applied. Total rules applied 1248 place count 314 transition count 599
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 1 rules applied. Total rules applied 1249 place count 314 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1250 place count 313 transition count 598
Performed 155 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 9 with 310 rules applied. Total rules applied 1560 place count 158 transition count 349
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1569 place count 158 transition count 340
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1574 place count 153 transition count 334
Iterating global reduction 10 with 5 rules applied. Total rules applied 1579 place count 153 transition count 334
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1580 place count 152 transition count 333
Iterating global reduction 10 with 1 rules applied. Total rules applied 1581 place count 152 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1582 place count 152 transition count 332
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1602 place count 142 transition count 321
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1611 place count 142 transition count 312
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 36 rules applied. Total rules applied 1647 place count 124 transition count 346
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 12 with 19 rules applied. Total rules applied 1666 place count 124 transition count 327
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1675 place count 115 transition count 309
Iterating global reduction 13 with 9 rules applied. Total rules applied 1684 place count 115 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1690 place count 115 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 14 with 37 rules applied. Total rules applied 1727 place count 115 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1728 place count 114 transition count 265
Applied a total of 1728 rules in 90 ms. Remains 114 /1569 variables (removed 1455) and now considering 265/2005 (removed 1740) transitions.
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
// Phase 1: matrix 209 rows 114 cols
[2025-05-30 05:10:35] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
[2025-05-30 05:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 05:10:35] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [11, 44, 77]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 164 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1569 places, 265/2005 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 262
Applied a total of 3 rules in 10 ms. Remains 108 /111 variables (removed 3) and now considering 262/265 (removed 3) transitions.
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
// Phase 1: matrix 206 rows 108 cols
[2025-05-30 05:10:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-30 05:10:35] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
[2025-05-30 05:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 05:10:36] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1569 places, 262/2005 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 108/1569 places, 262/2005 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-02
Stuttering criterion allowed to conclude after 1692 steps with 171 reset in 21 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-02 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X((X(!p0)||F((!p0 U (p2||G(!p0))))))))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1546 transition count 1979
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1546 transition count 1979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1546 transition count 1978
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 1537 transition count 1969
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 1537 transition count 1969
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1537 transition count 1968
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 1530 transition count 1961
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 1530 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 1530 transition count 1960
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 87 place count 1524 transition count 1951
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 1524 transition count 1951
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 1519 transition count 1945
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 1519 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 1516 transition count 1942
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 1514 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1512 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1510 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 1509 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 1509 transition count 1932
Applied a total of 123 rules in 697 ms. Remains 1509 /1569 variables (removed 60) and now considering 1932/2005 (removed 73) transitions.
// Phase 1: matrix 1932 rows 1509 cols
[2025-05-30 05:10:36] [INFO ] Computed 4 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:37] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-30 05:10:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:10:38] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 05:10:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60566ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60570ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1569 places, 1932/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62449 ms. Remains : 1509/1569 places, 1932/2005 transitions.
Stuttering acceptance computed with spot in 604 ms :[(AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Product exploration explored 100000 steps with 50000 reset in 517 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2107 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 22 ms. Reduced automaton from 13 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-301-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-301-LTLFireability-03 finished in 64134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||X(G(p1)))))))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1978
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1977
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 1535 transition count 1966
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 1535 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 1535 transition count 1965
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 1527 transition count 1957
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 1527 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 1527 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 1521 transition count 1947
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 1521 transition count 1947
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 104 place count 1516 transition count 1941
Iterating global reduction 3 with 5 rules applied. Total rules applied 109 place count 1516 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 1513 transition count 1938
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 1511 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 1509 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 1507 transition count 1929
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1506 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1506 transition count 1928
Applied a total of 129 rules in 633 ms. Remains 1506 /1569 variables (removed 63) and now considering 1928/2005 (removed 77) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 05:11:40] [INFO ] Computed 4 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:11:41] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-30 05:11:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:11:42] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 05:11:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1569 places, 1928/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62187 ms. Remains : 1506/1569 places, 1928/2005 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-05
Product exploration explored 100000 steps with 769 reset in 193 ms.
Product exploration explored 100000 steps with 760 reset in 290 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2103 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (308 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 146 ms. (272 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
[2025-05-30 05:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 802/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3055 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 802/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1513 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4818 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7884ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 115 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1837 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1302 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 867 transition count 634
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 544 rules applied. Total rules applied 1040 place count 380 transition count 577
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 38 rules applied. Total rules applied 1078 place count 343 transition count 576
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1081 place count 342 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1082 place count 341 transition count 574
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1082 place count 341 transition count 525
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1180 place count 292 transition count 525
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1191 place count 281 transition count 509
Iterating global reduction 5 with 11 rules applied. Total rules applied 1202 place count 281 transition count 509
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 1205 place count 281 transition count 506
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1208 place count 278 transition count 506
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1215 place count 271 transition count 498
Iterating global reduction 7 with 7 rules applied. Total rules applied 1222 place count 271 transition count 498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1228 place count 271 transition count 492
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1229 place count 270 transition count 486
Iterating global reduction 8 with 1 rules applied. Total rules applied 1230 place count 270 transition count 486
Performed 142 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 8 with 284 rules applied. Total rules applied 1514 place count 128 transition count 249
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1528 place count 128 transition count 235
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1531 place count 125 transition count 232
Iterating global reduction 9 with 3 rules applied. Total rules applied 1534 place count 125 transition count 232
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1560 place count 112 transition count 216
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1575 place count 112 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1577 place count 111 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1579 place count 111 transition count 198
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 11 with 2 rules applied. Total rules applied 1581 place count 110 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1583 place count 110 transition count 195
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1649 place count 77 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 12 with 47 rules applied. Total rules applied 1696 place count 77 transition count 178
Discarding 23 places :
Symmetric choice reduction at 13 with 23 rule applications. Total rules 1719 place count 54 transition count 148
Iterating global reduction 13 with 23 rules applied. Total rules applied 1742 place count 54 transition count 148
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 1756 place count 54 transition count 134
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1762 place count 48 transition count 122
Iterating global reduction 14 with 6 rules applied. Total rules applied 1768 place count 48 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1773 place count 48 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1794 place count 48 transition count 96
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1796 place count 46 transition count 90
Iterating global reduction 15 with 2 rules applied. Total rules applied 1798 place count 46 transition count 90
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1800 place count 44 transition count 88
Iterating global reduction 15 with 2 rules applied. Total rules applied 1802 place count 44 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1804 place count 44 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1806 place count 44 transition count 84
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 1811 place count 44 transition count 79
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1817 place count 39 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1818 place count 39 transition count 77
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 17 with 6 rules applied. Total rules applied 1824 place count 39 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1826 place count 39 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1827 place count 38 transition count 74
Applied a total of 1827 rules in 64 ms. Remains 38 /1506 variables (removed 1468) and now considering 74/1928 (removed 1854) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 38/1506 places, 74/1928 transitions.
RANDOM walk for 40000 steps (1084 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (351 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Probably explored full state space saw : 2503 states, properties seen :0
Probabilistic random walk after 10257 steps, saw 2503 distinct states, run finished after 25 ms. (steps per millisecond=410 ) properties seen :0
Explored full state space saw : 2503 states, properties seen :0
Exhaustive walk after 10257 steps, saw 2503 distinct states, run finished after 12 ms. (steps per millisecond=854 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 67 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2025-05-30 05:12:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:12:52] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-05-30 05:12:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:12:53] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 05:12:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Finished structural reductions in LTL mode , in 1 iterations and 61598 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2103 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (310 resets) in 148 ms. (268 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (76 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2025-05-30 05:13:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 288/289 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1206/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2301 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 288/289 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1206/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2065 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4378ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1839 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1302 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 867 transition count 633
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 545 rules applied. Total rules applied 1042 place count 379 transition count 576
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 38 rules applied. Total rules applied 1080 place count 342 transition count 575
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1083 place count 341 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1084 place count 340 transition count 573
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1084 place count 340 transition count 524
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1182 place count 291 transition count 524
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1193 place count 280 transition count 508
Iterating global reduction 5 with 11 rules applied. Total rules applied 1204 place count 280 transition count 508
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 1207 place count 280 transition count 505
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1210 place count 277 transition count 505
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1217 place count 270 transition count 497
Iterating global reduction 7 with 7 rules applied. Total rules applied 1224 place count 270 transition count 497
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1230 place count 270 transition count 491
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1231 place count 269 transition count 485
Iterating global reduction 8 with 1 rules applied. Total rules applied 1232 place count 269 transition count 485
Performed 143 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 8 with 286 rules applied. Total rules applied 1518 place count 126 transition count 246
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1532 place count 126 transition count 232
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1535 place count 123 transition count 229
Iterating global reduction 9 with 3 rules applied. Total rules applied 1538 place count 123 transition count 229
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1564 place count 110 transition count 213
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1579 place count 110 transition count 198
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 1581 place count 109 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1583 place count 109 transition count 195
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 11 with 2 rules applied. Total rules applied 1585 place count 108 transition count 194
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1587 place count 108 transition count 192
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1653 place count 75 transition count 222
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 12 with 47 rules applied. Total rules applied 1700 place count 75 transition count 175
Discarding 23 places :
Symmetric choice reduction at 13 with 23 rule applications. Total rules 1723 place count 52 transition count 145
Iterating global reduction 13 with 23 rules applied. Total rules applied 1746 place count 52 transition count 145
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 1760 place count 52 transition count 131
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1766 place count 46 transition count 119
Iterating global reduction 14 with 6 rules applied. Total rules applied 1772 place count 46 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1778 place count 46 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 15 with 20 rules applied. Total rules applied 1798 place count 46 transition count 93
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1800 place count 44 transition count 87
Iterating global reduction 15 with 2 rules applied. Total rules applied 1802 place count 44 transition count 87
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1804 place count 42 transition count 85
Iterating global reduction 15 with 2 rules applied. Total rules applied 1806 place count 42 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1808 place count 42 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1810 place count 42 transition count 81
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1814 place count 42 transition count 77
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1819 place count 38 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1820 place count 38 transition count 75
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 17 with 6 rules applied. Total rules applied 1826 place count 38 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1828 place count 38 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1829 place count 37 transition count 72
Applied a total of 1829 rules in 50 ms. Remains 37 /1506 variables (removed 1469) and now considering 72/1928 (removed 1856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 37/1506 places, 72/1928 transitions.
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 771 reset in 165 ms.
Product exploration explored 100000 steps with 788 reset in 158 ms.
Applying partial POR strategy [true, true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1837 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1365 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 867 transition count 1191
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 487 place count 867 transition count 1179
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 487 place count 867 transition count 1191
Deduced a syphon composed of 494 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 508 place count 867 transition count 1191
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 790 place count 585 transition count 899
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1072 place count 585 transition count 899
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1084 place count 573 transition count 883
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1096 place count 573 transition count 883
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1102 place count 573 transition count 877
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1114 place count 561 transition count 865
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1126 place count 561 transition count 865
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1128 place count 559 transition count 861
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1130 place count 559 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1132 place count 557 transition count 857
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1134 place count 557 transition count 857
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1138 place count 553 transition count 853
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1142 place count 553 transition count 853
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1144 place count 551 transition count 849
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1146 place count 551 transition count 849
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1147 place count 550 transition count 847
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1148 place count 550 transition count 847
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1150 place count 548 transition count 844
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1152 place count 548 transition count 844
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1154 place count 546 transition count 836
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1156 place count 546 transition count 836
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1158 place count 544 transition count 834
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1160 place count 544 transition count 834
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 318 places in 1 ms
Iterating global reduction 3 with 107 rules applied. Total rules applied 1267 place count 544 transition count 909
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 1308 place count 544 transition count 868
Discarding 101 places :
Symmetric choice reduction at 4 with 101 rule applications. Total rules 1409 place count 443 transition count 757
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 4 with 101 rules applied. Total rules applied 1510 place count 443 transition count 757
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1516 place count 437 transition count 748
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1522 place count 437 transition count 748
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1529 place count 437 transition count 748
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1534 place count 437 transition count 743
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1549 place count 422 transition count 724
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1564 place count 422 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1570 place count 422 transition count 718
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1574 place count 418 transition count 714
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1578 place count 418 transition count 714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1581 place count 418 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1587 place count 418 transition count 708
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1590 place count 415 transition count 705
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1593 place count 415 transition count 705
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 7 with 70 rules applied. Total rules applied 1663 place count 415 transition count 1023
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 7 with 123 rules applied. Total rules applied 1786 place count 415 transition count 900
Discarding 124 places :
Symmetric choice reduction at 8 with 124 rule applications. Total rules 1910 place count 291 transition count 572
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 8 with 124 rules applied. Total rules applied 2034 place count 291 transition count 572
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2049 place count 291 transition count 557
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 2076 place count 264 transition count 500
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 2103 place count 264 transition count 500
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2106 place count 264 transition count 548
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2109 place count 261 transition count 521
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2112 place count 261 transition count 521
Deduced a syphon composed of 141 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 9 with 50 rules applied. Total rules applied 2162 place count 261 transition count 471
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2166 place count 257 transition count 467
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2170 place count 257 transition count 467
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2173 place count 257 transition count 527
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2176 place count 254 transition count 512
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2179 place count 254 transition count 512
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 2179 rules in 294 ms. Remains 254 /1506 variables (removed 1252) and now considering 512/1928 (removed 1416) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 05:14:01] [INFO ] Redundant transitions in 10 ms returned []
Running 511 sub problems to find dead transitions.
[2025-05-30 05:14:01] [INFO ] Flow matrix only has 456 transitions (discarded 56 similar events)
// Phase 1: matrix 456 rows 254 cols
[2025-05-30 05:14:01] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 05:14:01] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
At refinement iteration 1 (OVERLAPS) 455/708 variables, 253/253 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/708 variables, 3/256 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/708 variables, 0/256 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 1/709 variables, 1/257 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 0/257 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/710 variables, 1/258 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/710 variables, 0/258 constraints. Problems are: Problem set: 244 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 710/710 variables, and 258 constraints, problems are : Problem set: 244 solved, 267 unsolved in 30019 ms.
Refiners :[State Equation: 254/254 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 511/511 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 244 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 452/568 variables, 116/116 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 3/119 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 267/386 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 0/386 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 141/709 variables, 138/524 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 0/524 constraints. Problems are: Problem set: 244 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/710 variables, 1/525 constraints. Problems are: Problem set: 244 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/710 variables, and 525 constraints, problems are : Problem set: 244 solved, 267 unsolved in 30012 ms.
Refiners :[State Equation: 254/254 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 267/511 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 244 solved, 267 unsolved
Search for dead transitions found 244 dead transitions in 60122ms
Found 244 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 244 transitions
Dead transitions reduction (with SMT) removed 244 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 254/1506 places, 268/1928 transitions.
Graph (complete) has 412 edges and 254 vertex of which 117 are kept as prefixes of interest. Removing 137 places using SCC suffix rule.0 ms
Discarding 137 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 117 /254 variables (removed 137) and now considering 268/268 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1506 places, 268/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60444 ms. Remains : 117/1506 places, 268/1928 transitions.
Built C files in :
/tmp/ltsmin2023583760953426714
[2025-05-30 05:15:01] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2023583760953426714
Running compilation step : cd /tmp/ltsmin2023583760953426714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2023583760953426714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2023583760953426714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 54 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 05:15:04] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:15:04] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 05:15:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:15:05] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 05:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s1193 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 1.0)
(s1104 0.0)
(s1105 1.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 1.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 1.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 1.0)
(s1123 0.0)
(s1124 0.0)
(s1125 1.0)
(s1126 1.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Finished structural reductions in LTL mode , in 1 iterations and 61576 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin7257086400598111887
[2025-05-30 05:16:06] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7257086400598111887
Running compilation step : cd /tmp/ltsmin7257086400598111887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7257086400598111887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7257086400598111887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 05:16:09] [INFO ] Flatten gal took : 52 ms
[2025-05-30 05:16:09] [INFO ] Flatten gal took : 50 ms
[2025-05-30 05:16:09] [INFO ] Time to serialize gal into /tmp/LTL10954216022014493279.gal : 14 ms
[2025-05-30 05:16:09] [INFO ] Time to serialize properties into /tmp/LTL14455082925247305977.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10954216022014493279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3027139310460487833.hoa' '-atoms' '/tmp/LTL14455082925247305977.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14455082925247305977.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3027139310460487833.hoa
Detected timeout of ITS tools.
[2025-05-30 05:16:24] [INFO ] Flatten gal took : 45 ms
[2025-05-30 05:16:24] [INFO ] Flatten gal took : 41 ms
[2025-05-30 05:16:24] [INFO ] Time to serialize gal into /tmp/LTL13745901293426854675.gal : 9 ms
[2025-05-30 05:16:24] [INFO ] Time to serialize properties into /tmp/LTL6128336065861070425.ltl : 4 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13745901293426854675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6128336065861070425.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(p862==0)"))||(X(G("(p191!=1)"))))))))
Formula 0 simplified : XXX(F!"(p862==0)" & XF!"(p191!=1)")
Detected timeout of ITS tools.
[2025-05-30 05:16:39] [INFO ] Flatten gal took : 36 ms
[2025-05-30 05:16:39] [INFO ] Applying decomposition
[2025-05-30 05:16:39] [INFO ] Flatten gal took : 37 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/graph6720048328408518442.txt' '-o' '/tmp/graph6720048328408518442.bin' '-w' '/tmp/graph6720048328408518442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6720048328408518442.bin' '-l' '-1' '-v' '-w' '/tmp/graph6720048328408518442.weights' '-q' '0' '-e' '0.001'
[2025-05-30 05:16:40] [INFO ] Decomposing Gal with order
[2025-05-30 05:16:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:16:40] [INFO ] Removed a total of 526 redundant transitions.
[2025-05-30 05:16:40] [INFO ] Flatten gal took : 123 ms
[2025-05-30 05:16:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 26 ms.
[2025-05-30 05:16:40] [INFO ] Time to serialize gal into /tmp/LTL6572691616097714885.gal : 18 ms
[2025-05-30 05:16:40] [INFO ] Time to serialize properties into /tmp/LTL14199041553980456302.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6572691616097714885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14199041553980456302.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(i9.u210.p862==0)"))||(X(G("(i1.u23.p191!=1)"))))))))
Formula 0 simplified : XXX(F!"(i9.u210.p862==0)" & XF!"(i1.u23.p191!=1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t206, t288, t319, t348, t399, t470, t520, t523, t683, t765, t825, t874, t945, t996, t116...2059
Computing Next relation with stutter on 91936 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
557 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.73221,228884,1,0,382445,8787,22652,681587,580,57896,1679783
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-301-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-301-LTLFireability-05 finished in 306721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1)) U (!p2&&F(p3))))'
Support contains 4 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1546 transition count 1980
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1546 transition count 1980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1546 transition count 1979
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 1538 transition count 1971
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 1538 transition count 1971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 1538 transition count 1970
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 1531 transition count 1963
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 1531 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 1531 transition count 1962
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 85 place count 1525 transition count 1953
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 1525 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 1520 transition count 1947
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 1520 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 1517 transition count 1944
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 1517 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 1515 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 1515 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 1513 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 1510 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 1510 transition count 1934
Applied a total of 121 rules in 640 ms. Remains 1510 /1569 variables (removed 59) and now considering 1934/2005 (removed 71) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2025-05-30 05:16:47] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:16:47] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-05-30 05:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:16:48] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2025-05-30 05:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 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 0)
(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 0)
(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 1)
(s234 1)
(s235 1)
(s236 0)
(s237 0)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(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 1)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(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 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60453ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1569 places, 1934/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62264 ms. Remains : 1510/1569 places, 1934/2005 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p3) p2), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-06
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-06 finished in 62500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U ((!p1&&X(p0))||X(G(p0)))) U X(X(p2))))'
Support contains 4 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1978
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1977
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 1536 transition count 1967
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 1536 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1536 transition count 1966
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 1529 transition count 1959
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 1529 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 1524 transition count 1951
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 1524 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 1520 transition count 1946
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 1520 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 1517 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 1515 transition count 1941
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 1515 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 1513 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 1511 transition count 1934
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 1510 transition count 1933
Applied a total of 120 rules in 610 ms. Remains 1510 /1569 variables (removed 59) and now considering 1933/2005 (removed 72) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2025-05-30 05:17:50] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:17:50] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-30 05:17:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:17:51] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 05:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1569 places, 1933/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62084 ms. Remains : 1510/1569 places, 1933/2005 transitions.
Stuttering acceptance computed with spot in 517 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-07
Product exploration explored 100000 steps with 25009 reset in 322 ms.
Product exploration explored 100000 steps with 25029 reset in 360 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2108 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 11 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (311 resets) in 301 ms. (132 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (83 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (82 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (82 resets) in 77 ms. (512 steps per ms) remains 1/3 properties
[2025-05-30 05:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1095/1098 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1098 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1499 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1499 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3422 variables, 1499/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3443/3443 variables, and 1514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2263 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1510 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1095/1098 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1098 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1499 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1499 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3422 variables, 1499/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3438 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3440 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3442 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3442 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3443 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3443 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3443 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3443/3443 variables, and 1515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2059 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1510 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4332ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1841 edges and 1510 vertex of which 692 / 1510 are part of one of the 63 SCC in 1 ms
Free SCC test removed 629 places
Drop transitions (Empty/Sink Transition effects.) removed 794 transitions
Reduce isomorphic transitions removed 794 transitions.
Graph (complete) has 1309 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 872 transition count 637
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 551 rules applied. Total rules applied 1051 place count 381 transition count 577
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1090 place count 342 transition count 577
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1090 place count 342 transition count 528
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1188 place count 293 transition count 528
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1198 place count 283 transition count 514
Iterating global reduction 3 with 10 rules applied. Total rules applied 1208 place count 283 transition count 514
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1210 place count 283 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1212 place count 281 transition count 512
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1220 place count 273 transition count 502
Iterating global reduction 5 with 8 rules applied. Total rules applied 1228 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1234 place count 273 transition count 496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1235 place count 272 transition count 490
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 272 transition count 490
Performed 144 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 6 with 288 rules applied. Total rules applied 1524 place count 128 transition count 248
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1538 place count 128 transition count 234
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1541 place count 125 transition count 231
Iterating global reduction 7 with 3 rules applied. Total rules applied 1544 place count 125 transition count 231
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1568 place count 113 transition count 217
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1582 place count 113 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1584 place count 112 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1586 place count 112 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1588 place count 111 transition count 199
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1590 place count 111 transition count 197
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1656 place count 78 transition count 227
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 10 with 47 rules applied. Total rules applied 1703 place count 78 transition count 180
Discarding 23 places :
Symmetric choice reduction at 11 with 23 rule applications. Total rules 1726 place count 55 transition count 150
Iterating global reduction 11 with 23 rules applied. Total rules applied 1749 place count 55 transition count 150
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1763 place count 55 transition count 136
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1769 place count 49 transition count 124
Iterating global reduction 12 with 6 rules applied. Total rules applied 1775 place count 49 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1781 place count 49 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1801 place count 49 transition count 98
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1803 place count 47 transition count 92
Iterating global reduction 13 with 2 rules applied. Total rules applied 1805 place count 47 transition count 92
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1807 place count 45 transition count 90
Iterating global reduction 13 with 2 rules applied. Total rules applied 1809 place count 45 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1811 place count 45 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1813 place count 45 transition count 86
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1817 place count 45 transition count 82
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1822 place count 41 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1823 place count 41 transition count 80
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 1829 place count 41 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1831 place count 41 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1832 place count 40 transition count 77
Applied a total of 1832 rules in 52 ms. Remains 40 /1510 variables (removed 1470) and now considering 77/1933 (removed 1856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 40/1510 places, 77/1933 transitions.
RANDOM walk for 303 steps (4 resets) in 4 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 11 states, 17 edges and 3 AP (stutter sensitive) to 11 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 439 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
[2025-05-30 05:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 05:18:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 05:19:00] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2025-05-30 05:19:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 05:19:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 05:19:01] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2025-05-30 05:19:02] [INFO ] Computed and/alt/rep : 1926/2354/1926 causal constraints (skipped 6 transitions) in 91 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-30 05:19:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 53 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
[2025-05-30 05:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:19:15] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-30 05:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:19:16] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 05:19: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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in LTL mode , in 1 iterations and 61560 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2108 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 11 states, 17 edges and 3 AP (stutter sensitive) to 11 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (308 resets) in 122 ms. (325 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40001 steps (79 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (86 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2025-05-30 05:20:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1094/1098 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1098 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1499 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1499 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3422 variables, 1499/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3443/3443 variables, and 1514 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3917 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1510 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1094/1098 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1098 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1499 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1499 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3422 variables, 1499/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3422 variables, 2/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3422 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3424 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3424 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3426 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3426 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3428 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3428 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3430 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3430 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3432 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3432 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3436 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3438 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3438 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3440 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3443 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3443 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3443 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3443/3443 variables, and 1516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3383 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1510 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7313ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 22 ms.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1841 edges and 1510 vertex of which 692 / 1510 are part of one of the 63 SCC in 1 ms
Free SCC test removed 629 places
Drop transitions (Empty/Sink Transition effects.) removed 794 transitions
Reduce isomorphic transitions removed 794 transitions.
Graph (complete) has 1309 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 872 transition count 637
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 551 rules applied. Total rules applied 1051 place count 381 transition count 577
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1090 place count 342 transition count 577
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1090 place count 342 transition count 528
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1188 place count 293 transition count 528
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1198 place count 283 transition count 514
Iterating global reduction 3 with 10 rules applied. Total rules applied 1208 place count 283 transition count 514
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1210 place count 283 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1212 place count 281 transition count 512
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1220 place count 273 transition count 502
Iterating global reduction 5 with 8 rules applied. Total rules applied 1228 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1234 place count 273 transition count 496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1235 place count 272 transition count 490
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 272 transition count 490
Performed 144 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 6 with 288 rules applied. Total rules applied 1524 place count 128 transition count 248
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1538 place count 128 transition count 234
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1541 place count 125 transition count 231
Iterating global reduction 7 with 3 rules applied. Total rules applied 1544 place count 125 transition count 231
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1568 place count 113 transition count 217
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1582 place count 113 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1584 place count 112 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1586 place count 112 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1588 place count 111 transition count 199
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1590 place count 111 transition count 197
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1656 place count 78 transition count 227
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 10 with 47 rules applied. Total rules applied 1703 place count 78 transition count 180
Discarding 23 places :
Symmetric choice reduction at 11 with 23 rule applications. Total rules 1726 place count 55 transition count 150
Iterating global reduction 11 with 23 rules applied. Total rules applied 1749 place count 55 transition count 150
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1763 place count 55 transition count 136
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1769 place count 49 transition count 124
Iterating global reduction 12 with 6 rules applied. Total rules applied 1775 place count 49 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1781 place count 49 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1801 place count 49 transition count 98
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1803 place count 47 transition count 92
Iterating global reduction 13 with 2 rules applied. Total rules applied 1805 place count 47 transition count 92
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1807 place count 45 transition count 90
Iterating global reduction 13 with 2 rules applied. Total rules applied 1809 place count 45 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1811 place count 45 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1813 place count 45 transition count 86
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1817 place count 45 transition count 82
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1822 place count 41 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1823 place count 41 transition count 80
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 1829 place count 41 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1831 place count 41 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1832 place count 40 transition count 77
Applied a total of 1832 rules in 61 ms. Remains 40 /1510 variables (removed 1470) and now considering 77/1933 (removed 1856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 40/1510 places, 77/1933 transitions.
RANDOM walk for 284 steps (6 resets) in 5 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 4 factoid took 305 ms. Reduced automaton from 11 states, 17 edges and 3 AP (stutter sensitive) to 11 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 470 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
[2025-05-30 05:20:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 05:20:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 05:20:27] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2025-05-30 05:20:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 05:20:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 05:20:28] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2025-05-30 05:20:28] [INFO ] Computed and/alt/rep : 1926/2354/1926 causal constraints (skipped 6 transitions) in 76 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-30 05:20:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 393 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20026 reset in 210 ms.
Product exploration explored 100000 steps with 19998 reset in 217 ms.
Applying partial POR strategy [false, false, true, true, false, false, false, true, false, true, false]
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1838 edges and 1510 vertex of which 686 / 1510 are part of one of the 62 SCC in 1 ms
Free SCC test removed 624 places
Ensure Unique test removed 725 transitions
Reduce isomorphic transitions removed 725 transitions.
Graph (complete) has 1377 edges and 886 vertex of which 877 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 480 place count 877 transition count 1203
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 492 place count 877 transition count 1191
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 492 place count 877 transition count 1203
Deduced a syphon composed of 500 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 514 place count 877 transition count 1203
Discarding 285 places :
Symmetric choice reduction at 2 with 285 rule applications. Total rules 799 place count 592 transition count 909
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 2 with 285 rules applied. Total rules applied 1084 place count 592 transition count 909
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1096 place count 580 transition count 893
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1108 place count 580 transition count 893
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1114 place count 580 transition count 887
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1126 place count 568 transition count 875
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1138 place count 568 transition count 875
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1140 place count 566 transition count 871
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1142 place count 566 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1144 place count 564 transition count 867
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1146 place count 564 transition count 867
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1150 place count 560 transition count 863
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1154 place count 560 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1156 place count 558 transition count 859
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1158 place count 558 transition count 859
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1160 place count 556 transition count 855
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1162 place count 556 transition count 855
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1166 place count 552 transition count 849
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1170 place count 552 transition count 849
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1173 place count 549 transition count 840
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1176 place count 549 transition count 840
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1178 place count 547 transition count 838
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1180 place count 547 transition count 838
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 3 with 108 rules applied. Total rules applied 1288 place count 547 transition count 915
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1331 place count 547 transition count 872
Discarding 99 places :
Symmetric choice reduction at 4 with 99 rule applications. Total rules 1430 place count 448 transition count 763
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 99 rules applied. Total rules applied 1529 place count 448 transition count 763
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1535 place count 442 transition count 754
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1541 place count 442 transition count 754
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1548 place count 442 transition count 754
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1554 place count 442 transition count 748
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1570 place count 426 transition count 728
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 1586 place count 426 transition count 728
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1592 place count 426 transition count 722
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1596 place count 422 transition count 718
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1600 place count 422 transition count 718
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 1602 place count 422 transition count 718
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1606 place count 422 transition count 714
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1608 place count 420 transition count 712
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1610 place count 420 transition count 712
Performed 71 Post agglomeration using F-continuation condition with reduction of 123 identical transitions.
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 7 with 71 rules applied. Total rules applied 1681 place count 420 transition count 1038
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 7 with 123 rules applied. Total rules applied 1804 place count 420 transition count 915
Discarding 125 places :
Symmetric choice reduction at 8 with 125 rule applications. Total rules 1929 place count 295 transition count 582
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 8 with 125 rules applied. Total rules applied 2054 place count 295 transition count 582
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2069 place count 295 transition count 567
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2095 place count 269 transition count 513
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 9 with 26 rules applied. Total rules applied 2121 place count 269 transition count 513
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2124 place count 269 transition count 563
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2127 place count 266 transition count 535
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2130 place count 266 transition count 535
Deduced a syphon composed of 144 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 9 with 47 rules applied. Total rules applied 2177 place count 266 transition count 488
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2181 place count 262 transition count 484
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2185 place count 262 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2188 place count 262 transition count 544
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2191 place count 259 transition count 529
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2194 place count 259 transition count 529
Deduced a syphon composed of 140 places in 1 ms
Applied a total of 2194 rules in 213 ms. Remains 259 /1510 variables (removed 1251) and now considering 529/1933 (removed 1404) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 05:20:44] [INFO ] Redundant transitions in 11 ms returned []
Running 528 sub problems to find dead transitions.
[2025-05-30 05:20:44] [INFO ] Flow matrix only has 474 transitions (discarded 55 similar events)
// Phase 1: matrix 474 rows 259 cols
[2025-05-30 05:20:44] [INFO ] Computed 0 invariants in 6 ms
[2025-05-30 05:20:44] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
At refinement iteration 1 (OVERLAPS) 473/731 variables, 258/258 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/731 variables, 3/261 constraints. Problems are: Problem set: 256 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/731 variables, 0/261 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/732 variables, 1/262 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 0/262 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 1/733 variables, 1/263 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 0/263 constraints. Problems are: Problem set: 256 solved, 272 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 1.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 1.0)
(t10 0.0)
(t11 1.0)
(t12 0.0)
(t13 0.0)
(t14 1.0)
(t15 0.0)
(t16 0.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 1.0)
(t32 0.0)
(t33 0.0)
(t34 1.0)
(t35 0.0)
(t36 1.0)
(t37 0.0)
(t38 0.0)
(t39 1.0)
(t40 0.0)
(t41 0.0)
(t42 1.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 1.0)
(t60 0.0)
(t61 0.0)
(t62 1.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 1.0)
(t70 0.0)
(t71 0.0)
(t72 1.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 6.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 6.0)
(t123 5.0)
(t124 5.0)
(t125 6.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 1.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 timeout
0.0)
(t144 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 733/733 variables, and 263 constraints, problems are : Problem set: 256 solved, 272 unsolved in 30015 ms.
Refiners :[State Equation: 259/259 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 256 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 470/588 variables, 118/118 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 3/121 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 272/393 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/393 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 144/732 variables, 141/534 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/534 constraints. Problems are: Problem set: 256 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/733 variables, 1/535 constraints. Problems are: Problem set: 256 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 733/733 variables, and 535 constraints, problems are : Problem set: 256 solved, 272 unsolved in 30014 ms.
Refiners :[State Equation: 259/259 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 272/528 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 256 solved, 272 unsolved
Search for dead transitions found 256 dead transitions in 60137ms
Found 256 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 256 transitions
Dead transitions reduction (with SMT) removed 256 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 259/1510 places, 273/1933 transitions.
Graph (complete) has 418 edges and 259 vertex of which 119 are kept as prefixes of interest. Removing 140 places using SCC suffix rule.0 ms
Discarding 140 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 119 /259 variables (removed 140) and now considering 273/273 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1510 places, 273/1933 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60378 ms. Remains : 119/1510 places, 273/1933 transitions.
Built C files in :
/tmp/ltsmin9034179720865022134
[2025-05-30 05:21:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9034179720865022134
Running compilation step : cd /tmp/ltsmin9034179720865022134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9034179720865022134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9034179720865022134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 63 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2025-05-30 05:21:47] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:21:47] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-30 05:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:21:48] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 05:21:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 1.0)
(s1107 0.0)
(s1108 0.0)
(s1109 1.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 0.0)
(s1120 1.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 1.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Finished structural reductions in LTL mode , in 1 iterations and 61614 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Built C files in :
/tmp/ltsmin8611732914839234862
[2025-05-30 05:22:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8611732914839234862
Running compilation step : cd /tmp/ltsmin8611732914839234862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8611732914839234862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8611732914839234862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 05:22:52] [INFO ] Flatten gal took : 33 ms
[2025-05-30 05:22:52] [INFO ] Flatten gal took : 31 ms
[2025-05-30 05:22:52] [INFO ] Time to serialize gal into /tmp/LTL10245472542638372008.gal : 6 ms
[2025-05-30 05:22:52] [INFO ] Time to serialize properties into /tmp/LTL17609723280939293857.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10245472542638372008.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7228300969576490916.hoa' '-atoms' '/tmp/LTL17609723280939293857.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17609723280939293857.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7228300969576490916.hoa
Detected timeout of ITS tools.
[2025-05-30 05:23:07] [INFO ] Flatten gal took : 30 ms
[2025-05-30 05:23:07] [INFO ] Flatten gal took : 31 ms
[2025-05-30 05:23:07] [INFO ] Time to serialize gal into /tmp/LTL167295414395035274.gal : 6 ms
[2025-05-30 05:23:07] [INFO ] Time to serialize properties into /tmp/LTL9850741585748053539.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL167295414395035274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9850741585748053539.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((X("(p385!=1)"))U((X(G("(p385!=1)")))||((!("((p1295==1)||(p1221==1))"))&&(X("(p385!=1)")))))U(X(X("(p825==1)")))))
Formula 0 simplified : (X!"(p385!=1)" R (XF!"(p385!=1)" & ("((p1295==1)||(p1221==1))" | X!"(p385!=1)"))) R XX!"(p825==1)"
Detected timeout of ITS tools.
[2025-05-30 05:23:22] [INFO ] Flatten gal took : 28 ms
[2025-05-30 05:23:22] [INFO ] Applying decomposition
[2025-05-30 05:23:22] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4032144083400730930.txt' '-o' '/tmp/graph4032144083400730930.bin' '-w' '/tmp/graph4032144083400730930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4032144083400730930.bin' '-l' '-1' '-v' '-w' '/tmp/graph4032144083400730930.weights' '-q' '0' '-e' '0.001'
[2025-05-30 05:23:22] [INFO ] Decomposing Gal with order
[2025-05-30 05:23:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:23:22] [INFO ] Removed a total of 513 redundant transitions.
[2025-05-30 05:23:22] [INFO ] Flatten gal took : 80 ms
[2025-05-30 05:23:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 17 ms.
[2025-05-30 05:23:22] [INFO ] Time to serialize gal into /tmp/LTL3391187364850919213.gal : 15 ms
[2025-05-30 05:23:22] [INFO ] Time to serialize properties into /tmp/LTL13381068339197760548.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3391187364850919213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13381068339197760548.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((X("(i1.u69.p385!=1)"))U((X(G("(i1.u69.p385!=1)")))||((!("((i20.i1.i1.u294.p1295==1)||(i9.i0.i3.u269.p1221==1))"))&&(X("(i1.u69.p3...204
Formula 0 simplified : (X!"(i1.u69.p385!=1)" R (XF!"(i1.u69.p385!=1)" & ("((i20.i1.i1.u294.p1295==1)||(i9.i0.i3.u269.p1221==1))" | X!"(i1.u69.p385!=1)"))) ...186
Reverse transition relation is NOT exact ! Due to transitions t26, t206, t236, t288, t319, t348, t399, t470, t523, t713, t765, t796, t825, t874, t945, t996...2049
Computing Next relation with stutter on 91936 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
478 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.97797,191048,1,0,327589,9562,22235,612820,547,65454,1324832
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-301-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-301-LTLFireability-07 finished in 339143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(p0))) U (p1||X(F((p0&&G(p2))))))))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1547 transition count 1981
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1547 transition count 1981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1547 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 1540 transition count 1972
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 1540 transition count 1972
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 1534 transition count 1966
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 1534 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 1534 transition count 1965
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 1530 transition count 1959
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 1530 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 1526 transition count 1954
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 1526 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 1524 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 1524 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 1523 transition count 1951
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 1523 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1522 transition count 1950
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1522 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1521 transition count 1948
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1521 transition count 1948
Applied a total of 98 rules in 559 ms. Remains 1521 /1569 variables (removed 48) and now considering 1948/2005 (removed 57) transitions.
// Phase 1: matrix 1948 rows 1521 cols
[2025-05-30 05:23:29] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:29] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-30 05:23:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:30] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2025-05-30 05:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/3469 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/3469 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Starting structural reductions in LTL mode, iteration 1 : 1521/1569 places, 1948/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62084 ms. Remains : 1521/1569 places, 1948/2005 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-08
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-08 finished in 62347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1546 transition count 1979
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1546 transition count 1979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1546 transition count 1978
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 1536 transition count 1967
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 1536 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1536 transition count 1966
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 1528 transition count 1958
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 1528 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 1528 transition count 1957
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 1522 transition count 1948
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 1522 transition count 1948
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 1517 transition count 1942
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 1517 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1514 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1512 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1510 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1508 transition count 1930
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1507 transition count 1929
Applied a total of 127 rules in 617 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2005 (removed 76) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2025-05-30 05:24:31] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:31] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-30 05:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:32] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 05:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s35 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62298 ms. Remains : 1507/1569 places, 1929/2005 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-09
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-09 finished in 62434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)&&X(G(p2))))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1546 transition count 1979
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1546 transition count 1979
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 1537 transition count 1969
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 1537 transition count 1969
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 1537 transition count 1968
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 1530 transition count 1961
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 1530 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 1530 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 1525 transition count 1952
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 1525 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 1521 transition count 1947
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 1521 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 1518 transition count 1944
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 1516 transition count 1942
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 1514 transition count 1939
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 1512 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 1511 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 1511 transition count 1934
Applied a total of 118 rules in 621 ms. Remains 1511 /1569 variables (removed 58) and now considering 1934/2005 (removed 71) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2025-05-30 05:25:34] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:25:34] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-05-30 05:25:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:25:35] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2025-05-30 05:25:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1569 places, 1934/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62136 ms. Remains : 1511/1569 places, 1934/2005 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-10 finished in 62353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||((F(p0)&&X(X(F(p1)))) U p2))))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1909 edges and 1569 vertex of which 695 / 1569 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1442 edges and 937 vertex of which 928 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 510 transitions
Trivial Post-agglo rules discarded 510 transitions
Performed 510 trivial Post agglomeration. Transition count delta: 510
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 927 transition count 754
Reduce places removed 510 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 535 rules applied. Total rules applied 1047 place count 417 transition count 729
Reduce places removed 12 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 17 rules applied. Total rules applied 1064 place count 405 transition count 724
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1069 place count 400 transition count 724
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1069 place count 400 transition count 680
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1157 place count 356 transition count 680
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1176 place count 337 transition count 649
Iterating global reduction 4 with 19 rules applied. Total rules applied 1195 place count 337 transition count 649
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 4 with 2 rules applied. Total rules applied 1197 place count 337 transition count 647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1198 place count 336 transition count 647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1198 place count 336 transition count 646
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1200 place count 335 transition count 646
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1210 place count 325 transition count 632
Iterating global reduction 6 with 10 rules applied. Total rules applied 1220 place count 325 transition count 632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 1227 place count 325 transition count 625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1228 place count 324 transition count 625
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1230 place count 322 transition count 621
Iterating global reduction 8 with 2 rules applied. Total rules applied 1232 place count 322 transition count 621
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1234 place count 320 transition count 617
Iterating global reduction 8 with 2 rules applied. Total rules applied 1236 place count 320 transition count 617
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1238 place count 318 transition count 613
Iterating global reduction 8 with 2 rules applied. Total rules applied 1240 place count 318 transition count 613
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1242 place count 316 transition count 609
Iterating global reduction 8 with 2 rules applied. Total rules applied 1244 place count 316 transition count 609
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1246 place count 314 transition count 605
Iterating global reduction 8 with 2 rules applied. Total rules applied 1248 place count 314 transition count 605
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1249 place count 313 transition count 598
Iterating global reduction 8 with 1 rules applied. Total rules applied 1250 place count 313 transition count 598
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 8 with 1 rules applied. Total rules applied 1251 place count 313 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1252 place count 312 transition count 597
Performed 151 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 10 with 302 rules applied. Total rules applied 1554 place count 161 transition count 364
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1570 place count 161 transition count 348
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1575 place count 156 transition count 342
Iterating global reduction 11 with 5 rules applied. Total rules applied 1580 place count 156 transition count 342
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1581 place count 155 transition count 341
Iterating global reduction 11 with 1 rules applied. Total rules applied 1582 place count 155 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1583 place count 155 transition count 340
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1603 place count 145 transition count 329
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1613 place count 145 transition count 319
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1614 place count 144 transition count 315
Iterating global reduction 13 with 1 rules applied. Total rules applied 1615 place count 144 transition count 315
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 13 with 2 rules applied. Total rules applied 1617 place count 143 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1619 place count 143 transition count 312
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1653 place count 126 transition count 346
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1670 place count 126 transition count 329
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1679 place count 117 transition count 311
Iterating global reduction 15 with 9 rules applied. Total rules applied 1688 place count 117 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1693 place count 117 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 16 with 38 rules applied. Total rules applied 1731 place count 117 transition count 268
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 1736 place count 117 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1737 place count 117 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1738 place count 116 transition count 266
Applied a total of 1738 rules in 85 ms. Remains 116 /1569 variables (removed 1453) and now considering 266/2005 (removed 1739) transitions.
[2025-05-30 05:26:35] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
// Phase 1: matrix 209 rows 116 cols
[2025-05-30 05:26:35] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-30 05:26:35] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
[2025-05-30 05:26:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 05:26:36] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [8, 41, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 172 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1569 places, 266/2005 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 263
Applied a total of 3 rules in 7 ms. Remains 110 /113 variables (removed 3) and now considering 263/266 (removed 3) transitions.
[2025-05-30 05:26:36] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 110 cols
[2025-05-30 05:26:36] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 05:26:36] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2025-05-30 05:26:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 05:26:36] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1569 places, 263/2005 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 110/1569 places, 263/2005 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-11 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1||F(p2)))))))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1546 transition count 1979
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1546 transition count 1979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1546 transition count 1978
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 1536 transition count 1967
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 1536 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1536 transition count 1966
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 1528 transition count 1958
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 1528 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 1528 transition count 1957
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 1522 transition count 1948
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 1522 transition count 1948
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 1517 transition count 1942
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 1517 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1514 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1512 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1510 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1508 transition count 1930
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1507 transition count 1929
Applied a total of 127 rules in 652 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2005 (removed 76) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2025-05-30 05:26:36] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:37] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-30 05:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:38] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 05:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2005 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62237 ms. Remains : 1507/1569 places, 1929/2005 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-12
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-12 finished in 62591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1909 edges and 1569 vertex of which 682 / 1569 are part of one of the 63 SCC in 1 ms
Free SCC test removed 619 places
Ensure Unique test removed 720 transitions
Reduce isomorphic transitions removed 720 transitions.
Graph (complete) has 1458 edges and 950 vertex of which 941 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 516 rules applied. Total rules applied 518 place count 940 transition count 763
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 543 rules applied. Total rules applied 1061 place count 424 transition count 736
Reduce places removed 13 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 18 rules applied. Total rules applied 1079 place count 411 transition count 731
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1084 place count 406 transition count 731
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1084 place count 406 transition count 685
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1176 place count 360 transition count 685
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1194 place count 342 transition count 655
Iterating global reduction 4 with 18 rules applied. Total rules applied 1212 place count 342 transition count 655
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 4 with 2 rules applied. Total rules applied 1214 place count 342 transition count 653
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1215 place count 341 transition count 653
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1215 place count 341 transition count 652
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1217 place count 340 transition count 652
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1226 place count 331 transition count 639
Iterating global reduction 6 with 9 rules applied. Total rules applied 1235 place count 331 transition count 639
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 1241 place count 331 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1242 place count 330 transition count 633
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1244 place count 328 transition count 629
Iterating global reduction 8 with 2 rules applied. Total rules applied 1246 place count 328 transition count 629
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1248 place count 326 transition count 625
Iterating global reduction 8 with 2 rules applied. Total rules applied 1250 place count 326 transition count 625
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1252 place count 324 transition count 621
Iterating global reduction 8 with 2 rules applied. Total rules applied 1254 place count 324 transition count 621
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1256 place count 322 transition count 617
Iterating global reduction 8 with 2 rules applied. Total rules applied 1258 place count 322 transition count 617
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1260 place count 320 transition count 613
Iterating global reduction 8 with 2 rules applied. Total rules applied 1262 place count 320 transition count 613
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1263 place count 319 transition count 606
Iterating global reduction 8 with 1 rules applied. Total rules applied 1264 place count 319 transition count 606
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 8 with 1 rules applied. Total rules applied 1265 place count 319 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1266 place count 318 transition count 605
Performed 154 Post agglomeration using F-continuation condition with reduction of 90 identical transitions.
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 10 with 308 rules applied. Total rules applied 1574 place count 164 transition count 361
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 15 rules applied. Total rules applied 1589 place count 164 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1591 place count 163 transition count 345
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1595 place count 159 transition count 340
Iterating global reduction 12 with 4 rules applied. Total rules applied 1599 place count 159 transition count 340
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 1617 place count 150 transition count 330
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1625 place count 150 transition count 322
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1626 place count 149 transition count 318
Iterating global reduction 13 with 1 rules applied. Total rules applied 1627 place count 149 transition count 318
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 13 with 2 rules applied. Total rules applied 1629 place count 148 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1631 place count 148 transition count 315
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 14 with 38 rules applied. Total rules applied 1669 place count 129 transition count 350
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1686 place count 129 transition count 333
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1695 place count 120 transition count 315
Iterating global reduction 15 with 9 rules applied. Total rules applied 1704 place count 120 transition count 315
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1710 place count 120 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 16 with 36 rules applied. Total rules applied 1746 place count 120 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1747 place count 119 transition count 272
Applied a total of 1747 rules in 75 ms. Remains 119 /1569 variables (removed 1450) and now considering 272/2005 (removed 1733) transitions.
[2025-05-30 05:27:38] [INFO ] Flow matrix only has 215 transitions (discarded 57 similar events)
// Phase 1: matrix 215 rows 119 cols
[2025-05-30 05:27:38] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 05:27:38] [INFO ] Flow matrix only has 215 transitions (discarded 57 similar events)
[2025-05-30 05:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [8, 43, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 168 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1569 places, 272/2005 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 113 transition count 269
Applied a total of 3 rules in 6 ms. Remains 113 /116 variables (removed 3) and now considering 269/272 (removed 3) transitions.
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
// Phase 1: matrix 212 rows 113 cols
[2025-05-30 05:27:39] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
[2025-05-30 05:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1569 places, 269/2005 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 372 ms. Remains : 113/1569 places, 269/2005 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-13 finished in 446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1913 edges and 1569 vertex of which 686 / 1569 are part of one of the 63 SCC in 1 ms
Free SCC test removed 623 places
Ensure Unique test removed 723 transitions
Reduce isomorphic transitions removed 723 transitions.
Graph (complete) has 1454 edges and 946 vertex of which 937 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 518 transitions
Trivial Post-agglo rules discarded 518 transitions
Performed 518 trivial Post agglomeration. Transition count delta: 518
Iterating post reduction 0 with 518 rules applied. Total rules applied 520 place count 936 transition count 758
Reduce places removed 518 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 541 rules applied. Total rules applied 1061 place count 418 transition count 735
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1073 place count 407 transition count 734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1074 place count 406 transition count 734
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1074 place count 406 transition count 689
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1164 place count 361 transition count 689
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1183 place count 342 transition count 658
Iterating global reduction 4 with 19 rules applied. Total rules applied 1202 place count 342 transition count 658
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 4 with 2 rules applied. Total rules applied 1204 place count 342 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1205 place count 341 transition count 656
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1205 place count 341 transition count 655
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1207 place count 340 transition count 655
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1217 place count 330 transition count 641
Iterating global reduction 6 with 10 rules applied. Total rules applied 1227 place count 330 transition count 641
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 1234 place count 330 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1235 place count 329 transition count 634
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1237 place count 327 transition count 630
Iterating global reduction 8 with 2 rules applied. Total rules applied 1239 place count 327 transition count 630
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1241 place count 325 transition count 626
Iterating global reduction 8 with 2 rules applied. Total rules applied 1243 place count 325 transition count 626
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1245 place count 323 transition count 622
Iterating global reduction 8 with 2 rules applied. Total rules applied 1247 place count 323 transition count 622
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1249 place count 321 transition count 618
Iterating global reduction 8 with 2 rules applied. Total rules applied 1251 place count 321 transition count 618
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1253 place count 319 transition count 614
Iterating global reduction 8 with 2 rules applied. Total rules applied 1255 place count 319 transition count 614
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1256 place count 318 transition count 607
Iterating global reduction 8 with 1 rules applied. Total rules applied 1257 place count 318 transition count 607
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 8 with 1 rules applied. Total rules applied 1258 place count 318 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1259 place count 317 transition count 606
Performed 157 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 10 with 314 rules applied. Total rules applied 1573 place count 160 transition count 353
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1583 place count 160 transition count 343
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1588 place count 155 transition count 337
Iterating global reduction 11 with 5 rules applied. Total rules applied 1593 place count 155 transition count 337
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1594 place count 154 transition count 336
Iterating global reduction 11 with 1 rules applied. Total rules applied 1595 place count 154 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1596 place count 154 transition count 335
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1618 place count 143 transition count 323
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1627 place count 143 transition count 314
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1628 place count 142 transition count 310
Iterating global reduction 13 with 1 rules applied. Total rules applied 1629 place count 142 transition count 310
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 13 with 2 rules applied. Total rules applied 1631 place count 141 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1633 place count 141 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1667 place count 124 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1684 place count 124 transition count 324
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1693 place count 115 transition count 306
Iterating global reduction 15 with 9 rules applied. Total rules applied 1702 place count 115 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1708 place count 115 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 16 with 36 rules applied. Total rules applied 1744 place count 115 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1745 place count 114 transition count 263
Applied a total of 1745 rules in 79 ms. Remains 114 /1569 variables (removed 1455) and now considering 263/2005 (removed 1742) transitions.
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 114 cols
[2025-05-30 05:27:39] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2025-05-30 05:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [8, 43, 77]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 164 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1569 places, 263/2005 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 260
Applied a total of 3 rules in 6 ms. Remains 108 /111 variables (removed 3) and now considering 260/263 (removed 3) transitions.
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 108 cols
[2025-05-30 05:27:39] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2025-05-30 05:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1569 places, 260/2005 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 383 ms. Remains : 108/1569 places, 260/2005 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-14
Stuttering criterion allowed to conclude after 2299 steps with 240 reset in 11 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-14 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2005/2005 transitions.
Graph (trivial) has 1916 edges and 1569 vertex of which 695 / 1569 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1442 edges and 937 vertex of which 928 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 516 rules applied. Total rules applied 518 place count 927 transition count 748
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 541 rules applied. Total rules applied 1059 place count 411 transition count 723
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1071 place count 399 transition count 723
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1071 place count 399 transition count 679
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1159 place count 355 transition count 679
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1177 place count 337 transition count 649
Iterating global reduction 3 with 18 rules applied. Total rules applied 1195 place count 337 transition count 649
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 3 with 2 rules applied. Total rules applied 1197 place count 337 transition count 647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1198 place count 336 transition count 647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1198 place count 336 transition count 646
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1200 place count 335 transition count 646
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1209 place count 326 transition count 633
Iterating global reduction 5 with 9 rules applied. Total rules applied 1218 place count 326 transition count 633
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1223 place count 326 transition count 628
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1225 place count 324 transition count 624
Iterating global reduction 6 with 2 rules applied. Total rules applied 1227 place count 324 transition count 624
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1229 place count 322 transition count 620
Iterating global reduction 6 with 2 rules applied. Total rules applied 1231 place count 322 transition count 620
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1233 place count 320 transition count 616
Iterating global reduction 6 with 2 rules applied. Total rules applied 1235 place count 320 transition count 616
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1237 place count 318 transition count 612
Iterating global reduction 6 with 2 rules applied. Total rules applied 1239 place count 318 transition count 612
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1241 place count 316 transition count 608
Iterating global reduction 6 with 2 rules applied. Total rules applied 1243 place count 316 transition count 608
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1244 place count 315 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 1245 place count 315 transition count 601
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 1 rules applied. Total rules applied 1246 place count 315 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1247 place count 314 transition count 600
Performed 155 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 8 with 310 rules applied. Total rules applied 1557 place count 159 transition count 350
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1566 place count 159 transition count 341
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1571 place count 154 transition count 335
Iterating global reduction 9 with 5 rules applied. Total rules applied 1576 place count 154 transition count 335
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1577 place count 153 transition count 334
Iterating global reduction 9 with 1 rules applied. Total rules applied 1578 place count 153 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1579 place count 153 transition count 333
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1599 place count 143 transition count 322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1608 place count 143 transition count 313
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1609 place count 142 transition count 309
Iterating global reduction 11 with 1 rules applied. Total rules applied 1610 place count 142 transition count 309
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 11 with 2 rules applied. Total rules applied 1612 place count 141 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1614 place count 141 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1648 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1665 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1674 place count 115 transition count 305
Iterating global reduction 13 with 9 rules applied. Total rules applied 1683 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1689 place count 115 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1725 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1726 place count 114 transition count 262
Applied a total of 1726 rules in 67 ms. Remains 114 /1569 variables (removed 1455) and now considering 262/2005 (removed 1743) transitions.
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2025-05-30 05:27:39] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2025-05-30 05:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [8, 41, 74]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 158 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1569 places, 262/2005 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 259
Applied a total of 3 rules in 6 ms. Remains 108 /111 variables (removed 3) and now considering 259/262 (removed 3) transitions.
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
// Phase 1: matrix 202 rows 108 cols
[2025-05-30 05:27:39] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 05:27:39] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2025-05-30 05:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 05:27:40] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1569 places, 259/2005 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 355 ms. Remains : 108/1569 places, 259/2005 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLFireability-15 finished in 396 ms.
All properties solved by simple procedures.
Total runtime 1149872 ms.
BK_STOP 1748582860156
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="CloudReconfiguration-PT-301"
export BK_EXAMINATION="LTLFireability"
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 CloudReconfiguration-PT-301, examination is LTLFireability"
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-174854028000212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-301.tgz
mv CloudReconfiguration-PT-301 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;