About the Execution of GreatSPN+red for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12092.991 | 2386100.00 | 4035189.00 | 5274.70 | FTTT??T?FFFTF?FF | normal |
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.r179-tall-171640601200291.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 greatspnxred
Input is FunctionPointer-PT-c008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 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-c008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716438600210
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:30:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 04:30:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:30:01] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2024-05-23 04:30:01] [INFO ] Transformed 2826 places.
[2024-05-23 04:30:01] [INFO ] Transformed 8960 transitions.
[2024-05-23 04:30:01] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 536 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c008-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3714
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3714
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Iterating post reduction 1 with 364 rules applied. Total rules applied 967 place count 1318 transition count 3350
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1119 place count 1166 transition count 3046
Iterating global reduction 2 with 152 rules applied. Total rules applied 1271 place count 1166 transition count 3046
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1339 place count 1166 transition count 2978
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1351 place count 1154 transition count 2954
Iterating global reduction 3 with 12 rules applied. Total rules applied 1363 place count 1154 transition count 2954
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1373 place count 1144 transition count 2934
Iterating global reduction 3 with 10 rules applied. Total rules applied 1383 place count 1144 transition count 2934
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1393 place count 1134 transition count 2914
Iterating global reduction 3 with 10 rules applied. Total rules applied 1403 place count 1134 transition count 2914
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1413 place count 1124 transition count 2894
Iterating global reduction 3 with 10 rules applied. Total rules applied 1423 place count 1124 transition count 2894
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1433 place count 1114 transition count 2874
Iterating global reduction 3 with 10 rules applied. Total rules applied 1443 place count 1114 transition count 2874
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1452 place count 1105 transition count 2856
Iterating global reduction 3 with 9 rules applied. Total rules applied 1461 place count 1105 transition count 2856
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1468 place count 1098 transition count 2842
Iterating global reduction 3 with 7 rules applied. Total rules applied 1475 place count 1098 transition count 2842
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1508 place count 1065 transition count 2716
Iterating global reduction 3 with 33 rules applied. Total rules applied 1541 place count 1065 transition count 2716
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1583 place count 1023 transition count 2548
Iterating global reduction 3 with 42 rules applied. Total rules applied 1625 place count 1023 transition count 2548
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1666 place count 982 transition count 2442
Iterating global reduction 3 with 41 rules applied. Total rules applied 1707 place count 982 transition count 2442
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1748 place count 941 transition count 2360
Iterating global reduction 3 with 41 rules applied. Total rules applied 1789 place count 941 transition count 2360
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1829 place count 901 transition count 2280
Iterating global reduction 3 with 40 rules applied. Total rules applied 1869 place count 901 transition count 2280
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1908 place count 862 transition count 2202
Iterating global reduction 3 with 39 rules applied. Total rules applied 1947 place count 862 transition count 2202
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1982 place count 827 transition count 2132
Iterating global reduction 3 with 35 rules applied. Total rules applied 2017 place count 827 transition count 2132
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2028 place count 816 transition count 2110
Iterating global reduction 3 with 11 rules applied. Total rules applied 2039 place count 816 transition count 2110
Applied a total of 2039 rules in 1209 ms. Remains 816 /1628 variables (removed 812) and now considering 2110/5962 (removed 3852) transitions.
[2024-05-23 04:30:03] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
// Phase 1: matrix 1428 rows 816 cols
[2024-05-23 04:30:03] [INFO ] Computed 2 invariants in 24 ms
[2024-05-23 04:30:04] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-23 04:30:04] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-23 04:30:04] [INFO ] Invariant cache hit.
[2024-05-23 04:30:04] [INFO ] State equation strengthened by 346 read => feed constraints.
[2024-05-23 04:30:06] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3677 ms to find 0 implicit places.
Running 2108 sub problems to find dead transitions.
[2024-05-23 04:30:07] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-23 04:30:07] [INFO ] Invariant cache hit.
[2024-05-23 04:30:07] [INFO ] State equation strengthened by 346 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/816 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 49.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 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)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/2244 variables, and 2 constraints, problems are : Problem set: 0 solved, 2108 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/816 constraints, ReadFeed: 0/346 constraints, PredecessorRefiner: 2108/2108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/816 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 49)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(timeout
s194 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/2244 variables, and 2 constraints, problems are : Problem set: 0 solved, 2108 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/816 constraints, ReadFeed: 0/346 constraints, PredecessorRefiner: 0/2108 constraints, Known Traps: 0/0 constraints]
After SMT, in 71005ms problems are : Problem set: 0 solved, 2108 unsolved
Search for dead transitions found 0 dead transitions in 71046ms
Starting structural reductions in LTL mode, iteration 1 : 816/1628 places, 2110/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75971 ms. Remains : 816/1628 places, 2110/5962 transitions.
Support contains 27 out of 816 places after structural reductions.
[2024-05-23 04:31:18] [INFO ] Flatten gal took : 152 ms
[2024-05-23 04:31:18] [INFO ] Flatten gal took : 107 ms
[2024-05-23 04:31:18] [INFO ] Input system was already deterministic with 2110 transitions.
RANDOM walk for 40000 steps (8 resets) in 2815 ms. (14 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (9 resets) in 82 ms. (481 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 92 ms. (430 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/4 properties
[2024-05-23 04:31:19] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-23 04:31:19] [INFO ] Invariant cache hit.
[2024-05-23 04:31:19] [INFO ] State equation strengthened by 346 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 382/389 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/440 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 779/1219 variables, 440/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1219 variables, 26/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1219 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 401/1620 variables, 60/528 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1620 variables, 254/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1620 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 502/2122 variables, 222/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2122 variables, 66/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2122 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 95/2217 variables, 78/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2217 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 25/2242 variables, 14/1162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2242 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/2244 variables, 2/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2244 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/2244 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2244/2244 variables, and 1164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 816/816 constraints, ReadFeed: 346/346 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 382/389 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/440 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 779/1219 variables, 440/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1219 variables, 26/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1219 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 401/1620 variables, 60/528 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1620 variables, 254/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1620 variables, 3/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1620 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 502/2122 variables, 222/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2122 variables, 66/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 04:31:21] [INFO ] Deduced a trap composed of 135 places in 207 ms of which 32 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2122 variables, 1/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2122 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 95/2217 variables, 78/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2217 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 25/2242 variables, 14/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2242 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/2244 variables, 2/1168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2244 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2244 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 1168 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 816/816 constraints, ReadFeed: 346/346 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2623ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 142 ms.
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Graph (complete) has 3433 edges and 816 vertex of which 624 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.6 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 624 transition count 1726
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 401 place count 608 transition count 1694
Iterating global reduction 1 with 16 rules applied. Total rules applied 417 place count 608 transition count 1694
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 431 place count 608 transition count 1680
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 444 place count 595 transition count 1654
Iterating global reduction 2 with 13 rules applied. Total rules applied 457 place count 595 transition count 1654
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 461 place count 595 transition count 1650
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 472 place count 584 transition count 1626
Iterating global reduction 3 with 11 rules applied. Total rules applied 483 place count 584 transition count 1626
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 498 place count 569 transition count 1578
Iterating global reduction 3 with 15 rules applied. Total rules applied 513 place count 569 transition count 1578
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 530 place count 552 transition count 1522
Iterating global reduction 3 with 17 rules applied. Total rules applied 547 place count 552 transition count 1522
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 563 place count 536 transition count 1484
Iterating global reduction 3 with 16 rules applied. Total rules applied 579 place count 536 transition count 1484
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 595 place count 520 transition count 1452
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 520 transition count 1452
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 629 place count 502 transition count 1410
Iterating global reduction 3 with 18 rules applied. Total rules applied 647 place count 502 transition count 1410
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 667 place count 482 transition count 1356
Iterating global reduction 3 with 20 rules applied. Total rules applied 687 place count 482 transition count 1356
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 706 place count 463 transition count 1308
Iterating global reduction 3 with 19 rules applied. Total rules applied 725 place count 463 transition count 1308
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 736 place count 452 transition count 1284
Iterating global reduction 3 with 11 rules applied. Total rules applied 747 place count 452 transition count 1284
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 755 place count 444 transition count 1268
Iterating global reduction 3 with 8 rules applied. Total rules applied 763 place count 444 transition count 1268
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 771 place count 436 transition count 1252
Iterating global reduction 3 with 8 rules applied. Total rules applied 779 place count 436 transition count 1252
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 787 place count 428 transition count 1236
Iterating global reduction 3 with 8 rules applied. Total rules applied 795 place count 428 transition count 1236
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 800 place count 423 transition count 1226
Iterating global reduction 3 with 5 rules applied. Total rules applied 805 place count 423 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 806 place count 422 transition count 1224
Iterating global reduction 3 with 1 rules applied. Total rules applied 807 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 3 with 4 rules applied. Total rules applied 811 place count 422 transition count 1220
Applied a total of 811 rules in 413 ms. Remains 422 /816 variables (removed 394) and now considering 1220/2110 (removed 890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 422/816 places, 1220/2110 transitions.
RANDOM walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 20963 steps (3 resets) in 39 ms. (524 steps per ms) remains 0/1 properties
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' '!(F(G(p0)))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 788 transition count 2042
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 788 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 788 transition count 2038
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 778 transition count 2014
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 778 transition count 2014
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 106 place count 764 transition count 1966
Iterating global reduction 2 with 14 rules applied. Total rules applied 120 place count 764 transition count 1966
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 748 transition count 1912
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 748 transition count 1912
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 167 place count 733 transition count 1876
Iterating global reduction 2 with 15 rules applied. Total rules applied 182 place count 733 transition count 1876
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 197 place count 718 transition count 1846
Iterating global reduction 2 with 15 rules applied. Total rules applied 212 place count 718 transition count 1846
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 229 place count 701 transition count 1806
Iterating global reduction 2 with 17 rules applied. Total rules applied 246 place count 701 transition count 1806
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 263 place count 684 transition count 1762
Iterating global reduction 2 with 17 rules applied. Total rules applied 280 place count 684 transition count 1762
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 296 place count 668 transition count 1726
Iterating global reduction 2 with 16 rules applied. Total rules applied 312 place count 668 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 320 place count 660 transition count 1710
Iterating global reduction 2 with 8 rules applied. Total rules applied 328 place count 660 transition count 1710
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 333 place count 655 transition count 1700
Iterating global reduction 2 with 5 rules applied. Total rules applied 338 place count 655 transition count 1700
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 343 place count 650 transition count 1690
Iterating global reduction 2 with 5 rules applied. Total rules applied 348 place count 650 transition count 1690
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 353 place count 645 transition count 1680
Iterating global reduction 2 with 5 rules applied. Total rules applied 358 place count 645 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 360 place count 643 transition count 1676
Iterating global reduction 2 with 2 rules applied. Total rules applied 362 place count 643 transition count 1676
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 370 place count 643 transition count 1668
Applied a total of 370 rules in 609 ms. Remains 643 /816 variables (removed 173) and now considering 1668/2110 (removed 442) transitions.
[2024-05-23 04:31:23] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
// Phase 1: matrix 1116 rows 643 cols
[2024-05-23 04:31:23] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 04:31:24] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-23 04:31:24] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
[2024-05-23 04:31:24] [INFO ] Invariant cache hit.
[2024-05-23 04:31:24] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-05-23 04:31:26] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
[2024-05-23 04:31:26] [INFO ] Redundant transitions in 85 ms returned []
Running 1666 sub problems to find dead transitions.
[2024-05-23 04:31:26] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
[2024-05-23 04:31:26] [INFO ] Invariant cache hit.
[2024-05-23 04:31:26] [INFO ] State equation strengthened by 276 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/1759 variables, and 2 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/643 constraints, ReadFeed: 0/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1759 variables, 643/645 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1759 variables, 276/921 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1759/1759 variables, and 2587 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 31554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 643/643 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
After SMT, in 68974ms problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 68993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 643/816 places, 1668/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71980 ms. Remains : 643/816 places, 1668/2110 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 659 ms.
Stack based approach found an accepted trace after 445 steps with 0 reset with depth 446 and stack size 446 in 4 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-00 finished in 72857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||((p1||X(G(p0)))&&(G(p2)||X(p3)))||G(p1))))'
Support contains 7 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 804 transition count 2086
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 804 transition count 2086
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 804 transition count 2074
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 795 transition count 2056
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 795 transition count 2056
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 795 transition count 2052
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 788 transition count 2036
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 788 transition count 2036
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 778 transition count 2004
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 778 transition count 2004
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 766 transition count 1964
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 766 transition count 1964
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 128 place count 754 transition count 1934
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 754 transition count 1934
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 152 place count 742 transition count 1910
Iterating global reduction 2 with 12 rules applied. Total rules applied 164 place count 742 transition count 1910
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 177 place count 729 transition count 1880
Iterating global reduction 2 with 13 rules applied. Total rules applied 190 place count 729 transition count 1880
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 205 place count 714 transition count 1840
Iterating global reduction 2 with 15 rules applied. Total rules applied 220 place count 714 transition count 1840
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 235 place count 699 transition count 1800
Iterating global reduction 2 with 15 rules applied. Total rules applied 250 place count 699 transition count 1800
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 260 place count 689 transition count 1776
Iterating global reduction 2 with 10 rules applied. Total rules applied 270 place count 689 transition count 1776
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 277 place count 682 transition count 1762
Iterating global reduction 2 with 7 rules applied. Total rules applied 284 place count 682 transition count 1762
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 291 place count 675 transition count 1748
Iterating global reduction 2 with 7 rules applied. Total rules applied 298 place count 675 transition count 1748
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 305 place count 668 transition count 1734
Iterating global reduction 2 with 7 rules applied. Total rules applied 312 place count 668 transition count 1734
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 317 place count 663 transition count 1724
Iterating global reduction 2 with 5 rules applied. Total rules applied 322 place count 663 transition count 1724
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 324 place count 661 transition count 1720
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 661 transition count 1720
Applied a total of 326 rules in 234 ms. Remains 661 /816 variables (removed 155) and now considering 1720/2110 (removed 390) transitions.
[2024-05-23 04:32:36] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
// Phase 1: matrix 1154 rows 661 cols
[2024-05-23 04:32:36] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:32:36] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-23 04:32:36] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
[2024-05-23 04:32:36] [INFO ] Invariant cache hit.
[2024-05-23 04:32:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 04:32:38] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2352 ms to find 0 implicit places.
Running 1718 sub problems to find dead transitions.
[2024-05-23 04:32:38] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
[2024-05-23 04:32:38] [INFO ] Invariant cache hit.
[2024-05-23 04:32:38] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/661 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/661 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/1815 variables, and 2 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/661 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/661 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/661 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1154/1815 variables, 661/663 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1815 variables, 284/947 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1815/1815 variables, and 2665 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 31583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 661/661 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
After SMT, in 69996ms problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 70014ms
Starting structural reductions in LTL mode, iteration 1 : 661/816 places, 1720/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72609 ms. Remains : 661/816 places, 1720/2110 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 654 ms.
Product exploration explored 100000 steps with 50000 reset in 798 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 p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 45 factoid took 112 ms. Reduced automaton from 4 states, 28 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-03 finished in 74416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 801 transition count 2066
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 788 transition count 2040
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 788 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 788 transition count 2036
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 85 place count 777 transition count 2010
Iterating global reduction 2 with 11 rules applied. Total rules applied 96 place count 777 transition count 2010
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 111 place count 762 transition count 1960
Iterating global reduction 2 with 15 rules applied. Total rules applied 126 place count 762 transition count 1960
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 143 place count 745 transition count 1904
Iterating global reduction 2 with 17 rules applied. Total rules applied 160 place count 745 transition count 1904
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 176 place count 729 transition count 1866
Iterating global reduction 2 with 16 rules applied. Total rules applied 192 place count 729 transition count 1866
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 208 place count 713 transition count 1834
Iterating global reduction 2 with 16 rules applied. Total rules applied 224 place count 713 transition count 1834
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 240 place count 697 transition count 1802
Iterating global reduction 2 with 16 rules applied. Total rules applied 256 place count 697 transition count 1802
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 276 place count 677 transition count 1750
Iterating global reduction 2 with 20 rules applied. Total rules applied 296 place count 677 transition count 1750
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 314 place count 659 transition count 1700
Iterating global reduction 2 with 18 rules applied. Total rules applied 332 place count 659 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 342 place count 649 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 352 place count 649 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 359 place count 642 transition count 1664
Iterating global reduction 2 with 7 rules applied. Total rules applied 366 place count 642 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 373 place count 635 transition count 1650
Iterating global reduction 2 with 7 rules applied. Total rules applied 380 place count 635 transition count 1650
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 387 place count 628 transition count 1636
Iterating global reduction 2 with 7 rules applied. Total rules applied 394 place count 628 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 401 place count 621 transition count 1622
Iterating global reduction 2 with 7 rules applied. Total rules applied 408 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 620 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 620 transition count 1620
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 414 place count 620 transition count 1616
Applied a total of 414 rules in 391 ms. Remains 620 /816 variables (removed 196) and now considering 1616/2110 (removed 494) transitions.
[2024-05-23 04:33:50] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-23 04:33:50] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 04:33:51] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-23 04:33:51] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:33:51] [INFO ] Invariant cache hit.
[2024-05-23 04:33:51] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:33:53] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
[2024-05-23 04:33:53] [INFO ] Redundant transitions in 75 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 04:33:53] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:33:53] [INFO ] Invariant cache hit.
[2024-05-23 04:33:53] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 68096ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 68110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/816 places, 1616/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70775 ms. Remains : 620/816 places, 1616/2110 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 399 ms.
Product exploration explored 100000 steps with 0 reset in 439 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 (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2024-05-23 04:35:02] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:35:02] [INFO ] Invariant cache hit.
[2024-05-23 04:35:02] [INFO ] State equation strengthened by 268 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1544 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 137/1681 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/1693 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 7/1700 variables, 5/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1700/1700 variables, and 890 constraints, problems are : Problem set: 0 solved, 2 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 930/1482 variables, 468/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 266/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1482 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 62/1544 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1544 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 137/1681 variables, 132/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1681 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/1693 variables, 6/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1693 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/1700 variables, 5/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1700 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1700 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 892 constraints, problems are : Problem set: 0 solved, 2 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1258ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 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 428 transition count 1232
Applied a total of 385 rules in 48 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 428/620 places, 1232/1616 transitions.
RANDOM walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-05-23 04:35:03] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2024-05-23 04:35:03] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 04:35:03] [INFO ] State equation strengthened by 78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 428/428 places, 1232/1232 transitions.
RANDOM walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 600377 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 600377 steps, saw 351079 distinct states, run finished after 3004 ms. (steps per millisecond=199 ) properties seen :0
[2024-05-23 04:35:07] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 04:35:07] [INFO ] Invariant cache hit.
[2024-05-23 04:35:07] [INFO ] State equation strengthened by 78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 41 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 04:35:08] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 04:35:08] [INFO ] Invariant cache hit.
[2024-05-23 04:35:08] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 04:35:08] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 04:35:08] [INFO ] Invariant cache hit.
[2024-05-23 04:35:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 04:35:10] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2024-05-23 04:35:10] [INFO ] Redundant transitions in 19 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 04:35:10] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 04:35:10] [INFO ] Invariant cache hit.
[2024-05-23 04:35:10] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 04:35:23] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 698/1126 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34184ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34198ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35965 ms. Remains : 428/428 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
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 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
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 1410 place count 22 transition count 38
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 1412 place count 21 transition count 37
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 1414 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 68 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2024-05-23 04:35:44] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 04:35:44] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:35:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:35:44] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:35:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:35:44] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:35:44] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:35:44] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 159 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 89 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-23 04:35:44] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-23 04:35:44] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:35:45] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-23 04:35:45] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:35:45] [INFO ] Invariant cache hit.
[2024-05-23 04:35:45] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:35:47] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
[2024-05-23 04:35:47] [INFO ] Redundant transitions in 23 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 04:35:47] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:35:47] [INFO ] Invariant cache hit.
[2024-05-23 04:35:47] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 68214ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 68229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70505 ms. Remains : 620/620 places, 1616/1616 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/3 properties
[2024-05-23 04:36:55] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:36:55] [INFO ] Invariant cache hit.
[2024-05-23 04:36:55] [INFO ] State equation strengthened by 268 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1544 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/1681 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1693 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1700 variables, 5/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1700/1700 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1482 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1544 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1544 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/1681 variables, 132/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1693 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1693 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/1700 variables, 5/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 880ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 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 428 transition count 1232
Applied a total of 385 rules in 57 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 428/620 places, 1232/1616 transitions.
RANDOM walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 632624 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 1
Probabilistic random walk after 632624 steps, saw 369017 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-05-23 04:36:59] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2024-05-23 04:36:59] [INFO ] Computed 3 invariants in 13 ms
[2024-05-23 04:36:59] [INFO ] State equation strengthened by 78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 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 0 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 04:37:00] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 04:37:00] [INFO ] Invariant cache hit.
[2024-05-23 04:37:00] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 04:37:00] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 04:37:00] [INFO ] Invariant cache hit.
[2024-05-23 04:37:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 04:37:01] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
[2024-05-23 04:37:01] [INFO ] Redundant transitions in 18 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 04:37:01] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 04:37:01] [INFO ] Invariant cache hit.
[2024-05-23 04:37:02] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 04:37:15] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 698/1126 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 33823ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 33833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35590 ms. Remains : 428/428 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
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 1410 place count 22 transition count 38
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 1412 place count 21 transition count 37
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 1414 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 38 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2024-05-23 04:37:35] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 04:37:35] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:37:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 04:37:35] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:37:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:37:35] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:37:35] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:37:35] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 90 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 454 ms.
Product exploration explored 100000 steps with 0 reset in 482 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 73 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-23 04:37:37] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-23 04:37:37] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:37:37] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-23 04:37:37] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:37:37] [INFO ] Invariant cache hit.
[2024-05-23 04:37:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:37:39] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
[2024-05-23 04:37:39] [INFO ] Redundant transitions in 27 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 04:37:39] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 04:37:39] [INFO ] Invariant cache hit.
[2024-05-23 04:37:39] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 timeout
1.0)
(s2 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 68883ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 68897ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71151 ms. Remains : 620/620 places, 1616/1616 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-04 finished in 298071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0)) U (p1||F(p2))))))'
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 801 transition count 2070
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 789 transition count 2046
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 789 transition count 2046
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 789 transition count 2042
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 777 transition count 2014
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 777 transition count 2014
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 108 place count 761 transition count 1962
Iterating global reduction 2 with 16 rules applied. Total rules applied 124 place count 761 transition count 1962
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 142 place count 743 transition count 1904
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 743 transition count 1904
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 177 place count 726 transition count 1864
Iterating global reduction 2 with 17 rules applied. Total rules applied 194 place count 726 transition count 1864
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 211 place count 709 transition count 1830
Iterating global reduction 2 with 17 rules applied. Total rules applied 228 place count 709 transition count 1830
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 247 place count 690 transition count 1786
Iterating global reduction 2 with 19 rules applied. Total rules applied 266 place count 690 transition count 1786
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 287 place count 669 transition count 1730
Iterating global reduction 2 with 21 rules applied. Total rules applied 308 place count 669 transition count 1730
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 327 place count 650 transition count 1682
Iterating global reduction 2 with 19 rules applied. Total rules applied 346 place count 650 transition count 1682
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 357 place count 639 transition count 1658
Iterating global reduction 2 with 11 rules applied. Total rules applied 368 place count 639 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 376 place count 631 transition count 1642
Iterating global reduction 2 with 8 rules applied. Total rules applied 384 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 392 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 623 transition count 1626
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 408 place count 615 transition count 1610
Iterating global reduction 2 with 8 rules applied. Total rules applied 416 place count 615 transition count 1610
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 610 transition count 1600
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 610 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 609 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 609 transition count 1598
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 609 transition count 1596
Applied a total of 430 rules in 460 ms. Remains 609 /816 variables (removed 207) and now considering 1596/2110 (removed 514) transitions.
[2024-05-23 04:38:49] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 04:38:49] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:38:49] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-23 04:38:49] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:38:49] [INFO ] Invariant cache hit.
[2024-05-23 04:38:49] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 04:38:51] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 2262 ms to find 0 implicit places.
[2024-05-23 04:38:51] [INFO ] Redundant transitions in 29 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 04:38:51] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:38:51] [INFO ] Invariant cache hit.
[2024-05-23 04:38:51] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68401ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68415ms
Starting structural reductions in SI_LTL mode, iteration 1 : 609/816 places, 1596/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71179 ms. Remains : 609/816 places, 1596/2110 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-05
Product exploration explored 100000 steps with 1 reset in 455 ms.
Product exploration explored 100000 steps with 0 reset in 521 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 139 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40007 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 32 ms. (1212 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2024-05-23 04:40:01] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:40:01] [INFO ] Invariant cache hit.
[2024-05-23 04:40:01] [INFO ] State equation strengthened by 266 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 337/1592 variables, 139/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1592 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 67/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 70/1662 variables, 66/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 337/1592 variables, 139/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 67/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1592 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 70/1662 variables, 66/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1670 variables, 4/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1670 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/1676 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1676 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1676 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1208ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 96 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Graph (complete) has 2662 edges and 609 vertex of which 420 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 420 transition count 1218
Applied a total of 379 rules in 46 ms. Remains 420 /609 variables (removed 189) and now considering 1218/1596 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 420/609 places, 1218/1596 transitions.
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 600399 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 600399 steps, saw 368153 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2024-05-23 04:40:05] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
// Phase 1: matrix 691 rows 420 cols
[2024-05-23 04:40:05] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:40:05] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/1090 variables, 13/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/1097 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1105 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1111 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/1090 variables, 13/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1097 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1105 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1111 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 04:40:06] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 04:40:06] [INFO ] Invariant cache hit.
[2024-05-23 04:40:06] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-23 04:40:06] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 04:40:06] [INFO ] Invariant cache hit.
[2024-05-23 04:40:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-23 04:40:07] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1558 ms to find 0 implicit places.
[2024-05-23 04:40:07] [INFO ] Redundant transitions in 21 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 04:40:07] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 04:40:07] [INFO ] Invariant cache hit.
[2024-05-23 04:40:07] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 691/1111 variables, 420/422 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34211ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35857 ms. Remains : 420/420 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 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 537 rules applied. Total rules applied 537 place count 420 transition count 681
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 548 place count 410 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 409 transition count 680
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 549 place count 409 transition count 613
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 683 place count 342 transition count 613
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 3 with 254 rules applied. Total rules applied 937 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1001 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 1065 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 151 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1066 place count 151 transition count 356
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 1068 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1131 place count 87 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 1194 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1257 place count 24 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1320 place count 24 transition count 104
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1381 place count 24 transition count 43
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 1383 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1390 place count 23 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1391 place count 23 transition count 37
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 1392 place count 23 transition count 36
Applied a total of 1392 rules in 42 ms. Remains 23 /420 variables (removed 397) and now considering 36/1218 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 23 cols
[2024-05-23 04:40:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:40:42] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:40:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:40:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:40:42] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:40:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:40:42] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:40:42] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:40:42] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 107 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 380 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 79 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-23 04:40:43] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 04:40:43] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 04:40:43] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-23 04:40:43] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:40:43] [INFO ] Invariant cache hit.
[2024-05-23 04:40:43] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 04:40:45] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2024-05-23 04:40:45] [INFO ] Redundant transitions in 25 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 04:40:45] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:40:45] [INFO ] Invariant cache hit.
[2024-05-23 04:40:45] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 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 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31410 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 69034ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 69048ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71460 ms. Remains : 609/609 places, 1596/1596 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 155 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 46 ms. (851 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
[2024-05-23 04:41:54] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:41:54] [INFO ] Invariant cache hit.
[2024-05-23 04:41:54] [INFO ] State equation strengthened by 266 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 337/1592 variables, 139/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1592 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 67/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 70/1662 variables, 66/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 3 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 337/1592 variables, 139/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 67/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1592 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 70/1662 variables, 66/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1670 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1670 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/1676 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 880 constraints, problems are : Problem set: 0 solved, 3 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1547ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 125 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Graph (complete) has 2662 edges and 609 vertex of which 420 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.0 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 420 transition count 1218
Applied a total of 379 rules in 45 ms. Remains 420 /609 variables (removed 189) and now considering 1218/1596 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 420/609 places, 1218/1596 transitions.
RANDOM walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 606900 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 606900 steps, saw 372140 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-05-23 04:41:59] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
// Phase 1: matrix 691 rows 420 cols
[2024-05-23 04:41:59] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:41:59] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/1090 variables, 13/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/1097 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1105 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1111 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/1090 variables, 13/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1097 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1105 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1111 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 04:42:00] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 04:42:00] [INFO ] Invariant cache hit.
[2024-05-23 04:42:00] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-23 04:42:00] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 04:42:00] [INFO ] Invariant cache hit.
[2024-05-23 04:42:01] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-23 04:42:02] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-05-23 04:42:02] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 04:42:02] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 04:42:02] [INFO ] Invariant cache hit.
[2024-05-23 04:42:02] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 691/1111 variables, 420/422 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34270ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35918 ms. Remains : 420/420 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 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 537 rules applied. Total rules applied 537 place count 420 transition count 681
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 548 place count 410 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 409 transition count 680
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 549 place count 409 transition count 613
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 683 place count 342 transition count 613
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 3 with 254 rules applied. Total rules applied 937 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1001 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 1065 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 151 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1066 place count 151 transition count 356
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 1068 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1131 place count 87 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 1194 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1257 place count 24 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1320 place count 24 transition count 104
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1381 place count 24 transition count 43
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 1383 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1390 place count 23 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1391 place count 23 transition count 37
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 1392 place count 23 transition count 36
Applied a total of 1392 rules in 40 ms. Remains 23 /420 variables (removed 397) and now considering 36/1218 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 23 cols
[2024-05-23 04:42:36] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 04:42:36] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:42:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:42:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:42:36] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:42:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:42:36] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:42:36] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:42:36] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 109 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 395 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 425 ms.
Product exploration explored 100000 steps with 0 reset in 463 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 70 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-23 04:42:38] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 04:42:38] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:42:38] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-23 04:42:38] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:42:38] [INFO ] Invariant cache hit.
[2024-05-23 04:42:38] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 04:42:40] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
[2024-05-23 04:42:40] [INFO ] Redundant transitions in 29 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 04:42:40] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:42:40] [INFO ] Invariant cache hit.
[2024-05-23 04:42:40] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68892ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71313 ms. Remains : 609/609 places, 1596/1596 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-05 finished in 301059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(!p0))))))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 787 transition count 2040
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 775 transition count 2008
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 775 transition count 2008
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 759 transition count 1956
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 759 transition count 1956
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 147 place count 742 transition count 1900
Iterating global reduction 2 with 17 rules applied. Total rules applied 164 place count 742 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 726 transition count 1862
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 726 transition count 1862
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 710 transition count 1830
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 710 transition count 1830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 246 place count 692 transition count 1788
Iterating global reduction 2 with 18 rules applied. Total rules applied 264 place count 692 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 283 place count 673 transition count 1740
Iterating global reduction 2 with 19 rules applied. Total rules applied 302 place count 673 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 320 place count 655 transition count 1696
Iterating global reduction 2 with 18 rules applied. Total rules applied 338 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 348 place count 645 transition count 1672
Iterating global reduction 2 with 10 rules applied. Total rules applied 358 place count 645 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 365 place count 638 transition count 1658
Iterating global reduction 2 with 7 rules applied. Total rules applied 372 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 379 place count 631 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 386 place count 631 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 393 place count 624 transition count 1630
Iterating global reduction 2 with 7 rules applied. Total rules applied 400 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 620 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 410 place count 618 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 618 transition count 1618
Applied a total of 412 rules in 298 ms. Remains 618 /816 variables (removed 198) and now considering 1618/2110 (removed 492) transitions.
[2024-05-23 04:43:49] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-23 04:43:49] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:43:50] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-23 04:43:50] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:43:50] [INFO ] Invariant cache hit.
[2024-05-23 04:43:50] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:43:52] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2349 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 04:43:52] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:43:52] [INFO ] Invariant cache hit.
[2024-05-23 04:43:52] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 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 618/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1698 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 2503 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31333 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 68792ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 68808ms
Starting structural reductions in LTL mode, iteration 1 : 618/816 places, 1618/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71461 ms. Remains : 618/816 places, 1618/2110 transitions.
Stuttering acceptance computed with spot in 113 ms :[false, false, p0]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07
Product exploration explored 100000 steps with 25006 reset in 494 ms.
Product exploration explored 100000 steps with 25084 reset in 490 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[false, p0]
RANDOM walk for 31532 steps (6 resets) in 90 ms. (346 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[false, p0]
Stuttering acceptance computed with spot in 72 ms :[false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1614
Applied a total of 4 rules in 158 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2024-05-23 04:45:02] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-23 04:45:02] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:45:03] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-23 04:45:03] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:45:03] [INFO ] Invariant cache hit.
[2024-05-23 04:45:03] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:45:05] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2024-05-23 04:45:05] [INFO ] Redundant transitions in 28 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 04:45:05] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:45:05] [INFO ] Invariant cache hit.
[2024-05-23 04:45:05] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 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 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68834ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68855ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71283 ms. Remains : 618/618 places, 1614/1618 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[false, p0]
RANDOM walk for 30994 steps (6 resets) in 110 ms. (279 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[false, p0]
Stuttering acceptance computed with spot in 77 ms :[false, p0]
Stuttering acceptance computed with spot in 79 ms :[false, p0]
Product exploration explored 100000 steps with 33340 reset in 494 ms.
Product exploration explored 100000 steps with 33341 reset in 507 ms.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 79 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-23 04:46:15] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:46:15] [INFO ] Invariant cache hit.
[2024-05-23 04:46:16] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-23 04:46:16] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:46:16] [INFO ] Invariant cache hit.
[2024-05-23 04:46:16] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:46:17] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2024-05-23 04:46:17] [INFO ] Redundant transitions in 28 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 04:46:17] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:46:17] [INFO ] Invariant cache hit.
[2024-05-23 04:46:17] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68632ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70909 ms. Remains : 618/618 places, 1614/1614 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 217059 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' '!((p0 U (p1&&G(F(p2)))))'
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 801 transition count 2066
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 789 transition count 2042
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 789 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 789 transition count 2038
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 779 transition count 2016
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 764 transition count 1968
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 764 transition count 1968
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 139 place count 747 transition count 1912
Iterating global reduction 2 with 17 rules applied. Total rules applied 156 place count 747 transition count 1912
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 731 transition count 1874
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 731 transition count 1874
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 715 transition count 1842
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 715 transition count 1842
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 238 place count 697 transition count 1800
Iterating global reduction 2 with 18 rules applied. Total rules applied 256 place count 697 transition count 1800
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 276 place count 677 transition count 1746
Iterating global reduction 2 with 20 rules applied. Total rules applied 296 place count 677 transition count 1746
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 315 place count 658 transition count 1698
Iterating global reduction 2 with 19 rules applied. Total rules applied 334 place count 658 transition count 1698
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 345 place count 647 transition count 1674
Iterating global reduction 2 with 11 rules applied. Total rules applied 356 place count 647 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 364 place count 639 transition count 1658
Iterating global reduction 2 with 8 rules applied. Total rules applied 372 place count 639 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 380 place count 631 transition count 1642
Iterating global reduction 2 with 8 rules applied. Total rules applied 388 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 396 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 404 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 618 transition count 1616
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 415 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 617 transition count 1614
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 420 place count 617 transition count 1610
Applied a total of 420 rules in 453 ms. Remains 617 /816 variables (removed 199) and now considering 1610/2110 (removed 500) transitions.
[2024-05-23 04:47:27] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
// Phase 1: matrix 1077 rows 617 cols
[2024-05-23 04:47:27] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 04:47:27] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-23 04:47:27] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-23 04:47:27] [INFO ] Invariant cache hit.
[2024-05-23 04:47:27] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:47:29] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2024-05-23 04:47:29] [INFO ] Redundant transitions in 26 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-23 04:47:29] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-23 04:47:29] [INFO ] Invariant cache hit.
[2024-05-23 04:47:29] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1694 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/886 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2494 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 31411 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
After SMT, in 68979ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 68993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 617/816 places, 1610/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71589 ms. Remains : 617/816 places, 1610/2110 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 386 ms.
Stack based approach found an accepted trace after 1504 steps with 0 reset with depth 1505 and stack size 1505 in 6 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-09 finished in 72134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 800 transition count 2078
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 800 transition count 2078
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 800 transition count 2066
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 788 transition count 2042
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 788 transition count 2042
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 79 place count 777 transition count 2016
Iterating global reduction 1 with 11 rules applied. Total rules applied 90 place count 777 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 105 place count 762 transition count 1966
Iterating global reduction 1 with 15 rules applied. Total rules applied 120 place count 762 transition count 1966
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 135 place count 747 transition count 1920
Iterating global reduction 1 with 15 rules applied. Total rules applied 150 place count 747 transition count 1920
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 164 place count 733 transition count 1892
Iterating global reduction 1 with 14 rules applied. Total rules applied 178 place count 733 transition count 1892
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 192 place count 719 transition count 1864
Iterating global reduction 1 with 14 rules applied. Total rules applied 206 place count 719 transition count 1864
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 222 place count 703 transition count 1826
Iterating global reduction 1 with 16 rules applied. Total rules applied 238 place count 703 transition count 1826
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 258 place count 683 transition count 1768
Iterating global reduction 1 with 20 rules applied. Total rules applied 278 place count 683 transition count 1768
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 296 place count 665 transition count 1718
Iterating global reduction 1 with 18 rules applied. Total rules applied 314 place count 665 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 324 place count 655 transition count 1696
Iterating global reduction 1 with 10 rules applied. Total rules applied 334 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 344 place count 645 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 354 place count 645 transition count 1676
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 364 place count 635 transition count 1656
Iterating global reduction 1 with 10 rules applied. Total rules applied 374 place count 635 transition count 1656
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 384 place count 625 transition count 1636
Iterating global reduction 1 with 10 rules applied. Total rules applied 394 place count 625 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 401 place count 618 transition count 1622
Iterating global reduction 1 with 7 rules applied. Total rules applied 408 place count 618 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 409 place count 617 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 410 place count 617 transition count 1620
Applied a total of 410 rules in 283 ms. Remains 617 /816 variables (removed 199) and now considering 1620/2110 (removed 490) transitions.
[2024-05-23 04:48:39] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2024-05-23 04:48:39] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:48:39] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 04:48:39] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2024-05-23 04:48:39] [INFO ] Invariant cache hit.
[2024-05-23 04:48:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:48:41] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2024-05-23 04:48:41] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2024-05-23 04:48:41] [INFO ] Invariant cache hit.
[2024-05-23 04:48:41] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 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 617/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/265 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/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1696 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 265/884 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 31447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
After SMT, in 69224ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 69239ms
Starting structural reductions in LTL mode, iteration 1 : 617/816 places, 1620/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71689 ms. Remains : 617/816 places, 1620/2110 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 401 ms.
Entered a terminal (fully accepting) state of product in 480 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-10 finished in 72212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 799 transition count 2076
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 799 transition count 2076
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 48 place count 799 transition count 2062
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 785 transition count 2034
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 785 transition count 2034
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 785 transition count 2030
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 773 transition count 2002
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 773 transition count 2002
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 120 place count 757 transition count 1950
Iterating global reduction 2 with 16 rules applied. Total rules applied 136 place count 757 transition count 1950
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 154 place count 739 transition count 1892
Iterating global reduction 2 with 18 rules applied. Total rules applied 172 place count 739 transition count 1892
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 189 place count 722 transition count 1852
Iterating global reduction 2 with 17 rules applied. Total rules applied 206 place count 722 transition count 1852
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 223 place count 705 transition count 1818
Iterating global reduction 2 with 17 rules applied. Total rules applied 240 place count 705 transition count 1818
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 259 place count 686 transition count 1774
Iterating global reduction 2 with 19 rules applied. Total rules applied 278 place count 686 transition count 1774
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 299 place count 665 transition count 1718
Iterating global reduction 2 with 21 rules applied. Total rules applied 320 place count 665 transition count 1718
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 339 place count 646 transition count 1670
Iterating global reduction 2 with 19 rules applied. Total rules applied 358 place count 646 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 635 transition count 1646
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 635 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 388 place count 627 transition count 1630
Iterating global reduction 2 with 8 rules applied. Total rules applied 396 place count 627 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 404 place count 619 transition count 1614
Iterating global reduction 2 with 8 rules applied. Total rules applied 412 place count 619 transition count 1614
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 420 place count 611 transition count 1598
Iterating global reduction 2 with 8 rules applied. Total rules applied 428 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 433 place count 606 transition count 1588
Iterating global reduction 2 with 5 rules applied. Total rules applied 438 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 439 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 440 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 442 place count 605 transition count 1584
Applied a total of 442 rules in 462 ms. Remains 605 /816 variables (removed 211) and now considering 1584/2110 (removed 526) transitions.
[2024-05-23 04:49:51] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 04:49:51] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:49:51] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-23 04:49:51] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:49:51] [INFO ] Invariant cache hit.
[2024-05-23 04:49:52] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:49:53] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
[2024-05-23 04:49:53] [INFO ] Redundant transitions in 26 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:49:53] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:49:53] [INFO ] Invariant cache hit.
[2024-05-23 04:49:53] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68771ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68785ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/816 places, 1584/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71512 ms. Remains : 605/816 places, 1584/2110 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 459 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30049 steps (6 resets) in 85 ms. (349 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 76 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 04:51:04] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:51:04] [INFO ] Invariant cache hit.
[2024-05-23 04:51:04] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-23 04:51:04] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:51:04] [INFO ] Invariant cache hit.
[2024-05-23 04:51:04] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:51:06] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
[2024-05-23 04:51:06] [INFO ] Redundant transitions in 24 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:51:06] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:51:06] [INFO ] Invariant cache hit.
[2024-05-23 04:51:06] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 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 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68418ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70850 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 26986 steps (6 resets) in 25 ms. (1037 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 448 ms.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 69 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 04:52:16] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:52:16] [INFO ] Invariant cache hit.
[2024-05-23 04:52:16] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-23 04:52:16] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:52:16] [INFO ] Invariant cache hit.
[2024-05-23 04:52:16] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:52:18] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2024-05-23 04:52:18] [INFO ] Redundant transitions in 24 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:52:18] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:52:18] [INFO ] Invariant cache hit.
[2024-05-23 04:52:18] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68613ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68627ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70992 ms. Remains : 605/605 places, 1584/1584 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-13 finished in 216284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 3 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 800 transition count 2078
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 800 transition count 2078
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 800 transition count 2066
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 787 transition count 2040
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 85 place count 776 transition count 2010
Iterating global reduction 2 with 11 rules applied. Total rules applied 96 place count 776 transition count 2010
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 764 transition count 1974
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 764 transition count 1974
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 135 place count 749 transition count 1928
Iterating global reduction 2 with 15 rules applied. Total rules applied 150 place count 749 transition count 1928
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 164 place count 735 transition count 1892
Iterating global reduction 2 with 14 rules applied. Total rules applied 178 place count 735 transition count 1892
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 192 place count 721 transition count 1864
Iterating global reduction 2 with 14 rules applied. Total rules applied 206 place count 721 transition count 1864
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 223 place count 704 transition count 1822
Iterating global reduction 2 with 17 rules applied. Total rules applied 240 place count 704 transition count 1822
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 259 place count 685 transition count 1768
Iterating global reduction 2 with 19 rules applied. Total rules applied 278 place count 685 transition count 1768
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 296 place count 667 transition count 1720
Iterating global reduction 2 with 18 rules applied. Total rules applied 314 place count 667 transition count 1720
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 328 place count 653 transition count 1688
Iterating global reduction 2 with 14 rules applied. Total rules applied 342 place count 653 transition count 1688
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 352 place count 643 transition count 1668
Iterating global reduction 2 with 10 rules applied. Total rules applied 362 place count 643 transition count 1668
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 372 place count 633 transition count 1648
Iterating global reduction 2 with 10 rules applied. Total rules applied 382 place count 633 transition count 1648
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 392 place count 623 transition count 1628
Iterating global reduction 2 with 10 rules applied. Total rules applied 402 place count 623 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 617 transition count 1616
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 615 transition count 1612
Applied a total of 418 rules in 292 ms. Remains 615 /816 variables (removed 201) and now considering 1612/2110 (removed 498) transitions.
[2024-05-23 04:53:27] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 04:53:27] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:53:28] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-23 04:53:28] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 04:53:28] [INFO ] Invariant cache hit.
[2024-05-23 04:53:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:53:29] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 04:53:29] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 04:53:29] [INFO ] Invariant cache hit.
[2024-05-23 04:53:29] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/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 31235 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 68949ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68965ms
Starting structural reductions in LTL mode, iteration 1 : 615/816 places, 1612/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71354 ms. Remains : 615/816 places, 1612/2110 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-15 finished in 71442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0)) U (p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(!p0))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c008-LTLCardinality-07
Stuttering acceptance computed with spot in 129 ms :[false, false, p0]
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 787 transition count 2040
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 775 transition count 2008
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 775 transition count 2008
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 759 transition count 1956
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 759 transition count 1956
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 147 place count 742 transition count 1900
Iterating global reduction 2 with 17 rules applied. Total rules applied 164 place count 742 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 726 transition count 1862
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 726 transition count 1862
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 710 transition count 1830
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 710 transition count 1830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 246 place count 692 transition count 1788
Iterating global reduction 2 with 18 rules applied. Total rules applied 264 place count 692 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 283 place count 673 transition count 1740
Iterating global reduction 2 with 19 rules applied. Total rules applied 302 place count 673 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 320 place count 655 transition count 1696
Iterating global reduction 2 with 18 rules applied. Total rules applied 338 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 348 place count 645 transition count 1672
Iterating global reduction 2 with 10 rules applied. Total rules applied 358 place count 645 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 365 place count 638 transition count 1658
Iterating global reduction 2 with 7 rules applied. Total rules applied 372 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 379 place count 631 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 386 place count 631 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 393 place count 624 transition count 1630
Iterating global reduction 2 with 7 rules applied. Total rules applied 400 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 620 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 410 place count 618 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 618 transition count 1618
Applied a total of 412 rules in 363 ms. Remains 618 /816 variables (removed 198) and now considering 1618/2110 (removed 492) transitions.
[2024-05-23 04:54:39] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-23 04:54:39] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:54:40] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-23 04:54:40] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:54:40] [INFO ] Invariant cache hit.
[2024-05-23 04:54:40] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:54:41] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 04:54:41] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 04:54:41] [INFO ] Invariant cache hit.
[2024-05-23 04:54:41] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 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 618/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1698 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 2503 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 68389ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 68406ms
Starting structural reductions in LI_LTL mode, iteration 1 : 618/816 places, 1618/2110 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71052 ms. Remains : 618/816 places, 1618/2110 transitions.
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07
Product exploration explored 100000 steps with 24983 reset in 464 ms.
Product exploration explored 100000 steps with 24996 reset in 475 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[false, p0]
RANDOM walk for 30930 steps (7 resets) in 94 ms. (325 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[false, p0]
Stuttering acceptance computed with spot in 76 ms :[false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1614
Applied a total of 4 rules in 145 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2024-05-23 04:55:51] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-23 04:55:51] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:55:52] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-23 04:55:52] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:55:52] [INFO ] Invariant cache hit.
[2024-05-23 04:55:52] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:55:54] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2024-05-23 04:55:54] [INFO ] Redundant transitions in 29 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 04:55:54] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:55:54] [INFO ] Invariant cache hit.
[2024-05-23 04:55:54] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68084ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70464 ms. Remains : 618/618 places, 1614/1618 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[false, p0]
RANDOM walk for 20921 steps (4 resets) in 61 ms. (337 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[false, p0]
Stuttering acceptance computed with spot in 76 ms :[false, p0]
Stuttering acceptance computed with spot in 74 ms :[false, p0]
Product exploration explored 100000 steps with 33209 reset in 493 ms.
Product exploration explored 100000 steps with 33204 reset in 501 ms.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 71 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-23 04:57:03] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:57:03] [INFO ] Invariant cache hit.
[2024-05-23 04:57:04] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-23 04:57:04] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:57:04] [INFO ] Invariant cache hit.
[2024-05-23 04:57:04] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:57:05] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
[2024-05-23 04:57:06] [INFO ] Redundant transitions in 26 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 04:57:06] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 04:57:06] [INFO ] Invariant cache hit.
[2024-05-23 04:57:06] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68235ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68250ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70498 ms. Remains : 618/618 places, 1614/1614 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 215272 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)))'
[2024-05-23 04:58:14] [INFO ] Flatten gal took : 77 ms
[2024-05-23 04:58:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 04:58:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 816 places, 2110 transitions and 8566 arcs took 17 ms.
Total runtime 1693200 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-c008
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 816
TRANSITIONS: 2110
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.047s, Sys 0.000s]
SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.001s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1758
MODEL NAME: /home/mcc/execution/406/model
816 places, 2110 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716440986310
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-c008"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FunctionPointer-PT-c008, 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 r179-tall-171640601200291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 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 '
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 ;