Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994100316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ShieldRVt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 489K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749121808178

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 11:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 11:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:10:09] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-06-05 11:10:09] [INFO ] Transformed 2003 places.
[2025-06-05 11:10:09] [INFO ] Transformed 2003 transitions.
[2025-06-05 11:10:09] [INFO ] Found NUPN structural information;
[2025-06-05 11:10:09] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-040B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 428 places :
Symmetric choice reduction at 0 with 428 rule applications. Total rules 428 place count 1575 transition count 1575
Iterating global reduction 0 with 428 rules applied. Total rules applied 856 place count 1575 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 1574 transition count 1574
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 1574 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 859 place count 1573 transition count 1573
Iterating global reduction 0 with 1 rules applied. Total rules applied 860 place count 1573 transition count 1573
Applied a total of 860 rules in 564 ms. Remains 1573 /2003 variables (removed 430) and now considering 1573/2003 (removed 430) transitions.
// Phase 1: matrix 1573 rows 1573 cols
[2025-06-05 11:10:10] [INFO ] Computed 161 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:10:11] [INFO ] Implicit Places using invariants in 677 ms returned []
[2025-06-05 11:10:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:10:12] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
Running 1572 sub problems to find dead transitions.
[2025-06-05 11:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s408 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1572/3146 variables, and 0 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1573 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1572/3146 variables, and 0 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1573 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Starting structural reductions in LTL mode, iteration 1 : 1573/2003 places, 1573/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62975 ms. Remains : 1573/2003 places, 1573/2003 transitions.
Support contains 39 out of 1573 places after structural reductions.
[2025-06-05 11:11:13] [INFO ] Flatten gal took : 112 ms
[2025-06-05 11:11:13] [INFO ] Flatten gal took : 62 ms
[2025-06-05 11:11:13] [INFO ] Input system was already deterministic with 1573 transitions.
Support contains 38 out of 1573 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1468 ms. (27 steps per ms) remains 18/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
[2025-06-05 11:11:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp25 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 281/304 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1269/1573 variables, 137/161 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1573 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1573/3146 variables, 1573/1734 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3146 variables, 0/1734 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/3146 variables, 0/1734 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3146/3146 variables, and 1734 constraints, problems are : Problem set: 1 solved, 17 unsolved in 2482 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1573/1573 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 232/253 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1320/1573 variables, 142/161 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:17] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:17] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:17] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:17] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:17] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:18] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:18] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:18] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:18] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:18] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:18] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:19] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:19] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:19] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:11:19] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1573 variables, 15/176 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1573 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1573/3146 variables, 1573/1749 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3146 variables, 17/1766 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3146/3146 variables, and 1766 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1573/1573 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7522ms problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 1573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 1573 transition count 1152
Reduce places removed 421 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 424 rules applied. Total rules applied 845 place count 1152 transition count 1149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 848 place count 1149 transition count 1149
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 308 Pre rules applied. Total rules applied 848 place count 1149 transition count 841
Deduced a syphon composed of 308 places in 2 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 616 rules applied. Total rules applied 1464 place count 841 transition count 841
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1471 place count 834 transition count 834
Iterating global reduction 3 with 7 rules applied. Total rules applied 1478 place count 834 transition count 834
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1478 place count 834 transition count 827
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1492 place count 827 transition count 827
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: 363
Deduced a syphon composed of 363 places in 0 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 3 with 726 rules applied. Total rules applied 2218 place count 464 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2219 place count 464 transition count 463
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2221 place count 463 transition count 462
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2423 place count 362 transition count 554
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 2449 place count 349 transition count 567
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2450 place count 349 transition count 566
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2451 place count 349 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2452 place count 348 transition count 565
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2453 place count 348 transition count 564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2454 place count 347 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2455 place count 346 transition count 563
Applied a total of 2455 rules in 272 ms. Remains 346 /1573 variables (removed 1227) and now considering 563/1573 (removed 1010) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 346/1573 places, 563/1573 transitions.
RANDOM walk for 40000 steps (12 resets) in 747 ms. (53 steps per ms) remains 13/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
// Phase 1: matrix 563 rows 346 cols
[2025-06-05 11:11:22] [INFO ] Computed 160 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/50 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 170/333 variables, 70/135 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 35/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 81/414 variables, 40/210 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 22/436 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 22/458 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 22/480 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 22/502 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/502 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/502 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 22/524 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/524 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/524 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 19/543 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/543 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/543 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 24/567 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/567 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/567 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 3/570 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/570 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/570 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (OVERLAPS) 20/590 variables, 10/325 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/590 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/590 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 23/613 variables, 8/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/613 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/613 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 2/615 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/615 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 23/638 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/638 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/638 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 23/661 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/661 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/661 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 1/662 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/662 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/662 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 22/684 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/684 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/684 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (OVERLAPS) 22/706 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/706 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/706 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 22/728 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/728 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/728 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (OVERLAPS) 22/750 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/750 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/750 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (OVERLAPS) 22/772 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/772 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/772 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (OVERLAPS) 22/794 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/794 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/794 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (OVERLAPS) 22/816 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/816 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/816 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (OVERLAPS) 22/838 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/838 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/838 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (OVERLAPS) 22/860 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/860 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/860 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (OVERLAPS) 22/882 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/882 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/882 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (OVERLAPS) 19/901 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/901 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/901 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 85 (OVERLAPS) 8/909 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/909 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/909 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 88 (OVERLAPS) 0/909 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 506 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2875 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/50 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 170/333 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 35/175 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 7/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 81/414 variables, 40/222 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 22/436 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 22/458 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 22/480 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 22/502 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 22/524 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/524 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/524 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 19/543 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/543 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/543 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 24/567 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/567 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/567 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 3/570 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/570 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/570 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 20/590 variables, 10/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/590 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/590 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 23/613 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/613 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/613 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 2/615 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/615 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 23/638 variables, 10/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/638 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/638 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 23/661 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/661 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/661 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (OVERLAPS) 1/662 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/662 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/662 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (OVERLAPS) 22/684 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/684 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/684 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (OVERLAPS) 22/706 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/706 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/706 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (OVERLAPS) 22/728 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/728 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/728 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (OVERLAPS) 22/750 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/750 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/750 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (OVERLAPS) 22/772 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/772 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/772 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (OVERLAPS) 22/794 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/794 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/794 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (OVERLAPS) 22/816 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/816 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/816 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (OVERLAPS) 22/838 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/838 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/838 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (OVERLAPS) 22/860 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/860 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/860 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (OVERLAPS) 22/882 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/882 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/882 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 84 (OVERLAPS) 19/901 variables, 8/508 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/901 variables, 4/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/901 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 87 (OVERLAPS) 8/909 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/909 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/909 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 90 (OVERLAPS) 0/909 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 909/909 variables, and 518 constraints, problems are : Problem set: 0 solved, 12 unsolved in 7703 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10589ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1479 ms.
Support contains 17 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 563/563 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 346 transition count 561
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 344 transition count 561
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 342 transition count 559
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 340 transition count 563
Applied a total of 12 rules in 27 ms. Remains 340 /346 variables (removed 6) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 340/346 places, 563/563 transitions.
RANDOM walk for 40000 steps (16 resets) in 322 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 163507 steps, run timeout after 3027 ms. (steps per millisecond=54 ) properties seen :0 out of 12
Probabilistic random walk after 163507 steps, saw 109855 distinct states, run finished after 3032 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 563 rows 340 cols
[2025-06-05 11:11:38] [INFO ] Computed 160 invariants in 2 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/50 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 170/333 variables, 70/135 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 35/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 81/414 variables, 40/210 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 22/436 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 22/458 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 22/480 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 22/502 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/502 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/502 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 22/524 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/524 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/524 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 22/546 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/546 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/546 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 22/568 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/568 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/568 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 22/590 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/590 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/590 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (OVERLAPS) 22/612 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/612 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/612 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 22/634 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/634 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/634 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 22/656 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/656 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/656 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (OVERLAPS) 22/678 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/678 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/678 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 22/700 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/700 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/700 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 22/722 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/722 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/722 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 22/744 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/744 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/744 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 22/766 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/766 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/766 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (OVERLAPS) 22/788 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/788 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/788 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (OVERLAPS) 22/810 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/810 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/810 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (OVERLAPS) 22/832 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/832 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/832 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (OVERLAPS) 22/854 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/854 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/854 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (OVERLAPS) 22/876 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/876 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/876 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (OVERLAPS) 19/895 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/895 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/895 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (OVERLAPS) 8/903 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/903 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/903 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (OVERLAPS) 0/903 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 903/903 variables, and 500 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2601 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/50 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 170/333 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 35/175 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 7/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 81/414 variables, 40/222 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 22/436 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 22/458 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 22/480 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 22/502 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 22/524 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/524 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/524 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 22/546 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/546 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/546 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 22/568 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/568 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/568 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 22/590 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/590 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/590 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 22/612 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/612 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/612 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 22/634 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/634 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/634 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 22/656 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/656 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/656 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 22/678 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/678 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/678 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 22/700 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/700 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/700 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 22/722 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/722 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/722 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (OVERLAPS) 22/744 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/744 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/744 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 22/766 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/766 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/766 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (OVERLAPS) 22/788 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/788 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/788 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (OVERLAPS) 22/810 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/810 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/810 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (OVERLAPS) 22/832 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/832 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/832 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (OVERLAPS) 22/854 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/854 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/854 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (OVERLAPS) 22/876 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/876 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/876 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (OVERLAPS) 19/895 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/895 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/895 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (OVERLAPS) 8/903 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/903 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/903 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (OVERLAPS) 0/903 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 903/903 variables, and 512 constraints, problems are : Problem set: 0 solved, 12 unsolved in 7048 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9657ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1867 ms.
Support contains 17 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 563/563 transitions.
Applied a total of 0 rules in 12 ms. Remains 340 /340 variables (removed 0) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 340/340 places, 563/563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 563/563 transitions.
Applied a total of 0 rules in 10 ms. Remains 340 /340 variables (removed 0) and now considering 563/563 (removed 0) transitions.
[2025-06-05 11:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:11:49] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-05 11:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:11:50] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:11:50] [INFO ] Redundant transitions in 27 ms returned []
Running 555 sub problems to find dead transitions.
[2025-06-05 11:11:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (OVERLAPS) 5/340 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 563/903 variables, 340/500 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)timeout

