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.r496-tall-171640603100323.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-c128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c128-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717195132031

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:38:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:38:53] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2024-05-31 22:38:53] [INFO ] Transformed 2826 places.
[2024-05-31 22:38:53] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:38:53] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3708
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3708
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 967 place count 1317 transition count 3346
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1120 place count 1164 transition count 3040
Iterating global reduction 2 with 153 rules applied. Total rules applied 1273 place count 1164 transition count 3040
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1345 place count 1164 transition count 2968
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1358 place count 1151 transition count 2942
Iterating global reduction 3 with 13 rules applied. Total rules applied 1371 place count 1151 transition count 2942
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1383 place count 1139 transition count 2918
Iterating global reduction 3 with 12 rules applied. Total rules applied 1395 place count 1139 transition count 2918
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1407 place count 1127 transition count 2894
Iterating global reduction 3 with 12 rules applied. Total rules applied 1419 place count 1127 transition count 2894
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1431 place count 1115 transition count 2870
Iterating global reduction 3 with 12 rules applied. Total rules applied 1443 place count 1115 transition count 2870
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1455 place count 1103 transition count 2846
Iterating global reduction 3 with 12 rules applied. Total rules applied 1467 place count 1103 transition count 2846
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1478 place count 1092 transition count 2824
Iterating global reduction 3 with 11 rules applied. Total rules applied 1489 place count 1092 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1500 place count 1081 transition count 2802
Iterating global reduction 3 with 11 rules applied. Total rules applied 1511 place count 1081 transition count 2802
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1553 place count 1039 transition count 2646
Iterating global reduction 3 with 42 rules applied. Total rules applied 1595 place count 1039 transition count 2646
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1649 place count 985 transition count 2430
Iterating global reduction 3 with 54 rules applied. Total rules applied 1703 place count 985 transition count 2430
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1757 place count 931 transition count 2286
Iterating global reduction 3 with 54 rules applied. Total rules applied 1811 place count 931 transition count 2286
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1865 place count 877 transition count 2178
Iterating global reduction 3 with 54 rules applied. Total rules applied 1919 place count 877 transition count 2178
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1973 place count 823 transition count 2070
Iterating global reduction 3 with 54 rules applied. Total rules applied 2027 place count 823 transition count 2070
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2081 place count 769 transition count 1962
Iterating global reduction 3 with 54 rules applied. Total rules applied 2135 place count 769 transition count 1962
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2183 place count 721 transition count 1866
Iterating global reduction 3 with 48 rules applied. Total rules applied 2231 place count 721 transition count 1866
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2249 place count 703 transition count 1830
Iterating global reduction 3 with 18 rules applied. Total rules applied 2267 place count 703 transition count 1830
Applied a total of 2267 rules in 1286 ms. Remains 703 /1628 variables (removed 925) and now considering 1830/5962 (removed 4132) transitions.
[2024-05-31 22:38:55] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
// Phase 1: matrix 1231 rows 703 cols
[2024-05-31 22:38:55] [INFO ] Computed 2 invariants in 32 ms
[2024-05-31 22:38:56] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-31 22:38:56] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-31 22:38:56] [INFO ] Invariant cache hit.
[2024-05-31 22:38:56] [INFO ] State equation strengthened by 304 read => feed constraints.
[2024-05-31 22:39:06] [INFO ] Implicit Places using invariants and state equation in 9874 ms returned []
Implicit Place search using SMT with State Equation took 10785 ms to find 0 implicit places.
Running 1828 sub problems to find dead transitions.
[2024-05-31 22:39:06] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-31 22:39:06] [INFO ] Invariant cache hit.
[2024-05-31 22:39:06] [INFO ] State equation strengthened by 304 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
(s642 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 22.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.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 1.0)
(s185 1.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 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.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 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1934 variables, and 2 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/703 constraints, ReadFeed: 0/304 constraints, PredecessorRefiner: 1828/1828 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1828 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 3 (OVERLAPS) 1231/1934 variables, 703/705 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1934 variables, 304/1009 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1934/1934 variables, and 2837 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 31839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 constraints, PredecessorRefiner: 1828/1828 constraints, Known Traps: 0/0 constraints]
After SMT, in 70609ms problems are : Problem set: 0 solved, 1828 unsolved
Search for dead transitions found 0 dead transitions in 70642ms
Starting structural reductions in LTL mode, iteration 1 : 703/1628 places, 1830/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82755 ms. Remains : 703/1628 places, 1830/5962 transitions.
Support contains 23 out of 703 places after structural reductions.
[2024-05-31 22:40:17] [INFO ] Flatten gal took : 145 ms
[2024-05-31 22:40:17] [INFO ] Flatten gal took : 98 ms
[2024-05-31 22:40:17] [INFO ] Input system was already deterministic with 1830 transitions.
RANDOM walk for 40076 steps (8 resets) in 1656 ms. (24 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40003 steps (14 resets) in 239 ms. (166 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 101 ms. (392 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 88 ms. (449 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
[2024-05-31 22:40:18] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-31 22:40:18] [INFO ] Invariant cache hit.
[2024-05-31 22:40:18] [INFO ] State equation strengthened by 304 read => feed constraints.
All remaining problems are real, not stopping.
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) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 389/406 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1288/1694 variables, 525/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 304/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/1756 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1756 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1757 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1757 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1757 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 162/1919 variables, 153/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1919 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 9/1928 variables, 4/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1928 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1934 variables, 4/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1934 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1934 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1934/1934 variables, and 1009 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 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) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 389/406 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1288/1694 variables, 525/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 304/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1694 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 62/1756 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1756 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1757 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1757 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1757 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 162/1919 variables, 153/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1919 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 9/1928 variables, 4/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1928 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 6/1934 variables, 4/1013 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1934 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1934 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1934/1934 variables, and 1013 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2469ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Graph (complete) has 3007 edges and 703 vertex of which 517 are kept as prefixes of interest. Removing 186 places using SCC suffix rule.5 ms
Discarding 186 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 517 transition count 1458
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 384 place count 506 transition count 1436
Iterating global reduction 1 with 11 rules applied. Total rules applied 395 place count 506 transition count 1436
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 407 place count 506 transition count 1424
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 415 place count 498 transition count 1406
Iterating global reduction 2 with 8 rules applied. Total rules applied 423 place count 498 transition count 1406
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 427 place count 494 transition count 1396
Iterating global reduction 2 with 4 rules applied. Total rules applied 431 place count 494 transition count 1396
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 436 place count 489 transition count 1382
Iterating global reduction 2 with 5 rules applied. Total rules applied 441 place count 489 transition count 1382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 446 place count 484 transition count 1368
Iterating global reduction 2 with 5 rules applied. Total rules applied 451 place count 484 transition count 1368
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 456 place count 479 transition count 1358
Iterating global reduction 2 with 5 rules applied. Total rules applied 461 place count 479 transition count 1358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 466 place count 474 transition count 1348
Iterating global reduction 2 with 5 rules applied. Total rules applied 471 place count 474 transition count 1348
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 477 place count 468 transition count 1332
Iterating global reduction 2 with 6 rules applied. Total rules applied 483 place count 468 transition count 1332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 488 place count 463 transition count 1316
Iterating global reduction 2 with 5 rules applied. Total rules applied 493 place count 463 transition count 1316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 498 place count 458 transition count 1304
Iterating global reduction 2 with 5 rules applied. Total rules applied 503 place count 458 transition count 1304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 506 place count 455 transition count 1298
Iterating global reduction 2 with 3 rules applied. Total rules applied 509 place count 455 transition count 1298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 512 place count 452 transition count 1292
Iterating global reduction 2 with 3 rules applied. Total rules applied 515 place count 452 transition count 1292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 518 place count 449 transition count 1286
Iterating global reduction 2 with 3 rules applied. Total rules applied 521 place count 449 transition count 1286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 524 place count 446 transition count 1280
Iterating global reduction 2 with 3 rules applied. Total rules applied 527 place count 446 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 528 place count 445 transition count 1278
Iterating global reduction 2 with 1 rules applied. Total rules applied 529 place count 445 transition count 1278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 537 place count 445 transition count 1270
Applied a total of 537 rules in 401 ms. Remains 445 /703 variables (removed 258) and now considering 1270/1830 (removed 560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 445/703 places, 1270/1830 transitions.
RANDOM walk for 40000 steps (8 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 229724 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 229724 steps, saw 140878 distinct states, run finished after 3005 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-31 22:40:24] [INFO ] Flow matrix only has 728 transitions (discarded 542 similar events)
// Phase 1: matrix 728 rows 445 cols
[2024-05-31 22:40:24] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 22:40:24] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
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) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 237/254 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 789/1043 variables, 359/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 87/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/1105 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1105 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1106 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1106 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 67/1173 variables, 69/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 534 constraints, problems are : Problem set: 0 solved, 4 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 445/445 constraints, ReadFeed: 87/87 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) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 237/254 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 789/1043 variables, 359/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 87/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 62/1105 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1105 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1106 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1106 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1106 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 67/1173 variables, 69/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1173 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1173 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 538 constraints, problems are : Problem set: 0 solved, 4 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 445/445 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1267ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 563 ms.
Support contains 4 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1270/1270 transitions.
Graph (complete) has 2183 edges and 445 vertex of which 442 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 442 transition count 1264
Applied a total of 7 rules in 57 ms. Remains 442 /445 variables (removed 3) and now considering 1264/1270 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 442/445 places, 1264/1270 transitions.
RANDOM walk for 40001 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2024-05-31 22:40:26] [INFO ] Flow matrix only has 722 transitions (discarded 542 similar events)
// Phase 1: matrix 722 rows 442 cols
[2024-05-31 22:40:26] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 22:40:26] [INFO ] State equation strengthened by 84 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 227/237 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 785/1022 variables, 356/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1022 variables, 84/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1022 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1084 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1084 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1085 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1085 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 72/1157 variables, 71/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1157 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/1163 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1164 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1164 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1164 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 528 constraints, problems are : Problem set: 0 solved, 2 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 442/442 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 227/237 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 785/1022 variables, 356/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1022 variables, 84/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1022 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1084 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1084 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/1085 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 72/1157 variables, 71/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1157 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1163 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1164 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1164 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1164 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 530 constraints, problems are : Problem set: 0 solved, 2 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 442/442 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 953ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1264/1264 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 441 transition count 1262
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 440 transition count 1260
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 440 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 439 transition count 1256
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 439 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 438 transition count 1254
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 438 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 437 transition count 1252
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 437 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 436 transition count 1250
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 436 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 435 transition count 1248
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 435 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 434 transition count 1246
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 434 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 433 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 433 transition count 1244
Applied a total of 18 rules in 129 ms. Remains 433 /442 variables (removed 9) and now considering 1244/1264 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 433/442 places, 1244/1264 transitions.
RANDOM walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 301181 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 301181 steps, saw 184691 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-31 22:40:30] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
// Phase 1: matrix 708 rows 433 cols
[2024-05-31 22:40:30] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 22:40:30] [INFO ] State equation strengthened by 81 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 224/234 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 772/1006 variables, 351/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 81/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1068 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1068 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1069 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1069 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1069 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 69/1138 variables, 69/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1138 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1141 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1141 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1141 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1141/1141 variables, and 516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 224/234 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 772/1006 variables, 351/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 81/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1068 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1068 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/1069 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1069 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1069 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 69/1138 variables, 69/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1138 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1141 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1141 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1141 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1141/1141 variables, and 518 constraints, problems are : Problem set: 0 solved, 2 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1244/1244 transitions.
Applied a total of 0 rules in 50 ms. Remains 433 /433 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 433/433 places, 1244/1244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1244/1244 transitions.
Applied a total of 0 rules in 50 ms. Remains 433 /433 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
[2024-05-31 22:40:31] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
[2024-05-31 22:40:31] [INFO ] Invariant cache hit.
[2024-05-31 22:40:31] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-31 22:40:31] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
[2024-05-31 22:40:31] [INFO ] Invariant cache hit.
[2024-05-31 22:40:32] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-31 22:40:33] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2024-05-31 22:40:33] [INFO ] Redundant transitions in 70 ms returned []
Running 1242 sub problems to find dead transitions.
[2024-05-31 22:40:33] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
[2024-05-31 22:40:33] [INFO ] Invariant cache hit.
[2024-05-31 22:40:33] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 3 (OVERLAPS) 708/1141 variables, 433/435 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
SMT process timed out in 34396ms, After SMT, problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 34409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35988 ms. Remains : 433/433 places, 1244/1244 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 536 transitions
Reduce isomorphic transitions removed 536 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 433 transition count 698
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 557 place count 423 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 422 transition count 697
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 558 place count 422 transition count 621
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 710 place count 346 transition count 621
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 966 place count 218 transition count 493
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1030 place count 154 transition count 365
Iterating global reduction 3 with 64 rules applied. Total rules applied 1094 place count 154 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1095 place count 154 transition count 364
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1158 place count 91 transition count 238
Iterating global reduction 4 with 63 rules applied. Total rules applied 1221 place count 91 transition count 238
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1284 place count 28 transition count 112
Iterating global reduction 4 with 63 rules applied. Total rules applied 1347 place count 28 transition count 112
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1410 place count 28 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1410 place count 28 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1412 place count 27 transition count 48
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 5 with 2 rules applied. Total rules applied 1414 place count 26 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1416 place count 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1417 place count 25 transition count 46
Applied a total of 1417 rules in 57 ms. Remains 25 /433 variables (removed 408) and now considering 46/1244 (removed 1198) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 46 rows 25 cols
[2024-05-31 22:41:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:41:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 22:41:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-31 22:41:07] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:41:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 22:41:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:41:07] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:41:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:41:07] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:41:07] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:41:07] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 158 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1&&G(p2))))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 693 transition count 1810
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 693 transition count 1810
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 693 transition count 1802
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 685 transition count 1784
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 685 transition count 1784
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 679 transition count 1766
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 679 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 672 transition count 1744
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 672 transition count 1744
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 665 transition count 1726
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 665 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 658 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 658 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 651 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 651 transition count 1698
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 643 transition count 1678
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 643 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 636 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 636 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 631 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 628 transition count 1640
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 625 transition count 1634
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 625 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 622 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 622 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 619 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 618 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 618 transition count 1620
Applied a total of 178 rules in 206 ms. Remains 618 /703 variables (removed 85) and now considering 1620/1830 (removed 210) transitions.
[2024-05-31 22:41:08] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
// Phase 1: matrix 1085 rows 618 cols
[2024-05-31 22:41:08] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 22:41:08] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-31 22:41:08] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-31 22:41:08] [INFO ] Invariant cache hit.
[2024-05-31 22:41:09] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-31 22:41:10] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2569 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2024-05-31 22:41:10] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-31 22:41:10] [INFO ] Invariant cache hit.
[2024-05-31 22:41:10] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1703 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1703 variables, 271/891 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1703/1703 variables, and 2509 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30405 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
After SMT, in 68501ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 68520ms
Starting structural reductions in LTL mode, iteration 1 : 618/703 places, 1620/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71308 ms. Remains : 618/703 places, 1620/1830 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-00 finished in 71726 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 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 690 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 680 transition count 1768
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 680 transition count 1768
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 674 transition count 1750
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 674 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 667 transition count 1730
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 667 transition count 1730
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 660 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 660 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 653 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 638 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 638 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 632 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 632 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 627 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 627 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 621 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 618 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 182 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 185 place count 615 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 188 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 614 transition count 1608
Applied a total of 190 rules in 191 ms. Remains 614 /703 variables (removed 89) and now considering 1608/1830 (removed 222) transitions.
[2024-05-31 22:42:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-31 22:42:19] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 22:42:20] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-31 22:42:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:42:20] [INFO ] Invariant cache hit.
[2024-05-31 22:42:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:42:22] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 2586 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:42:22] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:42:22] [INFO ] Invariant cache hit.
[2024-05-31 22:42:22] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 67472ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 67491ms
Starting structural reductions in LTL mode, iteration 1 : 614/703 places, 1608/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70275 ms. Remains : 614/703 places, 1608/1830 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-01
Product exploration explored 100000 steps with 750 reset in 628 ms.
Product exploration explored 100000 steps with 721 reset in 557 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 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 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40066 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502696 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502696 steps, saw 326282 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-31 22:43:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:43:34] [INFO ] Invariant cache hit.
[2024-05-31 22:43:34] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 544/563 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/568 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 926/1494 variables, 467/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1494 variables, 264/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1494 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1556 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1556 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 130/1686 variables, 130/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 544/563 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/568 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 926/1494 variables, 467/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1494 variables, 264/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1494 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1556 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1556 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 130/1686 variables, 130/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1686 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/1687 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1687 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1687 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Graph (complete) has 2682 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1224
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 422 transition count 1220
Applied a total of 389 rules in 96 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1608 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 422/614 places, 1220/1608 transitions.
RANDOM walk for 40011 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 618108 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 618108 steps, saw 379012 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-05-31 22:43:38] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-31 22:43:38] [INFO ] Computed 3 invariants in 9 ms
[2024-05-31 22:43:38] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 22:43:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:43:39] [INFO ] Invariant cache hit.
[2024-05-31 22:43:39] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 22:43:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:43:39] [INFO ] Invariant cache hit.
[2024-05-31 22:43:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:43:40] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2024-05-31 22:43:41] [INFO ] Redundant transitions in 52 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 22:43:41] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:43:41] [INFO ] Invariant cache hit.
[2024-05-31 22:43:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64042ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65633 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
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 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 42 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-31 22:44:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:44:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:44:45] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:44:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:44:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:44:45] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:44:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:44:45] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:44:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:44:45] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:44:45] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 119 ms.
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 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 10 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-31 22:44:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-31 22:44:45] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 22:44:45] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-31 22:44:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:44:45] [INFO ] Invariant cache hit.
[2024-05-31 22:44:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:44:48] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:44:48] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:44:48] [INFO ] Invariant cache hit.
[2024-05-31 22:44:48] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30430 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68330ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68344ms
Finished structural reductions in LTL mode , in 1 iterations and 70936 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 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 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40123 steps (8 resets) in 67 ms. (590 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 491616 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 491616 steps, saw 319092 distinct states, run finished after 3002 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-31 22:45:59] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:45:59] [INFO ] Invariant cache hit.
[2024-05-31 22:45:59] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 544/563 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/568 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 926/1494 variables, 467/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1494 variables, 264/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1494 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1556 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1556 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 130/1686 variables, 130/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 544/563 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/568 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 926/1494 variables, 467/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1494 variables, 264/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1494 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1556 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1556 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 130/1686 variables, 130/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1686 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/1687 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1687 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1687 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 996ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Graph (complete) has 2682 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1224
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 422 transition count 1220
Applied a total of 389 rules in 118 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1608 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 422/614 places, 1220/1608 transitions.
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 619641 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 619641 steps, saw 379952 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-31 22:46:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-31 22:46:03] [INFO ] Computed 3 invariants in 8 ms
[2024-05-31 22:46:03] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 48 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 48 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 22:46:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:46:04] [INFO ] Invariant cache hit.
[2024-05-31 22:46:04] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-31 22:46:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:46:04] [INFO ] Invariant cache hit.
[2024-05-31 22:46:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:46:06] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2024-05-31 22:46:06] [INFO ] Redundant transitions in 22 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 22:46:06] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 22:46:06] [INFO ] Invariant cache hit.
[2024-05-31 22:46:06] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (OVERLAPS) 689/1111 variables, 422/425 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1111 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 1218/1718 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 0/0 constraints]
After SMT, in 64116ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 64127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65626 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
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 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 25 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-31 22:47:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:47:10] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:47:10] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:47:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:47:10] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:47:10] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:47:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:47:10] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:47:10] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:47:10] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:47:10] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 114 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 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 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 745 reset in 495 ms.
Entered a terminal (fully accepting) state of product in 10346 steps with 68 reset in 54 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-01 finished in 291733 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((p0||X(X(X(G(p1))))))))))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 186 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-31 22:47:11] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-31 22:47:11] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 22:47:12] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-31 22:47:12] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:47:12] [INFO ] Invariant cache hit.
[2024-05-31 22:47:12] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-31 22:47:14] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-31 22:47:14] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:47:14] [INFO ] Invariant cache hit.
[2024-05-31 22:47:14] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30889 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68899ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68918ms
Starting structural reductions in LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71613 ms. Remains : 636/703 places, 1662/1830 transitions.
Stuttering acceptance computed with spot in 458 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05
Product exploration explored 100000 steps with 716 reset in 573 ms.
Product exploration explored 100000 steps with 741 reset in 665 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 577 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 38970 steps (8 resets) in 214 ms. (181 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 440 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 14 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-31 22:48:26] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:48:26] [INFO ] Invariant cache hit.
[2024-05-31 22:48:27] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-31 22:48:27] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:48:27] [INFO ] Invariant cache hit.
[2024-05-31 22:48:27] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-31 22:48:29] [INFO ] Implicit Places using invariants and state equation in 2044 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-31 22:48:29] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:48:29] [INFO ] Invariant cache hit.
[2024-05-31 22:48:29] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 9.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 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 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.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 1.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 1.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 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.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 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.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 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.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 1.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 1.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68502ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68517ms
Finished structural reductions in LTL mode , in 1 iterations and 71006 ms. Remains : 636/636 places, 1662/1662 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 38460 steps (8 resets) in 166 ms. (230 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 432 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 722 reset in 572 ms.
Product exploration explored 100000 steps with 704 reset in 512 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 15 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-31 22:49:41] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:49:41] [INFO ] Invariant cache hit.
[2024-05-31 22:49:41] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-31 22:49:41] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:49:41] [INFO ] Invariant cache hit.
[2024-05-31 22:49:42] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-31 22:49:43] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-31 22:49:43] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:49:43] [INFO ] Invariant cache hit.
[2024-05-31 22:49:43] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 31002 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68585ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68601ms
Finished structural reductions in LTL mode , in 1 iterations and 71014 ms. Remains : 636/636 places, 1662/1662 transitions.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 221174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 691 transition count 1794
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 682 transition count 1772
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 682 transition count 1772
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 677 transition count 1756
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 671 transition count 1738
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 671 transition count 1738
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 665 transition count 1722
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 665 transition count 1722
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 659 transition count 1710
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 659 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 653 transition count 1698
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 641 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 641 transition count 1666
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 140 place count 637 transition count 1658
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 637 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 635 transition count 1654
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 635 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 633 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 633 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 631 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 631 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 629 transition count 1642
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 629 transition count 1642
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 166 place count 629 transition count 1636
Applied a total of 166 rules in 472 ms. Remains 629 /703 variables (removed 74) and now considering 1636/1830 (removed 194) transitions.
[2024-05-31 22:50:53] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2024-05-31 22:50:53] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:50:53] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-31 22:50:53] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-31 22:50:53] [INFO ] Invariant cache hit.
[2024-05-31 22:50:53] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-31 22:50:55] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 2754 ms to find 0 implicit places.
[2024-05-31 22:50:55] [INFO ] Redundant transitions in 28 ms returned []
Running 1634 sub problems to find dead transitions.
[2024-05-31 22:50:55] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-31 22:50:55] [INFO ] Invariant cache hit.
[2024-05-31 22:50:55] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 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 Real declared 629/1722 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/629 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 3 (OVERLAPS) 1093/1722 variables, 629/631 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1722 variables, 270/901 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 2535 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 629/629 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
After SMT, in 68412ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 68428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 629/703 places, 1636/1830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71688 ms. Remains : 629/703 places, 1636/1830 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-06
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-06 finished in 71875 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 (G(p0)||(p0&&G(p1))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 680 transition count 1770
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 680 transition count 1770
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 673 transition count 1748
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 673 transition count 1748
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 665 transition count 1724
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 665 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 649 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 126 place count 641 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 143 place count 632 transition count 1650
Iterating global reduction 1 with 9 rules applied. Total rules applied 152 place count 632 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 158 place count 626 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 164 place count 626 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 169 place count 621 transition count 1620
Iterating global reduction 1 with 5 rules applied. Total rules applied 174 place count 621 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 177 place count 618 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 180 place count 618 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 615 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 612 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 612 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 609 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 608 transition count 1594
Applied a total of 200 rules in 177 ms. Remains 608 /703 variables (removed 95) and now considering 1594/1830 (removed 236) transitions.
[2024-05-31 22:52:04] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
// Phase 1: matrix 1066 rows 608 cols
[2024-05-31 22:52:04] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 22:52:05] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-31 22:52:05] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-31 22:52:05] [INFO ] Invariant cache hit.
[2024-05-31 22:52:05] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-31 22:52:07] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2024-05-31 22:52:07] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-31 22:52:07] [INFO ] Invariant cache hit.
[2024-05-31 22:52:07] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1674 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 3 (OVERLAPS) 1066/1674 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1674 variables, 266/876 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/1674 variables, and 2468 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 608/608 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
After SMT, in 68115ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 68130ms
Starting structural reductions in LTL mode, iteration 1 : 608/703 places, 1594/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70739 ms. Remains : 608/703 places, 1594/1830 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3682 steps with 27 reset in 25 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-09 finished in 70967 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 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 679 transition count 1768
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 679 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 672 transition count 1746
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 672 transition count 1746
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 664 transition count 1722
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 664 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 656 transition count 1702
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 656 transition count 1702
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 648 transition count 1686
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 648 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 641 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 633 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 633 transition count 1652
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 627 transition count 1636
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 166 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 170 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 172 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 174 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 176 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 178 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 180 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 182 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 615 transition count 1612
Applied a total of 186 rules in 168 ms. Remains 615 /703 variables (removed 88) and now considering 1612/1830 (removed 218) transitions.
[2024-05-31 22:53:15] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-31 22:53:15] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 22:53:16] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-31 22:53:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-31 22:53:16] [INFO ] Invariant cache hit.
[2024-05-31 22:53:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:53:17] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-31 22:53:17] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-31 22:53:17] [INFO ] Invariant cache hit.
[2024-05-31 22:53:17] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 617 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30640 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68155ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68167ms
Starting structural reductions in LTL mode, iteration 1 : 615/703 places, 1612/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70542 ms. Remains : 615/703 places, 1612/1830 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 566 ms.
Product exploration explored 100000 steps with 50000 reset in 625 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 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 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c128-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c128-LTLCardinality-12 finished in 71880 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((p0||X(X(X(G(p1))))))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c128-LTLCardinality-05
Stuttering acceptance computed with spot in 466 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 242 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-31 22:54:28] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-31 22:54:28] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 22:54:28] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-31 22:54:28] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:54:28] [INFO ] Invariant cache hit.
[2024-05-31 22:54:28] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-31 22:54:30] [INFO ] Implicit Places using invariants and state equation in 2053 ms returned []
Implicit Place search using SMT with State Equation took 2464 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-31 22:54:30] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:54:30] [INFO ] Invariant cache hit.
[2024-05-31 22:54:30] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 31062 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 69624ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 69639ms
Starting structural reductions in LI_LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72349 ms. Remains : 636/703 places, 1662/1830 transitions.
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05
Product exploration explored 100000 steps with 718 reset in 553 ms.
Product exploration explored 100000 steps with 722 reset in 531 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40061 steps (8 resets) in 138 ms. (288 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
[2024-05-31 22:55:42] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:55:42] [INFO ] Invariant cache hit.
[2024-05-31 22:55:42] [INFO ] State equation strengthened by 272 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 3 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 913 constraints, problems are : Problem set: 0 solved, 3 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1754ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 117 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-05-31 22:55:44] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-31 22:55:44] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 22:55:44] [INFO ] State equation strengthened by 82 read => feed constraints.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1103ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 47 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 444/444 places, 1270/1270 transitions.
RANDOM walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 558341 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 558341 steps, saw 343933 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-31 22:55:48] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-31 22:55:48] [INFO ] Invariant cache hit.
[2024-05-31 22:55:48] [INFO ] State equation strengthened by 82 read => feed constraints.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 51 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 47 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-31 22:55:49] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-31 22:55:49] [INFO ] Invariant cache hit.
[2024-05-31 22:55:49] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-31 22:55:49] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-31 22:55:49] [INFO ] Invariant cache hit.
[2024-05-31 22:55:49] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-31 22:55:50] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2024-05-31 22:55:50] [INFO ] Redundant transitions in 13 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-31 22:55:50] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-31 22:55:50] [INFO ] Invariant cache hit.
[2024-05-31 22:55:50] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64906ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66679 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 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 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
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 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 19 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-31 22:56:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 22:56:55] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:56:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:56:55] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:56:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:56:55] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:56:55] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:56:55] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 95 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 443 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 10 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-31 22:56:57] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-31 22:56:57] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 22:56:57] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-31 22:56:57] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:56:57] [INFO ] Invariant cache hit.
[2024-05-31 22:56:57] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-31 22:56:59] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-31 22:56:59] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:56:59] [INFO ] Invariant cache hit.
[2024-05-31 22:56:59] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 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 Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 69655ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 69671ms
Finished structural reductions in LTL mode , in 1 iterations and 72174 ms. Remains : 636/636 places, 1662/1662 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40012 steps (8 resets) in 145 ms. (274 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (18 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-05-31 22:58:09] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:58:09] [INFO ] Invariant cache hit.
[2024-05-31 22:58:09] [INFO ] State equation strengthened by 272 read => feed constraints.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 946ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 100 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559825 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559825 steps, saw 344848 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-31 22:58:14] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-31 22:58:14] [INFO ] Computed 3 invariants in 9 ms
[2024-05-31 22:58:14] [INFO ] State equation strengthened by 82 read => feed constraints.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 45 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 45 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-31 22:58:14] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-31 22:58:14] [INFO ] Invariant cache hit.
[2024-05-31 22:58:15] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-31 22:58:15] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-31 22:58:15] [INFO ] Invariant cache hit.
[2024-05-31 22:58:15] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-31 22:58:16] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2024-05-31 22:58:16] [INFO ] Redundant transitions in 19 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-31 22:58:16] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-31 22:58:16] [INFO ] Invariant cache hit.
[2024-05-31 22:58:16] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64767ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64777ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66410 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 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 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
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 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 19 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-31 22:59:21] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:59:21] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:59:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:59:21] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:59:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:59:21] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:59:21] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:59:21] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 113 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 341 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 458 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 435 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 712 reset in 530 ms.
Product exploration explored 100000 steps with 699 reset in 561 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 11 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-31 22:59:24] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-31 22:59:24] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 22:59:24] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-31 22:59:24] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:59:24] [INFO ] Invariant cache hit.
[2024-05-31 22:59:24] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-31 22:59:26] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 2479 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-31 22:59:26] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-31 22:59:26] [INFO ] Invariant cache hit.
[2024-05-31 22:59:26] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 31052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 69339ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 69355ms
Finished structural reductions in LTL mode , in 1 iterations and 71851 ms. Remains : 636/636 places, 1662/1662 transitions.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 368756 ms.
[2024-05-31 23:00:36] [INFO ] Flatten gal took : 74 ms
[2024-05-31 23:00:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 23:00:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 1830 transitions and 7446 arcs took 44 ms.
Total runtime 1303136 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-c128-LTLCardinality-05

BK_STOP 1717196472642

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-c128-LTLCardinality-05
ltl formula formula --ltl=/tmp/1981/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 703 places, 1830 transitions and 7446 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.020 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 15 states
pnml2lts-mc( 0/ 4): There are 704 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 704, there are 1878 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~43948 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~79948 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~151948 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~448684 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~583948 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~1792684 transitions
pnml2lts-mc( 1/ 4): ~160000 levels ~640000 states ~3584684 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 790473
pnml2lts-mc( 0/ 4): unique transitions count: 3848066
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 60723
pnml2lts-mc( 0/ 4): - claim success count: 790478
pnml2lts-mc( 0/ 4): - cum. max stack depth: 790478
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 790478 states 3848075 transitions, fanout: 4.868
pnml2lts-mc( 0/ 4): Total exploration time 35.180 sec (35.140 sec minimum, 35.155 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22470, Transitions per second: 109382
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 92.3MB, 26.1 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1860 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 92.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c128, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603100323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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