Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624188900260.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is CloudReconfiguration-PT-319, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188900260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 19:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 19:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 19:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 661K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717186174717

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-319
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:09:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:09:36] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-31 20:09:36] [INFO ] Transformed 2587 places.
[2024-05-31 20:09:36] [INFO ] Transformed 3099 transitions.
[2024-05-31 20:09:36] [INFO ] Found NUPN structural information;
[2024-05-31 20:09:36] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudReconfiguration-PT-319-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2068 transition count 2580
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2068 transition count 2580
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1067 place count 2068 transition count 2551
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1304 place count 1831 transition count 2314
Iterating global reduction 1 with 237 rules applied. Total rules applied 1541 place count 1831 transition count 2314
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1630 place count 1742 transition count 2225
Iterating global reduction 1 with 89 rules applied. Total rules applied 1719 place count 1742 transition count 2225
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1737 place count 1742 transition count 2207
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1785 place count 1694 transition count 2159
Iterating global reduction 2 with 48 rules applied. Total rules applied 1833 place count 1694 transition count 2159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1842 place count 1694 transition count 2150
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1880 place count 1656 transition count 2107
Iterating global reduction 3 with 38 rules applied. Total rules applied 1918 place count 1656 transition count 2107
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1945 place count 1629 transition count 2080
Iterating global reduction 3 with 27 rules applied. Total rules applied 1972 place count 1629 transition count 2080
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1997 place count 1604 transition count 2055
Iterating global reduction 3 with 25 rules applied. Total rules applied 2022 place count 1604 transition count 2055
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2046 place count 1580 transition count 2031
Iterating global reduction 3 with 24 rules applied. Total rules applied 2070 place count 1580 transition count 2031
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2091 place count 1559 transition count 1995
Iterating global reduction 3 with 21 rules applied. Total rules applied 2112 place count 1559 transition count 1995
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2118 place count 1553 transition count 1985
Iterating global reduction 3 with 6 rules applied. Total rules applied 2124 place count 1553 transition count 1985
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2129 place count 1548 transition count 1980
Iterating global reduction 3 with 5 rules applied. Total rules applied 2134 place count 1548 transition count 1980
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2137 place count 1548 transition count 1977
Applied a total of 2137 rules in 1629 ms. Remains 1548 /2587 variables (removed 1039) and now considering 1977/3099 (removed 1122) transitions.
// Phase 1: matrix 1977 rows 1548 cols
[2024-05-31 20:09:38] [INFO ] Computed 4 invariants in 41 ms
[2024-05-31 20:09:39] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-05-31 20:09:39] [INFO ] Invariant cache hit.
[2024-05-31 20:09:40] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
Running 1976 sub problems to find dead transitions.
[2024-05-31 20:09:40] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 1.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 1.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.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 1.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)timeout

