Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 214K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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-305-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748585929920

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-305
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 06:18:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 06:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:18:51] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2025-05-30 06:18:51] [INFO ] Transformed 2585 places.
[2025-05-30 06:18:51] [INFO ] Transformed 3095 transitions.
[2025-05-30 06:18:51] [INFO ] Found NUPN structural information;
[2025-05-30 06:18:51] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudReconfiguration-PT-305-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2070 transition count 2580
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2070 transition count 2580
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1058 place count 2070 transition count 2552
Discarding 236 places :
Symmetric choice reduction at 1 with 236 rule applications. Total rules 1294 place count 1834 transition count 2316
Iterating global reduction 1 with 236 rules applied. Total rules applied 1530 place count 1834 transition count 2316
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1618 place count 1746 transition count 2228
Iterating global reduction 1 with 88 rules applied. Total rules applied 1706 place count 1746 transition count 2228
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1721 place count 1746 transition count 2213
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1768 place count 1699 transition count 2166
Iterating global reduction 2 with 47 rules applied. Total rules applied 1815 place count 1699 transition count 2166
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1823 place count 1699 transition count 2158
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1860 place count 1662 transition count 2117
Iterating global reduction 3 with 37 rules applied. Total rules applied 1897 place count 1662 transition count 2117
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1925 place count 1634 transition count 2089
Iterating global reduction 3 with 28 rules applied. Total rules applied 1953 place count 1634 transition count 2089
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1978 place count 1609 transition count 2064
Iterating global reduction 3 with 25 rules applied. Total rules applied 2003 place count 1609 transition count 2064
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2028 place count 1584 transition count 2039
Iterating global reduction 3 with 25 rules applied. Total rules applied 2053 place count 1584 transition count 2039
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2075 place count 1562 transition count 2004
Iterating global reduction 3 with 22 rules applied. Total rules applied 2097 place count 1562 transition count 2004
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2104 place count 1555 transition count 1993
Iterating global reduction 3 with 7 rules applied. Total rules applied 2111 place count 1555 transition count 1993
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2118 place count 1548 transition count 1983
Iterating global reduction 3 with 7 rules applied. Total rules applied 2125 place count 1548 transition count 1983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2126 place count 1548 transition count 1982
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2129 place count 1545 transition count 1979
Iterating global reduction 4 with 3 rules applied. Total rules applied 2132 place count 1545 transition count 1979
Applied a total of 2132 rules in 1262 ms. Remains 1545 /2585 variables (removed 1040) and now considering 1979/3095 (removed 1116) transitions.
// Phase 1: matrix 1979 rows 1545 cols
[2025-05-30 06:18:52] [INFO ] Computed 4 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:18:53] [INFO ] Implicit Places using invariants in 452 ms returned []
[2025-05-30 06:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:18:54] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1482 ms to find 0 implicit places.
Running 1978 sub problems to find dead transitions.
[2025-05-30 06:18:54] [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 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.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 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.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 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1544 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1544/3524 variables, and 4 constraints, problems are : Problem set: 0 solved, 1978 unsolved in 30080 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1545 constraints, PredecessorRefiner: 1978/1978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1978 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1544 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1978 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 1544/3524 variables, and 4 constraints, problems are : Problem set: 0 solved, 1978 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1545 constraints, PredecessorRefiner: 0/1978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60673ms problems are : Problem set: 0 solved, 1978 unsolved
Search for dead transitions found 0 dead transitions in 60693ms
Starting structural reductions in LTL mode, iteration 1 : 1545/2585 places, 1979/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63467 ms. Remains : 1545/2585 places, 1979/3095 transitions.
Support contains 29 out of 1545 places after structural reductions.
[2025-05-30 06:19:55] [INFO ] Flatten gal took : 116 ms
[2025-05-30 06:19:55] [INFO ] Flatten gal took : 69 ms
[2025-05-30 06:19:55] [INFO ] Input system was already deterministic with 1979 transitions.
Support contains 28 out of 1545 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (312 resets) in 1950 ms. (20 steps per ms) remains 19/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 69 ms. (57 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 57 ms. (69 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 43 ms. (91 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
[2025-05-30 06:19:56] [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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1515/1534 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1534 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1969/3503 variables, 1534/1538 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3503 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/3505 variables, 1/1539 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3505 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 2/3507 variables, 1/1540 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3507 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2/3509 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3509 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/3511 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3511 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 2/3513 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3513/3524 variables, and 1543 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1539/1545 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1515/1534 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1534 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1969/3503 variables, 1534/1538 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3503 variables, 19/1557 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3503 variables, 0/1557 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/3505 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3505/3524 variables, and 1558 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5020 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1535/1545 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10050ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Graph (trivial) has 1851 edges and 1545 vertex of which 665 / 1545 are part of one of the 63 SCC in 9 ms
Free SCC test removed 602 places
Drop transitions (Empty/Sink Transition effects.) removed 756 transitions
Reduce isomorphic transitions removed 756 transitions.
Graph (complete) has 1395 edges and 943 vertex of which 934 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 505 rules applied. Total rules applied 507 place count 934 transition count 714
Reduce places removed 498 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 556 rules applied. Total rules applied 1063 place count 436 transition count 656
Reduce places removed 37 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 42 rules applied. Total rules applied 1105 place count 399 transition count 651
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1111 place count 394 transition count 650
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1111 place count 394 transition count 600
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1211 place count 344 transition count 600
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1221 place count 334 transition count 587
Iterating global reduction 4 with 10 rules applied. Total rules applied 1231 place count 334 transition count 587
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 4 with 3 rules applied. Total rules applied 1234 place count 334 transition count 584
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1237 place count 331 transition count 584
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1243 place count 325 transition count 578
Iterating global reduction 6 with 6 rules applied. Total rules applied 1249 place count 325 transition count 578
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1255 place count 325 transition count 572
Performed 164 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 164 places in 1 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 7 with 328 rules applied. Total rules applied 1583 place count 161 transition count 311
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1604 place count 161 transition count 290
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1607 place count 158 transition count 287
Iterating global reduction 8 with 3 rules applied. Total rules applied 1610 place count 158 transition count 287
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1632 place count 147 transition count 274
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1645 place count 147 transition count 261
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 1647 place count 146 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1649 place count 146 transition count 258
Performed 32 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 10 with 64 rules applied. Total rules applied 1713 place count 114 transition count 295
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 1740 place count 114 transition count 268
Discarding 16 places :
Symmetric choice reduction at 11 with 16 rule applications. Total rules 1756 place count 98 transition count 236
Iterating global reduction 11 with 16 rules applied. Total rules applied 1772 place count 98 transition count 236
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 1779 place count 98 transition count 229
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1782 place count 95 transition count 223
Iterating global reduction 12 with 3 rules applied. Total rules applied 1785 place count 95 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1788 place count 95 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 13 with 14 rules applied. Total rules applied 1802 place count 95 transition count 206
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1803 place count 94 transition count 205
Iterating global reduction 13 with 1 rules applied. Total rules applied 1804 place count 94 transition count 205
Free-agglomeration rule applied 6 times.
Iterating global reduction 13 with 6 rules applied. Total rules applied 1810 place count 94 transition count 199
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 1817 place count 88 transition count 198
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 1821 place count 88 transition count 198
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1822 place count 88 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1823 place count 87 transition count 197
Applied a total of 1823 rules in 179 ms. Remains 87 /1545 variables (removed 1458) and now considering 197/1979 (removed 1782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 87/1545 places, 197/1979 transitions.
RANDOM walk for 33974 steps (408 resets) in 401 ms. (84 steps per ms) remains 0/19 properties
Computed a total of 28 stabilizing places and 30 stable transitions
Graph (complete) has 2156 edges and 1545 vertex of which 1536 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' '!(F((X(p0)&&F(p1))))'
Support contains 2 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1529 transition count 1963
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1529 transition count 1963
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1529 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 1520 transition count 1952
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 1520 transition count 1952
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 1520 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 1516 transition count 1945
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 1516 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1516 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1515 transition count 1943
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1515 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1514 transition count 1942
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1514 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 1513 transition count 1940
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 1513 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 1512 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 1512 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 1511 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 1511 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 1511 transition count 1936
Applied a total of 74 rules in 459 ms. Remains 1511 /1545 variables (removed 34) and now considering 1936/1979 (removed 43) transitions.
// Phase 1: matrix 1936 rows 1511 cols
[2025-05-30 06:20:07] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:20:08] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-30 06:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:20:08] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2025-05-30 06:20:08] [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, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 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, 1935 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/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1545 places, 1936/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62052 ms. Remains : 1511/1545 places, 1936/1979 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 457 ms.
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2113 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 29 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-305-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-305-LTLFireability-00 finished in 63333 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)||(F(p1) U X((p2||F(G(!p2)))))))'
Support contains 3 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1530 transition count 1964
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1530 transition count 1964
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1530 transition count 1962
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 40 place count 1522 transition count 1954
Iterating global reduction 1 with 8 rules applied. Total rules applied 48 place count 1522 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 1522 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 1518 transition count 1948
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 1518 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 1518 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 1516 transition count 1944
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 1516 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 1514 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 1514 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 1514 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 1513 transition count 1939
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 1513 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 1511 transition count 1936
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 1511 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 1511 transition count 1935
Applied a total of 74 rules in 659 ms. Remains 1511 /1545 variables (removed 34) and now considering 1935/1979 (removed 44) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2025-05-30 06:21:11] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:21:11] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-05-30 06:21:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:21:12] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2025-05-30 06:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 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, 1934 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 1)
(s204 0)
(s205 1)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(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 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 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 1)
(s699 1)
(s700 0)
(s701 1)
(s702 0)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 0)
(s708 1)
(s709 0)
(s710 0)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 1)
(s716 1)
(s717 0)
(s718 1)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(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 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1545 places, 1935/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62247 ms. Remains : 1511/1545 places, 1935/1979 transitions.
Stuttering acceptance computed with spot in 258 ms :[false, false, false, (AND (NOT p1) p2), false, false]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 367 ms.
Product exploration explored 100000 steps with 50000 reset in 387 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.10 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-305-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-305-LTLFireability-02 finished in 63354 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((p0||X(G(p1)))) U G(p2))))'
Support contains 3 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1531 transition count 1965
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1531 transition count 1965
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1531 transition count 1963
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 1523 transition count 1955
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 1523 transition count 1955
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 1523 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 1518 transition count 1946
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 1518 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 1518 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 1516 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 1514 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 1513 transition count 1937
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 1512 transition count 1935
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 1511 transition count 1934
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 1511 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 1511 transition count 1933
Applied a total of 75 rules in 433 ms. Remains 1511 /1545 variables (removed 34) and now considering 1933/1979 (removed 46) transitions.
// Phase 1: matrix 1933 rows 1511 cols
[2025-05-30 06:22:14] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:22:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-05-30 06:22:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:22:15] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 06:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 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/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1545 places, 1933/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61971 ms. Remains : 1511/1545 places, 1933/1979 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-03
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-03 finished in 62346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||(F(p2)&&p1))) U p3))'
Support contains 5 out of 1545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Graph (trivial) has 1881 edges and 1545 vertex of which 695 / 1545 are part of one of the 63 SCC in 7 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1416 edges and 913 vertex of which 904 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 496 place count 903 transition count 745
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 520 rules applied. Total rules applied 1016 place count 409 transition count 719
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1031 place count 397 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1034 place count 394 transition count 716
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1034 place count 394 transition count 669
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1128 place count 347 transition count 669
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1142 place count 333 transition count 647
Iterating global reduction 4 with 14 rules applied. Total rules applied 1156 place count 333 transition count 647
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 4 with 3 rules applied. Total rules applied 1159 place count 333 transition count 644
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1162 place count 330 transition count 644
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1171 place count 321 transition count 632
Iterating global reduction 6 with 9 rules applied. Total rules applied 1180 place count 321 transition count 632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1186 place count 321 transition count 626
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1187 place count 320 transition count 624
Iterating global reduction 7 with 1 rules applied. Total rules applied 1188 place count 320 transition count 624
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1189 place count 319 transition count 622
Iterating global reduction 7 with 1 rules applied. Total rules applied 1190 place count 319 transition count 622
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 318 transition count 620
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 318 transition count 620
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 317 transition count 618
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 317 transition count 618
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 316 transition count 616
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 316 transition count 616
Performed 142 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1480 place count 174 transition count 390
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1494 place count 174 transition count 376
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1499 place count 169 transition count 369
Iterating global reduction 8 with 5 rules applied. Total rules applied 1504 place count 169 transition count 369
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 1530 place count 156 transition count 353
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1545 place count 156 transition count 338
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1546 place count 155 transition count 336
Iterating global reduction 9 with 1 rules applied. Total rules applied 1547 place count 155 transition count 336
Performed 20 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1587 place count 135 transition count 370
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1607 place count 135 transition count 350
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1616 place count 126 transition count 332
Iterating global reduction 10 with 9 rules applied. Total rules applied 1625 place count 126 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1631 place count 126 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 11 with 42 rules applied. Total rules applied 1673 place count 126 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1674 place count 125 transition count 283
Applied a total of 1674 rules in 123 ms. Remains 125 /1545 variables (removed 1420) and now considering 283/1979 (removed 1696) transitions.
[2025-05-30 06:23:16] [INFO ] Flow matrix only has 225 transitions (discarded 58 similar events)
// Phase 1: matrix 225 rows 125 cols
[2025-05-30 06:23:16] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:23:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-30 06:23:16] [INFO ] Flow matrix only has 225 transitions (discarded 58 similar events)
[2025-05-30 06:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:23:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 06:23:16] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:23:16] [INFO ] Redundant transitions in 18 ms returned []
Running 282 sub problems to find dead transitions.
[2025-05-30 06:23:16] [INFO ] Flow matrix only has 225 transitions (discarded 58 similar events)
[2025-05-30 06:23:16] [INFO ] Invariant cache hit.
[2025-05-30 06:23:16] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 1 (OVERLAPS) 224/348 variables, 124/124 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/128 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 1/349 variables, 1/129 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/129 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 1/350 variables, 1/130 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/130 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 0/350 variables, 0/130 constraints. Problems are: Problem set: 5 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 130 constraints, problems are : Problem set: 5 solved, 277 unsolved in 19588 ms.
Refiners :[State Equation: 125/125 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 224/348 variables, 124/124 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/128 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 277/405 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/405 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 1/349 variables, 1/406 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/406 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/407 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/407 constraints. Problems are: Problem set: 5 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/407 constraints. Problems are: Problem set: 5 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 407 constraints, problems are : Problem set: 5 solved, 277 unsolved in 30009 ms.
Refiners :[State Equation: 125/125 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 277/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49648ms problems are : Problem set: 5 solved, 277 unsolved
Search for dead transitions found 5 dead transitions in 49649ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/1545 places, 278/1979 transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 118 transition count 260
Applied a total of 7 rules in 8 ms. Remains 118 /125 variables (removed 7) and now considering 260/278 (removed 18) transitions.
[2025-05-30 06:24:06] [INFO ] Flow matrix only has 206 transitions (discarded 54 similar events)
// Phase 1: matrix 206 rows 118 cols
[2025-05-30 06:24:06] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:24:06] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-30 06:24:06] [INFO ] Flow matrix only has 206 transitions (discarded 54 similar events)
[2025-05-30 06:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:24:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 06:24:06] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1545 places, 260/1979 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50226 ms. Remains : 118/1545 places, 260/1979 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-05 finished in 50421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F((p0&&X(p1))) U !p0)) U G((!p0 U X(p2)))))'
Support contains 3 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1529 transition count 1963
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1529 transition count 1963
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1529 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 1520 transition count 1952
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 1520 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 1520 transition count 1951
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 1515 transition count 1944
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 1515 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1515 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1513 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1513 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 1511 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1511 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 1511 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 1510 transition count 1935
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 1509 transition count 1933
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 1508 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 1508 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 1508 transition count 1931
Applied a total of 80 rules in 413 ms. Remains 1508 /1545 variables (removed 37) and now considering 1931/1979 (removed 48) transitions.
// Phase 1: matrix 1931 rows 1508 cols
[2025-05-30 06:24:07] [INFO ] Computed 4 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:24:07] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-05-30 06:24:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:24:08] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2025-05-30 06:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 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 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60473ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1545 places, 1931/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62380 ms. Remains : 1508/1545 places, 1931/1979 transitions.
Stuttering acceptance computed with spot in 540 ms :[(NOT p2), false, (NOT p2), false, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), p0, (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-07
Stuttering criterion allowed to conclude after 275 steps with 6 reset in 3 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-07 finished in 62978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 1545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Graph (trivial) has 1888 edges and 1545 vertex of which 699 / 1545 are part of one of the 63 SCC in 4 ms
Free SCC test removed 636 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1410 edges and 909 vertex of which 900 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 899 transition count 740
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 519 rules applied. Total rules applied 1014 place count 406 transition count 714
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1027 place count 394 transition count 713
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1028 place count 393 transition count 713
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1028 place count 393 transition count 666
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 1122 place count 346 transition count 666
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1139 place count 329 transition count 639
Iterating global reduction 4 with 17 rules applied. Total rules applied 1156 place count 329 transition count 639
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 4 with 3 rules applied. Total rules applied 1159 place count 329 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1162 place count 326 transition count 636
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1172 place count 316 transition count 622
Iterating global reduction 6 with 10 rules applied. Total rules applied 1182 place count 316 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1188 place count 316 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1190 place count 314 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1192 place count 314 transition count 612
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 312 transition count 608
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 312 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 310 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 308 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 306 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 306 transition count 596
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1209 place count 305 transition count 589
Iterating global reduction 7 with 1 rules applied. Total rules applied 1210 place count 305 transition count 589
Performed 142 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1494 place count 163 transition count 365
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1506 place count 163 transition count 353
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1511 place count 158 transition count 346
Iterating global reduction 8 with 5 rules applied. Total rules applied 1516 place count 158 transition count 346
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1517 place count 157 transition count 341
Iterating global reduction 8 with 1 rules applied. Total rules applied 1518 place count 157 transition count 341
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1546 place count 143 transition count 324
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1561 place count 143 transition count 309
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 1595 place count 126 transition count 343
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1611 place count 126 transition count 327
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1620 place count 117 transition count 309
Iterating global reduction 10 with 9 rules applied. Total rules applied 1629 place count 117 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1634 place count 117 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1671 place count 117 transition count 267
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1672 place count 117 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1673 place count 116 transition count 266
Applied a total of 1673 rules in 96 ms. Remains 116 /1545 variables (removed 1429) and now considering 266/1979 (removed 1713) transitions.
[2025-05-30 06:25:09] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
// Phase 1: matrix 209 rows 116 cols
[2025-05-30 06:25:09] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:25:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 06:25:09] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
[2025-05-30 06:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:25:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 06:25:09] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [8, 78]
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 : 114/1545 places, 266/1979 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 264
Applied a total of 2 rules in 6 ms. Remains 112 /114 variables (removed 2) and now considering 264/266 (removed 2) transitions.
[2025-05-30 06:25:09] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
// Phase 1: matrix 207 rows 112 cols
[2025-05-30 06:25:09] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:25:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 06:25:10] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
[2025-05-30 06:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:25:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 06:25:10] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1545 places, 264/1979 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 413 ms. Remains : 112/1545 places, 264/1979 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-08 finished in 498 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(p0) U p1)))'
Support contains 2 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1529 transition count 1963
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1529 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1529 transition count 1962
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 1519 transition count 1952
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 1519 transition count 1952
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1519 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 1514 transition count 1943
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 1514 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1514 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 1512 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 1512 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 1510 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 1510 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 1510 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 1509 transition count 1934
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 1509 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 1508 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 1507 transition count 1931
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 1507 transition count 1930
Applied a total of 82 rules in 391 ms. Remains 1507 /1545 variables (removed 38) and now considering 1930/1979 (removed 49) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2025-05-30 06:25:10] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:25:10] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 06:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:25:11] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 06:25: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 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1545 places, 1930/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61857 ms. Remains : 1507/1545 places, 1930/1979 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-305-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-305-LTLFireability-10 finished in 62775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(p1))))))'
Support contains 2 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1529 transition count 1963
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1529 transition count 1963
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1529 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 1520 transition count 1952
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 1520 transition count 1952
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 1520 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 1516 transition count 1944
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 1516 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1516 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1515 transition count 1941
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1515 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1514 transition count 1940
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 1514 transition count 1939
Applied a total of 68 rules in 281 ms. Remains 1514 /1545 variables (removed 31) and now considering 1939/1979 (removed 40) transitions.
// Phase 1: matrix 1939 rows 1514 cols
[2025-05-30 06:26:13] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:26:13] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 06:26:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:26:14] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2025-05-30 06:26:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 30034 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
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 30033 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 60414ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1545 places, 1939/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61863 ms. Remains : 1514/1545 places, 1939/1979 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-11
Product exploration explored 100000 steps with 785 reset in 166 ms.
Product exploration explored 100000 steps with 777 reset in 169 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.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (313 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (90 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (93 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (101 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (84 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (85 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (100 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 292334 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 6
Probabilistic random walk after 292334 steps, saw 79803 distinct states, run finished after 3008 ms. (steps per millisecond=97 ) properties seen :0
[2025-05-30 06:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 824/826 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 677/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 6 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 Real declared 3452/3453 variables, and 1517 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1513/1514 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 824/826 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 677/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 6/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3432 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/3434 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3434 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/3436 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3436 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/3438 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3438 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/3440 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3440 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/3442 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3442 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 2/3444 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3444 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/3446 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3446/3453 variables, and 1520 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1514 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10037ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1848 edges and 1514 vertex of which 693 / 1514 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1315 edges and 884 vertex of which 875 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 875 transition count 641
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 551 rules applied. Total rules applied 1051 place count 384 transition count 581
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1090 place count 345 transition count 581
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1090 place count 345 transition count 531
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1190 place count 295 transition count 531
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1201 place count 284 transition count 515
Iterating global reduction 3 with 11 rules applied. Total rules applied 1212 place count 284 transition count 515
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 1215 place count 284 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1218 place count 281 transition count 512
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1226 place count 273 transition count 502
Iterating global reduction 5 with 8 rules applied. Total rules applied 1234 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1240 place count 273 transition count 496
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1242 place count 271 transition count 484
Iterating global reduction 6 with 2 rules applied. Total rules applied 1244 place count 271 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1245 place count 271 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1246 place count 270 transition count 483
Performed 143 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 8 with 286 rules applied. Total rules applied 1532 place count 127 transition count 248
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 8 with 14 rules applied. Total rules applied 1546 place count 127 transition count 234
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1548 place count 126 transition count 233
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1551 place count 123 transition count 230
Iterating global reduction 10 with 3 rules applied. Total rules applied 1554 place count 123 transition count 230
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 10 with 22 rules applied. Total rules applied 1576 place count 112 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1589 place count 112 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1591 place count 111 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1593 place count 111 transition count 201
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 12 with 68 rules applied. Total rules applied 1661 place count 77 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 12 with 61 rules applied. Total rules applied 1722 place count 77 transition count 171
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1746 place count 53 transition count 147
Iterating global reduction 13 with 24 rules applied. Total rules applied 1770 place count 53 transition count 147
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 1785 place count 53 transition count 132
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1791 place count 47 transition count 120
Iterating global reduction 14 with 6 rules applied. Total rules applied 1797 place count 47 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1803 place count 47 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 15 with 32 rules applied. Total rules applied 1835 place count 47 transition count 82
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1838 place count 44 transition count 73
Iterating global reduction 15 with 3 rules applied. Total rules applied 1841 place count 44 transition count 73
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1844 place count 41 transition count 70
Iterating global reduction 15 with 3 rules applied. Total rules applied 1847 place count 41 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1850 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1853 place count 41 transition count 64
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1856 place count 41 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1859 place count 38 transition count 61
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 1860 place count 38 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1861 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 35 edges and 36 vertex of which 24 / 36 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 1863 place count 21 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 18 with 31 rules applied. Total rules applied 1894 place count 21 transition count 29
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 1897 place count 18 transition count 26
Iterating global reduction 19 with 3 rules applied. Total rules applied 1900 place count 18 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1906 place count 15 transition count 23
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1913 place count 15 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1915 place count 15 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1917 place count 13 transition count 14
Applied a total of 1917 rules in 49 ms. Remains 13 /1514 variables (removed 1501) and now considering 14/1939 (removed 1925) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 13/1514 places, 14/1939 transitions.
RANDOM walk for 367 steps (31 resets) in 5 ms. (61 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Applied a total of 0 rules in 48 ms. Remains 1514 /1514 variables (removed 0) and now considering 1939/1939 (removed 0) transitions.
[2025-05-30 06:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:27:30] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 06:27:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:27:31] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2025-05-30 06:27:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 30033 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 "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30034 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 60416ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in LTL mode , in 1 iterations and 61722 ms. Remains : 1514/1514 places, 1939/1939 transitions.
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.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (315 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (99 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (89 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (91 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (92 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 286682 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 6
Probabilistic random walk after 286682 steps, saw 78530 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-05-30 06:28:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 824/826 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 677/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3452/3453 variables, and 1517 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1513/1514 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 824/826 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 677/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 6/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3432 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/3434 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3434 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/3436 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3436 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/3438 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3438 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/3440 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3440 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/3442 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3442 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 2/3444 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3444/3453 variables, and 1519 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1514 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10036ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1848 edges and 1514 vertex of which 693 / 1514 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1315 edges and 884 vertex of which 875 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 875 transition count 641
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 551 rules applied. Total rules applied 1051 place count 384 transition count 581
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1090 place count 345 transition count 581
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1090 place count 345 transition count 531
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1190 place count 295 transition count 531
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1201 place count 284 transition count 515
Iterating global reduction 3 with 11 rules applied. Total rules applied 1212 place count 284 transition count 515
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 1215 place count 284 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1218 place count 281 transition count 512
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1226 place count 273 transition count 502
Iterating global reduction 5 with 8 rules applied. Total rules applied 1234 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1240 place count 273 transition count 496
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1242 place count 271 transition count 484
Iterating global reduction 6 with 2 rules applied. Total rules applied 1244 place count 271 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1245 place count 271 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1246 place count 270 transition count 483
Performed 143 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 8 with 286 rules applied. Total rules applied 1532 place count 127 transition count 248
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 8 with 14 rules applied. Total rules applied 1546 place count 127 transition count 234
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1548 place count 126 transition count 233
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1551 place count 123 transition count 230
Iterating global reduction 10 with 3 rules applied. Total rules applied 1554 place count 123 transition count 230
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 10 with 22 rules applied. Total rules applied 1576 place count 112 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1589 place count 112 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1591 place count 111 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1593 place count 111 transition count 201
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 12 with 68 rules applied. Total rules applied 1661 place count 77 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 12 with 61 rules applied. Total rules applied 1722 place count 77 transition count 171
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1746 place count 53 transition count 147
Iterating global reduction 13 with 24 rules applied. Total rules applied 1770 place count 53 transition count 147
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 1785 place count 53 transition count 132
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1791 place count 47 transition count 120
Iterating global reduction 14 with 6 rules applied. Total rules applied 1797 place count 47 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1803 place count 47 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 15 with 32 rules applied. Total rules applied 1835 place count 47 transition count 82
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1838 place count 44 transition count 73
Iterating global reduction 15 with 3 rules applied. Total rules applied 1841 place count 44 transition count 73
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1844 place count 41 transition count 70
Iterating global reduction 15 with 3 rules applied. Total rules applied 1847 place count 41 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1850 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1853 place count 41 transition count 64
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1856 place count 41 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1859 place count 38 transition count 61
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 1860 place count 38 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1861 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 35 edges and 36 vertex of which 24 / 36 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 1863 place count 21 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 18 with 31 rules applied. Total rules applied 1894 place count 21 transition count 29
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 1897 place count 18 transition count 26
Iterating global reduction 19 with 3 rules applied. Total rules applied 1900 place count 18 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1906 place count 15 transition count 23
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1913 place count 15 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1915 place count 15 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1917 place count 13 transition count 14
Applied a total of 1917 rules in 46 ms. Remains 13 /1514 variables (removed 1501) and now considering 14/1939 (removed 1925) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 13/1514 places, 14/1939 transitions.
RANDOM walk for 349 steps (25 resets) in 5 ms. (58 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 769 reset in 134 ms.
Product exploration explored 100000 steps with 788 reset in 239 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 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 1848 edges and 1514 vertex of which 693 / 1514 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1378 edges and 884 vertex of which 875 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 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 875 transition count 1202
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 490 place count 875 transition count 1190
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 490 place count 875 transition count 1203
Deduced a syphon composed of 497 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 511 place count 875 transition count 1203
Discarding 284 places :
Symmetric choice reduction at 2 with 284 rule applications. Total rules 795 place count 591 transition count 909
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 2 with 284 rules applied. Total rules applied 1079 place count 591 transition count 909
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1091 place count 579 transition count 893
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1103 place count 579 transition count 893
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1109 place count 579 transition count 887
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1121 place count 567 transition count 875
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1133 place count 567 transition count 875
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 565 transition count 871
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 565 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1139 place count 563 transition count 867
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 563 transition count 867
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1145 place count 559 transition count 863
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1149 place count 559 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 557 transition count 859
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 557 transition count 859
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 555 transition count 855
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 555 transition count 855
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1161 place count 551 transition count 849
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1165 place count 551 transition count 849
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1169 place count 547 transition count 833
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1173 place count 547 transition count 833
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1174 place count 547 transition count 833
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1178 place count 543 transition count 829
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1182 place count 543 transition count 829
Performed 107 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 317 places in 1 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1289 place count 543 transition count 904
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 1326 place count 543 transition count 867
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 1427 place count 442 transition count 756
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 1528 place count 442 transition count 756
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1534 place count 436 transition count 747
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1540 place count 436 transition count 747
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1547 place count 436 transition count 747
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1551 place count 436 transition count 743
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1566 place count 421 transition count 724
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1581 place count 421 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1587 place count 421 transition count 718
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1591 place count 417 transition count 714
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1595 place count 417 transition count 714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1598 place count 417 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1604 place count 417 transition count 708
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1607 place count 414 transition count 705
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1610 place count 414 transition count 705
Performed 71 Post agglomeration using F-continuation condition with reduction of 107 identical transitions.
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1681 place count 414 transition count 1036
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 8 with 116 rules applied. Total rules applied 1797 place count 414 transition count 920
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1922 place count 289 transition count 587
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2047 place count 289 transition count 587
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 2057 place count 289 transition count 577
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 2082 place count 264 transition count 526
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 25 rules applied. Total rules applied 2107 place count 264 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2109 place count 264 transition count 554
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2113 place count 264 transition count 550
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2116 place count 261 transition count 531
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2119 place count 261 transition count 531
Deduced a syphon composed of 141 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 11 with 52 rules applied. Total rules applied 2171 place count 261 transition count 479
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2175 place count 257 transition count 475
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2179 place count 257 transition count 475
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2182 place count 257 transition count 535
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2185 place count 254 transition count 520
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2188 place count 254 transition count 520
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 2188 rules in 311 ms. Remains 254 /1514 variables (removed 1260) and now considering 520/1939 (removed 1419) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:28:47] [INFO ] Redundant transitions in 10 ms returned []
Running 519 sub problems to find dead transitions.
[2025-05-30 06:28:47] [INFO ] Flow matrix only has 463 transitions (discarded 57 similar events)
// Phase 1: matrix 463 rows 254 cols
[2025-05-30 06:28:47] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 06:28:47] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 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 TDEAD146 is UNSAT
Problem TDEAD147 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 TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 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 TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
At refinement iteration 1 (OVERLAPS) 462/715 variables, 253/253 constraints. Problems are: Problem set: 249 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/715 variables, 2/255 constraints. Problems are: Problem set: 249 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/715 variables, 0/255 constraints. Problems are: Problem set: 249 solved, 270 unsolved
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/716 variables, 1/256 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/716 variables, 0/256 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/717 variables, 1/257 constraints. Problems are: Problem set: 254 solved, 265 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 Real declared 717/717 variables, and 257 constraints, problems are : Problem set: 254 solved, 265 unsolved in 30013 ms.
Refiners :[State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 254 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: 254 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 459/575 variables, 116/116 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 2/118 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 265/383 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 0/383 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 141/716 variables, 138/521 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 0/521 constraints. Problems are: Problem set: 254 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/717 variables, 1/522 constraints. Problems are: Problem set: 254 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/717 variables, and 522 constraints, problems are : Problem set: 254 solved, 265 unsolved in 30013 ms.
Refiners :[State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 265/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 254 solved, 265 unsolved
Search for dead transitions found 254 dead transitions in 60110ms
Found 254 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 254 transitions
Dead transitions reduction (with SMT) removed 254 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 254/1514 places, 266/1939 transitions.
Graph (complete) has 409 edges and 254 vertex of which 117 are kept as prefixes of interest. Removing 137 places using SCC suffix rule.0 ms
Discarding 137 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 110 transition count 248
Applied a total of 8 rules in 6 ms. Remains 110 /254 variables (removed 144) and now considering 248/266 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1514 places, 248/1939 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60447 ms. Remains : 110/1514 places, 248/1939 transitions.
Built C files in :
/tmp/ltsmin8773379581297484882
[2025-05-30 06:29:47] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8773379581297484882
Running compilation step : cd /tmp/ltsmin8773379581297484882;'/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/ltsmin8773379581297484882;'/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/ltsmin8773379581297484882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Applied a total of 0 rules in 46 ms. Remains 1514 /1514 variables (removed 0) and now considering 1939/1939 (removed 0) transitions.
// Phase 1: matrix 1939 rows 1514 cols
[2025-05-30 06:29:50] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:29:50] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 06:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:29:51] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2025-05-30 06:29:51] [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 30030 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
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 30029 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 60419ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in LTL mode , in 1 iterations and 61608 ms. Remains : 1514/1514 places, 1939/1939 transitions.
Built C files in :
/tmp/ltsmin13797852889680521656
[2025-05-30 06:30:52] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13797852889680521656
Running compilation step : cd /tmp/ltsmin13797852889680521656;'/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/ltsmin13797852889680521656;'/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/ltsmin13797852889680521656;'/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 06:30:55] [INFO ] Flatten gal took : 53 ms
[2025-05-30 06:30:55] [INFO ] Flatten gal took : 61 ms
[2025-05-30 06:30:55] [INFO ] Time to serialize gal into /tmp/LTL7254692641435113792.gal : 13 ms
[2025-05-30 06:30:55] [INFO ] Time to serialize properties into /tmp/LTL2469506656511151077.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7254692641435113792.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6092296313187845648.hoa' '-atoms' '/tmp/LTL2469506656511151077.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...317
Loading property file /tmp/LTL2469506656511151077.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6092296313187845648.hoa
Detected timeout of ITS tools.
[2025-05-30 06:31:10] [INFO ] Flatten gal took : 39 ms
[2025-05-30 06:31:10] [INFO ] Flatten gal took : 40 ms
[2025-05-30 06:31:10] [INFO ] Time to serialize gal into /tmp/LTL970403359152490948.gal : 8 ms
[2025-05-30 06:31:10] [INFO ] Time to serialize properties into /tmp/LTL15953127137653176794.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL970403359152490948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15953127137653176794.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(X(X((G("(p1890==0)"))||(G("(p1012==1)")))))))
Formula 0 simplified : XXX(F!"(p1890==0)" & F!"(p1012==1)")
Detected timeout of ITS tools.
[2025-05-30 06:31:25] [INFO ] Flatten gal took : 36 ms
[2025-05-30 06:31:25] [INFO ] Applying decomposition
[2025-05-30 06:31:25] [INFO ] Flatten gal took : 35 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/graph14758116809126841797.txt' '-o' '/tmp/graph14758116809126841797.bin' '-w' '/tmp/graph14758116809126841797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14758116809126841797.bin' '-l' '-1' '-v' '-w' '/tmp/graph14758116809126841797.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:31:25] [INFO ] Decomposing Gal with order
[2025-05-30 06:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:31:26] [INFO ] Removed a total of 510 redundant transitions.
[2025-05-30 06:31:26] [INFO ] Flatten gal took : 119 ms
[2025-05-30 06:31:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 37 ms.
[2025-05-30 06:31:26] [INFO ] Time to serialize gal into /tmp/LTL11481832666715761892.gal : 19 ms
[2025-05-30 06:31:26] [INFO ] Time to serialize properties into /tmp/LTL18256932707344296416.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/LTL11481832666715761892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18256932707344296416.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(i25.i0.i5.u442.p1890==0)"))||(G("(i16.i0.i3.u237.p1012==1)")))))))
Formula 0 simplified : XXX(F!"(i25.i0.i5.u442.p1890==0)" & F!"(i16.i0.i3.u237.p1012==1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t208, t260, t322, t371, t442, t494, t655, t738, t769, t799, t848, t921, t1137, t1219, t1...2094
Computing Next relation with stutter on 89440 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
877 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,8.9371,321900,1,0,513135,9725,22776,1.29762e+06,664,84920,2391276
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-305-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-305-LTLFireability-11 finished in 323598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 2 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1530 transition count 1964
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1530 transition count 1964
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1530 transition count 1962
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 1521 transition count 1953
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 1521 transition count 1953
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 1521 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 1517 transition count 1945
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 1517 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1515 transition count 1942
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1515 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1513 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1513 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 1513 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 1511 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 1510 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 1510 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 1510 transition count 1933
Applied a total of 76 rules in 531 ms. Remains 1510 /1545 variables (removed 35) and now considering 1933/1979 (removed 46) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2025-05-30 06:31:37] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:31:37] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-05-30 06:31:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:31:38] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 06:31:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1545 places, 1933/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62110 ms. Remains : 1510/1545 places, 1933/1979 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-12
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-12 finished in 62284 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((p1&&G(p2)))&&p0))))'
Support contains 4 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1529 transition count 1963
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1529 transition count 1963
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1529 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 1520 transition count 1952
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 1520 transition count 1952
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 1520 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 1515 transition count 1943
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 1515 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 1515 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 1513 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 1511 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 1511 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 1511 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 1510 transition count 1934
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 1509 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 1508 transition count 1931
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 1508 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 1508 transition count 1930
Applied a total of 81 rules in 533 ms. Remains 1508 /1545 variables (removed 37) and now considering 1930/1979 (removed 49) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2025-05-30 06:32:39] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:32:39] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-30 06:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:32:40] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 06:32:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 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 1)
(s694 1)
(s695 1)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 1)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 1)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(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 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(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 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 1)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 1)
(s1115 0)
(s1116 0)
(s1117 1)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 1)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1545 places, 1930/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62141 ms. Remains : 1508/1545 places, 1930/1979 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-13
Entered a terminal (fully accepting) state of product in 50739 steps with 387 reset in 89 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-13 finished in 62388 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(p0)))'
Support contains 1 out of 1545 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1545/1545 places, 1979/1979 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1529 transition count 1963
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1529 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1529 transition count 1962
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 1519 transition count 1952
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 1519 transition count 1952
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1519 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 1514 transition count 1943
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 1514 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1514 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 1512 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 1512 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 1510 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 1510 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 1510 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 1509 transition count 1934
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 1509 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 1508 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 1507 transition count 1931
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 1507 transition count 1930
Applied a total of 82 rules in 526 ms. Remains 1507 /1545 variables (removed 38) and now considering 1930/1979 (removed 49) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2025-05-30 06:33:41] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:33:41] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-30 06:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:33:42] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 06:33:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 1)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 1)
(s173 1)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 1)
(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 1)
(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 1)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 1)
(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 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1545 places, 1930/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62013 ms. Remains : 1507/1545 places, 1930/1979 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-15 finished in 62116 ms.
All properties solved by simple procedures.
Total runtime 952250 ms.

BK_STOP 1748586883426

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-305"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-305, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028100244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-305.tgz
mv CloudReconfiguration-PT-305 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;