Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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-312-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-312-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748593386174

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-312
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 08:23:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 08:23:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 08:23:07] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-05-30 08:23:07] [INFO ] Transformed 2585 places.
[2025-05-30 08:23:07] [INFO ] Transformed 3095 transitions.
[2025-05-30 08:23:07] [INFO ] Found NUPN structural information;
[2025-05-30 08:23:07] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudReconfiguration-PT-312-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1067 place count 2066 transition count 2547
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 1302 place count 1831 transition count 2312
Iterating global reduction 1 with 235 rules applied. Total rules applied 1537 place count 1831 transition count 2312
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 1624 place count 1744 transition count 2225
Iterating global reduction 1 with 87 rules applied. Total rules applied 1711 place count 1744 transition count 2225
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1727 place count 1744 transition count 2209
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1774 place count 1697 transition count 2162
Iterating global reduction 2 with 47 rules applied. Total rules applied 1821 place count 1697 transition count 2162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1828 place count 1697 transition count 2155
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1867 place count 1658 transition count 2111
Iterating global reduction 3 with 39 rules applied. Total rules applied 1906 place count 1658 transition count 2111
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1934 place count 1630 transition count 2083
Iterating global reduction 3 with 28 rules applied. Total rules applied 1962 place count 1630 transition count 2083
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1987 place count 1605 transition count 2058
Iterating global reduction 3 with 25 rules applied. Total rules applied 2012 place count 1605 transition count 2058
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2037 place count 1580 transition count 2033
Iterating global reduction 3 with 25 rules applied. Total rules applied 2062 place count 1580 transition count 2033
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2082 place count 1560 transition count 2001
Iterating global reduction 3 with 20 rules applied. Total rules applied 2102 place count 1560 transition count 2001
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2110 place count 1552 transition count 1988
Iterating global reduction 3 with 8 rules applied. Total rules applied 2118 place count 1552 transition count 1988
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2126 place count 1544 transition count 1978
Iterating global reduction 3 with 8 rules applied. Total rules applied 2134 place count 1544 transition count 1978
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2137 place count 1544 transition count 1975
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2139 place count 1542 transition count 1973
Iterating global reduction 4 with 2 rules applied. Total rules applied 2141 place count 1542 transition count 1973
Applied a total of 2141 rules in 1880 ms. Remains 1542 /2585 variables (removed 1043) and now considering 1973/3095 (removed 1122) transitions.
// Phase 1: matrix 1973 rows 1542 cols
[2025-05-30 08:23:09] [INFO ] Computed 4 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:23:10] [INFO ] Implicit Places using invariants in 439 ms returned []
[2025-05-30 08:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:23:11] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
Running 1972 sub problems to find dead transitions.
[2025-05-30 08:23:11] [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 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.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 1.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 1.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 1.0)
(s137 1.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 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.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 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.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 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.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 1.0)
(s486 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1541 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1541/3515 variables, and 4 constraints, problems are : Problem set: 0 solved, 1972 unsolved in 30071 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1542 constraints, PredecessorRefiner: 1972/1972 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1972 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1541 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1972 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 1)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(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 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(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 1)
(s137 1)
(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 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 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 1)
(s326 0)
(s327 0)
(s328 1)
(s329 1)
(s330 1)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(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 1)
(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 1)
(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 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(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 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(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)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 1)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 1)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 1)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 timeout
0)
(s1013 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1541/3515 variables, and 4 constraints, problems are : Problem set: 0 solved, 1972 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1542 constraints, PredecessorRefiner: 0/1972 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60650ms problems are : Problem set: 0 solved, 1972 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Starting structural reductions in LTL mode, iteration 1 : 1542/2585 places, 1973/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64061 ms. Remains : 1542/2585 places, 1973/3095 transitions.
Support contains 26 out of 1542 places after structural reductions.
[2025-05-30 08:24:12] [INFO ] Flatten gal took : 123 ms
[2025-05-30 08:24:12] [INFO ] Flatten gal took : 71 ms
[2025-05-30 08:24:12] [INFO ] Input system was already deterministic with 1973 transitions.
RANDOM walk for 40000 steps (275 resets) in 1549 ms. (25 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40003 steps (77 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (75 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (82 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (75 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (78 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (77 resets) in 148 ms. (268 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (73 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (74 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (75 resets) in 123 ms. (322 steps per ms) remains 8/9 properties
[2025-05-30 08:24:13] [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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1517/1531 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1531 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1963/3494 variables, 1531/1535 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3494 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/3496 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3496 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/3498 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3498 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/3500 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3500 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/3502 variables, 1/1539 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3502 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/3504 variables, 1/1540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3504 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 2/3506 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3506 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 2/3508 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3508 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 2/3510 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3510 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 2/3512 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3512 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 2/3514 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3514 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 1/3515 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3515 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3515/3515 variables, and 1546 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1542/1542 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1517/1531 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1531 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1963/3494 variables, 1531/1535 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3494 variables, 8/1543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3494 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/3496 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3496 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/3498 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3498 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/3500 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3500 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/3502 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3502/3515 variables, and 1547 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1535/1542 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Graph (trivial) has 1857 edges and 1542 vertex of which 700 / 1542 are part of one of the 63 SCC in 10 ms
Free SCC test removed 637 places
Drop transitions (Empty/Sink Transition effects.) removed 803 transitions
Reduce isomorphic transitions removed 803 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 495 place count 905 transition count 676
Reduce places removed 494 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 551 rules applied. Total rules applied 1046 place count 411 transition count 619
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 39 rules applied. Total rules applied 1085 place count 374 transition count 617
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1087 place count 372 transition count 617
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1087 place count 372 transition count 570
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1181 place count 325 transition count 570
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1192 place count 314 transition count 555
Iterating global reduction 4 with 11 rules applied. Total rules applied 1203 place count 314 transition count 555
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 4 with 2 rules applied. Total rules applied 1205 place count 314 transition count 553
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1207 place count 312 transition count 553
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1214 place count 305 transition count 545
Iterating global reduction 6 with 7 rules applied. Total rules applied 1221 place count 305 transition count 545
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1227 place count 305 transition count 539
Performed 149 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 7 with 298 rules applied. Total rules applied 1525 place count 156 transition count 293
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1543 place count 156 transition count 275
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1546 place count 153 transition count 272
Iterating global reduction 8 with 3 rules applied. Total rules applied 1549 place count 153 transition count 272
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1571 place count 142 transition count 259
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1584 place count 142 transition count 246
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 1586 place count 141 transition count 245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1588 place count 141 transition count 243
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 1590 place count 140 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1592 place count 140 transition count 240
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 11 with 66 rules applied. Total rules applied 1658 place count 107 transition count 271
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 11 with 26 rules applied. Total rules applied 1684 place count 107 transition count 245
Discarding 18 places :
Symmetric choice reduction at 12 with 18 rule applications. Total rules 1702 place count 89 transition count 209
Iterating global reduction 12 with 18 rules applied. Total rules applied 1720 place count 89 transition count 209
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 1727 place count 89 transition count 202
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1732 place count 84 transition count 192
Iterating global reduction 13 with 5 rules applied. Total rules applied 1737 place count 84 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1741 place count 84 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 1750 place count 84 transition count 179
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 14 with 2 rules applied. Total rules applied 1752 place count 83 transition count 178
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1756 place count 83 transition count 174
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1757 place count 82 transition count 173
Iterating global reduction 15 with 1 rules applied. Total rules applied 1758 place count 82 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 15 with 9 rules applied. Total rules applied 1767 place count 82 transition count 164
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1768 place count 81 transition count 161
Iterating global reduction 15 with 1 rules applied. Total rules applied 1769 place count 81 transition count 161
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1770 place count 80 transition count 160
Iterating global reduction 15 with 1 rules applied. Total rules applied 1771 place count 80 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1772 place count 80 transition count 159
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 1773 place count 80 transition count 158
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 1780 place count 80 transition count 151
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 1788 place count 73 transition count 150
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 1790 place count 73 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1791 place count 73 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1792 place count 73 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1793 place count 72 transition count 147
Applied a total of 1793 rules in 204 ms. Remains 72 /1542 variables (removed 1470) and now considering 147/1973 (removed 1826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 72/1542 places, 147/1973 transitions.
RANDOM walk for 40000 steps (690 resets) in 870 ms. (45 steps per ms) remains 1/8 properties
BEST_FIRST walk for 38727 steps (166 resets) in 62 ms. (614 steps per ms) remains 0/1 properties
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2153 edges and 1542 vertex of which 1533 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 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(p0)||G(p1))))&&F(p2)))'
Support contains 6 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1531 transition count 1962
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1531 transition count 1962
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1524 transition count 1955
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1524 transition count 1955
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 1524 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 1521 transition count 1949
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 1521 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 1521 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 1520 transition count 1947
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 1520 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 1519 transition count 1946
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 1519 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1518 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1518 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1517 transition count 1943
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1517 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1516 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1515 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1515 transition count 1940
Applied a total of 57 rules in 562 ms. Remains 1515 /1542 variables (removed 27) and now considering 1940/1973 (removed 33) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2025-05-30 08:24:24] [INFO ] Computed 4 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:24:24] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 08:24:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:24:25] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2025-05-30 08:24:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 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 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1542 places, 1940/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62182 ms. Remains : 1515/1542 places, 1940/1973 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLCardinality-01
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-312-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLCardinality-01 finished in 62679 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 1 out of 1542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Graph (trivial) has 1883 edges and 1542 vertex of which 702 / 1542 are part of one of the 63 SCC in 3 ms
Free SCC test removed 639 places
Ensure Unique test removed 743 transitions
Reduce isomorphic transitions removed 743 transitions.
Graph (complete) has 1404 edges and 903 vertex of which 894 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 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 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 893 transition count 735
Reduce places removed 489 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 514 rules applied. Total rules applied 1005 place count 404 transition count 710
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1017 place count 392 transition count 710
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1017 place count 392 transition count 665
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1107 place count 347 transition count 665
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1126 place count 328 transition count 636
Iterating global reduction 3 with 19 rules applied. Total rules applied 1145 place count 328 transition count 636
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 1147 place count 328 transition count 634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1149 place count 326 transition count 634
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1161 place count 314 transition count 617
Iterating global reduction 5 with 12 rules applied. Total rules applied 1173 place count 314 transition count 617
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 1180 place count 314 transition count 610
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1181 place count 313 transition count 610
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1184 place count 310 transition count 604
Iterating global reduction 7 with 3 rules applied. Total rules applied 1187 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1189 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1191 place count 308 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1193 place count 306 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1195 place count 306 transition count 596
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1197 place count 304 transition count 592
Iterating global reduction 7 with 2 rules applied. Total rules applied 1199 place count 304 transition count 592
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1201 place count 302 transition count 588
Iterating global reduction 7 with 2 rules applied. Total rules applied 1203 place count 302 transition count 588
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1204 place count 301 transition count 581
Iterating global reduction 7 with 1 rules applied. Total rules applied 1205 place count 301 transition count 581
Performed 143 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1491 place count 158 transition count 354
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1502 place count 158 transition count 343
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1507 place count 153 transition count 333
Iterating global reduction 8 with 5 rules applied. Total rules applied 1512 place count 153 transition count 333
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 8 with 26 rules applied. Total rules applied 1538 place count 140 transition count 317
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1551 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 9 with 34 rules applied. Total rules applied 1585 place count 123 transition count 338
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1602 place count 123 transition count 321
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1610 place count 115 transition count 305
Iterating global reduction 10 with 8 rules applied. Total rules applied 1618 place count 115 transition count 305
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1623 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 11 with 36 rules applied. Total rules applied 1659 place count 115 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1660 place count 114 transition count 263
Applied a total of 1660 rules in 272 ms. Remains 114 /1542 variables (removed 1428) and now considering 263/1973 (removed 1710) transitions.
[2025-05-30 08:25:27] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 114 cols
[2025-05-30 08:25:27] [INFO ] Computed 0 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:27] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-30 08:25:27] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2025-05-30 08:25:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:25:27] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 292 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1542 places, 263/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 261
Applied a total of 1 rules in 23 ms. Remains 110 /112 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2025-05-30 08:25:27] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 110 cols
[2025-05-30 08:25:27] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:27] [INFO ] Implicit Places using invariants in 479 ms returned []
[2025-05-30 08:25:27] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 08:25:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 08:25:28] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1542 places, 261/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1266 ms. Remains : 110/1542 places, 261/1973 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-312-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLCardinality-02 finished in 1321 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 G((X(X(G(p1)))||(p2&&F(p3))))))'
Support contains 6 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1529 transition count 1959
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1529 transition count 1959
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1522 transition count 1952
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1522 transition count 1952
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 1522 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 1520 transition count 1947
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 1520 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 1519 transition count 1946
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 1519 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1518 transition count 1945
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1518 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1517 transition count 1944
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1517 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1516 transition count 1942
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1516 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1515 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1514 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1514 transition count 1939
Applied a total of 58 rules in 716 ms. Remains 1514 /1542 variables (removed 28) and now considering 1939/1973 (removed 34) transitions.
// Phase 1: matrix 1939 rows 1514 cols
[2025-05-30 08:25:28] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:29] [INFO ] Implicit Places using invariants in 468 ms returned []
[2025-05-30 08:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:30] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2025-05-30 08:25: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/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1938/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 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 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1542 places, 1939/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62646 ms. Remains : 1514/1542 places, 1939/1973 transitions.
Stuttering acceptance computed with spot in 663 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), false]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLCardinality-07
Product exploration explored 100000 steps with 704 reset in 238 ms.
Product exploration explored 100000 steps with 706 reset in 214 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2116 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p2 p0 p3 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p3)))), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1807 ms. Reduced automaton from 14 states, 45 edges and 4 AP (stutter sensitive) to 14 states, 45 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 728 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), false]
Reduction of identical properties reduced properties to check from 18 to 15
RANDOM walk for 40000 steps (288 resets) in 487 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 208093 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 15
Probabilistic random walk after 208093 steps, saw 53353 distinct states, run finished after 3007 ms. (steps per millisecond=69 ) properties seen :0
[2025-05-30 08:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1503 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3446/3453 variables, and 1514 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1514 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1503 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3432 variables, 14/1521 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3432 variables, 0/1521 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/3434 variables, 1/1522 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3434 variables, 0/1522 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/3436 variables, 1/1523 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3436/3453 variables, and 1523 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1505/1514 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1841 edges and 1514 vertex of which 693 / 1514 are part of one of the 63 SCC in 3 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 795 transitions
Reduce isomorphic transitions removed 795 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 488 rules applied. Total rules applied 489 place count 884 transition count 656
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 1034 place count 396 transition count 599
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1071 place count 359 transition count 599
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1071 place count 359 transition count 548
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1173 place count 308 transition count 548
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1184 place count 297 transition count 532
Iterating global reduction 3 with 11 rules applied. Total rules applied 1195 place count 297 transition count 532
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 3 with 3 rules applied. Total rules applied 1198 place count 297 transition count 529
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1201 place count 294 transition count 529
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1208 place count 287 transition count 521
Iterating global reduction 5 with 7 rules applied. Total rules applied 1215 place count 287 transition count 521
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1221 place count 287 transition count 515
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1222 place count 286 transition count 508
Iterating global reduction 6 with 1 rules applied. Total rules applied 1223 place count 286 transition count 508
Performed 145 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 6 with 290 rules applied. Total rules applied 1513 place count 141 transition count 268
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1528 place count 141 transition count 253
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1531 place count 138 transition count 250
Iterating global reduction 7 with 3 rules applied. Total rules applied 1534 place count 138 transition count 250
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 7 with 26 rules applied. Total rules applied 1560 place count 125 transition count 234
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1575 place count 125 transition count 219
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 1577 place count 124 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1579 place count 124 transition count 216
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 9 with 66 rules applied. Total rules applied 1645 place count 91 transition count 247
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 1672 place count 91 transition count 220
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 1692 place count 71 transition count 180
Iterating global reduction 10 with 20 rules applied. Total rules applied 1712 place count 71 transition count 180
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1722 place count 71 transition count 170
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1728 place count 65 transition count 158
Iterating global reduction 11 with 6 rules applied. Total rules applied 1734 place count 65 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1740 place count 65 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1743 place count 65 transition count 149
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 1745 place count 64 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1753 place count 64 transition count 140
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1755 place count 62 transition count 138
Iterating global reduction 13 with 2 rules applied. Total rules applied 1757 place count 62 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1759 place count 62 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 14 with 19 rules applied. Total rules applied 1778 place count 62 transition count 117
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1780 place count 60 transition count 111
Iterating global reduction 14 with 2 rules applied. Total rules applied 1782 place count 60 transition count 111
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1784 place count 58 transition count 109
Iterating global reduction 14 with 2 rules applied. Total rules applied 1786 place count 58 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1788 place count 58 transition count 107
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 1790 place count 58 transition count 105
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 1795 place count 58 transition count 100
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 15 with 6 rules applied. Total rules applied 1801 place count 53 transition count 99
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 1802 place count 53 transition count 98
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1803 place count 53 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1804 place count 52 transition count 97
Applied a total of 1804 rules in 64 ms. Remains 52 /1514 variables (removed 1462) and now considering 97/1939 (removed 1842) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 52/1514 places, 97/1939 transitions.
RANDOM walk for 40000 steps (899 resets) in 256 ms. (155 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40002 steps (25 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (220 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2025-05-30 08:26:48] [INFO ] Flow matrix only has 92 transitions (discarded 5 similar events)
// Phase 1: matrix 92 rows 52 cols
[2025-05-30 08:26:48] [INFO ] Computed 4 invariants in 1 ms
[2025-05-30 08:26:48] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 92/144 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/144 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 58 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 92/144 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 60 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 52/52 places, 97/97 transitions.
RANDOM walk for 40000 steps (900 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (217 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Probably explored full state space saw : 16792 states, properties seen :0
Probabilistic random walk after 74289 steps, saw 16792 distinct states, run finished after 152 ms. (steps per millisecond=488 ) properties seen :0
Explored full state space saw : 16792 states, properties seen :0
Exhaustive walk after 74289 steps, saw 16792 distinct states, run finished after 140 ms. (steps per millisecond=530 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p3 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p3)))), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1)), (G (OR p2 p1)), (G (OR p0 p2)), (G (OR p0 p3 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p3 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p3 p1))), (F (NOT p2)), (F (NOT (OR p0 p3 p1))), (F (NOT p1)), (F (NOT p3)), (F (NOT (OR (NOT p2) p3 (NOT p1)))), (F (NOT (OR p0 p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1284 ms. Reduced automaton from 14 states, 45 edges and 4 AP (stutter sensitive) to 7 states, 31 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3) (NOT p0))]
Support contains 6 out of 1514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1841 edges and 1514 vertex of which 693 / 1514 are part of one of the 63 SCC in 3 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 473 rules applied. Total rules applied 474 place count 883 transition count 733
Reduce places removed 473 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 496 rules applied. Total rules applied 970 place count 410 transition count 710
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 981 place count 399 transition count 710
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 981 place count 399 transition count 662
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1077 place count 351 transition count 662
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1092 place count 336 transition count 638
Iterating global reduction 3 with 15 rules applied. Total rules applied 1107 place count 336 transition count 638
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 3 with 3 rules applied. Total rules applied 1110 place count 336 transition count 635
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1113 place count 333 transition count 635
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1122 place count 324 transition count 623
Iterating global reduction 5 with 9 rules applied. Total rules applied 1131 place count 324 transition count 623
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1137 place count 324 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1138 place count 323 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 1139 place count 323 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1140 place count 322 transition count 613
Iterating global reduction 6 with 1 rules applied. Total rules applied 1141 place count 322 transition count 613
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1142 place count 321 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 1143 place count 321 transition count 611
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1144 place count 320 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 1145 place count 320 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1146 place count 319 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 1147 place count 319 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1148 place count 318 transition count 600
Iterating global reduction 6 with 1 rules applied. Total rules applied 1149 place count 318 transition count 600
Performed 140 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 6 with 280 rules applied. Total rules applied 1429 place count 178 transition count 382
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1440 place count 178 transition count 371
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1444 place count 174 transition count 366
Iterating global reduction 7 with 4 rules applied. Total rules applied 1448 place count 174 transition count 366
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 7 with 26 rules applied. Total rules applied 1474 place count 161 transition count 350
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1488 place count 161 transition count 336
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1489 place count 160 transition count 334
Iterating global reduction 8 with 1 rules applied. Total rules applied 1490 place count 160 transition count 334
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1526 place count 142 transition count 371
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1547 place count 142 transition count 350
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1555 place count 134 transition count 334
Iterating global reduction 9 with 8 rules applied. Total rules applied 1563 place count 134 transition count 334
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1568 place count 134 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 10 with 41 rules applied. Total rules applied 1609 place count 134 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1610 place count 133 transition count 287
Applied a total of 1610 rules in 74 ms. Remains 133 /1514 variables (removed 1381) and now considering 287/1939 (removed 1652) transitions.
[2025-05-30 08:26:50] [INFO ] Flow matrix only has 228 transitions (discarded 59 similar events)
// Phase 1: matrix 228 rows 133 cols
[2025-05-30 08:26:50] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 08:26:50] [INFO ] Flow matrix only has 228 transitions (discarded 59 similar events)
[2025-05-30 08:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:26:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [17, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 205 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/1514 places, 287/1939 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 285
Applied a total of 1 rules in 11 ms. Remains 129 /131 variables (removed 2) and now considering 285/287 (removed 2) transitions.
[2025-05-30 08:26:50] [INFO ] Flow matrix only has 226 transitions (discarded 59 similar events)
// Phase 1: matrix 226 rows 129 cols
[2025-05-30 08:26:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 08:26:50] [INFO ] Flow matrix only has 226 transitions (discarded 59 similar events)
[2025-05-30 08:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:26:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/1514 places, 285/1939 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 457 ms. Remains : 129/1514 places, 285/1939 transitions.
Computed a total of 4 stabilizing places and 20 stable transitions
Graph (complete) has 435 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 171 ms. Reduced automaton from 7 states, 31 edges and 4 AP (stutter insensitive) to 7 states, 31 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3) (NOT p0))]
Reduction of identical properties reduced properties to check from 15 to 12
RANDOM walk for 40000 steps (4181 resets) in 506 ms. (78 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (670 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (703 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (711 resets) in 24 ms. (1600 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (692 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (711 resets) in 26 ms. (1481 steps per ms) remains 2/5 properties
[2025-05-30 08:26:51] [INFO ] Flow matrix only has 226 transitions (discarded 59 similar events)
[2025-05-30 08:26:51] [INFO ] Invariant cache hit.
[2025-05-30 08:26:51] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/225 variables, 60/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/351 variables, 66/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 3/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/354 variables, 3/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 134 constraints, problems are : Problem set: 1 solved, 1 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/225 variables, 60/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/351 variables, 66/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 3/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/354 variables, 3/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/354 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 135 constraints, problems are : Problem set: 1 solved, 1 unsolved in 126 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 285/285 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 129 transition count 221
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 121 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 120 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 120 transition count 219
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 119 transition count 219
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 120 place count 97 transition count 196
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 128 place count 97 transition count 188
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 137 place count 88 transition count 179
Iterating global reduction 4 with 9 rules applied. Total rules applied 146 place count 88 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 149 place count 88 transition count 176
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 167 place count 79 transition count 167
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 173 place count 73 transition count 155
Iterating global reduction 5 with 6 rules applied. Total rules applied 179 place count 73 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 185 place count 73 transition count 149
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 201 place count 65 transition count 150
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 208 place count 65 transition count 143
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 214 place count 59 transition count 131
Iterating global reduction 7 with 6 rules applied. Total rules applied 220 place count 59 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 225 place count 59 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 228 place count 59 transition count 123
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 230 place count 58 transition count 122
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 236 place count 58 transition count 116
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 238 place count 56 transition count 114
Iterating global reduction 9 with 2 rules applied. Total rules applied 240 place count 56 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 242 place count 56 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 251 place count 56 transition count 103
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 253 place count 54 transition count 97
Iterating global reduction 10 with 2 rules applied. Total rules applied 255 place count 54 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 257 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 259 place count 52 transition count 93
Iterating global reduction 11 with 2 rules applied. Total rules applied 261 place count 52 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 265 place count 52 transition count 89
Free-agglomeration rule applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 272 place count 52 transition count 82
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 280 place count 45 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 281 place count 45 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 282 place count 45 transition count 80
Applied a total of 282 rules in 18 ms. Remains 45 /129 variables (removed 84) and now considering 80/285 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 45/129 places, 80/285 transitions.
RANDOM walk for 40000 steps (567 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (14 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Probably explored full state space saw : 11961 states, properties seen :0
Probabilistic random walk after 54050 steps, saw 11961 distinct states, run finished after 55 ms. (steps per millisecond=982 ) properties seen :0
Explored full state space saw : 11961 states, properties seen :0
Exhaustive walk after 54050 steps, saw 11961 distinct states, run finished after 31 ms. (steps per millisecond=1743 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p0)), (X (X p1)), (G (OR (NOT p1) p3 p0)), (G (OR p1 p2)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (OR p3 p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR p1 p3))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT p3)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 33 factoid took 637 ms. Reduced automaton from 7 states, 31 edges and 4 AP (stutter insensitive) to 6 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), false]
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), false]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), false]
Product exploration explored 100000 steps with 8699 reset in 273 ms.
Product exploration explored 100000 steps with 8684 reset in 322 ms.
Built C files in :
/tmp/ltsmin12352418525622116802
[2025-05-30 08:26:54] [INFO ] Computing symmetric may disable matrix : 285 transitions.
[2025-05-30 08:26:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:26:54] [INFO ] Computing symmetric may enable matrix : 285 transitions.
[2025-05-30 08:26:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:26:54] [INFO ] Computing Do-Not-Accords matrix : 285 transitions.
[2025-05-30 08:26:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:26:54] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12352418525622116802
Running compilation step : cd /tmp/ltsmin12352418525622116802;'/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'
Compilation finished in 639 ms.
Running link step : cd /tmp/ltsmin12352418525622116802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12352418525622116802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5297506537838431350.hoa' '--buchi-type=spotba'
LTSmin run took 506 ms.
FORMULA CloudReconfiguration-PT-312-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-312-LTLCardinality-07 finished in 87240 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 (p1||G(!p0)))))'
Support contains 5 out of 1542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Graph (trivial) has 1874 edges and 1542 vertex of which 687 / 1542 are part of one of the 62 SCC in 2 ms
Free SCC test removed 625 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1420 edges and 917 vertex of which 908 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 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 491 rules applied. Total rules applied 493 place count 907 transition count 749
Reduce places removed 491 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 516 rules applied. Total rules applied 1009 place count 416 transition count 724
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1023 place count 404 transition count 722
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1025 place count 402 transition count 722
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1025 place count 402 transition count 675
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1119 place count 355 transition count 675
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1137 place count 337 transition count 647
Iterating global reduction 4 with 18 rules applied. Total rules applied 1155 place count 337 transition count 647
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 4 with 2 rules applied. Total rules applied 1157 place count 337 transition count 645
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1159 place count 335 transition count 645
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1171 place count 323 transition count 628
Iterating global reduction 6 with 12 rules applied. Total rules applied 1183 place count 323 transition count 628
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 1190 place count 323 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1191 place count 322 transition count 621
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1194 place count 319 transition count 615
Iterating global reduction 8 with 3 rules applied. Total rules applied 1197 place count 319 transition count 615
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1199 place count 317 transition count 611
Iterating global reduction 8 with 2 rules applied. Total rules applied 1201 place count 317 transition count 611
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1203 place count 315 transition count 607
Iterating global reduction 8 with 2 rules applied. Total rules applied 1205 place count 315 transition count 607
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1207 place count 313 transition count 603
Iterating global reduction 8 with 2 rules applied. Total rules applied 1209 place count 313 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1211 place count 311 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1213 place count 311 transition count 599
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1214 place count 310 transition count 592
Iterating global reduction 8 with 1 rules applied. Total rules applied 1215 place count 310 transition count 592
Performed 146 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 8 with 292 rules applied. Total rules applied 1507 place count 164 transition count 363
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1518 place count 164 transition count 352
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1523 place count 159 transition count 342
Iterating global reduction 9 with 5 rules applied. Total rules applied 1528 place count 159 transition count 342
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 1554 place count 146 transition count 326
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1567 place count 146 transition count 313
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 1599 place count 130 transition count 336
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1615 place count 130 transition count 320
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1624 place count 121 transition count 302
Iterating global reduction 11 with 9 rules applied. Total rules applied 1633 place count 121 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1639 place count 121 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 12 with 34 rules applied. Total rules applied 1673 place count 121 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1674 place count 120 transition count 261
Applied a total of 1674 rules in 79 ms. Remains 120 /1542 variables (removed 1422) and now considering 261/1973 (removed 1712) transitions.
[2025-05-30 08:26:55] [INFO ] Flow matrix only has 207 transitions (discarded 54 similar events)
// Phase 1: matrix 207 rows 120 cols
[2025-05-30 08:26:55] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 08:26:55] [INFO ] Flow matrix only has 207 transitions (discarded 54 similar events)
[2025-05-30 08:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:26:55] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [9, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 171 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1542 places, 261/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 259
Applied a total of 1 rules in 9 ms. Remains 116 /118 variables (removed 2) and now considering 259/261 (removed 2) transitions.
[2025-05-30 08:26:55] [INFO ] Flow matrix only has 205 transitions (discarded 54 similar events)
// Phase 1: matrix 205 rows 116 cols
[2025-05-30 08:26:55] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:55] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 08:26:55] [INFO ] Flow matrix only has 205 transitions (discarded 54 similar events)
[2025-05-30 08:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 08:26:55] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1542 places, 259/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 393 ms. Remains : 116/1542 places, 259/1973 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-312-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLCardinality-08 finished in 439 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||X(p1))))'
Support contains 3 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1529 transition count 1959
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1529 transition count 1959
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1520 transition count 1950
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1520 transition count 1950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 1520 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1517 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1517 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1516 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1515 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1514 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1512 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1511 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1511 transition count 1934
Applied a total of 66 rules in 520 ms. Remains 1511 /1542 variables (removed 31) and now considering 1934/1973 (removed 39) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2025-05-30 08:26:56] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:56] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 08:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:57] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2025-05-30 08:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 30040 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
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 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30032 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 60547ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60551ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1542 places, 1934/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62189 ms. Remains : 1511/1542 places, 1934/1973 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 322 ms.
Product exploration explored 100000 steps with 33333 reset in 380 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-312-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-312-LTLCardinality-11 finished in 63082 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(G((X(p0)&&F(p1)))))'
Support contains 3 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1526 transition count 1956
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1526 transition count 1956
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1516 transition count 1946
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1516 transition count 1946
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 1516 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 1512 transition count 1937
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 1512 transition count 1937
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 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1506 transition count 1928
Applied a total of 76 rules in 525 ms. Remains 1506 /1542 variables (removed 36) and now considering 1928/1973 (removed 45) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 08:27:59] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:27:59] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-30 08:27:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:28:00] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 08:28:00] [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 30034 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 30029 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 60423ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1542 places, 1928/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62103 ms. Remains : 1506/1542 places, 1928/1973 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLCardinality-14
Product exploration explored 100000 steps with 24953 reset in 246 ms.
Product exploration explored 100000 steps with 24958 reset in 258 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
RANDOM walk for 11737 steps (82 resets) in 48 ms. (239 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 3 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 53 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2025-05-30 08:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:29:02] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-30 08:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:29:03] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 08:29:03] [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 30032 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 30039 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 60468ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Finished structural reductions in LTL mode , in 1 iterations and 61715 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
RANDOM walk for 6060 steps (44 resets) in 48 ms. (123 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 25029 reset in 245 ms.
Product exploration explored 100000 steps with 24891 reset in 248 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 3 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 1836 edges and 1506 vertex of which 687 / 1506 are part of one of the 62 SCC in 1 ms
Free SCC test removed 625 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1372 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 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 475 rules applied. Total rules applied 477 place count 872 transition count 1196
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 489 place count 872 transition count 1184
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 489 place count 872 transition count 1197
Deduced a syphon composed of 496 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 510 place count 872 transition count 1197
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 792 place count 590 transition count 905
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1074 place count 590 transition count 905
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1086 place count 578 transition count 889
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1098 place count 578 transition count 889
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1104 place count 578 transition count 883
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1116 place count 566 transition count 871
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1128 place count 566 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1130 place count 564 transition count 867
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1132 place count 564 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1134 place count 562 transition count 863
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1136 place count 562 transition count 863
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1140 place count 558 transition count 859
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1144 place count 558 transition count 859
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1146 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 1148 place count 556 transition count 855
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1150 place count 554 transition count 851
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1152 place count 554 transition count 851
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1156 place count 550 transition count 845
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1160 place count 550 transition count 845
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1164 place count 546 transition count 829
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1168 place count 546 transition count 829
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1169 place count 546 transition count 829
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1173 place count 542 transition count 825
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1177 place count 542 transition count 825
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 316 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1282 place count 542 transition count 899
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1321 place count 542 transition count 860
Discarding 102 places :
Symmetric choice reduction at 5 with 102 rule applications. Total rules 1423 place count 440 transition count 748
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 102 rules applied. Total rules applied 1525 place count 440 transition count 748
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1531 place count 434 transition count 739
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1537 place count 434 transition count 739
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1544 place count 434 transition count 739
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1548 place count 434 transition count 735
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1563 place count 419 transition count 716
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1578 place count 419 transition count 716
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1584 place count 419 transition count 710
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1588 place count 415 transition count 706
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1592 place count 415 transition count 706
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1595 place count 415 transition count 706
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1601 place count 415 transition count 700
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1604 place count 412 transition count 697
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1607 place count 412 transition count 697
Performed 71 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1678 place count 412 transition count 1010
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 8 with 119 rules applied. Total rules applied 1797 place count 412 transition count 891
Discarding 126 places :
Symmetric choice reduction at 9 with 126 rule applications. Total rules 1923 place count 286 transition count 561
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 9 with 126 rules applied. Total rules applied 2049 place count 286 transition count 561
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2064 place count 286 transition count 546
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2091 place count 259 transition count 489
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2118 place count 259 transition count 489
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2121 place count 259 transition count 542
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2124 place count 256 transition count 520
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2127 place count 256 transition count 520
Deduced a syphon composed of 137 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 10 with 48 rules applied. Total rules applied 2175 place count 256 transition count 472
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2180 place count 251 transition count 464
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 10 with 5 rules applied. Total rules applied 2185 place count 251 transition count 464
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2187 place count 251 transition count 504
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2189 place count 249 transition count 494
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2191 place count 249 transition count 494
Deduced a syphon composed of 132 places in 1 ms
Applied a total of 2191 rules in 345 ms. Remains 249 /1506 variables (removed 1257) and now considering 494/1928 (removed 1434) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:30:06] [INFO ] Redundant transitions in 30 ms returned []
Running 493 sub problems to find dead transitions.
[2025-05-30 08:30:06] [INFO ] Flow matrix only has 439 transitions (discarded 55 similar events)
// Phase 1: matrix 439 rows 249 cols
[2025-05-30 08:30:06] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 08:30:06] [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/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 493 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 TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 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 TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 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 TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 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 TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 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 TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
At refinement iteration 1 (OVERLAPS) 438/686 variables, 248/248 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 2/250 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/250 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 1/687 variables, 1/251 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/687 variables, 0/251 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/688 variables, 1/252 constraints. Problems are: Problem set: 228 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/688 variables, and 252 constraints, problems are : Problem set: 228 solved, 265 unsolved in 30021 ms.
Refiners :[State Equation: 249/249 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 228 solved, 265 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: 228 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 436/552 variables, 116/116 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 2/118 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/552 variables, 265/383 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 0/383 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 135/687 variables, 133/516 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/687 variables, 0/516 constraints. Problems are: Problem set: 228 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/688 variables, 1/517 constraints. Problems are: Problem set: 228 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/688 variables, and 517 constraints, problems are : Problem set: 228 solved, 265 unsolved in 30018 ms.
Refiners :[State Equation: 249/249 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 265/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 228 solved, 265 unsolved
Search for dead transitions found 228 dead transitions in 60172ms
Found 228 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 228 transitions
Dead transitions reduction (with SMT) removed 228 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 249/1506 places, 266/1928 transitions.
Graph (complete) has 407 edges and 249 vertex of which 117 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.1 ms
Discarding 132 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 117 /249 variables (removed 132) and now considering 266/266 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1506 places, 266/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60582 ms. Remains : 117/1506 places, 266/1928 transitions.
Built C files in :
/tmp/ltsmin1966795791725107980
[2025-05-30 08:31:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1966795791725107980
Running compilation step : cd /tmp/ltsmin1966795791725107980;'/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/ltsmin1966795791725107980;'/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/ltsmin1966795791725107980;'/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 3 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 38 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 08:31:09] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:31:10] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-30 08:31:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:31:11] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 08:31:11] [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 30050 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 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 60445ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Finished structural reductions in LTL mode , in 1 iterations and 61711 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin1603701604950610113
[2025-05-30 08:32:11] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1603701604950610113
Running compilation step : cd /tmp/ltsmin1603701604950610113;'/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/ltsmin1603701604950610113;'/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/ltsmin1603701604950610113;'/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 08:32:14] [INFO ] Flatten gal took : 54 ms
[2025-05-30 08:32:14] [INFO ] Flatten gal took : 51 ms
[2025-05-30 08:32:14] [INFO ] Time to serialize gal into /tmp/LTL9318092816458797921.gal : 15 ms
[2025-05-30 08:32:14] [INFO ] Time to serialize properties into /tmp/LTL6663575788665810950.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/LTL9318092816458797921.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16269616185873009928.hoa' '-atoms' '/tmp/LTL6663575788665810950.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...318
Loading property file /tmp/LTL6663575788665810950.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16269616185873009928.hoa
Detected timeout of ITS tools.
[2025-05-30 08:32:29] [INFO ] Flatten gal took : 89 ms
[2025-05-30 08:32:30] [INFO ] Flatten gal took : 75 ms
[2025-05-30 08:32:30] [INFO ] Time to serialize gal into /tmp/LTL8640017962465877657.gal : 10 ms
[2025-05-30 08:32:30] [INFO ] Time to serialize properties into /tmp/LTL4872608542409273956.ltl : 17 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/LTL8640017962465877657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4872608542409273956.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...275
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((p1983==0)||(p1653==1))"))&&(F("(((p822==1)||(p1983==0))||(p1653==1))"))))))
Formula 0 simplified : XF(X!"((p1983==0)||(p1653==1))" | G!"(((p822==1)||(p1983==0))||(p1653==1))")
Detected timeout of ITS tools.
[2025-05-30 08:32:45] [INFO ] Flatten gal took : 43 ms
[2025-05-30 08:32:45] [INFO ] Applying decomposition
[2025-05-30 08:32:45] [INFO ] Flatten gal took : 42 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/graph9723489471911814575.txt' '-o' '/tmp/graph9723489471911814575.bin' '-w' '/tmp/graph9723489471911814575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9723489471911814575.bin' '-l' '-1' '-v' '-w' '/tmp/graph9723489471911814575.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:32:45] [INFO ] Decomposing Gal with order
[2025-05-30 08:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:32:45] [INFO ] Removed a total of 505 redundant transitions.
[2025-05-30 08:32:46] [INFO ] Flatten gal took : 493 ms
[2025-05-30 08:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 114 ms.
[2025-05-30 08:32:46] [INFO ] Time to serialize gal into /tmp/LTL6282781230988682727.gal : 33 ms
[2025-05-30 08:32:46] [INFO ] Time to serialize properties into /tmp/LTL9049243439088909334.ltl : 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/LTL6282781230988682727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9049243439088909334.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...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i31.i0.i4.u469.p1983==0)||(i28.i0.i0.u400.p1653==1))"))&&(F("(((i14.i0.i1.u178.p822==1)||(i31.i0.i4.u469.p1983==0))||(i28...184
Formula 0 simplified : XF(X!"((i31.i0.i4.u469.p1983==0)||(i28.i0.i0.u400.p1653==1))" | G!"(((i14.i0.i1.u178.p822==1)||(i31.i0.i4.u469.p1983==0))||(i28.i0.i...174
Reverse transition relation is NOT exact ! Due to transitions t26, t183, t266, t297, t326, t375, t446, t497, t500, t670, t751, t811, t860, t932, t983, t113...2068
Computing Next relation with stutter on 140576 deadlock states
40 unique states visited
40 strongly connected components in search stack
41 transitions explored
40 items max in DFS search stack
758 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,7.75067,261568,1,0,414849,15023,22473,904870,664,129968,2062864
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-312-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-312-LTLCardinality-14 finished in 296594 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(G(p0))))'
Support contains 2 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1973/1973 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1528 transition count 1958
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1528 transition count 1958
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1520 transition count 1950
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1520 transition count 1950
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 1520 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 1516 transition count 1942
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1515 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1514 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1513 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1511 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1510 transition count 1933
Applied a total of 67 rules in 616 ms. Remains 1510 /1542 variables (removed 32) and now considering 1933/1973 (removed 40) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2025-05-30 08:32:56] [INFO ] Computed 4 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:32:56] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-05-30 08:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:32:57] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 08:32:57] [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 30031 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 30034 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 60469ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1542 places, 1933/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62253 ms. Remains : 1510/1542 places, 1933/1973 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-312-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLCardinality-15 finished in 62407 ms.
All properties solved by simple procedures.
Total runtime 650467 ms.

BK_STOP 1748594037919

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-312"
export BK_EXAMINATION="LTLCardinality"
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-312, examination is LTLCardinality"
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-174854028200299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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