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.r092-tall-171624188600123.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 itstools
Input is CloudReconfiguration-PT-302, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624188600123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 4.0K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 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 660K 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-302-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-302-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716262598218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-302
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 03:36:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:36:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:36:39] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-21 03:36:39] [INFO ] Transformed 2585 places.
[2024-05-21 03:36:39] [INFO ] Transformed 3095 transitions.
[2024-05-21 03:36:39] [INFO ] Found NUPN structural information;
[2024-05-21 03:36:39] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 506 places :
Symmetric choice reduction at 0 with 506 rule applications. Total rules 506 place count 2079 transition count 2589
Iterating global reduction 0 with 506 rules applied. Total rules applied 1012 place count 2079 transition count 2589
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1040 place count 2079 transition count 2561
Discarding 228 places :
Symmetric choice reduction at 1 with 228 rule applications. Total rules 1268 place count 1851 transition count 2333
Iterating global reduction 1 with 228 rules applied. Total rules applied 1496 place count 1851 transition count 2333
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 1579 place count 1768 transition count 2250
Iterating global reduction 1 with 83 rules applied. Total rules applied 1662 place count 1768 transition count 2250
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1677 place count 1768 transition count 2235
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1719 place count 1726 transition count 2193
Iterating global reduction 2 with 42 rules applied. Total rules applied 1761 place count 1726 transition count 2193
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1769 place count 1726 transition count 2185
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1799 place count 1696 transition count 2152
Iterating global reduction 3 with 30 rules applied. Total rules applied 1829 place count 1696 transition count 2152
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1855 place count 1670 transition count 2126
Iterating global reduction 3 with 26 rules applied. Total rules applied 1881 place count 1670 transition count 2126
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1905 place count 1646 transition count 2102
Iterating global reduction 3 with 24 rules applied. Total rules applied 1929 place count 1646 transition count 2102
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1953 place count 1622 transition count 2078
Iterating global reduction 3 with 24 rules applied. Total rules applied 1977 place count 1622 transition count 2078
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1998 place count 1601 transition count 2043
Iterating global reduction 3 with 21 rules applied. Total rules applied 2019 place count 1601 transition count 2043
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2025 place count 1595 transition count 2033
Iterating global reduction 3 with 6 rules applied. Total rules applied 2031 place count 1595 transition count 2033
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2037 place count 1589 transition count 2025
Iterating global reduction 3 with 6 rules applied. Total rules applied 2043 place count 1589 transition count 2025
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2045 place count 1589 transition count 2023
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2047 place count 1587 transition count 2021
Iterating global reduction 4 with 2 rules applied. Total rules applied 2049 place count 1587 transition count 2021
Applied a total of 2049 rules in 2315 ms. Remains 1587 /2585 variables (removed 998) and now considering 2021/3095 (removed 1074) transitions.
// Phase 1: matrix 2021 rows 1587 cols
[2024-05-21 03:36:42] [INFO ] Computed 4 invariants in 39 ms
[2024-05-21 03:36:42] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-21 03:36:42] [INFO ] Invariant cache hit.
[2024-05-21 03:36:43] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
Running 2020 sub problems to find dead transitions.
[2024-05-21 03:36:44] [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/1586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1586/3608 variables, and 4 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30071 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1587 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(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 1)
(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 1)
(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 1)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 1)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 0)
(s440 1)
(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 1)
(s512 1)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(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 0)
(s730 0)
(s731 0)
(s732 1)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 1)
(s743 1)
(s744 0)
(s745 1)
(s746 0)
(s747 0)
(s748 1)
(s749 1)
(s750 0)
(s751 1)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 1)
(s757 0)
(s758 0)
(s759 0)
(s760 1)
(s761 1)
(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 1)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 1)
(s1149 0)
(s1150 1)
(s1151 1)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 1)
(s1156 1)
(s1157 0)
(s1158 1)
(s1159 0)
(s1160 0)
(s1161 1)
(s1162 0)
(s1163 1)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 1)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 1)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 1)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 0)
(s1477 0)
(s1478 0)
(s1479 0)
(s1480 0)
(s1481 0)
(s1482 0)
(s1483 0)
(s1484 0)
(s1485 0)
(s1486 0)
(s1487 0)
(s1488 0)
(s1489 0)
(s1490 0)
(s1491 0)
(s1492 0)
(s1493 0)
(s1494 0)
(s1495 0)
(s1496 0)
(s1497 0)
(s1498 0)
(s1499 0)
(s1500 0)
(s1501 0)
(s1502 0)
(s1503 0)
(s1504 0)
(s1505 0)
(s1506 0)
(s1507 0)
(s1508 0)
(s1509 0)
(s1510 0)
(s1511 0)
(s1512 0)
(s1513 0)
(s1514 0)
(s1515 0)
(s1516 0)
(s1517 0)
(s1518 0)
(s1519 0)
(s1520 0)
(s1521 0)
(s1522 0)
(s1523 0)
(s1524 0)
(s1525 0)
(s1526 0)
(s1527 0)
(s1528 0)
(s1529 0)
(s1530 0)
(s1531 0)
(s1532 0)
(s1533 0)
(s1534 0)
(s1535 0)
(s1536 0)
(s1537 0)
(s1538 0)
(s1539 0)
(s1540 0)
(s1541 0)
(s1542 0)
(s1543 0)
(s1544 0)
(s1545 0)
(s1546 0)
(s1547 0)
(s1548 0)
(s1549 0)
(s1550 0)
(s1551 0)
(s1552 0)
(s1553 0)
(s1554 0)
(s1555 0)
(s1556 0)
(s1557 0)
(s1558 0)
(s1559 0)
(s1560 0)
(s1561 0)
(s1562 0)
(s1563 0)
(s1564 0)
(s1565 0)
(s1566 0)
(s1567 0)
(s1568 timeout
0)
(s1569 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1586/3608 variables, and 4 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1587 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 0/0 constraints]
After SMT, in 60806ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 60846ms
Starting structural reductions in LTL mode, iteration 1 : 1587/2585 places, 2021/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64753 ms. Remains : 1587/2585 places, 2021/3095 transitions.
Support contains 45 out of 1587 places after structural reductions.
[2024-05-21 03:37:45] [INFO ] Flatten gal took : 121 ms
[2024-05-21 03:37:45] [INFO ] Flatten gal took : 67 ms
[2024-05-21 03:37:45] [INFO ] Input system was already deterministic with 2021 transitions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (281 resets) in 1908 ms. (20 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
[2024-05-21 03:37:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1542/1576 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1576 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2011/3587 variables, 1576/1580 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3587 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/3589 variables, 1/1581 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3589 variables, 0/1581 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 2/3591 variables, 1/1582 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3591 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2/3593 variables, 1/1583 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3593 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/3595 variables, 1/1584 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3595/3608 variables, and 1584 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1580/1587 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1542/1576 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1576 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2011/3587 variables, 1576/1580 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3587 variables, 19/1599 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3587 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/3589 variables, 1/1600 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3589 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 2/3591 variables, 1/1601 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3591 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 2/3593 variables, 1/1602 constraints. Problems are: Problem set: 0 solved, 19 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 3593/3608 variables, and 1602 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1579/1587 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 10059ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 1587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1863 edges and 1587 vertex of which 589 / 1587 are part of one of the 61 SCC in 14 ms
Free SCC test removed 528 places
Drop transitions (Empty/Sink Transition effects.) removed 664 transitions
Reduce isomorphic transitions removed 664 transitions.
Graph (complete) has 1533 edges and 1059 vertex of which 1050 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 556 rules applied. Total rules applied 558 place count 1050 transition count 797
Reduce places removed 549 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 608 rules applied. Total rules applied 1166 place count 501 transition count 738
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 2 with 44 rules applied. Total rules applied 1210 place count 463 transition count 732
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 1219 place count 460 transition count 726
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 11 rules applied. Total rules applied 1230 place count 457 transition count 718
Reduce places removed 5 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 12 rules applied. Total rules applied 1242 place count 452 transition count 711
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1249 place count 445 transition count 711
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 55 Pre rules applied. Total rules applied 1249 place count 445 transition count 656
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 110 rules applied. Total rules applied 1359 place count 390 transition count 656
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1366 place count 383 transition count 647
Iterating global reduction 7 with 7 rules applied. Total rules applied 1373 place count 383 transition count 647
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 1375 place count 383 transition count 645
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1377 place count 381 transition count 645
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1377 place count 381 transition count 644
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1379 place count 380 transition count 644
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1384 place count 375 transition count 639
Iterating global reduction 9 with 5 rules applied. Total rules applied 1389 place count 375 transition count 639
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1393 place count 375 transition count 635
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1394 place count 374 transition count 634
Iterating global reduction 10 with 1 rules applied. Total rules applied 1395 place count 374 transition count 634
Performed 169 Post agglomeration using F-continuation condition with reduction of 91 identical transitions.
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 10 with 338 rules applied. Total rules applied 1733 place count 205 transition count 374
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1755 place count 205 transition count 352
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1758 place count 202 transition count 349
Iterating global reduction 11 with 3 rules applied. Total rules applied 1761 place count 202 transition count 349
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1781 place count 192 transition count 338
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1792 place count 192 transition count 327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1794 place count 191 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1796 place count 191 transition count 324
Performed 43 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 13 with 86 rules applied. Total rules applied 1882 place count 148 transition count 373
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 13 with 41 rules applied. Total rules applied 1923 place count 148 transition count 332
Discarding 17 places :
Symmetric choice reduction at 14 with 17 rule applications. Total rules 1940 place count 131 transition count 298
Iterating global reduction 14 with 17 rules applied. Total rules applied 1957 place count 131 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1961 place count 131 transition count 294
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1963 place count 129 transition count 290
Iterating global reduction 15 with 2 rules applied. Total rules applied 1965 place count 129 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 15 with 20 rules applied. Total rules applied 1985 place count 129 transition count 270
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1987 place count 127 transition count 268
Iterating global reduction 15 with 2 rules applied. Total rules applied 1989 place count 127 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1991 place count 127 transition count 266
Free-agglomeration rule applied 9 times.
Iterating global reduction 15 with 9 rules applied. Total rules applied 2000 place count 127 transition count 257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 2009 place count 118 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 2013 place count 118 transition count 253
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 16 with 12 rules applied. Total rules applied 2025 place count 118 transition count 253
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2026 place count 118 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2027 place count 117 transition count 252
Applied a total of 2027 rules in 213 ms. Remains 117 /1587 variables (removed 1470) and now considering 252/2021 (removed 1769) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 117/1587 places, 252/2021 transitions.
RANDOM walk for 40000 steps (469 resets) in 672 ms. (59 steps per ms) remains 1/19 properties
BEST_FIRST walk for 19111 steps (48 resets) in 19 ms. (955 steps per ms) remains 0/1 properties
FORMULA CloudReconfiguration-PT-302-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2200 edges and 1587 vertex of which 1578 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.27 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((p0||F(p1)))||(G(p2)&&X(p1))))'
Support contains 5 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1562 transition count 1996
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1562 transition count 1996
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 1562 transition count 1994
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 1546 transition count 1978
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 1546 transition count 1978
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 1536 transition count 1968
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 1536 transition count 1968
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 1536 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 1531 transition count 1961
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 1531 transition count 1961
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 1526 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 1526 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 1523 transition count 1952
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 1523 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 1521 transition count 1950
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 1521 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 1519 transition count 1947
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 1519 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 1518 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 1518 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 1517 transition count 1944
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 1517 transition count 1944
Applied a total of 144 rules in 688 ms. Remains 1517 /1587 variables (removed 70) and now considering 1944/2021 (removed 77) transitions.
// Phase 1: matrix 1944 rows 1517 cols
[2024-05-21 03:37:57] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 03:37:58] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 03:37:58] [INFO ] Invariant cache hit.
[2024-05-21 03:37:59] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
Running 1943 sub problems to find dead transitions.
[2024-05-21 03:37:59] [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/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1943/1943 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(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 1)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 0)
(s702 1)
(s703 0)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 1)
(s710 0)
(s711 0)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 1)
(s717 1)
(s718 0)
(s719 1)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 timeout
0)
(s988 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1943 constraints, Known Traps: 0/0 constraints]
After SMT, in 60735ms problems are : Problem set: 0 solved, 1943 unsolved
Search for dead transitions found 0 dead transitions in 60754ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1587 places, 1944/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62644 ms. Remains : 1517/1587 places, 1944/2021 transitions.
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-00
Product exploration explored 100000 steps with 710 reset in 278 ms.
Product exploration explored 100000 steps with 718 reset in 226 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2123 edges and 1517 vertex of which 1508 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 112 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (280 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (76 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (75 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 311721 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 3
Probabilistic random walk after 311721 steps, saw 78866 distinct states, run finished after 3004 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-21 03:39:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 1097/1100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 406/1506 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1934/3440 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3442 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3442 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3444 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3444 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3446 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3446 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3448 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3448 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3450 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3452 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3452 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3454 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3454 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3456 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3456 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3458 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3458 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3460 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3460 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3461 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3461/3461 variables, and 1521 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2320 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 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) 1097/1100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 406/1506 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1934/3440 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 3/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3442 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3442 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3444 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3444 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3446 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3448 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3448 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3450 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3450 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3454 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3456 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3456 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3458 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3458 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3460 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3461 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3461 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3461 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3461/3461 variables, and 1524 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2714 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5046ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 289 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=57 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 16 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 1517 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1517/1517 places, 1944/1944 transitions.
Graph (trivial) has 1847 edges and 1517 vertex of which 679 / 1517 are part of one of the 62 SCC in 3 ms
Free SCC test removed 617 places
Ensure Unique test removed 715 transitions
Reduce isomorphic transitions removed 715 transitions.
Graph (complete) has 1402 edges and 900 vertex of which 891 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 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 481 place count 890 transition count 744
Reduce places removed 479 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 505 rules applied. Total rules applied 986 place count 411 transition count 718
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 1001 place count 398 transition count 716
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 1004 place count 397 transition count 714
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 1008 place count 396 transition count 711
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1011 place count 394 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1012 place count 393 transition count 710
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 47 Pre rules applied. Total rules applied 1012 place count 393 transition count 663
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 1106 place count 346 transition count 663
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1122 place count 330 transition count 637
Iterating global reduction 7 with 16 rules applied. Total rules applied 1138 place count 330 transition count 637
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 7 with 3 rules applied. Total rules applied 1141 place count 330 transition count 634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1144 place count 327 transition count 634
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1153 place count 318 transition count 622
Iterating global reduction 9 with 9 rules applied. Total rules applied 1162 place count 318 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1168 place count 318 transition count 616
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1170 place count 316 transition count 612
Iterating global reduction 10 with 2 rules applied. Total rules applied 1172 place count 316 transition count 612
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1174 place count 314 transition count 608
Iterating global reduction 10 with 2 rules applied. Total rules applied 1176 place count 314 transition count 608
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1177 place count 313 transition count 606
Iterating global reduction 10 with 1 rules applied. Total rules applied 1178 place count 313 transition count 606
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1179 place count 312 transition count 604
Iterating global reduction 10 with 1 rules applied. Total rules applied 1180 place count 312 transition count 604
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1181 place count 311 transition count 602
Iterating global reduction 10 with 1 rules applied. Total rules applied 1182 place count 311 transition count 602
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1183 place count 310 transition count 595
Iterating global reduction 10 with 1 rules applied. Total rules applied 1184 place count 310 transition count 595
Performed 142 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 10 with 284 rules applied. Total rules applied 1468 place count 168 transition count 374
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1483 place count 168 transition count 359
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1487 place count 164 transition count 354
Iterating global reduction 11 with 4 rules applied. Total rules applied 1491 place count 164 transition count 354
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 1517 place count 151 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1531 place count 151 transition count 324
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 36 rules applied. Total rules applied 1567 place count 133 transition count 364
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 1589 place count 133 transition count 342
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1598 place count 124 transition count 324
Iterating global reduction 13 with 9 rules applied. Total rules applied 1607 place count 124 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1612 place count 124 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 14 with 40 rules applied. Total rules applied 1652 place count 124 transition count 279
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1655 place count 124 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1656 place count 124 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1657 place count 123 transition count 277
Applied a total of 1657 rules in 150 ms. Remains 123 /1517 variables (removed 1394) and now considering 277/1944 (removed 1667) transitions.
[2024-05-21 03:39:09] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
// Phase 1: matrix 221 rows 123 cols
[2024-05-21 03:39:09] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:39:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 03:39:09] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
[2024-05-21 03:39:09] [INFO ] Invariant cache hit.
[2024-05-21 03:39:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 03:39:09] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [13, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 154 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/1517 places, 277/1944 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 275
Applied a total of 4 rules in 7 ms. Remains 119 /121 variables (removed 2) and now considering 275/277 (removed 2) transitions.
[2024-05-21 03:39:09] [INFO ] Flow matrix only has 219 transitions (discarded 56 similar events)
// Phase 1: matrix 219 rows 119 cols
[2024-05-21 03:39:09] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 03:39:10] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 03:39:10] [INFO ] Flow matrix only has 219 transitions (discarded 56 similar events)
[2024-05-21 03:39:10] [INFO ] Invariant cache hit.
[2024-05-21 03:39:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 03:39:10] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1517 places, 275/1944 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 462 ms. Remains : 119/1517 places, 275/1944 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 19813 steps (2075 resets) in 285 ms. (69 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering criterion allowed to conclude after 582 steps with 57 reset in 9 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-00 finished in 73703 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(G(p1))))'
Support contains 4 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1560 transition count 1994
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1560 transition count 1994
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 1560 transition count 1992
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 74 place count 1542 transition count 1974
Iterating global reduction 1 with 18 rules applied. Total rules applied 92 place count 1542 transition count 1974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 1542 transition count 1973
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 104 place count 1531 transition count 1961
Iterating global reduction 2 with 11 rules applied. Total rules applied 115 place count 1531 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 1531 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 1526 transition count 1954
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 1526 transition count 1954
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 1521 transition count 1948
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 1521 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 1518 transition count 1945
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 1518 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 1515 transition count 1941
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 1515 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 1512 transition count 1936
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 1510 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 1510 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 1509 transition count 1931
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 1509 transition count 1931
Applied a total of 162 rules in 563 ms. Remains 1509 /1587 variables (removed 78) and now considering 1931/2021 (removed 90) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 03:39:11] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 03:39:11] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 03:39:11] [INFO ] Invariant cache hit.
[2024-05-21 03:39:12] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 03:39:12] [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, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1587 places, 1931/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62283 ms. Remains : 1509/1587 places, 1931/2021 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-01 finished in 62465 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)))'
Support contains 2 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1559 transition count 1993
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1559 transition count 1993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 1559 transition count 1991
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 1541 transition count 1973
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 1541 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 1541 transition count 1972
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 105 place count 1531 transition count 1961
Iterating global reduction 2 with 10 rules applied. Total rules applied 115 place count 1531 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 1531 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 1527 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 1527 transition count 1955
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 1522 transition count 1949
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 1522 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 1519 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 1519 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 1516 transition count 1942
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 1516 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 1513 transition count 1937
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 1511 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 1511 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 1510 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 1510 transition count 1932
Applied a total of 160 rules in 518 ms. Remains 1510 /1587 variables (removed 77) and now considering 1932/2021 (removed 89) transitions.
// Phase 1: matrix 1932 rows 1510 cols
[2024-05-21 03:40:13] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 03:40:14] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 03:40:14] [INFO ] Invariant cache hit.
[2024-05-21 03:40:14] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 03:40:14] [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, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 1)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60612ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1587 places, 1932/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62250 ms. Remains : 1510/1587 places, 1932/2021 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 467 ms.
Product exploration explored 100000 steps with 50000 reset in 433 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2109 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-302-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-03 finished in 63341 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((p1 U p2)))))'
Support contains 6 out of 1587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1920 edges and 1587 vertex of which 692 / 1587 are part of one of the 62 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1464 edges and 957 vertex of which 948 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 527 transitions
Trivial Post-agglo rules discarded 527 transitions
Performed 527 trivial Post agglomeration. Transition count delta: 527
Iterating post reduction 0 with 527 rules applied. Total rules applied 529 place count 947 transition count 758
Reduce places removed 527 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 553 rules applied. Total rules applied 1082 place count 420 transition count 732
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 1095 place count 408 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1096 place count 407 transition count 731
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1096 place count 407 transition count 685
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1188 place count 361 transition count 685
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1204 place count 345 transition count 662
Iterating global reduction 4 with 16 rules applied. Total rules applied 1220 place count 345 transition count 662
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 1222 place count 345 transition count 660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1224 place count 343 transition count 660
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1224 place count 343 transition count 659
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1226 place count 342 transition count 659
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1236 place count 332 transition count 647
Iterating global reduction 6 with 10 rules applied. Total rules applied 1246 place count 332 transition count 647
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 1254 place count 332 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1255 place count 331 transition count 639
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1258 place count 328 transition count 634
Iterating global reduction 8 with 3 rules applied. Total rules applied 1261 place count 328 transition count 634
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1262 place count 327 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 1263 place count 327 transition count 633
Performed 146 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 8 with 292 rules applied. Total rules applied 1555 place count 181 transition count 404
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1570 place count 181 transition count 389
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1577 place count 174 transition count 378
Iterating global reduction 9 with 7 rules applied. Total rules applied 1584 place count 174 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1585 place count 174 transition count 377
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1587 place count 172 transition count 373
Iterating global reduction 10 with 2 rules applied. Total rules applied 1589 place count 172 transition count 373
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1591 place count 170 transition count 369
Iterating global reduction 10 with 2 rules applied. Total rules applied 1593 place count 170 transition count 369
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1595 place count 168 transition count 365
Iterating global reduction 10 with 2 rules applied. Total rules applied 1597 place count 168 transition count 365
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1599 place count 166 transition count 361
Iterating global reduction 10 with 2 rules applied. Total rules applied 1601 place count 166 transition count 361
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 10 with 24 rules applied. Total rules applied 1625 place count 154 transition count 347
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1639 place count 154 transition count 333
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1640 place count 153 transition count 331
Iterating global reduction 11 with 1 rules applied. Total rules applied 1641 place count 153 transition count 331
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1675 place count 136 transition count 371
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 1698 place count 136 transition count 348
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 1708 place count 126 transition count 325
Iterating global reduction 12 with 10 rules applied. Total rules applied 1718 place count 126 transition count 325
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1723 place count 126 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 13 with 38 rules applied. Total rules applied 1761 place count 126 transition count 282
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1762 place count 126 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1763 place count 125 transition count 281
Applied a total of 1763 rules in 84 ms. Remains 125 /1587 variables (removed 1462) and now considering 281/2021 (removed 1740) transitions.
[2024-05-21 03:41:16] [INFO ] Flow matrix only has 225 transitions (discarded 56 similar events)
// Phase 1: matrix 225 rows 125 cols
[2024-05-21 03:41:16] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 03:41:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 03:41:16] [INFO ] Flow matrix only has 225 transitions (discarded 56 similar events)
[2024-05-21 03:41:16] [INFO ] Invariant cache hit.
[2024-05-21 03:41:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 03:41:16] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [12, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 170 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/1587 places, 281/2021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 279
Applied a total of 4 rules in 6 ms. Remains 121 /123 variables (removed 2) and now considering 279/281 (removed 2) transitions.
[2024-05-21 03:41:16] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
// Phase 1: matrix 223 rows 121 cols
[2024-05-21 03:41:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:41:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 03:41:16] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
[2024-05-21 03:41:16] [INFO ] Invariant cache hit.
[2024-05-21 03:41:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 03:41:17] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/1587 places, 279/2021 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 411 ms. Remains : 121/1587 places, 279/2021 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-05
Stuttering criterion allowed to conclude after 48075 steps with 3709 reset in 113 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-05 finished in 645 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 U p1))))'
Support contains 3 out of 1587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1927 edges and 1587 vertex of which 707 / 1587 are part of one of the 63 SCC in 2 ms
Free SCC test removed 644 places
Ensure Unique test removed 747 transitions
Reduce isomorphic transitions removed 747 transitions.
Graph (complete) has 1447 edges and 943 vertex of which 934 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 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 521 place count 933 transition count 749
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 545 rules applied. Total rules applied 1066 place count 414 transition count 723
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 1079 place count 402 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1080 place count 401 transition count 722
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1080 place count 401 transition count 677
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1170 place count 356 transition count 677
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1186 place count 340 transition count 654
Iterating global reduction 4 with 16 rules applied. Total rules applied 1202 place count 340 transition count 654
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 1204 place count 340 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1206 place count 338 transition count 652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1206 place count 338 transition count 651
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1208 place count 337 transition count 651
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1217 place count 328 transition count 641
Iterating global reduction 6 with 9 rules applied. Total rules applied 1226 place count 328 transition count 641
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 1234 place count 328 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1235 place count 327 transition count 633
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1238 place count 324 transition count 628
Iterating global reduction 8 with 3 rules applied. Total rules applied 1241 place count 324 transition count 628
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1242 place count 323 transition count 627
Iterating global reduction 8 with 1 rules applied. Total rules applied 1243 place count 323 transition count 627
Performed 149 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 8 with 298 rules applied. Total rules applied 1541 place count 174 transition count 391
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1555 place count 174 transition count 377
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1562 place count 167 transition count 366
Iterating global reduction 9 with 7 rules applied. Total rules applied 1569 place count 167 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1570 place count 167 transition count 365
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1572 place count 165 transition count 361
Iterating global reduction 10 with 2 rules applied. Total rules applied 1574 place count 165 transition count 361
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1576 place count 163 transition count 357
Iterating global reduction 10 with 2 rules applied. Total rules applied 1578 place count 163 transition count 357
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1580 place count 161 transition count 353
Iterating global reduction 10 with 2 rules applied. Total rules applied 1582 place count 161 transition count 353
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1584 place count 159 transition count 349
Iterating global reduction 10 with 2 rules applied. Total rules applied 1586 place count 159 transition count 349
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1587 place count 158 transition count 342
Iterating global reduction 10 with 1 rules applied. Total rules applied 1588 place count 158 transition count 342
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 10 with 24 rules applied. Total rules applied 1612 place count 146 transition count 328
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1625 place count 146 transition count 315
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1626 place count 145 transition count 310
Iterating global reduction 11 with 1 rules applied. Total rules applied 1627 place count 145 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1661 place count 128 transition count 344
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1677 place count 128 transition count 328
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1686 place count 119 transition count 310
Iterating global reduction 12 with 9 rules applied. Total rules applied 1695 place count 119 transition count 310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1701 place count 119 transition count 304
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 1737 place count 119 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1738 place count 118 transition count 267
Applied a total of 1738 rules in 76 ms. Remains 118 /1587 variables (removed 1469) and now considering 267/2021 (removed 1754) transitions.
[2024-05-21 03:41:17] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 118 cols
[2024-05-21 03:41:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 03:41:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 03:41:17] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-21 03:41:17] [INFO ] Invariant cache hit.
[2024-05-21 03:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:41:17] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [8, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 170 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1587 places, 267/2021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 265
Applied a total of 4 rules in 4 ms. Remains 114 /116 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-21 03:41:17] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 114 cols
[2024-05-21 03:41:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 03:41:17] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 03:41:17] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 03:41:17] [INFO ] Invariant cache hit.
[2024-05-21 03:41:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:41:17] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1587 places, 265/2021 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 397 ms. Remains : 114/1587 places, 265/2021 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-06 finished in 497 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 U !p1) U (X(p2) U p2))||(p3 U p1))))'
Support contains 7 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1564 transition count 1998
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1564 transition count 1998
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 1564 transition count 1996
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 1549 transition count 1981
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 1549 transition count 1981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 1549 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 86 place count 1542 transition count 1972
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 1542 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 1542 transition count 1971
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 1538 transition count 1967
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 1538 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 1534 transition count 1962
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 1534 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 1532 transition count 1960
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 1532 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 1530 transition count 1957
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 1530 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 1528 transition count 1953
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 1528 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 1526 transition count 1950
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 1526 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 1526 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 1525 transition count 1948
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 1525 transition count 1948
Applied a total of 129 rules in 484 ms. Remains 1525 /1587 variables (removed 62) and now considering 1948/2021 (removed 73) transitions.
// Phase 1: matrix 1948 rows 1525 cols
[2024-05-21 03:41:18] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 03:41:18] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 03:41:18] [INFO ] Invariant cache hit.
[2024-05-21 03:41:19] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2024-05-21 03:41:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1524/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1524/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60575ms
Starting structural reductions in LTL mode, iteration 1 : 1525/1587 places, 1948/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62236 ms. Remains : 1525/1587 places, 1948/2021 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), true, p1]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 481 ms.
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2125 edges and 1525 vertex of which 1516 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p3 p2 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-302-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-08 finished in 63469 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(X(G(p0)))))'
Support contains 2 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1559 transition count 1993
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1559 transition count 1993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 1559 transition count 1991
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 1541 transition count 1973
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 1541 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 1541 transition count 1972
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 105 place count 1531 transition count 1961
Iterating global reduction 2 with 10 rules applied. Total rules applied 115 place count 1531 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 1531 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 1527 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 1527 transition count 1955
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 1523 transition count 1950
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 1523 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 1521 transition count 1948
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 1521 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 1519 transition count 1946
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 1519 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 1517 transition count 1943
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 1517 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 1516 transition count 1941
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 1515 transition count 1940
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 1515 transition count 1940
Applied a total of 149 rules in 482 ms. Remains 1515 /1587 variables (removed 72) and now considering 1940/2021 (removed 81) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2024-05-21 03:42:21] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 03:42:21] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 03:42:21] [INFO ] Invariant cache hit.
[2024-05-21 03:42:22] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 03:42:22] [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/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 0)
(s186 1)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(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 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(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 0)
(s700 1)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 0)
(s706 0)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 0)
(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 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 1)
(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 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60567ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1587 places, 1940/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62225 ms. Remains : 1515/1587 places, 1940/2021 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-09
Product exploration explored 100000 steps with 708 reset in 162 ms.
Product exploration explored 100000 steps with 715 reset in 161 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (294 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (77 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 439314 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 439314 steps, saw 108922 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-21 03:43:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3455/3455 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1356 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3455 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3455/3455 variables, and 1520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1227 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2594ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 95 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Applied a total of 0 rules in 43 ms. Remains 1515 /1515 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2024-05-21 03:43:30] [INFO ] Invariant cache hit.
[2024-05-21 03:43:30] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 03:43:30] [INFO ] Invariant cache hit.
[2024-05-21 03:43:31] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 03:43:31] [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 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.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 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.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 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 1.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 1.0)
(s1101 0.0)
(s1102 1.0)
(s1103 0.0)
(s1104 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60623ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60640ms
Finished structural reductions in LTL mode , in 1 iterations and 61857 ms. Remains : 1515/1515 places, 1940/1940 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (285 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (75 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442844 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442844 steps, saw 109885 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-05-21 03:44:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3455/3455 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1363 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3455 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3455/3455 variables, and 1520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1211 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2616ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=117 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 705 reset in 131 ms.
Product exploration explored 100000 steps with 698 reset in 130 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Graph (trivial) has 1849 edges and 1515 vertex of which 693 / 1515 are part of one of the 63 SCC in 5 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 885 vertex of which 876 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 876 transition count 1203
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 490 place count 876 transition count 1192
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 490 place count 876 transition count 1205
Deduced a syphon composed of 498 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 511 place count 876 transition count 1205
Discarding 285 places :
Symmetric choice reduction at 2 with 285 rule applications. Total rules 796 place count 591 transition count 910
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 2 with 285 rules applied. Total rules applied 1081 place count 591 transition count 910
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1093 place count 579 transition count 894
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1105 place count 579 transition count 894
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1111 place count 579 transition count 888
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1123 place count 567 transition count 876
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1135 place count 567 transition count 876
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1137 place count 565 transition count 872
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1139 place count 565 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1141 place count 563 transition count 868
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1143 place count 563 transition count 868
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1147 place count 559 transition count 864
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1151 place count 559 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1153 place count 557 transition count 860
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1155 place count 557 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1157 place count 555 transition count 856
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1159 place count 555 transition count 856
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1163 place count 551 transition count 850
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1167 place count 551 transition count 850
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1171 place count 547 transition count 834
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1175 place count 547 transition count 834
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1176 place count 547 transition count 834
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1180 place count 543 transition count 830
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1184 place count 543 transition count 830
Performed 106 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 316 places in 1 ms
Iterating global reduction 4 with 106 rules applied. Total rules applied 1290 place count 543 transition count 908
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1329 place count 543 transition count 869
Discarding 99 places :
Symmetric choice reduction at 5 with 99 rule applications. Total rules 1428 place count 444 transition count 760
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 99 rules applied. Total rules applied 1527 place count 444 transition count 760
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1533 place count 438 transition count 751
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1539 place count 438 transition count 751
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1546 place count 438 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 1550 place count 438 transition count 747
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1565 place count 423 transition count 728
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1580 place count 423 transition count 728
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1586 place count 423 transition count 722
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1590 place count 419 transition count 718
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1594 place count 419 transition count 718
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 1597 place count 419 transition count 718
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1603 place count 419 transition count 712
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1606 place count 416 transition count 709
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1609 place count 416 transition count 709
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 1680 place count 416 transition count 1035
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 8 with 125 rules applied. Total rules applied 1805 place count 416 transition count 910
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1930 place count 291 transition count 582
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2055 place count 291 transition count 582
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2070 place count 291 transition count 567
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2097 place count 264 transition count 509
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2124 place count 264 transition count 509
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2127 place count 264 transition count 553
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2131 place count 264 transition count 549
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2135 place count 260 transition count 521
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2139 place count 260 transition count 521
Deduced a syphon composed of 140 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 11 with 45 rules applied. Total rules applied 2184 place count 260 transition count 476
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2188 place count 256 transition count 472
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2192 place count 256 transition count 472
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2195 place count 256 transition count 532
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2198 place count 253 transition count 517
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2201 place count 253 transition count 517
Deduced a syphon composed of 136 places in 1 ms
Applied a total of 2201 rules in 379 ms. Remains 253 /1515 variables (removed 1262) and now considering 517/1940 (removed 1423) transitions.
[2024-05-21 03:44:39] [INFO ] Redundant transitions in 36 ms returned []
Running 516 sub problems to find dead transitions.
[2024-05-21 03:44:39] [INFO ] Flow matrix only has 460 transitions (discarded 57 similar events)
// Phase 1: matrix 460 rows 253 cols
[2024-05-21 03:44:39] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 03:44:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem 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 TDEAD172 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 TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem 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 TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
At refinement iteration 1 (OVERLAPS) 459/711 variables, 252/252 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/711 variables, 2/254 constraints. Problems are: Problem set: 248 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/711 variables, 0/254 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 1/712 variables, 1/255 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/712 variables, 0/255 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 1/713 variables, 1/256 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/256 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/713 variables, 0/256 constraints. Problems are: Problem set: 248 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 256 constraints, problems are : Problem set: 248 solved, 268 unsolved in 18398 ms.
Refiners :[State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 248 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 456/572 variables, 116/116 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 2/118 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 268/386 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/386 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 140/712 variables, 137/523 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/523 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/713 variables, 1/524 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/524 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/713 variables, 0/524 constraints. Problems are: Problem set: 248 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 713/713 variables, and 524 constraints, problems are : Problem set: 248 solved, 268 unsolved in 22924 ms.
Refiners :[State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 268/516 constraints, Known Traps: 0/0 constraints]
After SMT, in 41588ms problems are : Problem set: 248 solved, 268 unsolved
Search for dead transitions found 248 dead transitions in 41594ms
Found 248 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 248 transitions
Dead transitions reduction (with SMT) removed 248 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 253/1515 places, 269/1940 transitions.
Graph (complete) has 418 edges and 253 vertex of which 117 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 117 /253 variables (removed 136) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1515 places, 269/1940 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42040 ms. Remains : 117/1515 places, 269/1940 transitions.
Built C files in :
/tmp/ltsmin9443361741966487934
[2024-05-21 03:45:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9443361741966487934
Running compilation step : cd /tmp/ltsmin9443361741966487934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9443361741966487934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9443361741966487934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Applied a total of 0 rules in 37 ms. Remains 1515 /1515 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2024-05-21 03:45:24] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 03:45:24] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 03:45:24] [INFO ] Invariant cache hit.
[2024-05-21 03:45:25] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 03:45:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Finished structural reductions in LTL mode , in 1 iterations and 61825 ms. Remains : 1515/1515 places, 1940/1940 transitions.
Built C files in :
/tmp/ltsmin5700816401408065283
[2024-05-21 03:46:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5700816401408065283
Running compilation step : cd /tmp/ltsmin5700816401408065283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5700816401408065283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5700816401408065283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 03:46:29] [INFO ] Flatten gal took : 72 ms
[2024-05-21 03:46:29] [INFO ] Flatten gal took : 67 ms
[2024-05-21 03:46:29] [INFO ] Time to serialize gal into /tmp/LTL4880329861263756199.gal : 32 ms
[2024-05-21 03:46:29] [INFO ] Time to serialize properties into /tmp/LTL4099515813731172193.prop : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4880329861263756199.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16145364856718112972.hoa' '-atoms' '/tmp/LTL4099515813731172193.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4099515813731172193.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16145364856718112972.hoa
Detected timeout of ITS tools.
[2024-05-21 03:46:44] [INFO ] Flatten gal took : 42 ms
[2024-05-21 03:46:44] [INFO ] Flatten gal took : 38 ms
[2024-05-21 03:46:44] [INFO ] Time to serialize gal into /tmp/LTL3365424558915483592.gal : 8 ms
[2024-05-21 03:46:44] [INFO ] Time to serialize properties into /tmp/LTL16759145757084116611.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3365424558915483592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16759145757084116611.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("((p2351==0)||(p1581==1))"))))))
Formula 0 simplified : XXXF!"((p2351==0)||(p1581==1))"
Detected timeout of ITS tools.
[2024-05-21 03:46:59] [INFO ] Flatten gal took : 37 ms
[2024-05-21 03:46:59] [INFO ] Applying decomposition
[2024-05-21 03:46:59] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7077509180937819431.txt' '-o' '/tmp/graph7077509180937819431.bin' '-w' '/tmp/graph7077509180937819431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7077509180937819431.bin' '-l' '-1' '-v' '-w' '/tmp/graph7077509180937819431.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:47:00] [INFO ] Decomposing Gal with order
[2024-05-21 03:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:47:00] [INFO ] Removed a total of 505 redundant transitions.
[2024-05-21 03:47:00] [INFO ] Flatten gal took : 194 ms
[2024-05-21 03:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 33 ms.
[2024-05-21 03:47:00] [INFO ] Time to serialize gal into /tmp/LTL3624351578555241712.gal : 20 ms
[2024-05-21 03:47:00] [INFO ] Time to serialize properties into /tmp/LTL2496139797901326533.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3624351578555241712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2496139797901326533.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("((i39.i0.i4.u565.p2351==0)||(i27.i0.i2.u373.p1581==1))"))))))
Formula 0 simplified : XXXF!"((i39.i0.i4.u565.p2351==0)||(i27.i0.i2.u373.p1581==1))"
Reverse transition relation is NOT exact ! Due to transitions t26, t203, t287, t347, t396, t468, t521, t677, t758, t818, t868, t940, t991, t1186, t1238, t1...2052
Computing Next relation with stutter on 140576 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
804 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.22503,231992,1,0,422320,6752,22517,839957,577,41216,1468226
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-09 finished in 289055 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)||X(X(F(p1))))))'
Support contains 5 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1561 transition count 1995
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1561 transition count 1995
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 1561 transition count 1993
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 1545 transition count 1977
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 1545 transition count 1976
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 1535 transition count 1965
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 place count 1535 transition count 1965
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 1535 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 1530 transition count 1959
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 1530 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 1526 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 1526 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 1523 transition count 1952
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 1523 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 1520 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 1517 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 1515 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 1514 transition count 1938
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 1514 transition count 1938
Applied a total of 151 rules in 487 ms. Remains 1514 /1587 variables (removed 73) and now considering 1938/2021 (removed 83) transitions.
// Phase 1: matrix 1938 rows 1514 cols
[2024-05-21 03:47:10] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 03:47:11] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 03:47:11] [INFO ] Invariant cache hit.
[2024-05-21 03:47:12] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 03:47:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 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 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60495ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1587 places, 1938/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62283 ms. Remains : 1514/1587 places, 1938/2021 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-10
Product exploration explored 100000 steps with 721 reset in 166 ms.
Product exploration explored 100000 steps with 721 reset in 179 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2115 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (284 resets) in 176 ms. (225 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (74 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 289760 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 4
Probabilistic random walk after 289760 steps, saw 72452 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-21 03:48:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3452/3452 variables, and 1518 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3188 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 4/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3445 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3447 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3447 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3449 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3449 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3451 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3451 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 1/3452 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3452 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/3452 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3452/3452 variables, and 1522 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3335 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6560ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 153 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=76 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Applied a total of 0 rules in 46 ms. Remains 1514 /1514 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2024-05-21 03:48:23] [INFO ] Invariant cache hit.
[2024-05-21 03:48:23] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 03:48:23] [INFO ] Invariant cache hit.
[2024-05-21 03:48:24] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 03:48:24] [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/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60574ms
Finished structural reductions in LTL mode , in 1 iterations and 61793 ms. Remains : 1514/1514 places, 1938/1938 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2115 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (275 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (77 resets) in 368 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (73 resets) in 175 ms. (227 steps per ms) remains 1/4 properties
[2024-05-21 03:49:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3452/3452 variables, and 1518 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1656 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3452/3452 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1355 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3038ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 146 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 696 reset in 137 ms.
Product exploration explored 100000 steps with 717 reset in 152 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Graph (trivial) has 1840 edges and 1514 vertex of which 641 / 1514 are part of one of the 61 SCC in 1 ms
Free SCC test removed 580 places
Ensure Unique test removed 674 transitions
Reduce isomorphic transitions removed 674 transitions.
Graph (complete) has 1437 edges and 934 vertex of which 925 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 925 transition count 1259
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 14 rules applied. Total rules applied 519 place count 925 transition count 1246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 2 rules applied. Total rules applied 521 place count 925 transition count 1245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 522 place count 925 transition count 1244
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 522 place count 925 transition count 1259
Deduced a syphon composed of 530 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 547 place count 925 transition count 1259
Discarding 297 places :
Symmetric choice reduction at 4 with 297 rule applications. Total rules 844 place count 628 transition count 952
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 4 with 297 rules applied. Total rules applied 1141 place count 628 transition count 952
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1150 place count 619 transition count 940
Deduced a syphon composed of 245 places in 1 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1159 place count 619 transition count 940
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1163 place count 619 transition count 936
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1172 place count 610 transition count 927
Deduced a syphon composed of 238 places in 0 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1181 place count 610 transition count 927
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1182 place count 609 transition count 925
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1183 place count 609 transition count 925
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1184 place count 608 transition count 923
Deduced a syphon composed of 238 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1185 place count 608 transition count 923
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1187 place count 606 transition count 921
Deduced a syphon composed of 237 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1189 place count 606 transition count 921
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1190 place count 605 transition count 919
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1191 place count 605 transition count 919
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1192 place count 604 transition count 917
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1193 place count 604 transition count 917
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1194 place count 603 transition count 916
Deduced a syphon composed of 236 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1195 place count 603 transition count 916
Performed 117 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 353 places in 0 ms
Iterating global reduction 5 with 117 rules applied. Total rules applied 1312 place count 603 transition count 993
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 5 with 45 rules applied. Total rules applied 1357 place count 603 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1357 place count 603 transition count 948
Deduced a syphon composed of 354 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 1358 place count 603 transition count 948
Discarding 116 places :
Symmetric choice reduction at 6 with 116 rule applications. Total rules 1474 place count 487 transition count 822
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 6 with 116 rules applied. Total rules applied 1590 place count 487 transition count 822
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1596 place count 481 transition count 813
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1602 place count 481 transition count 813
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 249 places in 0 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1609 place count 481 transition count 813
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1615 place count 481 transition count 807
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1630 place count 466 transition count 788
Deduced a syphon composed of 238 places in 0 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1645 place count 466 transition count 788
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1651 place count 466 transition count 782
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1655 place count 462 transition count 778
Deduced a syphon composed of 234 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1659 place count 462 transition count 778
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1662 place count 462 transition count 778
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1668 place count 462 transition count 772
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1671 place count 459 transition count 769
Deduced a syphon composed of 234 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1674 place count 459 transition count 769
Performed 80 Post agglomeration using F-continuation condition with reduction of 137 identical transitions.
Deduced a syphon composed of 314 places in 1 ms
Iterating global reduction 9 with 80 rules applied. Total rules applied 1754 place count 459 transition count 1143
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 9 with 133 rules applied. Total rules applied 1887 place count 459 transition count 1010
Discarding 138 places :
Symmetric choice reduction at 10 with 138 rule applications. Total rules 2025 place count 321 transition count 639
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 10 with 138 rules applied. Total rules applied 2163 place count 321 transition count 639
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2178 place count 321 transition count 624
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 2205 place count 294 transition count 567
Deduced a syphon composed of 158 places in 0 ms
Iterating global reduction 11 with 27 rules applied. Total rules applied 2232 place count 294 transition count 567
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2236 place count 294 transition count 626
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2241 place count 289 transition count 595
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 11 with 5 rules applied. Total rules applied 2246 place count 289 transition count 595
Deduced a syphon composed of 157 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 11 with 59 rules applied. Total rules applied 2305 place count 289 transition count 536
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2309 place count 285 transition count 532
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2313 place count 285 transition count 532
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2316 place count 285 transition count 592
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2319 place count 282 transition count 577
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2322 place count 282 transition count 577
Deduced a syphon composed of 153 places in 1 ms
Applied a total of 2322 rules in 185 ms. Remains 282 /1514 variables (removed 1232) and now considering 577/1938 (removed 1361) transitions.
[2024-05-21 03:49:30] [INFO ] Redundant transitions in 14 ms returned []
Running 576 sub problems to find dead transitions.
[2024-05-21 03:49:30] [INFO ] Flow matrix only has 522 transitions (discarded 55 similar events)
// Phase 1: matrix 522 rows 282 cols
[2024-05-21 03:49:30] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 03:49:30] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 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 TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 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 TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
At refinement iteration 1 (OVERLAPS) 521/802 variables, 281/281 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/802 variables, 4/285 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/802 variables, 0/285 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 1/803 variables, 1/286 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 0/286 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 1/804 variables, 1/287 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 0/287 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 0/804 variables, 0/287 constraints. Problems are: Problem set: 280 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 287 constraints, problems are : Problem set: 280 solved, 296 unsolved in 22068 ms.
Refiners :[State Equation: 282/282 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 280 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 518/646 variables, 128/128 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/646 variables, 4/132 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/646 variables, 296/428 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 0/428 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 157/803 variables, 154/582 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 0/582 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 1/804 variables, 1/583 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 0/583 constraints. Problems are: Problem set: 280 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 0/804 variables, 0/583 constraints. Problems are: Problem set: 280 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 583 constraints, problems are : Problem set: 280 solved, 296 unsolved in 27984 ms.
Refiners :[State Equation: 282/282 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 296/576 constraints, Known Traps: 0/0 constraints]
After SMT, in 50339ms problems are : Problem set: 280 solved, 296 unsolved
Search for dead transitions found 280 dead transitions in 50346ms
Found 280 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 280 transitions
Dead transitions reduction (with SMT) removed 280 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 282/1514 places, 297/1938 transitions.
Graph (complete) has 456 edges and 282 vertex of which 129 are kept as prefixes of interest. Removing 153 places using SCC suffix rule.1 ms
Discarding 153 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 129 /282 variables (removed 153) and now considering 297/297 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/1514 places, 297/1938 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50571 ms. Remains : 129/1514 places, 297/1938 transitions.
Built C files in :
/tmp/ltsmin6860670132524632250
[2024-05-21 03:50:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6860670132524632250
Running compilation step : cd /tmp/ltsmin6860670132524632250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6860670132524632250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6860670132524632250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Applied a total of 0 rules in 44 ms. Remains 1514 /1514 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
// Phase 1: matrix 1938 rows 1514 cols
[2024-05-21 03:50:23] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 03:50:23] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 03:50:23] [INFO ] Invariant cache hit.
[2024-05-21 03:50:24] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 03:50:24] [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 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Finished structural reductions in LTL mode , in 1 iterations and 61824 ms. Remains : 1514/1514 places, 1938/1938 transitions.
Built C files in :
/tmp/ltsmin13626453549426609017
[2024-05-21 03:51:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13626453549426609017
Running compilation step : cd /tmp/ltsmin13626453549426609017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13626453549426609017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13626453549426609017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 03:51:28] [INFO ] Flatten gal took : 32 ms
[2024-05-21 03:51:28] [INFO ] Flatten gal took : 34 ms
[2024-05-21 03:51:28] [INFO ] Time to serialize gal into /tmp/LTL18394402885957521665.gal : 5 ms
[2024-05-21 03:51:28] [INFO ] Time to serialize properties into /tmp/LTL17696722691425449920.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18394402885957521665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3888517114913216824.hoa' '-atoms' '/tmp/LTL17696722691425449920.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17696722691425449920.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3888517114913216824.hoa
Detected timeout of ITS tools.
[2024-05-21 03:51:43] [INFO ] Flatten gal took : 32 ms
[2024-05-21 03:51:43] [INFO ] Flatten gal took : 36 ms
[2024-05-21 03:51:43] [INFO ] Time to serialize gal into /tmp/LTL1445750339401884979.gal : 6 ms
[2024-05-21 03:51:43] [INFO ] Time to serialize properties into /tmp/LTL16808931289287688580.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1445750339401884979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16808931289287688580.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p2241==0)||(p254==1))"))||(X(X(F("(((p625==0)&&(p2241==1))&&((p494==0)&&(p1601==1)))")))))))
Formula 0 simplified : G(F!"((p2241==0)||(p254==1))" & XXG!"(((p625==0)&&(p2241==1))&&((p494==0)&&(p1601==1)))")
Detected timeout of ITS tools.
[2024-05-21 03:51:58] [INFO ] Flatten gal took : 41 ms
[2024-05-21 03:51:58] [INFO ] Applying decomposition
[2024-05-21 03:51:58] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10589766119859360090.txt' '-o' '/tmp/graph10589766119859360090.bin' '-w' '/tmp/graph10589766119859360090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10589766119859360090.bin' '-l' '-1' '-v' '-w' '/tmp/graph10589766119859360090.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:51:58] [INFO ] Decomposing Gal with order
[2024-05-21 03:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:51:59] [INFO ] Removed a total of 521 redundant transitions.
[2024-05-21 03:51:59] [INFO ] Flatten gal took : 65 ms
[2024-05-21 03:51:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 23 ms.
[2024-05-21 03:51:59] [INFO ] Time to serialize gal into /tmp/LTL4889477483406044684.gal : 12 ms
[2024-05-21 03:51:59] [INFO ] Time to serialize properties into /tmp/LTL600006652963529499.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4889477483406044684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL600006652963529499.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("((i33.i0.i0.u552.p2241==0)||(i2.i2.i3.u50.p254==1))"))||(X(X(F("(((i7.i1.i2.u133.p625==0)&&(i33.i0.i0.u552.p2241==1))&&((i6.u...203
Formula 0 simplified : G(F!"((i33.i0.i0.u552.p2241==0)||(i2.i2.i3.u50.p254==1))" & XXG!"(((i7.i1.i2.u133.p625==0)&&(i33.i0.i0.u552.p2241==1))&&((i6.u97.p49...191
Reverse transition relation is NOT exact ! Due to transitions t26, t232, t287, t318, t347, t396, t468, t521, t706, t758, t789, t818, t940, t991, t1238, t12...2199
Computing Next relation with stutter on 140576 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-10 finished in 303959 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(p0))))'
Support contains 1 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1559 transition count 1993
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1559 transition count 1993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1559 transition count 1992
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 76 place count 1540 transition count 1973
Iterating global reduction 1 with 19 rules applied. Total rules applied 95 place count 1540 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 1540 transition count 1972
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 107 place count 1529 transition count 1960
Iterating global reduction 2 with 11 rules applied. Total rules applied 118 place count 1529 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 1529 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 125 place count 1524 transition count 1953
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 1524 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 135 place count 1519 transition count 1947
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 1516 transition count 1944
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 1513 transition count 1940
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 1513 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 1510 transition count 1935
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 160 place count 1508 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 1508 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 1507 transition count 1930
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 1507 transition count 1930
Applied a total of 165 rules in 514 ms. Remains 1507 /1587 variables (removed 80) and now considering 1930/2021 (removed 91) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 03:52:14] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 03:52:15] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 03:52:15] [INFO ] Invariant cache hit.
[2024-05-21 03:52:15] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 03:52:15] [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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1587 places, 1930/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62264 ms. Remains : 1507/1587 places, 1930/2021 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-14
Product exploration explored 100000 steps with 717 reset in 125 ms.
Product exploration explored 100000 steps with 698 reset in 158 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (281 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 435217 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 435217 steps, saw 108002 distinct states, run finished after 3002 ms. (steps per millisecond=144 ) properties seen :0
[2024-05-21 03:53:20] [INFO ] Invariant cache hit.
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) 416/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1635 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1282 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2928ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 49 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 03:53:23] [INFO ] Invariant cache hit.
[2024-05-21 03:53:23] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 03:53:23] [INFO ] Invariant cache hit.
[2024-05-21 03:53:24] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 03:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60567ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Finished structural reductions in LTL mode , in 1 iterations and 61744 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (288 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (79 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 444996 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 444996 steps, saw 110444 distinct states, run finished after 3002 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-21 03:54:28] [INFO ] Invariant cache hit.
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) 416/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1613 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1254 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2888ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 91 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=91 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 55538 steps with 394 reset in 76 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-14 finished in 137843 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)||X(X(F(p1))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-302-LTLCardinality-10
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1922 edges and 1587 vertex of which 654 / 1587 are part of one of the 61 SCC in 1 ms
Free SCC test removed 593 places
Ensure Unique test removed 688 transitions
Reduce isomorphic transitions removed 688 transitions.
Graph (complete) has 1508 edges and 994 vertex of which 985 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 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 549 rules applied. Total rules applied 551 place count 984 transition count 778
Reduce places removed 549 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 578 rules applied. Total rules applied 1129 place count 435 transition count 749
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 1145 place count 421 transition count 747
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 1148 place count 420 transition count 745
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 1152 place count 419 transition count 742
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1155 place count 417 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1156 place count 416 transition count 741
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 1156 place count 416 transition count 690
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 1258 place count 365 transition count 690
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1273 place count 350 transition count 667
Iterating global reduction 7 with 15 rules applied. Total rules applied 1288 place count 350 transition count 667
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 1290 place count 350 transition count 665
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1292 place count 348 transition count 665
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1292 place count 348 transition count 664
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1294 place count 347 transition count 664
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1302 place count 339 transition count 654
Iterating global reduction 9 with 8 rules applied. Total rules applied 1310 place count 339 transition count 654
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 1316 place count 339 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1317 place count 338 transition count 648
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1320 place count 335 transition count 643
Iterating global reduction 11 with 3 rules applied. Total rules applied 1323 place count 335 transition count 643
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1324 place count 334 transition count 642
Iterating global reduction 11 with 1 rules applied. Total rules applied 1325 place count 334 transition count 642
Performed 147 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 11 with 294 rules applied. Total rules applied 1619 place count 187 transition count 413
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1635 place count 187 transition count 397
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 1642 place count 180 transition count 386
Iterating global reduction 12 with 7 rules applied. Total rules applied 1649 place count 180 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1650 place count 180 transition count 385
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1652 place count 178 transition count 381
Iterating global reduction 13 with 2 rules applied. Total rules applied 1654 place count 178 transition count 381
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1655 place count 177 transition count 379
Iterating global reduction 13 with 1 rules applied. Total rules applied 1656 place count 177 transition count 379
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1657 place count 176 transition count 377
Iterating global reduction 13 with 1 rules applied. Total rules applied 1658 place count 176 transition count 377
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1659 place count 175 transition count 375
Iterating global reduction 13 with 1 rules applied. Total rules applied 1660 place count 175 transition count 375
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 26 rules applied. Total rules applied 1686 place count 162 transition count 360
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 1700 place count 162 transition count 346
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1701 place count 161 transition count 344
Iterating global reduction 14 with 1 rules applied. Total rules applied 1702 place count 161 transition count 344
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 14 with 46 rules applied. Total rules applied 1748 place count 138 transition count 393
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 14 with 31 rules applied. Total rules applied 1779 place count 138 transition count 362
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1788 place count 129 transition count 344
Iterating global reduction 15 with 9 rules applied. Total rules applied 1797 place count 129 transition count 344
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1803 place count 129 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1804 place count 128 transition count 337
Applied a total of 1804 rules in 80 ms. Remains 128 /1587 variables (removed 1459) and now considering 337/2021 (removed 1684) transitions.
[2024-05-21 03:54:32] [INFO ] Flow matrix only has 282 transitions (discarded 55 similar events)
// Phase 1: matrix 282 rows 128 cols
[2024-05-21 03:54:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 03:54:32] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-21 03:54:32] [INFO ] Flow matrix only has 282 transitions (discarded 55 similar events)
[2024-05-21 03:54:32] [INFO ] Invariant cache hit.
[2024-05-21 03:54:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:54:32] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [15, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 460 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 126/1587 places, 337/2021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 335
Applied a total of 4 rules in 3 ms. Remains 124 /126 variables (removed 2) and now considering 335/337 (removed 2) transitions.
[2024-05-21 03:54:32] [INFO ] Flow matrix only has 280 transitions (discarded 55 similar events)
// Phase 1: matrix 280 rows 124 cols
[2024-05-21 03:54:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:54:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 03:54:32] [INFO ] Flow matrix only has 280 transitions (discarded 55 similar events)
[2024-05-21 03:54:32] [INFO ] Invariant cache hit.
[2024-05-21 03:54:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:54:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 124/1587 places, 335/2021 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 718 ms. Remains : 124/1587 places, 335/2021 transitions.
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-10
Stuttering criterion allowed to conclude after 6913 steps with 608 reset in 12 ms.
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-10 finished in 956 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 03:54:33] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11951132841666578475
[2024-05-21 03:54:33] [INFO ] Too many transitions (2021) to apply POR reductions. Disabling POR matrices.
[2024-05-21 03:54:33] [INFO ] Applying decomposition
[2024-05-21 03:54:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11951132841666578475
Running compilation step : cd /tmp/ltsmin11951132841666578475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 03:54:33] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5543255519208619017.txt' '-o' '/tmp/graph5543255519208619017.bin' '-w' '/tmp/graph5543255519208619017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5543255519208619017.bin' '-l' '-1' '-v' '-w' '/tmp/graph5543255519208619017.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:54:33] [INFO ] Decomposing Gal with order
[2024-05-21 03:54:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:54:33] [INFO ] Removed a total of 526 redundant transitions.
[2024-05-21 03:54:33] [INFO ] Flatten gal took : 128 ms
[2024-05-21 03:54:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 31 ms.
[2024-05-21 03:54:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality17747509179499831034.gal : 45 ms
[2024-05-21 03:54:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality13673588582184710621.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17747509179499831034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13673588582184710621.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F((G("((i33.i2.i0.u587.p2241==0)||(i5.i1.i0.u54.p254==1))"))||(X(X(F("(((i9.i1.i2.u146.p625==0)&&(i33.i2.i0.u587.p2241==1))&&((i7.i...210
Formula 0 simplified : G(F!"((i33.i2.i0.u587.p2241==0)||(i5.i1.i0.u54.p254==1))" & XXG!"(((i9.i1.i2.u146.p625==0)&&(i33.i2.i0.u587.p2241==1))&&((i7.i1.i0.u...198
Compilation finished in 4841 ms.
Running link step : cd /tmp/ltsmin11951132841666578475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin11951132841666578475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t26, t203, t232, t287, t318, t396, t468, t518, t521, t677, t706, t758, t789, t868, t940, t991...2264
Computing Next relation with stutter on 147296 deadlock states
LTSmin run took 26145 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1104751 ms.

BK_STOP 1716263704247

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600