(s411 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1976 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1547/3525 variables, and 4 constraints, problems are : Problem set: 0 solved, 1976 unsolved in 30069 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1548 constraints, PredecessorRefiner: 1976/1976 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1976 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1976 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 1547/3525 variables, and 4 constraints, problems are : Problem set: 0 solved, 1976 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1548 constraints, PredecessorRefiner: 0/1976 constraints, Known Traps: 0/0 constraints]
After SMT, in 60763ms problems are : Problem set: 0 solved, 1976 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Starting structural reductions in LTL mode, iteration 1 : 1548/2587 places, 1977/3099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64349 ms. Remains : 1548/2587 places, 1977/3099 transitions.
Support contains 26 out of 1548 places after structural reductions.
[2024-05-31 20:10:41] [INFO ] Flatten gal took : 153 ms
[2024-05-31 20:10:41] [INFO ] Flatten gal took : 76 ms
[2024-05-31 20:10:41] [INFO ] Input system was already deterministic with 1977 transitions.
RANDOM walk for 40000 steps (463 resets) in 3018 ms. (13 steps per ms) remains 11/24 properties
BEST_FIRST walk for 40003 steps (173 resets) in 544 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (193 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (181 resets) in 310 ms. (128 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (74 resets) in 256 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (179 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (180 resets) in 254 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (81 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (192 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (180 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (177 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (104 resets) in 81 ms. (487 steps per ms) remains 10/11 properties
[2024-05-31 20:10:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1525/1537 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1537 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1967/3504 variables, 1537/1541 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3504 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/3506 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3506 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/3508 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3508 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/3510 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3510 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/3512 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3512 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/3514 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3514 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/3516 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3516 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 2/3518 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3518 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/3520 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3520/3525 variables, and 1549 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1545/1548 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1525/1537 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1537 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1967/3504 variables, 1537/1541 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3504 variables, 10/1551 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3504 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/3506 variables, 1/1552 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3506 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/3508 variables, 1/1553 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3508 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3510 variables, 1/1554 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3510 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/3512 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3512 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/3514 variables, 1/1556 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3514 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2/3516 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3516 variables, 0/1557 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/3518 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3518 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 2/3520 variables, 1/1559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3520/3525 variables, and 1559 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1545/1548 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 10062ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Graph (trivial) has 1858 edges and 1548 vertex of which 677 / 1548 are part of one of the 63 SCC in 9 ms
Free SCC test removed 614 places
Drop transitions (Empty/Sink Transition effects.) removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Graph (complete) has 1386 edges and 934 vertex of which 925 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 511 transitions
Trivial Post-agglo rules discarded 511 transitions
Performed 511 trivial Post agglomeration. Transition count delta: 511
Iterating post reduction 0 with 517 rules applied. Total rules applied 519 place count 925 transition count 683
Reduce places removed 511 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 567 rules applied. Total rules applied 1086 place count 414 transition count 627
Reduce places removed 36 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 38 rules applied. Total rules applied 1124 place count 378 transition count 625
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 7 rules applied. Total rules applied 1131 place count 377 transition count 619
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1136 place count 372 transition count 619
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1136 place count 372 transition count 570
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1234 place count 323 transition count 570
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1244 place count 313 transition count 556
Iterating global reduction 5 with 10 rules applied. Total rules applied 1254 place count 313 transition count 556
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 5 with 2 rules applied. Total rules applied 1256 place count 313 transition count 554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1258 place count 311 transition count 554
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1265 place count 304 transition count 546
Iterating global reduction 7 with 7 rules applied. Total rules applied 1272 place count 304 transition count 546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1278 place count 304 transition count 540
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1279 place count 303 transition count 534
Iterating global reduction 8 with 1 rules applied. Total rules applied 1280 place count 303 transition count 534
Performed 155 Post agglomeration using F-continuation condition with reduction of 102 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 8 with 310 rules applied. Total rules applied 1590 place count 148 transition count 277
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1604 place count 148 transition count 263
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1607 place count 145 transition count 260
Iterating global reduction 9 with 3 rules applied. Total rules applied 1610 place count 145 transition count 260
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 1630 place count 135 transition count 248
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1638 place count 135 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1640 place count 134 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1642 place count 134 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1644 place count 133 transition count 236
Performed 35 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 11 with 70 rules applied. Total rules applied 1714 place count 98 transition count 271
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 11 with 31 rules applied. Total rules applied 1745 place count 98 transition count 240
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 1765 place count 78 transition count 199
Iterating global reduction 12 with 20 rules applied. Total rules applied 1785 place count 78 transition count 199
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 1796 place count 78 transition count 188
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1801 place count 73 transition count 178
Iterating global reduction 13 with 5 rules applied. Total rules applied 1806 place count 73 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1811 place count 73 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1813 place count 73 transition count 171
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 14 with 2 rules applied. Total rules applied 1815 place count 72 transition count 170
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1817 place count 72 transition count 170
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1818 place count 72 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1819 place count 71 transition count 169
Applied a total of 1819 rules in 255 ms. Remains 71 /1548 variables (removed 1477) and now considering 169/1977 (removed 1808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 71/1548 places, 169/1977 transitions.
RANDOM walk for 40000 steps (6415 resets) in 796 ms. (50 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (1501 resets) in 114 ms. (347 steps per ms) remains 1/2 properties
[2024-05-31 20:10:54] [INFO ] Flow matrix only has 158 transitions (discarded 11 similar events)
// Phase 1: matrix 158 rows 71 cols
[2024-05-31 20:10:54] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:10:54] [INFO ] State equation strengthened by 7 read => feed constraints.
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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/57 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/162 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/224 variables, 39/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:10:54] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 14 ms to minimize.
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 224/229 variables, and 75 constraints, problems are : Problem set: 1 solved, 0 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 66/71 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 301ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA CloudReconfiguration-PT-319-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 35 stable transitions
Graph (complete) has 2164 edges and 1548 vertex of which 1539 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.26 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Graph (trivial) has 1880 edges and 1548 vertex of which 696 / 1548 are part of one of the 63 SCC in 3 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1423 edges and 915 vertex of which 906 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 905 transition count 734
Reduce places removed 502 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 526 rules applied. Total rules applied 1030 place count 403 transition count 710
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1042 place count 391 transition count 710
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1042 place count 391 transition count 666
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1130 place count 347 transition count 666
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1149 place count 328 transition count 637
Iterating global reduction 3 with 19 rules applied. Total rules applied 1168 place count 328 transition count 637
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1170 place count 328 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1172 place count 326 transition count 635
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1184 place count 314 transition count 618
Iterating global reduction 5 with 12 rules applied. Total rules applied 1196 place count 314 transition count 618
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1202 place count 314 transition count 612
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1205 place count 311 transition count 606
Iterating global reduction 6 with 3 rules applied. Total rules applied 1208 place count 311 transition count 606
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1210 place count 309 transition count 602
Iterating global reduction 6 with 2 rules applied. Total rules applied 1212 place count 309 transition count 602
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1214 place count 307 transition count 598
Iterating global reduction 6 with 2 rules applied. Total rules applied 1216 place count 307 transition count 598
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1218 place count 305 transition count 594
Iterating global reduction 6 with 2 rules applied. Total rules applied 1220 place count 305 transition count 594
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1222 place count 303 transition count 590
Iterating global reduction 6 with 2 rules applied. Total rules applied 1224 place count 303 transition count 590
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1226 place count 301 transition count 576
Iterating global reduction 6 with 2 rules applied. Total rules applied 1228 place count 301 transition count 576
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1229 place count 301 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1230 place count 300 transition count 575
Performed 142 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 8 with 284 rules applied. Total rules applied 1514 place count 158 transition count 349
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 12 rules applied. Total rules applied 1526 place count 158 transition count 337
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1528 place count 157 transition count 336
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1532 place count 153 transition count 331
Iterating global reduction 10 with 4 rules applied. Total rules applied 1536 place count 153 transition count 331
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1556 place count 143 transition count 319
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1565 place count 143 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1599 place count 126 transition count 356
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1616 place count 126 transition count 339
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1625 place count 117 transition count 321
Iterating global reduction 12 with 9 rules applied. Total rules applied 1634 place count 117 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1640 place count 117 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1676 place count 117 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1677 place count 116 transition count 278
Applied a total of 1677 rules in 189 ms. Remains 116 /1548 variables (removed 1432) and now considering 278/1977 (removed 1699) transitions.
[2024-05-31 20:10:55] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
// Phase 1: matrix 219 rows 116 cols
[2024-05-31 20:10:55] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 20:10:55] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 20:10:55] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
[2024-05-31 20:10:55] [INFO ] Invariant cache hit.
[2024-05-31 20:10:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:10:55] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 271 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1548 places, 278/1977 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 277
Applied a total of 2 rules in 11 ms. Remains 114 /115 variables (removed 1) and now considering 277/278 (removed 1) transitions.
[2024-05-31 20:10:55] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
// Phase 1: matrix 218 rows 114 cols
[2024-05-31 20:10:55] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 20:10:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 20:10:55] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
[2024-05-31 20:10:55] [INFO ] Invariant cache hit.
[2024-05-31 20:10:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:10:55] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1548 places, 277/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 655 ms. Remains : 114/1548 places, 277/1977 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-00
Product exploration explored 100000 steps with 16048 reset in 316 ms.
Stack based approach found an accepted trace after 3921 steps with 634 reset with depth 7 and stack size 7 in 9 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-00 finished in 1305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1540 transition count 1969
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1540 transition count 1969
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1533 transition count 1962
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1533 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 1530 transition count 1958
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 1530 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 1527 transition count 1954
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 1527 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 1524 transition count 1951
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 1524 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1522 transition count 1949
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1522 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1520 transition count 1947
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1520 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1518 transition count 1945
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1518 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1516 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1514 transition count 1939
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1937
Applied a total of 72 rules in 1045 ms. Remains 1512 /1548 variables (removed 36) and now considering 1937/1977 (removed 40) transitions.
// Phase 1: matrix 1937 rows 1512 cols
[2024-05-31 20:10:57] [INFO ] Computed 4 invariants in 16 ms
[2024-05-31 20:10:57] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-31 20:10:57] [INFO ] Invariant cache hit.
[2024-05-31 20:10:58] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2024-05-31 20:10:58] [INFO ] Invariant cache hit.
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/1511 variables, 4/4 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 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 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 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints]
After SMT, in 60729ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1548 places, 1937/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63271 ms. Remains : 1512/1548 places, 1937/1977 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-01
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-01 finished in 63492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((p1||(G(p2) U (p0&&G(p2))))))))'
Support contains 2 out of 1548 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1539 transition count 1967
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1539 transition count 1967
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1531 transition count 1959
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1531 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 1528 transition count 1955
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 1528 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 1525 transition count 1951
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 1525 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1522 transition count 1948
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1520 transition count 1946
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1518 transition count 1944
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1516 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1514 transition count 1939
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1512 transition count 1936
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1510 transition count 1934
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1934
Applied a total of 76 rules in 480 ms. Remains 1510 /1548 variables (removed 38) and now considering 1934/1977 (removed 43) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2024-05-31 20:12:00] [INFO ] Computed 4 invariants in 14 ms
[2024-05-31 20:12:00] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-31 20:12:00] [INFO ] Invariant cache hit.
[2024-05-31 20:12:01] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-31 20:12:01] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1548 places, 1934/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62331 ms. Remains : 1510/1548 places, 1934/1977 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-02
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-02 finished in 62456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 2 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1538 transition count 1966
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1538 transition count 1966
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 1529 transition count 1957
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 1529 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1526 transition count 1953
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1526 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1523 transition count 1949
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1523 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1520 transition count 1946
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1518 transition count 1944
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1516 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1514 transition count 1940
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1510 transition count 1934
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1508 transition count 1932
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1508 transition count 1932
Applied a total of 80 rules in 494 ms. Remains 1508 /1548 variables (removed 40) and now considering 1932/1977 (removed 45) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2024-05-31 20:13:02] [INFO ] Computed 4 invariants in 17 ms
[2024-05-31 20:13:03] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-31 20:13:03] [INFO ] Invariant cache hit.
[2024-05-31 20:13:04] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-31 20:13:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 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 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 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 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1548 places, 1932/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62406 ms. Remains : 1508/1548 places, 1932/1977 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 524 ms.
Product exploration explored 100000 steps with 50000 reset in 546 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2115 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-319-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-319-LTLFireability-03 finished in 63751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((p1&&G(p2))))))'
Support contains 2 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1539 transition count 1967
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1539 transition count 1967
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1531 transition count 1959
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1531 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 1528 transition count 1955
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 1528 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 1525 transition count 1951
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 1525 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1522 transition count 1948
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1520 transition count 1946
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1518 transition count 1944
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1516 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1514 transition count 1939
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1512 transition count 1936
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1510 transition count 1934
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1934
Applied a total of 76 rules in 537 ms. Remains 1510 /1548 variables (removed 38) and now considering 1934/1977 (removed 43) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2024-05-31 20:14:06] [INFO ] Computed 4 invariants in 14 ms
[2024-05-31 20:14:06] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-31 20:14:06] [INFO ] Invariant cache hit.
[2024-05-31 20:14:07] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-31 20:14:07] [INFO ] Invariant cache hit.
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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60578ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60598ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1548 places, 1934/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62443 ms. Remains : 1510/1548 places, 1934/1977 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-04 finished in 62731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1538 transition count 1966
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1538 transition count 1966
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 1529 transition count 1957
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 1529 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1526 transition count 1953
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1526 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1523 transition count 1949
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1523 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1520 transition count 1946
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1518 transition count 1944
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1516 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 1514 transition count 1940
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1510 transition count 1934
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1508 transition count 1932
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1508 transition count 1932
Applied a total of 80 rules in 531 ms. Remains 1508 /1548 variables (removed 40) and now considering 1932/1977 (removed 45) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2024-05-31 20:15:09] [INFO ] Computed 4 invariants in 9 ms
[2024-05-31 20:15:09] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-31 20:15:09] [INFO ] Invariant cache hit.
[2024-05-31 20:15:10] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-31 20:15:10] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 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 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1548 places, 1932/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62438 ms. Remains : 1508/1548 places, 1932/1977 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-05
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-05 finished in 62571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F((p1&&G(p2)))))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Graph (trivial) has 1877 edges and 1548 vertex of which 696 / 1548 are part of one of the 63 SCC in 4 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1423 edges and 915 vertex of which 906 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 905 transition count 736
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 524 rules applied. Total rules applied 1026 place count 405 transition count 712
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1039 place count 393 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1040 place count 392 transition count 711
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1040 place count 392 transition count 667
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1128 place count 348 transition count 667
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1146 place count 330 transition count 639
Iterating global reduction 4 with 18 rules applied. Total rules applied 1164 place count 330 transition count 639
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1166 place count 330 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1168 place count 328 transition count 637
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1178 place count 318 transition count 623
Iterating global reduction 6 with 10 rules applied. Total rules applied 1188 place count 318 transition count 623
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1194 place count 318 transition count 617
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1197 place count 315 transition count 611
Iterating global reduction 7 with 3 rules applied. Total rules applied 1200 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 313 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 311 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 309 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 309 transition count 599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1213 place count 308 transition count 597
Iterating global reduction 7 with 1 rules applied. Total rules applied 1214 place count 308 transition count 597
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1215 place count 307 transition count 590
Iterating global reduction 7 with 1 rules applied. Total rules applied 1216 place count 307 transition count 590
Performed 143 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1502 place count 164 transition count 362
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1514 place count 164 transition count 350
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1518 place count 160 transition count 345
Iterating global reduction 8 with 4 rules applied. Total rules applied 1522 place count 160 transition count 345
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1544 place count 149 transition count 332
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1555 place count 149 transition count 321
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1591 place count 131 transition count 369
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1610 place count 131 transition count 350
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1619 place count 122 transition count 332
Iterating global reduction 10 with 9 rules applied. Total rules applied 1628 place count 122 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1634 place count 122 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 1672 place count 122 transition count 288
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1673 place count 122 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1674 place count 121 transition count 287
Applied a total of 1674 rules in 208 ms. Remains 121 /1548 variables (removed 1427) and now considering 287/1977 (removed 1690) transitions.
[2024-05-31 20:16:11] [INFO ] Flow matrix only has 229 transitions (discarded 58 similar events)
// Phase 1: matrix 229 rows 121 cols
[2024-05-31 20:16:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:16:11] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 20:16:11] [INFO ] Flow matrix only has 229 transitions (discarded 58 similar events)
[2024-05-31 20:16:11] [INFO ] Invariant cache hit.
[2024-05-31 20:16:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:16:11] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 332 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/1548 places, 287/1977 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 286
Applied a total of 2 rules in 19 ms. Remains 119 /120 variables (removed 1) and now considering 286/287 (removed 1) transitions.
[2024-05-31 20:16:11] [INFO ] Flow matrix only has 228 transitions (discarded 58 similar events)
// Phase 1: matrix 228 rows 119 cols
[2024-05-31 20:16:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:16:11] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 20:16:12] [INFO ] Flow matrix only has 228 transitions (discarded 58 similar events)
[2024-05-31 20:16:12] [INFO ] Invariant cache hit.
[2024-05-31 20:16:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:16:12] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1548 places, 286/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1045 ms. Remains : 119/1548 places, 286/1977 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-09 finished in 1251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||p0)))))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1539 transition count 1967
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1539 transition count 1967
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1530 transition count 1958
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1530 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 1527 transition count 1954
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 1527 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 1524 transition count 1950
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 1524 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1521 transition count 1947
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1521 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1519 transition count 1945
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1517 transition count 1943
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 1515 transition count 1941
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 1515 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 1513 transition count 1938
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 1511 transition count 1935
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1509 transition count 1933
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1509 transition count 1933
Applied a total of 78 rules in 486 ms. Remains 1509 /1548 variables (removed 39) and now considering 1933/1977 (removed 44) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2024-05-31 20:16:13] [INFO ] Computed 4 invariants in 8 ms
[2024-05-31 20:16:13] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-31 20:16:13] [INFO ] Invariant cache hit.
[2024-05-31 20:16:14] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-31 20:16:14] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 1)
(s179 1)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 1)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 0)
(s708 1)
(s709 0)
(s710 1)
(s711 1)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 1)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(timeout
s977 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1548 places, 1933/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62345 ms. Remains : 1509/1548 places, 1933/1977 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (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-319-LTLFireability-10
Product exploration explored 100000 steps with 1216 reset in 157 ms.
Product exploration explored 100000 steps with 1180 reset in 229 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2117 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (461 resets) in 319 ms. (125 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (85 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (88 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (94 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
[2024-05-31 20:17:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1094/1097 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1097 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 401/1498 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3442/3442 variables, and 1513 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3453 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1094/1097 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1097 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 401/1498 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 3/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3435 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3437 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3437 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3439 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3439 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3441 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3441 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3442 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3442 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3442 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3442/3442 variables, and 1516 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3872 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 7342ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 480 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Graph (trivial) has 1833 edges and 1509 vertex of which 693 / 1509 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1316 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 870 transition count 644
Reduce places removed 483 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 543 rules applied. Total rules applied 1034 place count 387 transition count 584
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 42 rules applied. Total rules applied 1076 place count 348 transition count 581
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1079 place count 345 transition count 581
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1079 place count 345 transition count 531
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1179 place count 295 transition count 531
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1190 place count 284 transition count 515
Iterating global reduction 4 with 11 rules applied. Total rules applied 1201 place count 284 transition count 515
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1204 place count 284 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1207 place count 281 transition count 512
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1215 place count 273 transition count 502
Iterating global reduction 6 with 8 rules applied. Total rules applied 1223 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1229 place count 273 transition count 496
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1231 place count 271 transition count 484
Iterating global reduction 7 with 2 rules applied. Total rules applied 1233 place count 271 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1234 place count 271 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1235 place count 270 transition count 483
Performed 140 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 9 with 280 rules applied. Total rules applied 1515 place count 130 transition count 249
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 13 rules applied. Total rules applied 1528 place count 130 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1530 place count 129 transition count 235
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1533 place count 126 transition count 232
Iterating global reduction 11 with 3 rules applied. Total rules applied 1536 place count 126 transition count 232
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1562 place count 113 transition count 216
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1574 place count 113 transition count 204
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1640 place count 80 transition count 248
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1667 place count 80 transition count 221
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 1688 place count 59 transition count 179
Iterating global reduction 13 with 21 rules applied. Total rules applied 1709 place count 59 transition count 179
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1721 place count 59 transition count 167
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1727 place count 53 transition count 155
Iterating global reduction 14 with 6 rules applied. Total rules applied 1733 place count 53 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1739 place count 53 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1740 place count 53 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1741 place count 53 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1742 place count 53 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1743 place count 52 transition count 147
Applied a total of 1743 rules in 53 ms. Remains 52 /1509 variables (removed 1457) and now considering 147/1933 (removed 1786) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 52/1509 places, 147/1933 transitions.
RANDOM walk for 15082 steps (2596 resets) in 116 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 279 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Applied a total of 0 rules in 49 ms. Remains 1509 /1509 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
[2024-05-31 20:17:24] [INFO ] Invariant cache hit.
[2024-05-31 20:17:25] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-31 20:17:25] [INFO ] Invariant cache hit.
[2024-05-31 20:17:26] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-31 20:17:26] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60645ms
Finished structural reductions in LTL mode , in 1 iterations and 62025 ms. Remains : 1509/1509 places, 1933/1933 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2117 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (488 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (95 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (180 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (82 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (90 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 310007 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 4
Probabilistic random walk after 310007 steps, saw 89185 distinct states, run finished after 3011 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-31 20:18:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1094/1097 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1097 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1498 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3442/3442 variables, and 1513 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4149 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1094/1097 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1097 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1498 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 4/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3442 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3442 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3442 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3442/3442 variables, and 1517 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4205 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8406ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 241 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Graph (trivial) has 1833 edges and 1509 vertex of which 693 / 1509 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1316 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 870 transition count 644
Reduce places removed 483 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 543 rules applied. Total rules applied 1034 place count 387 transition count 584
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 42 rules applied. Total rules applied 1076 place count 348 transition count 581
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1079 place count 345 transition count 581
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1079 place count 345 transition count 531
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1179 place count 295 transition count 531
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1190 place count 284 transition count 515
Iterating global reduction 4 with 11 rules applied. Total rules applied 1201 place count 284 transition count 515
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1204 place count 284 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1207 place count 281 transition count 512
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1215 place count 273 transition count 502
Iterating global reduction 6 with 8 rules applied. Total rules applied 1223 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1229 place count 273 transition count 496
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1231 place count 271 transition count 484
Iterating global reduction 7 with 2 rules applied. Total rules applied 1233 place count 271 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1234 place count 271 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1235 place count 270 transition count 483
Performed 140 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 9 with 280 rules applied. Total rules applied 1515 place count 130 transition count 249
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 13 rules applied. Total rules applied 1528 place count 130 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1530 place count 129 transition count 235
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1533 place count 126 transition count 232
Iterating global reduction 11 with 3 rules applied. Total rules applied 1536 place count 126 transition count 232
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1562 place count 113 transition count 216
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1574 place count 113 transition count 204
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1640 place count 80 transition count 248
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1667 place count 80 transition count 221
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 1688 place count 59 transition count 179
Iterating global reduction 13 with 21 rules applied. Total rules applied 1709 place count 59 transition count 179
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1721 place count 59 transition count 167
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1727 place count 53 transition count 155
Iterating global reduction 14 with 6 rules applied. Total rules applied 1733 place count 53 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1739 place count 53 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1740 place count 53 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1741 place count 53 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1742 place count 53 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1743 place count 52 transition count 147
Applied a total of 1743 rules in 43 ms. Remains 52 /1509 variables (removed 1457) and now considering 147/1933 (removed 1786) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 52/1509 places, 147/1933 transitions.
RANDOM walk for 40000 steps (6969 resets) in 200 ms. (199 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1149 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-05-31 20:18:39] [INFO ] Flow matrix only has 132 transitions (discarded 15 similar events)
// Phase 1: matrix 132 rows 52 cols
[2024-05-31 20:18:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:18:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/140 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/182 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/184 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/184 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 52/52 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/140 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/182 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/184 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 52/52 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1194 reset in 215 ms.
Product exploration explored 100000 steps with 1192 reset in 233 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Graph (trivial) has 1833 edges and 1509 vertex of which 693 / 1509 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1379 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 471 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 870 transition count 1196
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 485 place count 870 transition count 1184
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 485 place count 870 transition count 1198
Deduced a syphon composed of 493 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 507 place count 870 transition count 1198
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 789 place count 588 transition count 906
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1071 place count 588 transition count 906
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1083 place count 576 transition count 890
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1095 place count 576 transition count 890
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 576 transition count 884
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1113 place count 564 transition count 872
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1125 place count 564 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1127 place count 562 transition count 868
Deduced a syphon composed of 215 places in 2 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1129 place count 562 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 560 transition count 864
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 560 transition count 864
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1137 place count 556 transition count 860
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1141 place count 556 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1143 place count 554 transition count 856
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1145 place count 554 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 552 transition count 852
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 552 transition count 852
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1153 place count 548 transition count 846
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1157 place count 548 transition count 846
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1161 place count 544 transition count 830
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1165 place count 544 transition count 830
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 544 transition count 830
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1170 place count 540 transition count 826
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1174 place count 540 transition count 826
Performed 104 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 312 places in 1 ms
Iterating global reduction 4 with 104 rules applied. Total rules applied 1278 place count 540 transition count 900
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 1316 place count 540 transition count 862
Discarding 97 places :
Symmetric choice reduction at 5 with 97 rule applications. Total rules 1413 place count 443 transition count 757
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 97 rules applied. Total rules applied 1510 place count 443 transition count 757
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1514 place count 439 transition count 751
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 1518 place count 439 transition count 751
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1524 place count 439 transition count 751
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1528 place count 439 transition count 747
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1541 place count 426 transition count 730
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 13 rules applied. Total rules applied 1554 place count 426 transition count 730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1558 place count 426 transition count 726
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1562 place count 422 transition count 722
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1566 place count 422 transition count 722
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 1569 place count 422 transition count 722
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1575 place count 422 transition count 716
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1578 place count 419 transition count 713
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1581 place count 419 transition count 713
Performed 71 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1652 place count 419 transition count 1034
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1773 place count 419 transition count 913
Discarding 126 places :
Symmetric choice reduction at 9 with 126 rule applications. Total rules 1899 place count 293 transition count 584
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 9 with 126 rules applied. Total rules applied 2025 place count 293 transition count 584
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2040 place count 293 transition count 569
Discarding 26 places :
Symmetric choice reduction at 10 with 26 rule applications. Total rules 2066 place count 267 transition count 516
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 10 with 26 rules applied. Total rules applied 2092 place count 267 transition count 516
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2095 place count 267 transition count 562
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2099 place count 267 transition count 558
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2103 place count 263 transition count 529
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2107 place count 263 transition count 529
Deduced a syphon composed of 140 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 11 with 47 rules applied. Total rules applied 2154 place count 263 transition count 482
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2158 place count 259 transition count 478
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2162 place count 259 transition count 478
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2165 place count 259 transition count 550
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2168 place count 256 transition count 535
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2171 place count 256 transition count 535
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2171 rules in 371 ms. Remains 256 /1509 variables (removed 1253) and now considering 535/1933 (removed 1398) transitions.
[2024-05-31 20:18:41] [INFO ] Redundant transitions in 28 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-31 20:18:41] [INFO ] Flow matrix only has 476 transitions (discarded 59 similar events)
// Phase 1: matrix 476 rows 256 cols
[2024-05-31 20:18:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:18:41] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 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 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 TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 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 TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
At refinement iteration 1 (OVERLAPS) 475/730 variables, 255/255 constraints. Problems are: Problem set: 249 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 3/258 constraints. Problems are: Problem set: 249 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/730 variables, 0/258 constraints. Problems are: Problem set: 249 solved, 285 unsolved
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/731 variables, 1/259 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/731 variables, 0/259 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 1/732 variables, 1/260 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/260 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 0/732 variables, 0/260 constraints. Problems are: Problem set: 264 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 732/732 variables, and 260 constraints, problems are : Problem set: 264 solved, 270 unsolved in 20992 ms.
Refiners :[State Equation: 256/256 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 264 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 472/591 variables, 119/119 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 3/122 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 270/392 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/392 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 140/731 variables, 137/529 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 0/529 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/732 variables, 1/530 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/732 variables, 0/530 constraints. Problems are: Problem set: 264 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/732 variables, 0/530 constraints. Problems are: Problem set: 264 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 732/732 variables, and 530 constraints, problems are : Problem set: 264 solved, 270 unsolved in 24064 ms.
Refiners :[State Equation: 256/256 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 270/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 45309ms problems are : Problem set: 264 solved, 270 unsolved
Search for dead transitions found 264 dead transitions in 45316ms
Found 264 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 264 transitions
Dead transitions reduction (with SMT) removed 264 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 256/1509 places, 271/1933 transitions.
Graph (complete) has 421 edges and 256 vertex of which 120 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 113 transition count 253
Applied a total of 8 rules in 11 ms. Remains 113 /256 variables (removed 143) and now considering 253/271 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1509 places, 253/1933 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45742 ms. Remains : 113/1509 places, 253/1933 transitions.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Applied a total of 0 rules in 48 ms. Remains 1509 /1509 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2024-05-31 20:19:26] [INFO ] Computed 4 invariants in 13 ms
[2024-05-31 20:19:27] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-31 20:19:27] [INFO ] Invariant cache hit.
[2024-05-31 20:19:28] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-31 20:19:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Finished structural reductions in LTL mode , in 1 iterations and 61984 ms. Remains : 1509/1509 places, 1933/1933 transitions.
Treatment of property CloudReconfiguration-PT-319-LTLFireability-10 finished in 256398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(F(p1)))) U p2))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Graph (trivial) has 1871 edges and 1548 vertex of which 686 / 1548 are part of one of the 63 SCC in 1 ms
Free SCC test removed 623 places
Ensure Unique test removed 720 transitions
Reduce isomorphic transitions removed 720 transitions.
Graph (complete) has 1438 edges and 925 vertex of which 916 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 915 transition count 748
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 527 rules applied. Total rules applied 1032 place count 412 transition count 724
Reduce places removed 12 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 14 rules applied. Total rules applied 1046 place count 400 transition count 722
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 1051 place count 399 transition count 718
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1054 place count 396 transition count 718
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 45 Pre rules applied. Total rules applied 1054 place count 396 transition count 673
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1144 place count 351 transition count 673
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1163 place count 332 transition count 644
Iterating global reduction 5 with 19 rules applied. Total rules applied 1182 place count 332 transition count 644
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 5 with 2 rules applied. Total rules applied 1184 place count 332 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1186 place count 330 transition count 642
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1198 place count 318 transition count 625
Iterating global reduction 7 with 12 rules applied. Total rules applied 1210 place count 318 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1216 place count 318 transition count 619
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1218 place count 316 transition count 615
Iterating global reduction 8 with 2 rules applied. Total rules applied 1220 place count 316 transition count 615
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1221 place count 315 transition count 613
Iterating global reduction 8 with 1 rules applied. Total rules applied 1222 place count 315 transition count 613
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1223 place count 314 transition count 611
Iterating global reduction 8 with 1 rules applied. Total rules applied 1224 place count 314 transition count 611
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1225 place count 313 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 1226 place count 313 transition count 609
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1227 place count 312 transition count 607
Iterating global reduction 8 with 1 rules applied. Total rules applied 1228 place count 312 transition count 607
Performed 144 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 8 with 288 rules applied. Total rules applied 1516 place count 168 transition count 377
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1529 place count 168 transition count 364
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1533 place count 164 transition count 359
Iterating global reduction 9 with 4 rules applied. Total rules applied 1537 place count 164 transition count 359
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 9 with 24 rules applied. Total rules applied 1561 place count 152 transition count 345
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1573 place count 152 transition count 333
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1574 place count 151 transition count 331
Iterating global reduction 10 with 1 rules applied. Total rules applied 1575 place count 151 transition count 331
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 1613 place count 132 transition count 382
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1636 place count 132 transition count 359
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1645 place count 123 transition count 341
Iterating global reduction 11 with 9 rules applied. Total rules applied 1654 place count 123 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1660 place count 123 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 12 with 41 rules applied. Total rules applied 1701 place count 123 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1702 place count 122 transition count 293
Applied a total of 1702 rules in 79 ms. Remains 122 /1548 variables (removed 1426) and now considering 293/1977 (removed 1684) transitions.
[2024-05-31 20:20:29] [INFO ] Flow matrix only has 234 transitions (discarded 59 similar events)
// Phase 1: matrix 234 rows 122 cols
[2024-05-31 20:20:29] [INFO ] Computed 0 invariants in 5 ms
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 20:20:29] [INFO ] Flow matrix only has 234 transitions (discarded 59 similar events)
[2024-05-31 20:20:29] [INFO ] Invariant cache hit.
[2024-05-31 20:20:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 220 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/1548 places, 293/1977 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 292
Applied a total of 2 rules in 6 ms. Remains 120 /121 variables (removed 1) and now considering 292/293 (removed 1) transitions.
[2024-05-31 20:20:29] [INFO ] Flow matrix only has 233 transitions (discarded 59 similar events)
// Phase 1: matrix 233 rows 120 cols
[2024-05-31 20:20:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 20:20:29] [INFO ] Flow matrix only has 233 transitions (discarded 59 similar events)
[2024-05-31 20:20:29] [INFO ] Invariant cache hit.
[2024-05-31 20:20:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/1548 places, 292/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 490 ms. Remains : 120/1548 places, 292/1977 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-12
Stuttering criterion allowed to conclude after 20 steps with 3 reset in 0 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-12 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Graph (trivial) has 1881 edges and 1548 vertex of which 682 / 1548 are part of one of the 62 SCC in 1 ms
Free SCC test removed 620 places
Ensure Unique test removed 718 transitions
Reduce isomorphic transitions removed 718 transitions.
Graph (complete) has 1440 edges and 928 vertex of which 919 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 918 transition count 745
Reduce places removed 508 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 534 rules applied. Total rules applied 1044 place count 410 transition count 719
Reduce places removed 13 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 15 rules applied. Total rules applied 1059 place count 397 transition count 717
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 1062 place count 396 transition count 715
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 1066 place count 395 transition count 712
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1068 place count 393 transition count 712
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 45 Pre rules applied. Total rules applied 1068 place count 393 transition count 667
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 1158 place count 348 transition count 667
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1176 place count 330 transition count 640
Iterating global reduction 6 with 18 rules applied. Total rules applied 1194 place count 330 transition count 640
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 6 with 2 rules applied. Total rules applied 1196 place count 330 transition count 638
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1198 place count 328 transition count 638
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1209 place count 317 transition count 623
Iterating global reduction 8 with 11 rules applied. Total rules applied 1220 place count 317 transition count 623
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1226 place count 317 transition count 617
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1228 place count 315 transition count 613
Iterating global reduction 9 with 2 rules applied. Total rules applied 1230 place count 315 transition count 613
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1231 place count 314 transition count 611
Iterating global reduction 9 with 1 rules applied. Total rules applied 1232 place count 314 transition count 611
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1233 place count 313 transition count 609
Iterating global reduction 9 with 1 rules applied. Total rules applied 1234 place count 313 transition count 609
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1235 place count 312 transition count 607
Iterating global reduction 9 with 1 rules applied. Total rules applied 1236 place count 312 transition count 607
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1237 place count 311 transition count 605
Iterating global reduction 9 with 1 rules applied. Total rules applied 1238 place count 311 transition count 605
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1239 place count 310 transition count 598
Iterating global reduction 9 with 1 rules applied. Total rules applied 1240 place count 310 transition count 598
Performed 145 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 9 with 290 rules applied. Total rules applied 1530 place count 165 transition count 367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1540 place count 165 transition count 357
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1544 place count 161 transition count 352
Iterating global reduction 10 with 4 rules applied. Total rules applied 1548 place count 161 transition count 352
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1570 place count 150 transition count 339
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1581 place count 150 transition count 328
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1582 place count 149 transition count 326
Iterating global reduction 11 with 1 rules applied. Total rules applied 1583 place count 149 transition count 326
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 1623 place count 129 transition count 377
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 11 with 25 rules applied. Total rules applied 1648 place count 129 transition count 352
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1657 place count 120 transition count 334
Iterating global reduction 12 with 9 rules applied. Total rules applied 1666 place count 120 transition count 334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1672 place count 120 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 13 with 40 rules applied. Total rules applied 1712 place count 120 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1713 place count 119 transition count 287
Applied a total of 1713 rules in 116 ms. Remains 119 /1548 variables (removed 1429) and now considering 287/1977 (removed 1690) transitions.
[2024-05-31 20:20:29] [INFO ] Flow matrix only has 227 transitions (discarded 60 similar events)
// Phase 1: matrix 227 rows 119 cols
[2024-05-31 20:20:29] [INFO ] Computed 0 invariants in 4 ms
[2024-05-31 20:20:30] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-31 20:20:30] [INFO ] Flow matrix only has 227 transitions (discarded 60 similar events)
[2024-05-31 20:20:30] [INFO ] Invariant cache hit.
[2024-05-31 20:20:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:20:30] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 717 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1548 places, 287/1977 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 286
Applied a total of 2 rules in 5 ms. Remains 117 /118 variables (removed 1) and now considering 286/287 (removed 1) transitions.
[2024-05-31 20:20:30] [INFO ] Flow matrix only has 226 transitions (discarded 60 similar events)
// Phase 1: matrix 226 rows 117 cols
[2024-05-31 20:20:30] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:20:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 20:20:30] [INFO ] Flow matrix only has 226 transitions (discarded 60 similar events)
[2024-05-31 20:20:30] [INFO ] Invariant cache hit.
[2024-05-31 20:20:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 20:20:30] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1548 places, 286/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1069 ms. Remains : 117/1548 places, 286/1977 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-13 finished in 1158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Graph (trivial) has 1875 edges and 1548 vertex of which 696 / 1548 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1423 edges and 915 vertex of which 906 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 905 transition count 740
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 520 rules applied. Total rules applied 1018 place count 409 transition count 716
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1033 place count 397 transition count 713
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1036 place count 394 transition count 713
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1036 place count 394 transition count 669
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1124 place count 350 transition count 669
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1142 place count 332 transition count 641
Iterating global reduction 4 with 18 rules applied. Total rules applied 1160 place count 332 transition count 641
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1162 place count 332 transition count 639
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1164 place count 330 transition count 639
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1175 place count 319 transition count 624
Iterating global reduction 6 with 11 rules applied. Total rules applied 1186 place count 319 transition count 624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1192 place count 319 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 317 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 317 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 315 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 315 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 313 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 313 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 311 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 311 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 309 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 309 transition count 598
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1214 place count 307 transition count 584
Iterating global reduction 7 with 2 rules applied. Total rules applied 1216 place count 307 transition count 584
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1217 place count 307 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1218 place count 306 transition count 583
Performed 146 Post agglomeration using F-continuation condition with reduction of 89 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 9 with 292 rules applied. Total rules applied 1510 place count 160 transition count 348
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 10 rules applied. Total rules applied 1520 place count 160 transition count 338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1522 place count 159 transition count 337
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1526 place count 155 transition count 332
Iterating global reduction 11 with 4 rules applied. Total rules applied 1530 place count 155 transition count 332
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1548 place count 146 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 1555 place count 146 transition count 314
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1589 place count 129 transition count 360
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1606 place count 129 transition count 343
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1615 place count 120 transition count 325
Iterating global reduction 13 with 9 rules applied. Total rules applied 1624 place count 120 transition count 325
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1630 place count 120 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1666 place count 120 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1667 place count 119 transition count 282
Applied a total of 1667 rules in 96 ms. Remains 119 /1548 variables (removed 1429) and now considering 282/1977 (removed 1695) transitions.
[2024-05-31 20:20:30] [INFO ] Flow matrix only has 223 transitions (discarded 59 similar events)
// Phase 1: matrix 223 rows 119 cols
[2024-05-31 20:20:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:20:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:20:30] [INFO ] Flow matrix only has 223 transitions (discarded 59 similar events)
[2024-05-31 20:20:30] [INFO ] Invariant cache hit.
[2024-05-31 20:20:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:20:31] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 217 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1548 places, 282/1977 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 281
Applied a total of 2 rules in 6 ms. Remains 117 /118 variables (removed 1) and now considering 281/282 (removed 1) transitions.
[2024-05-31 20:20:31] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
// Phase 1: matrix 222 rows 117 cols
[2024-05-31 20:20:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 20:20:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 20:20:31] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
[2024-05-31 20:20:31] [INFO ] Invariant cache hit.
[2024-05-31 20:20:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:20:31] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1548 places, 281/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 513 ms. Remains : 117/1548 places, 281/1977 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-15 finished in 580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||p0)))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-319-LTLFireability-10
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1548/1548 places, 1977/1977 transitions.
Graph (trivial) has 1875 edges and 1548 vertex of which 696 / 1548 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1423 edges and 915 vertex of which 906 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 905 transition count 739
Reduce places removed 497 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 521 rules applied. Total rules applied 1020 place count 408 transition count 715
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1035 place count 396 transition count 712
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1038 place count 393 transition count 712
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1038 place count 393 transition count 668
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1126 place count 349 transition count 668
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1144 place count 331 transition count 640
Iterating global reduction 4 with 18 rules applied. Total rules applied 1162 place count 331 transition count 640
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1164 place count 331 transition count 638
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1166 place count 329 transition count 638
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1178 place count 317 transition count 621
Iterating global reduction 6 with 12 rules applied. Total rules applied 1190 place count 317 transition count 621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1196 place count 317 transition count 615
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1199 place count 314 transition count 609
Iterating global reduction 7 with 3 rules applied. Total rules applied 1202 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1204 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 312 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1208 place count 310 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1210 place count 310 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1212 place count 308 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1214 place count 308 transition count 597
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1216 place count 306 transition count 593
Iterating global reduction 7 with 2 rules applied. Total rules applied 1218 place count 306 transition count 593
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1220 place count 304 transition count 579
Iterating global reduction 7 with 2 rules applied. Total rules applied 1222 place count 304 transition count 579
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1223 place count 304 transition count 578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1224 place count 303 transition count 578
Performed 142 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 9 with 284 rules applied. Total rules applied 1508 place count 161 transition count 353
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 rules applied. Total rules applied 1519 place count 161 transition count 342
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1521 place count 160 transition count 341
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1525 place count 156 transition count 336
Iterating global reduction 11 with 4 rules applied. Total rules applied 1529 place count 156 transition count 336
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1549 place count 146 transition count 324
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1558 place count 146 transition count 315
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1592 place count 129 transition count 361
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1609 place count 129 transition count 344
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1618 place count 120 transition count 326
Iterating global reduction 13 with 9 rules applied. Total rules applied 1627 place count 120 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1633 place count 120 transition count 320
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1634 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1635 place count 120 transition count 319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1636 place count 119 transition count 318
Applied a total of 1636 rules in 109 ms. Remains 119 /1548 variables (removed 1429) and now considering 318/1977 (removed 1659) transitions.
[2024-05-31 20:20:31] [INFO ] Flow matrix only has 259 transitions (discarded 59 similar events)
// Phase 1: matrix 259 rows 119 cols
[2024-05-31 20:20:31] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 20:20:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 20:20:31] [INFO ] Flow matrix only has 259 transitions (discarded 59 similar events)
[2024-05-31 20:20:31] [INFO ] Invariant cache hit.
[2024-05-31 20:20:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 20:20:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 118/1548 places, 318/1977 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 317
Applied a total of 2 rules in 4 ms. Remains 117 /118 variables (removed 1) and now considering 317/318 (removed 1) transitions.
[2024-05-31 20:20:31] [INFO ] Flow matrix only has 258 transitions (discarded 59 similar events)
// Phase 1: matrix 258 rows 117 cols
[2024-05-31 20:20:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:20:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 20:20:32] [INFO ] Flow matrix only has 258 transitions (discarded 59 similar events)
[2024-05-31 20:20:32] [INFO ] Invariant cache hit.
[2024-05-31 20:20:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 20:20:32] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 117/1548 places, 317/1977 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 515 ms. Remains : 117/1548 places, 317/1977 transitions.
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-10
Entered a terminal (fully accepting) state of product in 7056 steps with 914 reset in 12 ms.
Treatment of property CloudReconfiguration-PT-319-LTLFireability-10 finished in 815 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-31 20:20:32] [INFO ] Flatten gal took : 68 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 656164 ms.
ITS solved all properties within timeout

BK_STOP 1717186832338

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-319"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-319, 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 r480-tall-171624188900260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-319.tgz
mv CloudReconfiguration-PT-319 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;