Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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-306-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748587107333

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-306
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 06:38:28] [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:38:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:38:28] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-05-30 06:38:28] [INFO ] Transformed 2584 places.
[2025-05-30 06:38:28] [INFO ] Transformed 3094 transitions.
[2025-05-30 06:38:28] [INFO ] Found NUPN structural information;
[2025-05-30 06:38:28] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudReconfiguration-PT-306-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-306-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-306-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-306-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 2068 transition count 2578
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 2068 transition count 2578
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1060 place count 2068 transition count 2550
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1299 place count 1829 transition count 2311
Iterating global reduction 1 with 239 rules applied. Total rules applied 1538 place count 1829 transition count 2311
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1627 place count 1740 transition count 2222
Iterating global reduction 1 with 89 rules applied. Total rules applied 1716 place count 1740 transition count 2222
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1734 place count 1740 transition count 2204
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1782 place count 1692 transition count 2156
Iterating global reduction 2 with 48 rules applied. Total rules applied 1830 place count 1692 transition count 2156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1839 place count 1692 transition count 2147
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1876 place count 1655 transition count 2106
Iterating global reduction 3 with 37 rules applied. Total rules applied 1913 place count 1655 transition count 2106
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1939 place count 1629 transition count 2080
Iterating global reduction 3 with 26 rules applied. Total rules applied 1965 place count 1629 transition count 2080
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1990 place count 1604 transition count 2055
Iterating global reduction 3 with 25 rules applied. Total rules applied 2015 place count 1604 transition count 2055
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2040 place count 1579 transition count 2030
Iterating global reduction 3 with 25 rules applied. Total rules applied 2065 place count 1579 transition count 2030
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2087 place count 1557 transition count 1994
Iterating global reduction 3 with 22 rules applied. Total rules applied 2109 place count 1557 transition count 1994
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2115 place count 1551 transition count 1985
Iterating global reduction 3 with 6 rules applied. Total rules applied 2121 place count 1551 transition count 1985
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2127 place count 1545 transition count 1978
Iterating global reduction 3 with 6 rules applied. Total rules applied 2133 place count 1545 transition count 1978
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2135 place count 1545 transition count 1976
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2136 place count 1544 transition count 1975
Iterating global reduction 4 with 1 rules applied. Total rules applied 2137 place count 1544 transition count 1975
Applied a total of 2137 rules in 1753 ms. Remains 1544 /2584 variables (removed 1040) and now considering 1975/3094 (removed 1119) transitions.
// Phase 1: matrix 1975 rows 1544 cols
[2025-05-30 06:38:30] [INFO ] Computed 4 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:38:31] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-05-30 06:38:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:38:32] [INFO ] Implicit Places using invariants and state equation in 937 ms returned [1533]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1411 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1543/2584 places, 1975/3094 transitions.
Applied a total of 0 rules in 62 ms. Remains 1543 /1543 variables (removed 0) and now considering 1975/1975 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3244 ms. Remains : 1543/2584 places, 1975/3094 transitions.
Support contains 34 out of 1543 places after structural reductions.
[2025-05-30 06:38:32] [INFO ] Flatten gal took : 123 ms
[2025-05-30 06:38:32] [INFO ] Flatten gal took : 73 ms
[2025-05-30 06:38:32] [INFO ] Input system was already deterministic with 1975 transitions.
RANDOM walk for 40000 steps (441 resets) in 1188 ms. (33 steps per ms) remains 26/33 properties
BEST_FIRST walk for 4003 steps (10 resets) in 49 ms. (80 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (15 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (10 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (15 resets) in 55 ms. (71 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (13 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (14 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (17 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (15 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (15 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (16 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
// Phase 1: matrix 1975 rows 1543 cols
[2025-05-30 06:38:33] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1493/1520 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 1957/3477 variables, 1520/1523 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3477 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 7/3484 variables, 5/1528 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3484 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 6/3490 variables, 3/1531 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3490 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 6/3496 variables, 3/1534 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 0.0)
(s2 0.0)
(s11 0.0)
(s12 (/ 3.0 4.0))
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 (/ 1.0 8.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 1.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 (/ 1.0 4.0))
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.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 (/ 5.0 4.0))
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.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 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 (/ 1.0 8.0))
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 (/ 3.0 4.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 (/ 1.0 8.0))
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 (/ 1.0 8.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 (/ 9.0 8.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 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 (/ 1.0 8.0))
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 (/ 17.0 4.0))
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 1.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 (/ 1.0 8.0))
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 1.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 (/ 1.0 8.0))
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 (/ 1.0 8.0))
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 1.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 1.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 1.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 1.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 (/ 1.0 8.0))
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 1.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 timeout
0.0)
(s1492 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3496/3518 variables, and 1534 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1531/1543 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1493/1520 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 1957/3477 variables, 1520/1523 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3477 variables, 26/1549 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3477/3518 variables, and 1549 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1520/1543 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10121ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 1543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Graph (trivial) has 1824 edges and 1543 vertex of which 634 / 1543 are part of one of the 59 SCC in 8 ms
Free SCC test removed 575 places
Drop transitions (Empty/Sink Transition effects.) removed 722 transitions
Reduce isomorphic transitions removed 722 transitions.
Graph (complete) has 1424 edges and 968 vertex of which 960 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 960 transition count 741
Reduce places removed 502 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 554 rules applied. Total rules applied 1064 place count 458 transition count 689
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 36 rules applied. Total rules applied 1100 place count 425 transition count 686
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1103 place count 424 transition count 684
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1107 place count 423 transition count 681
Reduce places removed 2 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 5 with 15 rules applied. Total rules applied 1122 place count 421 transition count 668
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1136 place count 408 transition count 667
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 1136 place count 408 transition count 616
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 1238 place count 357 transition count 616
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1249 place count 346 transition count 601
Iterating global reduction 7 with 11 rules applied. Total rules applied 1260 place count 346 transition count 601
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 1262 place count 346 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1264 place count 344 transition count 599
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1270 place count 338 transition count 593
Iterating global reduction 9 with 6 rules applied. Total rules applied 1276 place count 338 transition count 593
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1282 place count 338 transition count 587
Performed 166 Post agglomeration using F-continuation condition with reduction of 91 identical transitions.
Deduced a syphon composed of 166 places in 1 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 10 with 332 rules applied. Total rules applied 1614 place count 172 transition count 330
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 1641 place count 172 transition count 303
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1644 place count 169 transition count 300
Iterating global reduction 11 with 3 rules applied. Total rules applied 1647 place count 169 transition count 300
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1663 place count 161 transition count 290
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 1671 place count 161 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1673 place count 160 transition count 281
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1676 place count 160 transition count 278
Performed 35 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 13 with 70 rules applied. Total rules applied 1746 place count 125 transition count 314
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 13 with 30 rules applied. Total rules applied 1776 place count 125 transition count 284
Discarding 15 places :
Symmetric choice reduction at 14 with 15 rule applications. Total rules 1791 place count 110 transition count 254
Iterating global reduction 14 with 15 rules applied. Total rules applied 1806 place count 110 transition count 254
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 1814 place count 110 transition count 246
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1816 place count 108 transition count 242
Iterating global reduction 15 with 2 rules applied. Total rules applied 1818 place count 108 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1820 place count 108 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 16 with 13 rules applied. Total rules applied 1833 place count 108 transition count 227
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1835 place count 108 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1837 place count 106 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1839 place count 106 transition count 223
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 17 with 8 rules applied. Total rules applied 1847 place count 106 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1848 place count 106 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1849 place count 105 transition count 222
Applied a total of 1849 rules in 170 ms. Remains 105 /1543 variables (removed 1438) and now considering 222/1975 (removed 1753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 105/1543 places, 222/1975 transitions.
RANDOM walk for 40000 steps (4816 resets) in 387 ms. (103 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40004 steps (1156 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1146 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2025-05-30 06:38:43] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 105 cols
[2025-05-30 06:38:43] [INFO ] Computed 3 invariants in 2 ms
[2025-05-30 06:38:43] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 191/278 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/309 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/317 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/319 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/319 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 191/278 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/309 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:45] [INFO ] Deduced a trap composed of 28 places in 837 ms of which 5 ms to minimize.
Problem AtomicPropp8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:45] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Int declared 309/319 variables, and 111 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/105 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1174ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA CloudReconfiguration-PT-306-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2151 edges and 1543 vertex of which 1535 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.19 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(F(p0)))&&(X(X(p1))||G(p2))))'
Support contains 4 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1531 transition count 1962
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1531 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1531 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1522 transition count 1950
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1522 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1518 transition count 1946
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1518 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 1518 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 1516 transition count 1943
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 1516 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 1514 transition count 1941
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 1514 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1512 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1508 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1508 transition count 1932
Applied a total of 72 rules in 549 ms. Remains 1508 /1543 variables (removed 35) and now considering 1932/1975 (removed 43) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2025-05-30 06:38:46] [INFO ] Computed 3 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:38:46] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-30 06:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:38:47] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 06:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60545ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60551ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1543 places, 1932/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62276 ms. Remains : 1508/1543 places, 1932/1975 transitions.
Stuttering acceptance computed with spot in 462 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 415 ms.
Product exploration explored 100000 steps with 33333 reset in 352 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1508 vertex of which 1500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 24 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-00 finished in 63641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(p1)))))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1530 transition count 1961
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1530 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1530 transition count 1960
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 1520 transition count 1948
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 1520 transition count 1948
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 1515 transition count 1942
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 1515 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1515 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 1512 transition count 1938
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1510 transition count 1936
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1510 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1508 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1508 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1506 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1506 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 1504 transition count 1927
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 1504 transition count 1927
Applied a total of 80 rules in 544 ms. Remains 1504 /1543 variables (removed 39) and now considering 1927/1975 (removed 48) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2025-05-30 06:39:49] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:39:50] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-05-30 06:39:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:39:50] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2025-05-30 06:39:50] [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/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60435ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1543 places, 1927/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62086 ms. Remains : 1504/1543 places, 1927/1975 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-02
Product exploration explored 100000 steps with 1084 reset in 166 ms.
Product exploration explored 100000 steps with 1072 reset in 219 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.11 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (436 resets) in 188 ms. (211 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (145 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
[2025-05-30 06:40:52] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 802/803 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/803 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 678/1481 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3397 variables, 5/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3397 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3403 variables, 3/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3403 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3409 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3409 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3415 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3415 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3418 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3418 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3420 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3420 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3422 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3431/3431 variables, and 1507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1205 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 802/803 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/803 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 678/1481 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 1/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3390 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3397 variables, 5/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3397 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3403 variables, 3/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3403 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3409 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3409 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3415 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3415 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3418 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3431/3431 variables, and 1508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1995 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3217ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 176 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=88 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 1504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Applied a total of 0 rules in 70 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
[2025-05-30 06:40:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:40:56] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-30 06:40:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:40:57] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2025-05-30 06:40:57] [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/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 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 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60449ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Finished structural reductions in LTL mode , in 1 iterations and 61684 ms. Remains : 1504/1504 places, 1927/1927 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (429 resets) in 203 ms. (196 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (152 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2025-05-30 06:41:58] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 802/803 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/803 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 678/1481 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3397 variables, 5/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3397 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3403 variables, 3/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3403 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3409 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3409 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3415 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3415 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3418 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3418 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3420 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3420 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3422 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3431/3431 variables, and 1507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1182 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 802/803 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/803 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 678/1481 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 1/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3390 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3397 variables, 5/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3397 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3403 variables, 3/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3403 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3409 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3409 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3415 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3415 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3418 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3431/3431 variables, and 1508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2104 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3302ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 127 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 1091 reset in 129 ms.
Product exploration explored 100000 steps with 1117 reset in 166 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 1504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Graph (trivial) has 1836 edges and 1504 vertex of which 687 / 1504 are part of one of the 63 SCC in 6 ms
Free SCC test removed 624 places
Ensure Unique test removed 724 transitions
Reduce isomorphic transitions removed 724 transitions.
Graph (complete) has 1370 edges and 880 vertex of which 872 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 872 transition count 1198
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 487 place count 872 transition count 1186
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 487 place count 872 transition count 1198
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 509 place count 872 transition count 1198
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 790 place count 591 transition count 907
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 281 rules applied. Total rules applied 1071 place count 591 transition count 907
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1083 place count 579 transition count 891
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1095 place count 579 transition count 891
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1101 place count 579 transition count 885
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1113 place count 567 transition count 873
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1125 place count 567 transition count 873
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1127 place count 565 transition count 869
Deduced a syphon composed of 218 places in 7 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1129 place count 565 transition count 869
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 563 transition count 865
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 563 transition count 865
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1137 place count 559 transition count 861
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1141 place count 559 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1143 place count 557 transition count 857
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1145 place count 557 transition count 857
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 555 transition count 853
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 555 transition count 853
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1153 place count 551 transition count 847
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1157 place count 551 transition count 847
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1161 place count 547 transition count 831
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1165 place count 547 transition count 831
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1166 place count 547 transition count 831
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1170 place count 543 transition count 827
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1174 place count 543 transition count 827
Performed 106 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 4 with 106 rules applied. Total rules applied 1280 place count 543 transition count 902
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1319 place count 543 transition count 863
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1419 place count 443 transition count 753
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1519 place count 443 transition count 753
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1525 place count 437 transition count 744
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1531 place count 437 transition count 744
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1538 place count 437 transition count 744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1542 place count 437 transition count 740
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1557 place count 422 transition count 721
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1572 place count 422 transition count 721
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1578 place count 422 transition count 715
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1582 place count 418 transition count 711
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1586 place count 418 transition count 711
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1589 place count 418 transition count 711
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1595 place count 418 transition count 705
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1598 place count 415 transition count 702
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1601 place count 415 transition count 702
Performed 71 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1672 place count 415 transition count 1020
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 8 with 122 rules applied. Total rules applied 1794 place count 415 transition count 898
Discarding 126 places :
Symmetric choice reduction at 9 with 126 rule applications. Total rules 1920 place count 289 transition count 567
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 9 with 126 rules applied. Total rules applied 2046 place count 289 transition count 567
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2061 place count 289 transition count 552
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2088 place count 262 transition count 495
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2115 place count 262 transition count 495
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2118 place count 262 transition count 543
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2121 place count 259 transition count 516
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2124 place count 259 transition count 516
Deduced a syphon composed of 140 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 10 with 48 rules applied. Total rules applied 2172 place count 259 transition count 468
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2177 place count 254 transition count 463
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 5 rules applied. Total rules applied 2182 place count 254 transition count 463
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2185 place count 254 transition count 523
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2188 place count 251 transition count 508
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2191 place count 251 transition count 508
Deduced a syphon composed of 135 places in 0 ms
Applied a total of 2191 rules in 362 ms. Remains 251 /1504 variables (removed 1253) and now considering 508/1927 (removed 1419) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:42:03] [INFO ] Redundant transitions in 28 ms returned []
Running 507 sub problems to find dead transitions.
[2025-05-30 06:42:03] [INFO ] Flow matrix only has 451 transitions (discarded 57 similar events)
// Phase 1: matrix 451 rows 251 cols
[2025-05-30 06:42:03] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 06:42:03] [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/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
At refinement iteration 1 (OVERLAPS) 450/700 variables, 250/250 constraints. Problems are: Problem set: 241 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/700 variables, 2/252 constraints. Problems are: Problem set: 241 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/700 variables, 0/252 constraints. Problems are: Problem set: 241 solved, 266 unsolved
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/701 variables, 1/253 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 0/253 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 1/702 variables, 1/254 constraints. Problems are: Problem set: 251 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/702 variables, and 254 constraints, problems are : Problem set: 251 solved, 256 unsolved in 30017 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 251 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 447/562 variables, 115/115 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 2/117 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 256/373 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/373 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 139/701 variables, 136/509 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 0/509 constraints. Problems are: Problem set: 251 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/702 variables, 1/510 constraints. Problems are: Problem set: 251 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/702 variables, and 510 constraints, problems are : Problem set: 251 solved, 256 unsolved in 30017 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 256/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 251 solved, 256 unsolved
Search for dead transitions found 251 dead transitions in 60124ms
Found 251 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 251 transitions
Dead transitions reduction (with SMT) removed 251 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 251/1504 places, 257/1927 transitions.
Graph (complete) has 393 edges and 251 vertex of which 116 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.1 ms
Discarding 135 places :
Also discarding 0 output transitions
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 36 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 102 transition count 221
Applied a total of 15 rules in 9 ms. Remains 102 /251 variables (removed 149) and now considering 221/257 (removed 36) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/1504 places, 221/1927 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60531 ms. Remains : 102/1504 places, 221/1927 transitions.
Built C files in :
/tmp/ltsmin8912200460016685761
[2025-05-30 06:43:03] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8912200460016685761
Running compilation step : cd /tmp/ltsmin8912200460016685761;'/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/ltsmin8912200460016685761;'/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/ltsmin8912200460016685761;'/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 1504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Applied a total of 0 rules in 55 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2025-05-30 06:43:06] [INFO ] Computed 3 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:43:06] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-30 06:43:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:43:07] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2025-05-30 06:43:07] [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 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 127.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 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 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Finished structural reductions in LTL mode , in 1 iterations and 61622 ms. Remains : 1504/1504 places, 1927/1927 transitions.
Built C files in :
/tmp/ltsmin3001877897968193107
[2025-05-30 06:44:08] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3001877897968193107
Running compilation step : cd /tmp/ltsmin3001877897968193107;'/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/ltsmin3001877897968193107;'/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/ltsmin3001877897968193107;'/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:44:11] [INFO ] Flatten gal took : 53 ms
[2025-05-30 06:44:11] [INFO ] Flatten gal took : 48 ms
[2025-05-30 06:44:11] [INFO ] Time to serialize gal into /tmp/LTL989735923413846067.gal : 12 ms
[2025-05-30 06:44:11] [INFO ] Time to serialize properties into /tmp/LTL1711669521832428142.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/LTL989735923413846067.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5835466710378084788.hoa' '-atoms' '/tmp/LTL1711669521832428142.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...316
Loading property file /tmp/LTL1711669521832428142.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5835466710378084788.hoa
Detected timeout of ITS tools.
[2025-05-30 06:44:26] [INFO ] Flatten gal took : 46 ms
[2025-05-30 06:44:26] [INFO ] Flatten gal took : 43 ms
[2025-05-30 06:44:26] [INFO ] Time to serialize gal into /tmp/LTL10347649559135966128.gal : 10 ms
[2025-05-30 06:44:26] [INFO ] Time to serialize properties into /tmp/LTL7326802234328700254.ltl : 5 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/LTL10347649559135966128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7326802234328700254.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p812==0)")||(X(X(X(X("(p577==0)"))))))))
Formula 0 simplified : F(!"(p812==0)" & XXXX!"(p577==0)")
Detected timeout of ITS tools.
[2025-05-30 06:44:41] [INFO ] Flatten gal took : 39 ms
[2025-05-30 06:44:41] [INFO ] Applying decomposition
[2025-05-30 06:44:41] [INFO ] Flatten gal took : 38 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/graph5853001916387891311.txt' '-o' '/tmp/graph5853001916387891311.bin' '-w' '/tmp/graph5853001916387891311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5853001916387891311.bin' '-l' '-1' '-v' '-w' '/tmp/graph5853001916387891311.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:44:41] [INFO ] Decomposing Gal with order
[2025-05-30 06:44:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:44:42] [INFO ] Removed a total of 512 redundant transitions.
[2025-05-30 06:44:42] [INFO ] Flatten gal took : 126 ms
[2025-05-30 06:44:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 33 ms.
[2025-05-30 06:44:42] [INFO ] Time to serialize gal into /tmp/LTL16932246017077566754.gal : 21 ms
[2025-05-30 06:44:42] [INFO ] Time to serialize properties into /tmp/LTL6004229191874714361.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16932246017077566754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6004229191874714361.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i13.u186.p812==0)")||(X(X(X(X("(i0.u106.p577==0)"))))))))
Formula 0 simplified : F(!"(i13.u186.p812==0)" & XXXX!"(i0.u106.p577==0)")
Reverse transition relation is NOT exact ! Due to transitions t210, t264, t295, t373, t694, t746, t808, t857, t979, t1146, t1175, t1227, t1258, t1336, t140...2001
Computing Next relation with stutter on 32080 deadlock states
43 unique states visited
43 strongly connected components in search stack
44 transitions explored
43 items max in DFS search stack
374 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,3.91943,147828,1,0,266550,3917,21321,415114,523,16150,961688
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-306-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-306-LTLFireability-02 finished in 297669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(p2)))'
Support contains 4 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1532 transition count 1963
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1532 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 23 place count 1532 transition count 1962
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 1523 transition count 1952
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 1523 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 1519 transition count 1947
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1516 transition count 1944
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1516 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 1514 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 1514 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1512 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1512 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1510 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1510 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1508 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1508 transition count 1933
Applied a total of 71 rules in 533 ms. Remains 1508 /1543 variables (removed 35) and now considering 1933/1975 (removed 42) transitions.
// Phase 1: matrix 1933 rows 1508 cols
[2025-05-30 06:44:47] [INFO ] Computed 3 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:44:47] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-30 06:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:44:48] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 06:44:48] [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/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3441 variables, and 3 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 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/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3441 variables, and 3 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1543 places, 1933/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62100 ms. Remains : 1508/1543 places, 1933/1975 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-04
Stuttering criterion allowed to conclude after 169 steps with 2 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-04 finished in 62330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p1)||F((G(F(p2))||(F(p2)&&X((p3 U (p4||G(p3))))))))))'
Support contains 4 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1531 transition count 1963
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1531 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 25 place count 1531 transition count 1962
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1522 transition count 1952
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1522 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1518 transition count 1947
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1518 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 1518 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 1515 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 1515 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 1513 transition count 1941
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 1513 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 1511 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1511 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1509 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1509 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1507 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1507 transition count 1932
Applied a total of 74 rules in 529 ms. Remains 1507 /1543 variables (removed 36) and now considering 1932/1975 (removed 43) transitions.
// Phase 1: matrix 1932 rows 1507 cols
[2025-05-30 06:45:49] [INFO ] Computed 3 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:45:49] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-30 06:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:45:50] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 06:45:50] [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 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 127.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 0.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 timeout
1.0)
(s1086 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3439 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3439 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1543 places, 1932/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62141 ms. Remains : 1507/1543 places, 1932/1975 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p4) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 379 ms.
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p4 p3), (X p2), (X p3), (X p4), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) (NOT p1) p4) (AND (NOT p2) (NOT p1) p3)))), (X p1), (X (X p3)), (X (X p4)), (X (X p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 11 ms. Reduced automaton from 6 states, 10 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-06 finished in 63242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1 U G(p2)))&&(G(p3) U !p1)))'
Support contains 4 out of 1543 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Graph (trivial) has 1878 edges and 1543 vertex of which 669 / 1543 are part of one of the 61 SCC in 2 ms
Free SCC test removed 608 places
Ensure Unique test removed 704 transitions
Reduce isomorphic transitions removed 704 transitions.
Graph (complete) has 1441 edges and 935 vertex of which 927 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 926 transition count 761
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 532 rules applied. Total rules applied 1038 place count 422 transition count 733
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 1054 place count 408 transition count 731
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1057 place count 407 transition count 729
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1061 place count 406 transition count 726
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1064 place count 404 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1065 place count 403 transition count 725
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 49 Pre rules applied. Total rules applied 1065 place count 403 transition count 676
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1163 place count 354 transition count 676
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1181 place count 336 transition count 648
Iterating global reduction 7 with 18 rules applied. Total rules applied 1199 place count 336 transition count 648
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 1201 place count 336 transition count 646
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1203 place count 334 transition count 646
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1215 place count 322 transition count 629
Iterating global reduction 9 with 12 rules applied. Total rules applied 1227 place count 322 transition count 629
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 9 with 8 rules applied. Total rules applied 1235 place count 322 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1236 place count 321 transition count 621
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1238 place count 319 transition count 617
Iterating global reduction 11 with 2 rules applied. Total rules applied 1240 place count 319 transition count 617
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1242 place count 317 transition count 613
Iterating global reduction 11 with 2 rules applied. Total rules applied 1244 place count 317 transition count 613
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1245 place count 316 transition count 611
Iterating global reduction 11 with 1 rules applied. Total rules applied 1246 place count 316 transition count 611
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1247 place count 315 transition count 609
Iterating global reduction 11 with 1 rules applied. Total rules applied 1248 place count 315 transition count 609
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1249 place count 314 transition count 607
Iterating global reduction 11 with 1 rules applied. Total rules applied 1250 place count 314 transition count 607
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1251 place count 313 transition count 600
Iterating global reduction 11 with 1 rules applied. Total rules applied 1252 place count 313 transition count 600
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 11 with 1 rules applied. Total rules applied 1253 place count 313 transition count 599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1254 place count 312 transition count 599
Performed 147 Post agglomeration using F-continuation condition with reduction of 89 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 13 with 294 rules applied. Total rules applied 1548 place count 165 transition count 363
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1559 place count 165 transition count 352
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1563 place count 161 transition count 347
Iterating global reduction 14 with 4 rules applied. Total rules applied 1567 place count 161 transition count 347
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 14 with 24 rules applied. Total rules applied 1591 place count 149 transition count 333
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1601 place count 149 transition count 323
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1602 place count 148 transition count 321
Iterating global reduction 15 with 1 rules applied. Total rules applied 1603 place count 148 transition count 321
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 15 with 36 rules applied. Total rules applied 1639 place count 130 transition count 363
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 15 with 26 rules applied. Total rules applied 1665 place count 130 transition count 337
Discarding 9 places :
Symmetric choice reduction at 16 with 9 rule applications. Total rules 1674 place count 121 transition count 319
Iterating global reduction 16 with 9 rules applied. Total rules applied 1683 place count 121 transition count 319
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1689 place count 121 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 17 with 39 rules applied. Total rules applied 1728 place count 121 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1729 place count 120 transition count 273
Applied a total of 1729 rules in 94 ms. Remains 120 /1543 variables (removed 1423) and now considering 273/1975 (removed 1702) transitions.
[2025-05-30 06:46:52] [INFO ] Flow matrix only has 218 transitions (discarded 55 similar events)
// Phase 1: matrix 218 rows 120 cols
[2025-05-30 06:46:52] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:46:52] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-30 06:46:52] [INFO ] Flow matrix only has 218 transitions (discarded 55 similar events)
[2025-05-30 06:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:46:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 06:46:52] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [11, 44, 79]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 381 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1543 places, 273/1975 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 270
Applied a total of 4 rules in 7 ms. Remains 114 /117 variables (removed 3) and now considering 270/273 (removed 3) transitions.
[2025-05-30 06:46:52] [INFO ] Flow matrix only has 215 transitions (discarded 55 similar events)
// Phase 1: matrix 215 rows 114 cols
[2025-05-30 06:46:52] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:46:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 06:46:52] [INFO ] Flow matrix only has 215 transitions (discarded 55 similar events)
[2025-05-30 06:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:46:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 06:46:53] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1543 places, 270/1975 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 720 ms. Remains : 114/1543 places, 270/1975 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) p1), true, (NOT p0), (NOT p2), (NOT p3), p1, (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-07 finished in 1001 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||F(G(p1))))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1531 transition count 1962
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1531 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1531 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1522 transition count 1950
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1522 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1517 transition count 1944
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1517 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1517 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 1514 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1512 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1508 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1508 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1506 transition count 1929
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1506 transition count 1929
Applied a total of 76 rules in 515 ms. Remains 1506 /1543 variables (removed 37) and now considering 1929/1975 (removed 46) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2025-05-30 06:46:53] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:46:54] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-30 06:46:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:46:55] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 06:46:55] [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/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1543 places, 1929/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62092 ms. Remains : 1506/1543 places, 1929/1975 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-08
Product exploration explored 100000 steps with 1060 reset in 160 ms.
Stack based approach found an accepted trace after 85491 steps with 942 reset with depth 71 and stack size 71 in 155 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-08 finished in 62602 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))&&F(p1)))'
Support contains 3 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1531 transition count 1962
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1531 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1531 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1522 transition count 1950
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1522 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1517 transition count 1944
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1517 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1517 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 1514 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1512 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1508 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1507 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1507 transition count 1931
Applied a total of 74 rules in 522 ms. Remains 1507 /1543 variables (removed 36) and now considering 1931/1975 (removed 44) transitions.
// Phase 1: matrix 1931 rows 1507 cols
[2025-05-30 06:47:56] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:56] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-05-30 06:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:47:57] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2025-05-30 06:47:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 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/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
(s483 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 127)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 0)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1timeout
)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30058 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60442ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1543 places, 1931/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62136 ms. Remains : 1507/1543 places, 1931/1975 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-09
Product exploration explored 100000 steps with 1115 reset in 143 ms.
Product exploration explored 100000 steps with 1078 reset in 143 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (446 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (82 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 485600 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485600 steps, saw 110106 distinct states, run finished after 3007 ms. (steps per millisecond=161 ) properties seen :0
[2025-05-30 06:49:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1081/1083 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3397 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3397 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3404 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3404 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3410 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3410 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3416 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3416 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3422 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3422 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3425 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3437 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3438/3438 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1081/1083 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3397 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3397 variables, 1/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3397 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3404 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3404 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3410 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3410 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3416 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3416 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3422 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3425 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3438/3438 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3052 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4303ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 9 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-09 finished in 70310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1531 transition count 1962
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1531 transition count 1962
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1521 transition count 1950
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1521 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1516 transition count 1944
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1516 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1516 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1513 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1513 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1511 transition count 1938
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1511 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1509 transition count 1935
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1509 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1507 transition count 1932
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1507 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1505 transition count 1929
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1505 transition count 1929
Applied a total of 77 rules in 511 ms. Remains 1505 /1543 variables (removed 38) and now considering 1929/1975 (removed 46) transitions.
// Phase 1: matrix 1929 rows 1505 cols
[2025-05-30 06:49:06] [INFO ] Computed 3 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:49:07] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-30 06:49:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:49:08] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 06:49:08] [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/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1543 places, 1929/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62140 ms. Remains : 1505/1543 places, 1929/1975 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-10
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-10 finished in 62353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1))))'
Support contains 3 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1532 transition count 1963
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1532 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 23 place count 1532 transition count 1962
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 1524 transition count 1952
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 1524 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1521 transition count 1948
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1521 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1521 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1520 transition count 1946
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1520 transition count 1946
Applied a total of 48 rules in 291 ms. Remains 1520 /1543 variables (removed 23) and now considering 1946/1975 (removed 29) transitions.
// Phase 1: matrix 1946 rows 1520 cols
[2025-05-30 06:50:09] [INFO ] Computed 3 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:50:09] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 06:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:50:10] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 1945 sub problems to find dead transitions.
[2025-05-30 06:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/3466 variables, and 3 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 1945/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1945 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/3466 variables, and 3 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 0/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 1945 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Starting structural reductions in LTL mode, iteration 1 : 1520/1543 places, 1946/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61823 ms. Remains : 1520/1543 places, 1946/1975 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-11
Product exploration explored 100000 steps with 1106 reset in 123 ms.
Product exploration explored 100000 steps with 1079 reset in 129 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2120 edges and 1520 vertex of which 1512 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 95 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (428 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (151 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 497051 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 1
Probabilistic random walk after 497051 steps, saw 112730 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2025-05-30 06:51:14] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 810/811 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/811 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 686/1497 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3425 variables, 1497/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3432 variables, 5/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3432 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3438 variables, 3/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3444 variables, 3/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3444 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3450 variables, 3/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3450 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3453 variables, 2/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3453 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3455 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3455 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3457 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3457 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3459 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3459 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3461 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3461 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3463 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3463 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3465 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3465 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3466 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3466 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3466 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3466/3466 variables, and 1523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1304 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1520/1520 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 810/811 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/811 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 686/1497 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3425 variables, 1497/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3425 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3432 variables, 5/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3432 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3438 variables, 3/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3444 variables, 3/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3444 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3450 variables, 3/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3453 variables, 2/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3453 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3455 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3455 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3457 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3457 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3459 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3459 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3461 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3463 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3463 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3465 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3465 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3466 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3466/3466 variables, and 1524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2097 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1520/1520 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3416ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3971 steps, including 60 resets, run visited all 1 properties in 14 ms. (steps per millisecond=283 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1520 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Applied a total of 0 rules in 59 ms. Remains 1520 /1520 variables (removed 0) and now considering 1946/1946 (removed 0) transitions.
[2025-05-30 06:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:51:18] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-05-30 06:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:51:19] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
Running 1945 sub problems to find dead transitions.
[2025-05-30 06:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/3466 variables, and 3 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 1945/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1945 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/3466 variables, and 3 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 0/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60406ms problems are : Problem set: 0 solved, 1945 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in LTL mode , in 1 iterations and 61565 ms. Remains : 1520/1520 places, 1946/1946 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2120 edges and 1520 vertex of which 1512 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (434 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (140 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 497897 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 1
Probabilistic random walk after 497897 steps, saw 112859 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2025-05-30 06:52:22] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 810/811 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/811 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 686/1497 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3425 variables, 1497/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3432 variables, 5/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3432 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3438 variables, 3/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3444 variables, 3/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3444 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3450 variables, 3/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3450 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3453 variables, 2/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3453 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3455 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3455 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3457 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3457 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3459 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3459 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3461 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3461 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3463 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3463 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3465 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3465 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3466 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3466 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3466 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3466/3466 variables, and 1523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1281 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1520/1520 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 810/811 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/811 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 686/1497 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3425 variables, 1497/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3425 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3432 variables, 5/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3432 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3438 variables, 3/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3444 variables, 3/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3444 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3450 variables, 3/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3453 variables, 2/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3453 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3455 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3455 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3457 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3457 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3459 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3459 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3461 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3463 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3463 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3465 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3465 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3466 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3466/3466 variables, and 1524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2081 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1520/1520 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3379ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6943 steps, including 108 resets, run visited all 1 properties in 21 ms. (steps per millisecond=330 )
Parikh walk visited 1 properties in 21 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1067 reset in 120 ms.
Product exploration explored 100000 steps with 1072 reset in 129 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Graph (trivial) has 1857 edges and 1520 vertex of which 693 / 1520 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1382 edges and 890 vertex of which 882 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 484 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 484 rules applied. Total rules applied 486 place count 882 transition count 1209
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 498 place count 882 transition count 1197
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 498 place count 882 transition count 1208
Deduced a syphon composed of 504 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 518 place count 882 transition count 1208
Discarding 288 places :
Symmetric choice reduction at 2 with 288 rule applications. Total rules 806 place count 594 transition count 911
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 2 with 288 rules applied. Total rules applied 1094 place count 594 transition count 911
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 2 rules applied. Total rules applied 1096 place count 594 transition count 910
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1110 place count 580 transition count 892
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 3 with 14 rules applied. Total rules applied 1124 place count 580 transition count 892
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1130 place count 580 transition count 886
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1142 place count 568 transition count 874
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 1154 place count 568 transition count 874
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1156 place count 566 transition count 870
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 1158 place count 566 transition count 870
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1160 place count 564 transition count 866
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 1162 place count 564 transition count 866
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1166 place count 560 transition count 862
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1170 place count 560 transition count 862
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1172 place count 558 transition count 858
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 1174 place count 558 transition count 858
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1176 place count 556 transition count 854
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 1178 place count 556 transition count 854
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1182 place count 552 transition count 848
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1186 place count 552 transition count 848
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1190 place count 548 transition count 832
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1194 place count 548 transition count 832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 4 with 1 rules applied. Total rules applied 1195 place count 548 transition count 832
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1199 place count 544 transition count 828
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 1203 place count 544 transition count 828
Performed 110 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 322 places in 0 ms
Iterating global reduction 5 with 110 rules applied. Total rules applied 1313 place count 544 transition count 907
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 1355 place count 544 transition count 865
Discarding 104 places :
Symmetric choice reduction at 6 with 104 rule applications. Total rules 1459 place count 440 transition count 750
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 6 with 104 rules applied. Total rules applied 1563 place count 440 transition count 750
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1565 place count 440 transition count 748
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1571 place count 434 transition count 740
Deduced a syphon composed of 222 places in 1 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 1577 place count 434 transition count 740
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 7 with 7 rules applied. Total rules applied 1584 place count 434 transition count 740
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1590 place count 434 transition count 734
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1606 place count 418 transition count 714
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 1622 place count 418 transition count 714
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1629 place count 418 transition count 707
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1633 place count 414 transition count 703
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 1637 place count 414 transition count 703
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1639 place count 414 transition count 703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1643 place count 414 transition count 699
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1645 place count 412 transition count 697
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 1647 place count 412 transition count 697
Performed 70 Post agglomeration using F-continuation condition with reduction of 115 identical transitions.
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 10 with 70 rules applied. Total rules applied 1717 place count 412 transition count 1011
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 10 with 115 rules applied. Total rules applied 1832 place count 412 transition count 896
Discarding 126 places :
Symmetric choice reduction at 11 with 126 rule applications. Total rules 1958 place count 286 transition count 563
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 11 with 126 rules applied. Total rules applied 2084 place count 286 transition count 563
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 2099 place count 286 transition count 548
Discarding 25 places :
Symmetric choice reduction at 12 with 25 rule applications. Total rules 2124 place count 261 transition count 498
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 12 with 25 rules applied. Total rules applied 2149 place count 261 transition count 498
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 12 with 3 rules applied. Total rules applied 2152 place count 261 transition count 548
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2155 place count 258 transition count 520
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 12 with 3 rules applied. Total rules applied 2158 place count 258 transition count 520
Deduced a syphon composed of 141 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 12 with 45 rules applied. Total rules applied 2203 place count 258 transition count 475
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2207 place count 254 transition count 471
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 12 with 4 rules applied. Total rules applied 2211 place count 254 transition count 471
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 12 with 3 rules applied. Total rules applied 2214 place count 254 transition count 531
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2217 place count 251 transition count 516
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 12 with 3 rules applied. Total rules applied 2220 place count 251 transition count 516
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 2220 rules in 215 ms. Remains 251 /1520 variables (removed 1269) and now considering 516/1946 (removed 1430) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:52:27] [INFO ] Redundant transitions in 9 ms returned []
Running 515 sub problems to find dead transitions.
[2025-05-30 06:52:27] [INFO ] Flow matrix only has 459 transitions (discarded 57 similar events)
// Phase 1: matrix 459 rows 251 cols
[2025-05-30 06:52:27] [INFO ] Computed 0 invariants in 4 ms
[2025-05-30 06:52:27] [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/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 515 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 TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 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 TDEAD220 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 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 TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
At refinement iteration 1 (OVERLAPS) 458/708 variables, 250/250 constraints. Problems are: Problem set: 252 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/708 variables, 2/252 constraints. Problems are: Problem set: 252 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/708 variables, 0/252 constraints. Problems are: Problem set: 252 solved, 263 unsolved
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/709 variables, 1/253 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 0/253 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 1/710 variables, 1/254 constraints. Problems are: Problem set: 262 solved, 253 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 710/710 variables, and 254 constraints, problems are : Problem set: 262 solved, 253 unsolved in 30019 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 262 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 455/568 variables, 113/113 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 2/115 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 253/368 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 0/368 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 141/709 variables, 138/506 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 0/506 constraints. Problems are: Problem set: 262 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 1/710 variables, 1/507 constraints. Problems are: Problem set: 262 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/710 variables, and 507 constraints, problems are : Problem set: 262 solved, 253 unsolved in 30018 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 253/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 262 solved, 253 unsolved
Search for dead transitions found 262 dead transitions in 60163ms
Found 262 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 262 transitions
Dead transitions reduction (with SMT) removed 262 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 251/1520 places, 254/1946 transitions.
Graph (complete) has 391 edges and 251 vertex of which 114 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 14 places in 0 ms
Reduce places removed 14 places and 36 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 100 transition count 218
Applied a total of 15 rules in 7 ms. Remains 100 /251 variables (removed 151) and now considering 218/254 (removed 36) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/1520 places, 218/1946 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60399 ms. Remains : 100/1520 places, 218/1946 transitions.
Built C files in :
/tmp/ltsmin11859736423004161515
[2025-05-30 06:53:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11859736423004161515
Running compilation step : cd /tmp/ltsmin11859736423004161515;'/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/ltsmin11859736423004161515;'/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/ltsmin11859736423004161515;'/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 1 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1519 transition count 1945
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1519 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1518 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1518 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1517 transition count 1943
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1517 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1516 transition count 1942
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1516 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1515 transition count 1941
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1515 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1514 transition count 1940
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1514 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1513 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1513 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1512 transition count 1937
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1512 transition count 1937
Applied a total of 16 rules in 495 ms. Remains 1512 /1520 variables (removed 8) and now considering 1937/1946 (removed 9) transitions.
// Phase 1: matrix 1937 rows 1512 cols
[2025-05-30 06:53:31] [INFO ] Computed 3 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:53:31] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 06:53:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:53:32] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2025-05-30 06:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3449 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3449 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1520 places, 1937/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62003 ms. Remains : 1512/1520 places, 1937/1946 transitions.
Built C files in :
/tmp/ltsmin4984859995758365508
[2025-05-30 06:54:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4984859995758365508
Running compilation step : cd /tmp/ltsmin4984859995758365508;'/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/ltsmin4984859995758365508;'/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/ltsmin4984859995758365508;'/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:54:35] [INFO ] Flatten gal took : 34 ms
[2025-05-30 06:54:35] [INFO ] Flatten gal took : 36 ms
[2025-05-30 06:54:35] [INFO ] Time to serialize gal into /tmp/LTL14544025105752498270.gal : 5 ms
[2025-05-30 06:54:35] [INFO ] Time to serialize properties into /tmp/LTL813824837653931676.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/LTL14544025105752498270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14816540797832622355.hoa' '-atoms' '/tmp/LTL813824837653931676.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL813824837653931676.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14816540797832622355.hoa
Detected timeout of ITS tools.
[2025-05-30 06:54:50] [INFO ] Flatten gal took : 29 ms
[2025-05-30 06:54:51] [INFO ] Flatten gal took : 28 ms
[2025-05-30 06:54:51] [INFO ] Time to serialize gal into /tmp/LTL727825705874571470.gal : 6 ms
[2025-05-30 06:54:51] [INFO ] Time to serialize properties into /tmp/LTL8858741752144265763.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/LTL727825705874571470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8858741752144265763.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(p1770==0)")))||(G("((p572==1)&&(p1145==1))")))))
Formula 0 simplified : X(XF!"(p1770==0)" & F!"((p572==1)&&(p1145==1))")
Detected timeout of ITS tools.
[2025-05-30 06:55:06] [INFO ] Flatten gal took : 28 ms
[2025-05-30 06:55:06] [INFO ] Applying decomposition
[2025-05-30 06:55:06] [INFO ] Flatten gal took : 27 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/graph8457426860711955965.txt' '-o' '/tmp/graph8457426860711955965.bin' '-w' '/tmp/graph8457426860711955965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8457426860711955965.bin' '-l' '-1' '-v' '-w' '/tmp/graph8457426860711955965.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:55:06] [INFO ] Decomposing Gal with order
[2025-05-30 06:55:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:55:06] [INFO ] Removed a total of 503 redundant transitions.
[2025-05-30 06:55:06] [INFO ] Flatten gal took : 64 ms
[2025-05-30 06:55:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 24 ms.
[2025-05-30 06:55:06] [INFO ] Time to serialize gal into /tmp/LTL9852136455000468834.gal : 20 ms
[2025-05-30 06:55:06] [INFO ] Time to serialize properties into /tmp/LTL16815070413277386478.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/LTL9852136455000468834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16815070413277386478.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(i18.u424.p1770==0)")))||(G("((i7.i0.i0.u41.p572==1)&&(i15.i1.i5.u252.p1145==1))")))))
Formula 0 simplified : X(XF!"(i18.u424.p1770==0)" & F!"((i7.i0.i0.u41.p572==1)&&(i15.i1.i5.u252.p1145==1))")
Reverse transition relation is NOT exact ! Due to transitions t210, t264, t295, t373, t494, t665, t694, t746, t779, t808, t857, t979, t1175, t1227, t1258, ...1904
Computing Next relation with stutter on 33684 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
341 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,3.6107,150216,1,0,258583,3591,21643,404417,572,14990,1165778
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-306-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-306-LTLFireability-11 finished in 302062 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)))'
Support contains 1 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1530 transition count 1961
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1530 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1530 transition count 1960
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 1520 transition count 1948
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 1520 transition count 1948
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 1515 transition count 1942
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 1515 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1515 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 1512 transition count 1938
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1510 transition count 1936
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1510 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1508 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1508 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1506 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1506 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 1504 transition count 1927
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 1504 transition count 1927
Applied a total of 80 rules in 503 ms. Remains 1504 /1543 variables (removed 39) and now considering 1927/1975 (removed 48) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2025-05-30 06:55:11] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:11] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-30 06:55:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:12] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2025-05-30 06:55:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1543 places, 1927/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61976 ms. Remains : 1504/1543 places, 1927/1975 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-13
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-13 finished in 62077 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)||X((p1 U (p2 U p3))))))'
Support contains 4 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1975/1975 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1531 transition count 1962
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1531 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1531 transition count 1961
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1522 transition count 1950
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1522 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1517 transition count 1944
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1517 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1517 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 1514 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1512 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1508 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1508 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1506 transition count 1929
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1506 transition count 1929
Applied a total of 76 rules in 510 ms. Remains 1506 /1543 variables (removed 37) and now considering 1929/1975 (removed 46) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2025-05-30 06:56:13] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:56:13] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-05-30 06:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:56:14] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 06:56: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/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1543 places, 1929/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61971 ms. Remains : 1506/1543 places, 1929/1975 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-15
Product exploration explored 100000 steps with 1085 reset in 174 ms.
Product exploration explored 100000 steps with 1093 reset in 179 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2102 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 78 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (433 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (146 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 461205 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 461205 steps, saw 105765 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2025-05-30 06:57:18] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1911/3394 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3394 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/3401 variables, 5/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3401 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/3407 variables, 3/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3407 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3413 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3413 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3419 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/3422 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3435/3435 variables, and 1509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1274 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1911/3394 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3394 variables, 1/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3394 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/3401 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3401 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/3407 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3407 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3413 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3413 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3419 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/3422 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3435/3435 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2183 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3468ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 193 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=193 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 15 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-15 finished in 69461 ms.
All properties solved by simple procedures.
Total runtime 1133776 ms.

BK_STOP 1748588242376

--------------------
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-306"
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-306, 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-174854028100252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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