(s160 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/903 variables, and 500 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (OVERLAPS) 5/340 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 563/903 variables, 340/500 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 555/1055 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/903 variables, and 1055 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60659 ms. Remains : 340/340 places, 563/563 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 145 edges and 340 vertex of which 4 / 340 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1150 edges and 338 vertex of which 336 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 142 edges and 334 vertex of which 4 / 334 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 332 transition count 554
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 141 edges and 330 vertex of which 6 / 330 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 327 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 139 edges and 324 vertex of which 8 / 324 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 320 transition count 534
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 316 vertex of which 8 / 316 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 312 transition count 520
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 308 vertex of which 8 / 308 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 304 transition count 506
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 300 vertex of which 8 / 300 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 296 transition count 492
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 292 vertex of which 8 / 292 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 288 transition count 478
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 284 vertex of which 8 / 284 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 280 transition count 464
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 276 vertex of which 8 / 276 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 272 transition count 450
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 268 vertex of which 8 / 268 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 264 transition count 436
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 256 transition count 422
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 252 vertex of which 8 / 252 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 248 transition count 408
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 240 transition count 394
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 236 vertex of which 8 / 236 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 232 transition count 380
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 228 vertex of which 8 / 228 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 224 transition count 366
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 220 vertex of which 8 / 220 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 216 transition count 352
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 212 vertex of which 8 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 208 transition count 338
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 204 vertex of which 8 / 204 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 200 transition count 324
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 196 vertex of which 8 / 196 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 192 transition count 310
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 188 vertex of which 8 / 188 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 184 transition count 296
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 180 vertex of which 8 / 180 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 176 transition count 282
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 172 vertex of which 8 / 172 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 168 transition count 268
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 164 vertex of which 6 / 164 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 161 transition count 254
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 55 edges and 158 vertex of which 4 / 158 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 14 rules applied. Total rules applied 429 place count 156 transition count 244
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 52 edges and 154 vertex of which 2 / 154 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 24 with 9 rules applied. Total rules applied 438 place count 153 transition count 238
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 5 rules applied. Total rules applied 443 place count 152 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 443 place count 152 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 3 rules applied. Total rules applied 446 place count 150 transition count 233
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 2 places and 0 transitions.
Iterating global reduction 26 with 3 rules applied. Total rules applied 449 place count 148 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 49 edges and 148 vertex of which 2 / 148 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 26 with 4 rules applied. Total rules applied 453 place count 147 transition count 229
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 455 place count 147 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 28 with 14 rules applied. Total rules applied 469 place count 147 transition count 213
Applied a total of 469 rules in 84 ms. Remains 147 /340 variables (removed 193) and now considering 213/563 (removed 350) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 213 rows 147 cols
[2025-06-05 11:12:50] [INFO ] Computed 64 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:12:50] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:12:50] [INFO ] [Nat]Absence check using 64 positive place invariants in 9 ms returned sat
[2025-06-05 11:12:50] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
TRAPS : Iteration 0
[2025-06-05 11:12:50] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
[2025-06-05 11:12:50] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Over-approximation ignoring read arcs solved 0 properties in 674 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 479 stabilizing places and 479 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 431 rules applied. Total rules applied 431 place count 1572 transition count 1141
Reduce places removed 431 places and 0 transitions.
Iterating post reduction 1 with 431 rules applied. Total rules applied 862 place count 1141 transition count 1141
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 862 place count 1141 transition count 824
Deduced a syphon composed of 317 places in 1 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1496 place count 824 transition count 824
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1507 place count 813 transition count 813
Iterating global reduction 2 with 11 rules applied. Total rules applied 1518 place count 813 transition count 813
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1518 place count 813 transition count 802
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1540 place count 802 transition count 802
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 2250 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 447 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2253 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2455 place count 345 transition count 545
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2491 place count 327 transition count 563
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2492 place count 327 transition count 563
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2494 place count 325 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2495 place count 324 transition count 561
Applied a total of 2495 rules in 192 ms. Remains 324 /1573 variables (removed 1249) and now considering 561/1573 (removed 1012) transitions.
// Phase 1: matrix 561 rows 324 cols
[2025-06-05 11:12:51] [INFO ] Computed 160 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:51] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-05 11:12:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:12:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-05 11:12:52] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:12:52] [INFO ] Redundant transitions in 12 ms returned []
Running 556 sub problems to find dead transitions.
[2025-06-05 11:12:52] [INFO ] Invariant cache hit.
[2025-06-05 11:12:52] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/885 variables, and 495 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 556/1051 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:38] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 1052 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1573 places, 561/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60939 ms. Remains : 324/1573 places, 561/1573 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-01
Product exploration explored 100000 steps with 28 reset in 490 ms.
Product exploration explored 100000 steps with 29 reset in 572 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/324 stabilizing places and 2/561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 352 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (13 resets) in 469 ms. (85 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
[2025-06-05 11:13:54] [INFO ] Invariant cache hit.
[2025-06-05 11:13:54] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/44 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 58/102 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 82/184 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 63/247 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 47/294 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/294 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 44/338 variables, 16/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/338 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 44/382 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/382 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 44/426 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/426 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/426 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 44/470 variables, 16/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/470 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/470 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 44/514 variables, 16/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/514 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/514 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 44/558 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/558 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/558 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 44/602 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/602 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/602 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 41/643 variables, 16/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/643 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/643 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 28/671 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/671 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/671 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 22/693 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/693 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/693 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 22/715 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/715 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/715 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 22/737 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/737 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/737 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 22/759 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/759 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/759 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 22/781 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/781 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/781 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 22/803 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/803 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/803 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 22/825 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/825 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/825 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 22/847 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/847 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 20/867 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/867 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/867 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 14/881 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/881 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/881 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 3/884 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/884 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/885 variables, and 494 constraints, problems are : Problem set: 0 solved, 2 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:54] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/44 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 58/102 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 82/184 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 63/247 variables, 26/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 47/294 variables, 18/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/294 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/294 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 44/338 variables, 16/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/338 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 44/382 variables, 16/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/382 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/382 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 44/426 variables, 16/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/426 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/426 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 44/470 variables, 16/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/470 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/470 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 44/514 variables, 16/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/514 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/514 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 44/558 variables, 16/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/558 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/558 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 44/602 variables, 16/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/602 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/602 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 41/643 variables, 16/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/643 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/643 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 28/671 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/671 variables, 6/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 22/693 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/693 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/693 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 22/715 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/715 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/715 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 22/737 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/737 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/737 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 22/759 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/759 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/759 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 22/781 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 22/803 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/803 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/803 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 22/825 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/825 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/825 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 22/847 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/847 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/847 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 20/867 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/867 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/867 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 14/881 variables, 6/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/881 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/881 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 3/884 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/884 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/884 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 0/884 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/885 variables, and 497 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1648ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 561/561 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 560
Applied a total of 1 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 560/561 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 324/324 places, 560/561 transitions.
RANDOM walk for 40000 steps (10 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 365806 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :1 out of 2
Probabilistic random walk after 365806 steps, saw 235688 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :1
// Phase 1: matrix 560 rows 324 cols
[2025-06-05 11:13:59] [INFO ] Computed 160 invariants in 9 ms
[2025-06-05 11:13:59] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/44 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/102 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/184 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/247 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 47/294 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/294 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 44/338 variables, 16/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/338 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 44/382 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/382 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/426 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/426 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/426 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 44/470 variables, 16/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/470 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/470 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 44/514 variables, 16/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/514 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/514 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 44/558 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/558 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/558 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 44/602 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/602 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/602 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 41/643 variables, 16/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/643 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/643 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 28/671 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/671 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/671 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/693 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/693 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/693 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/715 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/715 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/715 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/737 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/737 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/737 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/759 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/759 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/759 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/781 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/781 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/781 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/803 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/803 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/803 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/825 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/825 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/825 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/847 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/847 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 20/867 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/867 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/867 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 14/881 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/881 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/881 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 3/884 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/884 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/884 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:13:59] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/44 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 58/102 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/184 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/247 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/294 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/294 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/294 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 44/338 variables, 16/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/338 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 44/382 variables, 16/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/382 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/382 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 44/426 variables, 16/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/426 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/426 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 44/470 variables, 16/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/470 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/470 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 44/514 variables, 16/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/514 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/514 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 44/558 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/558 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/558 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 44/602 variables, 16/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/602 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/602 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 41/643 variables, 16/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/643 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/643 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 28/671 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/671 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/693 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/693 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/693 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/715 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/715 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/715 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/737 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/737 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/737 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/759 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/759 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/759 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/781 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/803 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/803 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/803 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/825 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/825 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/825 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/847 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/847 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/847 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 20/867 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/867 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 14/881 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/881 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/881 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/884 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/884 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/884 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1104ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 560/560 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 324/324 places, 560/560 transitions.
RANDOM walk for 40000 steps (13 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 488121 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 488121 steps, saw 314907 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2025-06-05 11:14:03] [INFO ] Invariant cache hit.
[2025-06-05 11:14:03] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/44 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/102 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/184 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/247 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 47/294 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/294 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 44/338 variables, 16/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/338 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 44/382 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/382 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/426 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/426 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/426 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 44/470 variables, 16/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/470 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/470 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 44/514 variables, 16/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/514 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/514 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 44/558 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/558 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/558 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 44/602 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/602 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/602 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 41/643 variables, 16/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/643 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/643 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 28/671 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/671 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/671 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/693 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/693 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/693 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/715 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/715 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/715 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/737 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/737 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/737 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/759 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/759 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/759 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/781 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/781 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/781 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/803 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/803 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/803 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/825 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/825 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/825 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/847 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/847 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 20/867 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/867 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/867 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 14/881 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/881 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/881 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 3/884 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/884 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/884 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:03] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/44 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 58/102 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/184 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/247 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/294 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/294 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/294 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 44/338 variables, 16/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/338 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 44/382 variables, 16/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/382 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/382 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 44/426 variables, 16/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/426 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/426 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 44/470 variables, 16/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/470 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/470 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 44/514 variables, 16/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/514 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/514 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 44/558 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/558 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/558 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 44/602 variables, 16/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/602 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/602 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 41/643 variables, 16/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/643 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/643 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 28/671 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/671 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/693 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/693 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/693 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/715 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/715 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/715 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/737 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/737 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/737 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/759 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/759 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/759 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/781 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/803 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/803 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/803 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/825 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/825 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/825 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/847 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/847 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/847 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 20/867 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/867 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 14/881 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/881 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/881 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/884 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/884 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/884 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1070ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 560/560 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 324/324 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 560/560 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2025-06-05 11:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:04] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-05 11:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:14:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-05 11:14:04] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:14:04] [INFO ] Redundant transitions in 4 ms returned []
Running 556 sub problems to find dead transitions.
[2025-06-05 11:14:04] [INFO ] Invariant cache hit.
[2025-06-05 11:14:04] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:14] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 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 884/884 variables, and 495 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 556/1051 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:14:51] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/884 variables, and 1052 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60691 ms. Remains : 324/324 places, 560/560 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 324 vertex of which 4 / 324 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1108 edges and 322 vertex of which 320 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 157 edges and 318 vertex of which 4 / 318 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 316 transition count 551
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 156 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 311 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 154 edges and 308 vertex of which 8 / 308 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 304 transition count 531
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 300 vertex of which 8 / 300 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 296 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 292 vertex of which 8 / 292 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 288 transition count 503
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 284 vertex of which 8 / 284 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 280 transition count 489
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 276 vertex of which 8 / 276 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 272 transition count 475
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 268 vertex of which 8 / 268 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 264 transition count 461
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 256 transition count 447
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 252 vertex of which 8 / 252 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 248 transition count 433
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 240 transition count 419
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 236 vertex of which 8 / 236 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 232 transition count 405
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 8 / 228 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 224 transition count 391
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 220 vertex of which 8 / 220 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 216 transition count 377
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 212 vertex of which 8 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 208 transition count 363
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 204 vertex of which 8 / 204 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 200 transition count 349
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 196 vertex of which 8 / 196 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 192 transition count 335
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 94 edges and 188 vertex of which 8 / 188 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 184 transition count 321
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 90 edges and 180 vertex of which 8 / 180 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 176 transition count 307
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 86 edges and 172 vertex of which 8 / 172 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 168 transition count 293
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 82 edges and 164 vertex of which 8 / 164 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 160 transition count 279
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 78 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 152 transition count 265
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 74 edges and 148 vertex of which 8 / 148 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 144 transition count 251
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 67 edges and 142 vertex of which 2 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 23 with 13 rules applied. Total rules applied 428 place count 141 transition count 241
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 432 place count 140 transition count 238
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 25 with 2 rules applied. Total rules applied 434 place count 139 transition count 237
Graph (complete) has 466 edges and 139 vertex of which 137 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 25 with 1 rules applied. Total rules applied 435 place count 137 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 439 place count 137 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 27 with 3 rules applied. Total rules applied 442 place count 137 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 444 place count 135 transition count 229
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 2 places and 0 transitions.
Iterating global reduction 28 with 3 rules applied. Total rules applied 447 place count 133 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 451 place count 133 transition count 224
Applied a total of 451 rules in 58 ms. Remains 133 /324 variables (removed 191) and now considering 224/560 (removed 336) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 133 cols
[2025-06-05 11:15:05] [INFO ] Computed 65 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:15:05] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:15:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2025-06-05 11:15:05] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-05 11:15:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 11:15:05] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 11:15:05] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 11:15:05] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 220 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 445 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 561/561 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 561/561 (removed 0) transitions.
// Phase 1: matrix 561 rows 324 cols
[2025-06-05 11:15:05] [INFO ] Computed 160 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:15:06] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-05 11:15:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:15:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-05 11:15:06] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:15:06] [INFO ] Redundant transitions in 3 ms returned []
Running 556 sub problems to find dead transitions.
[2025-06-05 11:15:06] [INFO ] Invariant cache hit.
[2025-06-05 11:15:06] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/885 variables, and 495 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 556/1051 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:15:53] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 1052 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60710 ms. Remains : 324/324 places, 561/561 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/324 stabilizing places and 2/561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 386 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 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (13 resets) in 229 ms. (173 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
[2025-06-05 11:16:07] [INFO ] Invariant cache hit.
[2025-06-05 11:16:07] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/44 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 58/102 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 82/184 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 63/247 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 47/294 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/294 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 44/338 variables, 16/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/338 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 44/382 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/382 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 44/426 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/426 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/426 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 44/470 variables, 16/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/470 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/470 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 44/514 variables, 16/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/514 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/514 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 44/558 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/558 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/558 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 44/602 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/602 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/602 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 41/643 variables, 16/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/643 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/643 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 28/671 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/671 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/671 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 22/693 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/693 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/693 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 22/715 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/715 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/715 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 22/737 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/737 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/737 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 22/759 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/759 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/759 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 22/781 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/781 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/781 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 22/803 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/803 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/803 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 22/825 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/825 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/825 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 22/847 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/847 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 20/867 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/867 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/867 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 14/881 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/881 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/881 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 3/884 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/884 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/885 variables, and 494 constraints, problems are : Problem set: 0 solved, 2 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:07] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/44 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 58/102 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 82/184 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 63/247 variables, 26/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 47/294 variables, 18/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/294 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/294 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 44/338 variables, 16/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/338 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 44/382 variables, 16/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/382 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/382 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 44/426 variables, 16/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/426 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/426 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 44/470 variables, 16/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/470 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/470 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 44/514 variables, 16/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/514 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/514 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 44/558 variables, 16/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/558 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/558 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 44/602 variables, 16/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/602 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/602 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 41/643 variables, 16/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/643 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/643 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 28/671 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/671 variables, 6/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 22/693 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/693 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/693 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 22/715 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/715 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/715 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 22/737 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/737 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/737 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 22/759 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/759 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/759 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 22/781 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 22/803 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/803 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/803 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 22/825 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/825 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/825 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 22/847 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/847 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/847 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 20/867 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/867 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/867 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 14/881 variables, 6/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/881 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/881 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 3/884 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/884 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/884 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 0/884 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/885 variables, and 497 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1602ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 561/561 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 560
Applied a total of 1 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 560/561 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 324/324 places, 560/561 transitions.
RANDOM walk for 40000 steps (19 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 290498 steps, run timeout after 3009 ms. (steps per millisecond=96 ) properties seen :1 out of 2
Probabilistic random walk after 290498 steps, saw 186890 distinct states, run finished after 3009 ms. (steps per millisecond=96 ) properties seen :1
// Phase 1: matrix 560 rows 324 cols
[2025-06-05 11:16:12] [INFO ] Computed 160 invariants in 3 ms
[2025-06-05 11:16:12] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/44 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/102 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/184 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/247 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 47/294 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/294 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 44/338 variables, 16/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/338 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 44/382 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/382 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/426 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/426 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/426 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 44/470 variables, 16/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/470 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/470 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 44/514 variables, 16/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/514 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/514 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 44/558 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/558 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/558 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 44/602 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/602 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/602 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 41/643 variables, 16/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/643 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/643 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 28/671 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/671 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/671 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/693 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/693 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/693 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/715 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/715 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/715 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/737 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/737 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/737 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/759 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/759 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/759 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/781 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/781 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/781 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/803 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/803 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/803 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/825 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/825 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/825 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/847 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/847 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 20/867 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/867 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/867 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 14/881 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/881 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/881 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 3/884 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/884 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/884 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:12] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/44 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 58/102 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/184 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/247 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/294 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/294 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/294 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 44/338 variables, 16/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/338 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 44/382 variables, 16/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/382 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/382 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 44/426 variables, 16/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/426 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/426 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 44/470 variables, 16/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/470 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/470 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 44/514 variables, 16/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/514 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/514 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 44/558 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/558 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/558 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 44/602 variables, 16/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/602 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/602 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 41/643 variables, 16/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/643 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/643 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 28/671 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/671 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/693 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/693 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/693 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/715 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/715 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/715 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/737 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/737 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/737 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/759 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/759 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/759 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/781 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/803 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/803 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/803 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/825 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/825 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/825 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/847 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/847 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/847 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 20/867 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/867 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 14/881 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/881 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/881 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/884 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/884 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/884 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 560/560 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 324/324 places, 560/560 transitions.
RANDOM walk for 40000 steps (11 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 483130 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 483130 steps, saw 311711 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2025-06-05 11:16:16] [INFO ] Invariant cache hit.
[2025-06-05 11:16:16] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/44 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/102 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/184 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/247 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 47/294 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/294 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 44/338 variables, 16/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/338 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 44/382 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/382 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/426 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/426 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/426 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 44/470 variables, 16/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/470 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/470 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 44/514 variables, 16/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/514 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/514 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 44/558 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/558 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/558 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 44/602 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/602 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/602 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 41/643 variables, 16/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/643 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/643 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 28/671 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/671 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/671 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/693 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/693 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/693 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/715 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/715 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/715 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/737 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/737 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/737 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/759 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/759 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/759 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/781 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/781 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/781 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/803 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/803 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/803 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/825 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/825 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/825 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/847 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/847 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/847 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 20/867 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/867 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/867 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 14/881 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/881 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/881 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 3/884 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/884 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 0/884 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/884 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/44 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 58/102 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/184 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/247 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 47/294 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/294 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/294 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 44/338 variables, 16/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/338 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 44/382 variables, 16/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/382 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/382 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 44/426 variables, 16/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/426 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/426 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 44/470 variables, 16/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/470 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/470 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 44/514 variables, 16/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/514 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/514 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 44/558 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/558 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/558 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 44/602 variables, 16/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/602 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/602 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 41/643 variables, 16/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/643 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/643 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 28/671 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/671 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/693 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/693 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/693 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/715 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/715 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/715 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/737 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/737 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/737 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/759 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/759 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/759 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/781 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/781 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/781 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/803 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/803 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/803 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/825 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/825 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/825 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/847 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/847 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/847 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 20/867 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/867 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 14/881 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/881 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/881 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/884 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/884 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 0/884 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/884 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 999ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 560/560 transitions.
Applied a total of 0 rules in 7 ms. Remains 324 /324 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 324/324 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 560/560 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2025-06-05 11:16:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-05 11:16:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-05 11:16:17] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:16:17] [INFO ] Redundant transitions in 2 ms returned []
Running 556 sub problems to find dead transitions.
[2025-06-05 11:16:17] [INFO ] Invariant cache hit.
[2025-06-05 11:16:17] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:16:27] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/884 variables, and 495 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 556/1051 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:04] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/884 variables, and 1052 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60670 ms. Remains : 324/324 places, 560/560 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 324 vertex of which 4 / 324 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1108 edges and 322 vertex of which 320 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 157 edges and 318 vertex of which 4 / 318 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 316 transition count 551
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 156 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 311 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 154 edges and 308 vertex of which 8 / 308 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 304 transition count 531
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 300 vertex of which 8 / 300 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 296 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 292 vertex of which 8 / 292 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 288 transition count 503
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 284 vertex of which 8 / 284 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 280 transition count 489
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 276 vertex of which 8 / 276 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 272 transition count 475
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 268 vertex of which 8 / 268 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 264 transition count 461
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 256 transition count 447
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 252 vertex of which 8 / 252 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 248 transition count 433
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 240 transition count 419
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 236 vertex of which 8 / 236 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 232 transition count 405
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 8 / 228 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 224 transition count 391
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 220 vertex of which 8 / 220 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 216 transition count 377
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 212 vertex of which 8 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 208 transition count 363
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 204 vertex of which 8 / 204 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 200 transition count 349
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 196 vertex of which 8 / 196 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 192 transition count 335
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 94 edges and 188 vertex of which 8 / 188 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 184 transition count 321
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 90 edges and 180 vertex of which 8 / 180 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 176 transition count 307
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 86 edges and 172 vertex of which 8 / 172 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 168 transition count 293
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 82 edges and 164 vertex of which 8 / 164 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 160 transition count 279
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 78 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 152 transition count 265
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 74 edges and 148 vertex of which 8 / 148 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 144 transition count 251
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 67 edges and 142 vertex of which 2 / 142 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 23 with 13 rules applied. Total rules applied 428 place count 141 transition count 241
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 432 place count 140 transition count 238
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 25 with 2 rules applied. Total rules applied 434 place count 139 transition count 237
Graph (complete) has 466 edges and 139 vertex of which 137 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 25 with 1 rules applied. Total rules applied 435 place count 137 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 439 place count 137 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 27 with 3 rules applied. Total rules applied 442 place count 137 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 444 place count 135 transition count 229
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 2 places and 0 transitions.
Iterating global reduction 28 with 3 rules applied. Total rules applied 447 place count 133 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 451 place count 133 transition count 224
Applied a total of 451 rules in 56 ms. Remains 133 /324 variables (removed 191) and now considering 224/560 (removed 336) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 133 cols
[2025-06-05 11:17:17] [INFO ] Computed 65 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:17:18] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:17:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 7 ms returned sat
[2025-06-05 11:17:18] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-05 11:17:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 11:17:18] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 11:17:18] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 11:17:18] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 213 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 415 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20 reset in 453 ms.
Product exploration explored 100000 steps with 28 reset in 513 ms.
Built C files in :
/tmp/ltsmin43238359871453401
[2025-06-05 11:17:19] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2025-06-05 11:17:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:17:19] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2025-06-05 11:17:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:17:19] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2025-06-05 11:17:19] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:17:19] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin43238359871453401
Running compilation step : cd /tmp/ltsmin43238359871453401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1459 ms.
Running link step : cd /tmp/ltsmin43238359871453401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin43238359871453401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11556084431839810132.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 561/561 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 561/561 (removed 0) transitions.
// Phase 1: matrix 561 rows 324 cols
[2025-06-05 11:17:34] [INFO ] Computed 160 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:35] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-05 11:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-05 11:17:35] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:17:35] [INFO ] Redundant transitions in 2 ms returned []
Running 556 sub problems to find dead transitions.
[2025-06-05 11:17:35] [INFO ] Invariant cache hit.
[2025-06-05 11:17:35] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/885 variables, and 495 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (OVERLAPS) 560/884 variables, 324/485 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 556/1051 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:21] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 1052 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60696 ms. Remains : 324/324 places, 561/561 transitions.
Built C files in :
/tmp/ltsmin10817550229123184459
[2025-06-05 11:18:35] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2025-06-05 11:18:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:18:35] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2025-06-05 11:18:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:18:35] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2025-06-05 11:18:35] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:18:35] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10817550229123184459
Running compilation step : cd /tmp/ltsmin10817550229123184459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1346 ms.
Running link step : cd /tmp/ltsmin10817550229123184459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10817550229123184459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13187788081500887078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:18:50] [INFO ] Flatten gal took : 40 ms
[2025-06-05 11:18:50] [INFO ] Flatten gal took : 30 ms
[2025-06-05 11:18:50] [INFO ] Time to serialize gal into /tmp/LTL13408051225560649421.gal : 7 ms
[2025-06-05 11:18:50] [INFO ] Time to serialize properties into /tmp/LTL2625412306997982537.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13408051225560649421.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5613554453538646158.hoa' '-atoms' '/tmp/LTL2625412306997982537.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2625412306997982537.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5613554453538646158.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t363, t365, t367, t369, t371, t373, t375, t376, t379, t381, t383, t386, t388, t390, t392,...913
Computing Next relation with stutter on 4.90389e+30 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
118 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.25963,61028,1,0,863,334069,1149,233,16322,150795,1138
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-040B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-040B-LTLFireability-01 finished in 361007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(p0))||(!p1&&F(p0)))) U X(X((p2&&F(!p3))))))'
Support contains 7 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 145 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2025-06-05 11:18:52] [INFO ] Computed 161 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:52] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-05 11:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:18:54] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2025-06-05 11:18:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62031 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 597 ms :[(OR (NOT p2) p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p2) p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p2) p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p3), p3, (AND (NOT p0) p3), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-02
Stuttering criterion allowed to conclude after 27240 steps with 18 reset in 134 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-02 finished in 62819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(G(p1)) U p1)))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1562 transition count 1562
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1562 transition count 1562
Applied a total of 22 rules in 137 ms. Remains 1562 /1573 variables (removed 11) and now considering 1562/1573 (removed 11) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2025-06-05 11:19:55] [INFO ] Computed 161 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:19:55] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-05 11:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:19:56] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2025-06-05 11:19:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1573 places, 1562/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61934 ms. Remains : 1562/1573 places, 1562/1573 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-03
Stuttering criterion allowed to conclude after 27296 steps with 0 reset in 104 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-03 finished in 62186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p0&&(p1||G(p2))))))'
Support contains 1 out of 1573 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 431 rules applied. Total rules applied 431 place count 1572 transition count 1141
Reduce places removed 431 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 432 rules applied. Total rules applied 863 place count 1141 transition count 1140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 864 place count 1140 transition count 1140
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 864 place count 1140 transition count 825
Deduced a syphon composed of 315 places in 1 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1494 place count 825 transition count 825
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1504 place count 815 transition count 815
Iterating global reduction 3 with 10 rules applied. Total rules applied 1514 place count 815 transition count 815
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1514 place count 815 transition count 805
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1534 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 3 with 718 rules applied. Total rules applied 2252 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2253 place count 446 transition count 445
Renaming transitions due to excessive name length > 1024 char.
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 2255 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2457 place count 344 transition count 544
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2491 place count 327 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2493 place count 325 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2494 place count 324 transition count 558
Applied a total of 2494 rules in 161 ms. Remains 324 /1573 variables (removed 1249) and now considering 558/1573 (removed 1015) transitions.
// Phase 1: matrix 558 rows 324 cols
[2025-06-05 11:20:57] [INFO ] Computed 160 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:20:57] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-05 11:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:20:57] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:20:57] [INFO ] Redundant transitions in 2 ms returned []
Running 554 sub problems to find dead transitions.
[2025-06-05 11:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 554 unsolved in 28710 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 554/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 881/882 variables, and 1038 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58811ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 58812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1573 places, 558/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59454 ms. Remains : 324/1573 places, 558/1573 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-06
Product exploration explored 100000 steps with 24 reset in 446 ms.
Product exploration explored 100000 steps with 29 reset in 500 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (18 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 63507 steps, run visited all 1 properties in 380 ms. (steps per millisecond=167 )
Probabilistic random walk after 63507 steps, saw 42617 distinct states, run finished after 384 ms. (steps per millisecond=165 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-06 finished in 61203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(((F(p0) U p1)||X(p2))) U G(p1)))))'
Support contains 3 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1562 transition count 1562
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1562 transition count 1562
Applied a total of 22 rules in 138 ms. Remains 1562 /1573 variables (removed 11) and now considering 1562/1573 (removed 11) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2025-06-05 11:21:58] [INFO ] Computed 161 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:59] [INFO ] Implicit Places using invariants in 354 ms returned []
[2025-06-05 11:21:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:22:00] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2025-06-05 11:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1573 places, 1562/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61875 ms. Remains : 1562/1573 places, 1562/1573 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-07
Product exploration explored 100000 steps with 246 reset in 341 ms.
Stack based approach found an accepted trace after 1546 steps with 2 reset with depth 880 and stack size 379 in 16 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-07 finished in 62547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(p1)))))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 139 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2025-06-05 11:23:01] [INFO ] Computed 161 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:01] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-06-05 11:23:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:02] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2025-06-05 11:23:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62085 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-08
Stuttering criterion allowed to conclude after 1768 steps with 0 reset in 6 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-08 finished in 62326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 141 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
[2025-06-05 11:24:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:24:03] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-05 11:24:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:24:05] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2025-06-05 11:24:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62002 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-09
Stuttering criterion allowed to conclude after 52729 steps with 0 reset in 210 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-09 finished in 62344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&(p1 U G(p2))))))))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 139 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
[2025-06-05 11:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:25:06] [INFO ] Implicit Places using invariants in 353 ms returned []
[2025-06-05 11:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:25:07] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2025-06-05 11:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62000 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-10 finished in 62268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(!p0))) U (X(X(X(G(!p0))))||(p1&&X((p2&&X(X(!p0))))))))'
Support contains 5 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1563 transition count 1563
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1563 transition count 1563
Applied a total of 20 rules in 139 ms. Remains 1563 /1573 variables (removed 10) and now considering 1563/1573 (removed 10) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2025-06-05 11:26:08] [INFO ] Computed 161 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:26:08] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-06-05 11:26:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:26:09] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
Running 1562 sub problems to find dead transitions.
[2025-06-05 11:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 timeout
1.0)
(s1189 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 1562/1562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 0/1562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in LTL mode, iteration 1 : 1563/1573 places, 1563/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61867 ms. Remains : 1563/1573 places, 1563/1573 transitions.
Stuttering acceptance computed with spot in 395 ms :[p0, p0, true, p0, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 242 ms.
Product exploration explored 100000 steps with 25000 reset in 268 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1563 stabilizing places and 479/1563 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (8 resets) in 403 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 246590 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 246590 steps, saw 118257 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-05 11:27:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1494/1563 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:14] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:14] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:15] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:15] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:15] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:15] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:15] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:15] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:16] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:16] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:16] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:16] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1563 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1563 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1563/3126 variables, 1563/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3126 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3126 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3126/3126 variables, and 1736 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1563/1563 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1494/1563 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1563 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:17] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:17] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:17] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:17] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:18] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:18] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:18] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:18] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:18] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:18] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:19] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:19] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:19] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:19] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:19] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1563 variables, 15/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1563 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1563/3126 variables, 1563/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3126 variables, 1/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:20] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:20] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:20] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:21] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:21] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:21] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:21] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:27:22] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 16 ms to minimize.
SMT process timed out in 7820ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1563/1563 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 1563 transition count 1125
Reduce places removed 438 places and 0 transitions.
Iterating post reduction 1 with 438 rules applied. Total rules applied 876 place count 1125 transition count 1125
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 876 place count 1125 transition count 808
Deduced a syphon composed of 317 places in 3 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1510 place count 808 transition count 808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1512 place count 806 transition count 806
Iterating global reduction 2 with 2 rules applied. Total rules applied 1514 place count 806 transition count 806
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1514 place count 806 transition count 804
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1518 place count 804 transition count 804
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2236 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2237 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 2239 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2441 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2477 place count 325 transition count 561
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2478 place count 325 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2479 place count 324 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2480 place count 323 transition count 559
Applied a total of 2480 rules in 132 ms. Remains 323 /1563 variables (removed 1240) and now considering 559/1563 (removed 1004) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 323/1563 places, 559/1563 transitions.
RANDOM walk for 40000 steps (10 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527214 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527214 steps, saw 341273 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 559 rows 323 cols
[2025-06-05 11:27:25] [INFO ] Computed 160 invariants in 1 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/33 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/72 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/113 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/141 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/163 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/185 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/207 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/207 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/207 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/229 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/229 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/229 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/251 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/251 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/251 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/273 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/273 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/273 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/295 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/295 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/295 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/317 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/317 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/317 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/339 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/339 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/339 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/361 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/361 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/361 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/383 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/383 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/383 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/405 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/405 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/405 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/427 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/427 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/427 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/449 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/449 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/449 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/471 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/471 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/471 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/493 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/493 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/493 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/515 variables, 8/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/515 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/515 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/537 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/537 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/537 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/559 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/559 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/559 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/581 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/581 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/581 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/603 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/603 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/603 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/625 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/625 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/625 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/647 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/647 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/647 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/669 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/669 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/669 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 22/691 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/691 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/691 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 22/713 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/713 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/713 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 22/735 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/735 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/735 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 22/757 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/757 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/757 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 22/779 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/779 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/779 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 22/801 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/801 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/801 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 22/823 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/823 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/823 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 22/845 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/845 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/845 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 20/865 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/865 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/865 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 14/879 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/879 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/879 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 3/882 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/882 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/882 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 0/882 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 882/882 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/33 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/72 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 41/113 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 28/141 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/163 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/163 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/185 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/207 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/207 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/207 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/229 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/229 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/229 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/251 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/251 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/251 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/273 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/273 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/273 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/295 variables, 8/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/295 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/295 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/317 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/317 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/317 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/339 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/339 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/339 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/361 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/361 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/361 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/383 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/383 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/383 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/405 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/405 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/405 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/427 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/427 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/427 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/449 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/449 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/449 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/471 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/471 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/471 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/493 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/493 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/493 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/515 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/515 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/515 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/537 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/537 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/537 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/559 variables, 8/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/559 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/559 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/581 variables, 8/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/581 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/581 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/603 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/603 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/603 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/625 variables, 8/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/625 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/625 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/647 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/647 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/647 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 22/669 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/669 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/669 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 22/691 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/691 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/691 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 22/713 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/713 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/713 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 22/735 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/735 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/735 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 22/757 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/757 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/757 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 22/779 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/779 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/779 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 22/801 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/801 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/801 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 22/823 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/823 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/823 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 22/845 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/845 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/845 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 20/865 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/865 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/865 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 14/879 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/879 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/879 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 3/882 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/882 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/882 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 0/882 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 882/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1903ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 559/559 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 323/323 places, 559/559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 559/559 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2025-06-05 11:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:27:27] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-05 11:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:27:27] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:27:27] [INFO ] Redundant transitions in 3 ms returned []
Running 554 sub problems to find dead transitions.
[2025-06-05 11:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 2/323 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 559/882 variables, 323/483 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 882/882 variables, and 483 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 2/323 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 559/882 variables, 323/483 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/882 variables, 554/1037 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 882/882 variables, and 1037 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60593 ms. Remains : 323/323 places, 559/559 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 323 vertex of which 4 / 323 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1112 edges and 321 vertex of which 319 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 317 vertex of which 4 / 317 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 315 transition count 550
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 313 vertex of which 6 / 313 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 310 transition count 541
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 152 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 303 transition count 530
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 148 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 295 transition count 516
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 144 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 287 transition count 502
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 279 transition count 488
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 271 transition count 474
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 263 transition count 460
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 255 transition count 446
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 247 transition count 432
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 239 transition count 418
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 231 transition count 404
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 223 transition count 390
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 215 transition count 376
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 207 transition count 362
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 100 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 199 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 96 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 191 transition count 334
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 92 edges and 187 vertex of which 8 / 187 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 183 transition count 320
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 88 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 175 transition count 306
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 84 edges and 171 vertex of which 8 / 171 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 167 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 80 edges and 163 vertex of which 8 / 163 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 159 transition count 278
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 76 edges and 155 vertex of which 8 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 151 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 72 edges and 147 vertex of which 8 / 147 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 143 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 68 edges and 139 vertex of which 8 / 139 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 135 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 64 edges and 131 vertex of which 8 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 127 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 60 edges and 123 vertex of which 8 / 123 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 119 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 56 edges and 115 vertex of which 8 / 115 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 111 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 52 edges and 107 vertex of which 8 / 107 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 103 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 48 edges and 99 vertex of which 8 / 99 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 95 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 44 edges and 91 vertex of which 8 / 91 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 87 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 40 edges and 83 vertex of which 8 / 83 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 79 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 36 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 71 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 32 edges and 67 vertex of which 8 / 67 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 63 transition count 110
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 28 edges and 59 vertex of which 8 / 59 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 55 transition count 96
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 24 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 47 transition count 82
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 20 edges and 43 vertex of which 6 / 43 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 40 transition count 68
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 16 edges and 37 vertex of which 4 / 37 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 36 with 14 rules applied. Total rules applied 676 place count 35 transition count 58
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 13 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 37 with 9 rules applied. Total rules applied 685 place count 32 transition count 52
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 5 rules applied. Total rules applied 690 place count 31 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 39 with 1 Pre rules applied. Total rules applied 690 place count 31 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 39 with 3 rules applied. Total rules applied 693 place count 29 transition count 47
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 39 with 2 rules applied. Total rules applied 695 place count 28 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 699 place count 28 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 40 with 3 rules applied. Total rules applied 702 place count 28 transition count 39
Applied a total of 702 rules in 44 ms. Remains 28 /323 variables (removed 295) and now considering 39/559 (removed 520) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 28 cols
[2025-06-05 11:28:27] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:28:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-05 11:28:27] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:28:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-05 11:28:27] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 11:28:27] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 11:28:27] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 122 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 118 ms :[p0, p0, p0, p0, true]
Support contains 3 out of 1563 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1563/1563 transitions.
Applied a total of 0 rules in 73 ms. Remains 1563 /1563 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2025-06-05 11:28:28] [INFO ] Computed 161 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:28:28] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-05 11:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:28:29] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Running 1562 sub problems to find dead transitions.
[2025-06-05 11:28:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 1562/1562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 timeout
1)
(s376 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 0/1562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Finished structural reductions in LTL mode , in 1 iterations and 61842 ms. Remains : 1563/1563 places, 1563/1563 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 253243 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 253243 steps, saw 120836 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2025-06-05 11:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1494/1563 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:33] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:34] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:34] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:34] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:34] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:34] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:35] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:35] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:35] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:35] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:35] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:35] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1563 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1563 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1563/3126 variables, 1563/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3126 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3126 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3126/3126 variables, and 1736 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2644 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1563/1563 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1494/1563 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1563 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:36] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:36] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:36] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:37] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:37] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:37] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:37] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:37] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:37] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:38] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:38] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:38] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:38] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:38] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:38] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1563 variables, 15/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1563 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1563/3126 variables, 1563/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3126 variables, 1/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:39] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:39] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:40] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:40] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:40] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:40] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:29:41] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 18 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3126/3126 variables, and 1759 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1563/1563 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7663ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1563/1563 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 1563 transition count 1125
Reduce places removed 438 places and 0 transitions.
Iterating post reduction 1 with 438 rules applied. Total rules applied 876 place count 1125 transition count 1125
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 876 place count 1125 transition count 808
Deduced a syphon composed of 317 places in 1 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1510 place count 808 transition count 808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1512 place count 806 transition count 806
Iterating global reduction 2 with 2 rules applied. Total rules applied 1514 place count 806 transition count 806
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1514 place count 806 transition count 804
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1518 place count 804 transition count 804
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2236 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2237 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 2239 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2441 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2477 place count 325 transition count 561
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2478 place count 325 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2479 place count 324 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2480 place count 323 transition count 559
Applied a total of 2480 rules in 124 ms. Remains 323 /1563 variables (removed 1240) and now considering 559/1563 (removed 1004) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 323/1563 places, 559/1563 transitions.
RANDOM walk for 40000 steps (14 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505981 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505981 steps, saw 326882 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
// Phase 1: matrix 559 rows 323 cols
[2025-06-05 11:29:44] [INFO ] Computed 160 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/33 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/72 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/113 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/141 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/163 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/185 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/207 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/207 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/207 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/229 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/229 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/229 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/251 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/251 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/251 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/273 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/273 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/273 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/295 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/295 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/295 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/317 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/317 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/317 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/339 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/339 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/339 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/361 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/361 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/361 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/383 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/383 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/383 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/405 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/405 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/405 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/427 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/427 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/427 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/449 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/449 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/449 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/471 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/471 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/471 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/493 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/493 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/493 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/515 variables, 8/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/515 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/515 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/537 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/537 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/537 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/559 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/559 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/559 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/581 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/581 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/581 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/603 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/603 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/603 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/625 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/625 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/625 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/647 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/647 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/647 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/669 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/669 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/669 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 22/691 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/691 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/691 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 22/713 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/713 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/713 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 22/735 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/735 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/735 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 22/757 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/757 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/757 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 22/779 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/779 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/779 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 22/801 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/801 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/801 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 22/823 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/823 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/823 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 22/845 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/845 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/845 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 20/865 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/865 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/865 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 14/879 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/879 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/879 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 3/882 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/882 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/882 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 0/882 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 882/882 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/33 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/72 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 41/113 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 28/141 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/163 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/163 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/185 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/207 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/207 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/207 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/229 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/229 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/229 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/251 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/251 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/251 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/273 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/273 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/273 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/295 variables, 8/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/295 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/295 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/317 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/317 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/317 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/339 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/339 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/339 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/361 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/361 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/361 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/383 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/383 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/383 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/405 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/405 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/405 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/427 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/427 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/427 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/449 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/449 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/449 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/471 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/471 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/471 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/493 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/493 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/493 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/515 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/515 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/515 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/537 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/537 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/537 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/559 variables, 8/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/559 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/559 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/581 variables, 8/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/581 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/581 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/603 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/603 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/603 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/625 variables, 8/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/625 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/625 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/647 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/647 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/647 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 22/669 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/669 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/669 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 22/691 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/691 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/691 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 22/713 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/713 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/713 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 22/735 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/735 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/735 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 22/757 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/757 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/757 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 22/779 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/779 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/779 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 22/801 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/801 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/801 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 22/823 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/823 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/823 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 22/845 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/845 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/845 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 20/865 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/865 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/865 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 14/879 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/879 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/879 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 3/882 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/882 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/882 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 0/882 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 882/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 559/559 transitions.
Applied a total of 0 rules in 13 ms. Remains 323 /323 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 323/323 places, 559/559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 559/559 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2025-06-05 11:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:29:46] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-05 11:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:29:46] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:29:46] [INFO ] Redundant transitions in 3 ms returned []
Running 554 sub problems to find dead transitions.
[2025-06-05 11:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 2/323 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 559/882 variables, 323/483 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 882/882 variables, and 483 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 2/323 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 559/882 variables, 323/483 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/882 variables, 554/1037 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 882/882 variables, and 1037 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60631 ms. Remains : 323/323 places, 559/559 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 323 vertex of which 4 / 323 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1112 edges and 321 vertex of which 319 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 317 vertex of which 4 / 317 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 315 transition count 550
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 313 vertex of which 6 / 313 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 310 transition count 541
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 152 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 303 transition count 530
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 148 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 295 transition count 516
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 144 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 287 transition count 502
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 279 transition count 488
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 271 transition count 474
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 263 transition count 460
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 255 transition count 446
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 247 transition count 432
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 239 transition count 418
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 231 transition count 404
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 223 transition count 390
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 215 transition count 376
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 207 transition count 362
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 100 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 199 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 96 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 191 transition count 334
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 92 edges and 187 vertex of which 8 / 187 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 183 transition count 320
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 88 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 175 transition count 306
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 84 edges and 171 vertex of which 8 / 171 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 167 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 80 edges and 163 vertex of which 8 / 163 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 159 transition count 278
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 76 edges and 155 vertex of which 8 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 151 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 72 edges and 147 vertex of which 8 / 147 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 143 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 68 edges and 139 vertex of which 8 / 139 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 135 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 64 edges and 131 vertex of which 8 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 127 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 60 edges and 123 vertex of which 8 / 123 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 119 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 56 edges and 115 vertex of which 8 / 115 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 111 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 52 edges and 107 vertex of which 8 / 107 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 103 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 48 edges and 99 vertex of which 8 / 99 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 95 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 44 edges and 91 vertex of which 8 / 91 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 87 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 40 edges and 83 vertex of which 8 / 83 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 79 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 36 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 71 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 32 edges and 67 vertex of which 8 / 67 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 63 transition count 110
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 28 edges and 59 vertex of which 8 / 59 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 55 transition count 96
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 24 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 47 transition count 82
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 20 edges and 43 vertex of which 6 / 43 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 40 transition count 68
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 16 edges and 37 vertex of which 4 / 37 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 36 with 14 rules applied. Total rules applied 676 place count 35 transition count 58
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 13 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 37 with 9 rules applied. Total rules applied 685 place count 32 transition count 52
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 5 rules applied. Total rules applied 690 place count 31 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 39 with 1 Pre rules applied. Total rules applied 690 place count 31 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 39 with 3 rules applied. Total rules applied 693 place count 29 transition count 47
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 39 with 2 rules applied. Total rules applied 695 place count 28 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 699 place count 28 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 40 with 3 rules applied. Total rules applied 702 place count 28 transition count 39
Applied a total of 702 rules in 49 ms. Remains 28 /323 variables (removed 295) and now considering 39/559 (removed 520) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 28 cols
[2025-06-05 11:30:47] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:30:47] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-05 11:30:47] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:30:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-05 11:30:47] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 11:30:47] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 11:30:47] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 131 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 345 ms.
Product exploration explored 100000 steps with 25000 reset in 340 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, p0, true]
Support contains 3 out of 1563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1563/1563 places, 1563/1563 transitions.
Performed 438 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 1563 transition count 1563
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 438 place count 1563 transition count 1722
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 598 place count 1563 transition count 1722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 601 place count 1560 transition count 1719
Deduced a syphon composed of 597 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 604 place count 1560 transition count 1719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 604 place count 1560 transition count 1720
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 605 place count 1560 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 606 place count 1559 transition count 1718
Deduced a syphon composed of 597 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 607 place count 1559 transition count 1718
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1074 places in 1 ms
Iterating global reduction 1 with 477 rules applied. Total rules applied 1084 place count 1559 transition count 1718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1085 place count 1559 transition count 1717
Renaming transitions due to excessive name length > 1024 char.
Discarding 317 places :
Symmetric choice reduction at 2 with 317 rule applications. Total rules 1402 place count 1242 transition count 1400
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 317 rules applied. Total rules applied 1719 place count 1242 transition count 1400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1720 place count 1242 transition count 1400
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1722 place count 1240 transition count 1398
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1724 place count 1240 transition count 1398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -722
Deduced a syphon composed of 857 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1825 place count 1240 transition count 2120
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1926 place count 1139 transition count 1918
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2027 place count 1139 transition count 1918
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 814 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2085 place count 1139 transition count 2333
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2143 place count 1081 transition count 2217
Deduced a syphon composed of 756 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2201 place count 1081 transition count 2217
Deduced a syphon composed of 756 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2204 place count 1081 transition count 2214
Deduced a syphon composed of 756 places in 1 ms
Applied a total of 2204 rules in 823 ms. Remains 1081 /1563 variables (removed 482) and now considering 2214/1563 (removed -651) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:30:49] [INFO ] Redundant transitions in 36 ms returned []
Running 2213 sub problems to find dead transitions.
// Phase 1: matrix 2214 rows 1081 cols
[2025-06-05 11:30:49] [INFO ] Computed 161 invariants in 14 ms
[2025-06-05 11:30:49] [INFO ] State equation strengthened by 702 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 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 1080/3295 variables, and 0 constraints, problems are : Problem set: 0 solved, 2213 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1081 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 2213/1790 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/3295 variables, and 0 constraints, problems are : Problem set: 0 solved, 2213 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1081 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 423/1790 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62382ms problems are : Problem set: 0 solved, 2213 unsolved
Search for dead transitions found 0 dead transitions in 62385ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1081/1563 places, 2214/1563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63254 ms. Remains : 1081/1563 places, 2214/1563 transitions.
Built C files in :
/tmp/ltsmin7966351518761658646
[2025-06-05 11:31:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7966351518761658646
Running compilation step : cd /tmp/ltsmin7966351518761658646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2662 ms.
Running link step : cd /tmp/ltsmin7966351518761658646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7966351518761658646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2523531514129201626.hoa' '--buchi-type=spotba'
LTSmin run took 606 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 347306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(G(!p0)))))))'
Support contains 1 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 145 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2025-06-05 11:31:55] [INFO ] Computed 161 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:31:55] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-05 11:31:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:31:57] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2025-06-05 11:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62102 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), true, false, p0]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-12
Stuttering criterion allowed to conclude after 85026 steps with 0 reset in 353 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-12 finished in 62705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((p0||X((X(p1) U (p0&&X(p1))))) U p2)))'
Support contains 4 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1562 transition count 1562
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1562 transition count 1562
Applied a total of 22 rules in 136 ms. Remains 1562 /1573 variables (removed 11) and now considering 1562/1573 (removed 11) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2025-06-05 11:32:58] [INFO ] Computed 161 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:32:58] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-05 11:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:32:59] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2025-06-05 11:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1573 places, 1562/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61991 ms. Remains : 1562/1573 places, 1562/1573 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-13
Product exploration explored 100000 steps with 19936 reset in 244 ms.
Product exploration explored 100000 steps with 19960 reset in 245 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 161 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
RANDOM walk for 28964 steps (5 resets) in 324 ms. (89 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 11 factoid took 357 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
[2025-06-05 11:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:34:02] [INFO ] [Real]Absence check using 161 positive place invariants in 304 ms returned sat
[2025-06-05 11:34:10] [INFO ] [Real]Absence check using state equation in 7830 ms returned sat
[2025-06-05 11:34:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:34:11] [INFO ] [Nat]Absence check using 161 positive place invariants in 314 ms returned sat
[2025-06-05 11:34:19] [INFO ] [Nat]Absence check using state equation in 7957 ms returned sat
[2025-06-05 11:34:19] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 82 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-05 11:34:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
[2025-06-05 11:34:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:34:26] [INFO ] [Real]Absence check using 161 positive place invariants in 306 ms returned sat
[2025-06-05 11:34:34] [INFO ] [Real]Absence check using state equation in 7838 ms returned sat
[2025-06-05 11:34:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:34:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 310 ms returned sat
[2025-06-05 11:34:43] [INFO ] [Nat]Absence check using state equation in 7910 ms returned sat
[2025-06-05 11:34:43] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 72 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-05 11:34:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 69 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2025-06-05 11:34:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:34:49] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-05 11:34:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:34:51] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2025-06-05 11:34:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Finished structural reductions in LTL mode , in 1 iterations and 61921 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 157 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
RANDOM walk for 32856 steps (6 resets) in 209 ms. (156 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 252 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
[2025-06-05 11:35:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:35:53] [INFO ] [Real]Absence check using 161 positive place invariants in 302 ms returned sat
[2025-06-05 11:36:00] [INFO ] [Real]Absence check using state equation in 7706 ms returned sat
[2025-06-05 11:36:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:36:01] [INFO ] [Nat]Absence check using 161 positive place invariants in 310 ms returned sat
[2025-06-05 11:36:09] [INFO ] [Nat]Absence check using state equation in 7893 ms returned sat
[2025-06-05 11:36:09] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-05 11:36:16] [INFO ] Added : 335 causal constraints over 67 iterations in 6252 ms. Result :unknown
Could not prove EG (NOT p2)
[2025-06-05 11:36:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:36:16] [INFO ] [Real]Absence check using 161 positive place invariants in 306 ms returned sat
[2025-06-05 11:36:24] [INFO ] [Real]Absence check using state equation in 7724 ms returned sat
[2025-06-05 11:36:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:36:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 302 ms returned sat
[2025-06-05 11:36:33] [INFO ] [Nat]Absence check using state equation in 7889 ms returned sat
[2025-06-05 11:36:33] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 62 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Product exploration explored 100000 steps with 19978 reset in 265 ms.
Product exploration explored 100000 steps with 20011 reset in 242 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Performed 436 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1562 transition count 1562
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 436 place count 1562 transition count 1723
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 598 place count 1562 transition count 1723
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1074 places in 2 ms
Iterating global reduction 1 with 476 rules applied. Total rules applied 1074 place count 1562 transition count 1723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1075 place count 1562 transition count 1722
Renaming transitions due to excessive name length > 1024 char.
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1391 place count 1246 transition count 1406
Deduced a syphon composed of 758 places in 2 ms
Iterating global reduction 2 with 316 rules applied. Total rules applied 1707 place count 1246 transition count 1406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 759 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1708 place count 1246 transition count 1406
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1710 place count 1244 transition count 1404
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1712 place count 1244 transition count 1404
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 858 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1813 place count 1244 transition count 2136
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1914 place count 1143 transition count 1934
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2015 place count 1143 transition count 1934
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -395
Deduced a syphon composed of 814 places in 1 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2072 place count 1143 transition count 2329
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2130 place count 1085 transition count 2213
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2188 place count 1085 transition count 2213
Deduced a syphon composed of 756 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2191 place count 1085 transition count 2210
Deduced a syphon composed of 756 places in 1 ms
Applied a total of 2191 rules in 502 ms. Remains 1085 /1562 variables (removed 477) and now considering 2210/1562 (removed -648) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:36:41] [INFO ] Redundant transitions in 35 ms returned []
Running 2209 sub problems to find dead transitions.
// Phase 1: matrix 2210 rows 1085 cols
[2025-06-05 11:36:41] [INFO ] Computed 161 invariants in 27 ms
[2025-06-05 11:36:41] [INFO ] State equation strengthened by 702 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/3295 variables, and 0 constraints, problems are : Problem set: 0 solved, 2209 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1085 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 2209/1782 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 timeout
1)
(s205 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/3295 variables, and 0 constraints, problems are : Problem set: 0 solved, 2209 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1085 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 427/1782 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62293ms problems are : Problem set: 0 solved, 2209 unsolved
Search for dead transitions found 0 dead transitions in 62297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/1562 places, 2210/1562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62843 ms. Remains : 1085/1562 places, 2210/1562 transitions.
Built C files in :
/tmp/ltsmin9930787821255658051
[2025-06-05 11:37:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9930787821255658051
Running compilation step : cd /tmp/ltsmin9930787821255658051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2758 ms.
Running link step : cd /tmp/ltsmin9930787821255658051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9930787821255658051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14354410429164031191.hoa' '--buchi-type=spotba'
LTSmin run took 1975 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040B-LTLFireability-13 finished in 290274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((p1||X(G(!p1))))))))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 128 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2025-06-05 11:37:48] [INFO ] Computed 161 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:37:48] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-05 11:37:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:37:50] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2025-06-05 11:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 timeout
1)
(s1240 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62111 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 219 ms :[false, false, false, p1, true, false]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-14
Product exploration explored 100000 steps with 1 reset in 454 ms.
Entered a terminal (fully accepting) state of product in 18251 steps with 0 reset in 109 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-14 finished in 62923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(p1)||(!p0 U (p2||G(!p0)))))))'
Support contains 3 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1564 transition count 1564
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1564 transition count 1564
Applied a total of 18 rules in 139 ms. Remains 1564 /1573 variables (removed 9) and now considering 1564/1573 (removed 9) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2025-06-05 11:38:51] [INFO ] Computed 161 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:38:51] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-05 11:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:38:52] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2025-06-05 11:38:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 1563/1563 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 timeout
1)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 0/1563 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Starting structural reductions in LTL mode, iteration 1 : 1564/1573 places, 1564/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61993 ms. Remains : 1564/1573 places, 1564/1573 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Product exploration explored 100000 steps with 50000 reset in 384 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 17 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-15 finished in 63052 ms.
All properties solved by simple procedures.
Total runtime 1784955 ms.

BK_STOP 1749123594363

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600