Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200458.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J40, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717260328447

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:45:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:45:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:45:30] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-06-01 16:45:30] [INFO ] Transformed 629 places.
[2024-06-01 16:45:30] [INFO ] Transformed 1590 transitions.
[2024-06-01 16:45:30] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
[2024-06-01 16:45:30] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 16:45:30] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 16:45:30] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 16:45:30] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:45:30] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:45:30] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 16:45:30] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 626 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 24 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-06-01 16:45:30] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-06-01 16:45:30] [INFO ] Computed 102 invariants in 77 ms
[2024-06-01 16:45:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 1.0 2.0))
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 (/ 1.0 2.0))
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 (/ 1.0 2.0))
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 (/ 1.0 2.0))
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 timeout
0.0)
(s583 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/1560 variables, and 102 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20100 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
[2024-06-01 16:46:07] [INFO ] Deduced a trap composed of 24 places in 422 ms of which 37 ms to minimize.
[2024-06-01 16:46:09] [INFO ] Deduced a trap composed of 15 places in 330 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/1560 variables, and 104 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 2/2 constraints]
After SMT, in 42155ms problems are : Problem set: 95 solved, 834 unsolved
Search for dead transitions found 95 dead transitions in 42196ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-06-01 16:46:12] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2024-06-01 16:46:12] [INFO ] Computed 102 invariants in 39 ms
[2024-06-01 16:46:12] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 16:46:12] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:46:12] [INFO ] Invariant cache hit.
[2024-06-01 16:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:46:13] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 840/935 transitions.
Applied a total of 0 rules in 14 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43460 ms. Remains : 629/629 places, 840/935 transitions.
Support contains 626 out of 629 places after structural reductions.
[2024-06-01 16:46:14] [INFO ] Flatten gal took : 201 ms
[2024-06-01 16:46:14] [INFO ] Flatten gal took : 113 ms
[2024-06-01 16:46:15] [INFO ] Input system was already deterministic with 840 transitions.
Reduction of identical properties reduced properties to check from 81 to 78
RANDOM walk for 40000 steps (2735 resets) in 5395 ms. (7 steps per ms) remains 29/78 properties
BEST_FIRST walk for 4003 steps (48 resets) in 264 ms. (15 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (100 resets) in 63 ms. (62 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (11 resets) in 476 ms. (8 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (82 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (100 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (58 resets) in 109 ms. (36 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (120 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (92 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (100 resets) in 103 ms. (38 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (57 resets) in 16 ms. (235 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (69 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (65 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
[2024-06-01 16:46:17] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:46:17] [INFO ] Invariant cache hit.
[2024-06-01 16:46:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp38 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 202/601 variables, 75/77 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 6 (OVERLAPS) 28/629 variables, 23/102 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 836/1465 variables, 629/731 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1465 variables, 1/732 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1465 variables, 0/732 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1465 variables, 0/732 constraints. Problems are: Problem set: 26 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1465/1465 variables, and 732 constraints, problems are : Problem set: 26 solved, 2 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/147 variables, 1/4 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 180/327 variables, 30/34 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/34 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 150/477 variables, 30/64 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/64 constraints. Problems are: Problem set: 26 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 139/616 variables, 26/90 constraints. Problems are: Problem set: 26 solved, 2 unsolved
[2024-06-01 16:46:20] [INFO ] Deduced a trap composed of 256 places in 276 ms of which 12 ms to minimize.
[2024-06-01 16:46:20] [INFO ] Deduced a trap composed of 129 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:46:21] [INFO ] Deduced a trap composed of 266 places in 250 ms of which 5 ms to minimize.
[2024-06-01 16:46:21] [INFO ] Deduced a trap composed of 269 places in 260 ms of which 29 ms to minimize.
[2024-06-01 16:46:21] [INFO ] Deduced a trap composed of 274 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:46:21] [INFO ] Deduced a trap composed of 257 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:46:22] [INFO ] Deduced a trap composed of 266 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:46:22] [INFO ] Deduced a trap composed of 254 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:46:22] [INFO ] Deduced a trap composed of 269 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:46:22] [INFO ] Deduced a trap composed of 257 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:46:23] [INFO ] Deduced a trap composed of 262 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:46:23] [INFO ] Deduced a trap composed of 250 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:46:23] [INFO ] Deduced a trap composed of 265 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:46:23] [INFO ] Deduced a trap composed of 260 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:46:23] [INFO ] Deduced a trap composed of 248 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:46:24] [INFO ] Deduced a trap composed of 275 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:46:24] [INFO ] Deduced a trap composed of 251 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:46:24] [INFO ] Deduced a trap composed of 262 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:46:24] [INFO ] Deduced a trap composed of 263 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:46:25] [INFO ] Deduced a trap composed of 278 places in 210 ms of which 4 ms to minimize.
SMT process timed out in 7877ms, After SMT, problems are : Problem set: 26 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 95 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 95 place count 579 transition count 750
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 185 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 533 transition count 749
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 533 transition count 749
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 531 transition count 747
Applied a total of 191 rules in 246 ms. Remains 531 /629 variables (removed 98) and now considering 747/840 (removed 93) transitions.
Running 741 sub problems to find dead transitions.
[2024-06-01 16:46:25] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-06-01 16:46:25] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:46:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 176 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 153 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 189 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 4 ms to minimize.
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 6 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 16 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 138 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 137 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:46:40] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:46:40] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:46:40] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 6 ms to minimize.
[2024-06-01 16:46:40] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:46:40] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 162 places in 266 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1274 variables, and 132 constraints, problems are : Problem set: 0 solved, 741 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 199 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:46:50] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 3 ms to minimize.
[2024-06-01 16:46:52] [INFO ] Deduced a trap composed of 137 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:46:52] [INFO ] Deduced a trap composed of 137 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:46:54] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 2 ms to minimize.
[2024-06-01 16:46:54] [INFO ] Deduced a trap composed of 171 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:46:54] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:46:55] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:46:55] [INFO ] Deduced a trap composed of 179 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:46:55] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:46:55] [INFO ] Deduced a trap composed of 174 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:46:56] [INFO ] Deduced a trap composed of 144 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:46:56] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:46:56] [INFO ] Deduced a trap composed of 183 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:46:56] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:46:56] [INFO ] Deduced a trap composed of 163 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:46:57] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:46:57] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:46:57] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:46:57] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1274 variables, and 152 constraints, problems are : Problem set: 0 solved, 741 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/741 constraints, Known Traps: 60/60 constraints]
After SMT, in 41439ms problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 41448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41725 ms. Remains : 531/629 places, 747/840 transitions.
RANDOM walk for 40000 steps (2106 resets) in 1110 ms. (36 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (189 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2024-06-01 16:47:07] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-06-01 16:47:07] [INFO ] Invariant cache hit.
[2024-06-01 16:47:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 259/503 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/529 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/530 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 743/1273 variables, 530/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1273 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1273 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1274 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1274 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1274 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1274/1274 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 259/503 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/529 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 174 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 174 places in 181 ms of which 2 ms to minimize.
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 172 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 177 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 184 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 174 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:47:10] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:47:10] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:47:10] [INFO ] Deduced a trap composed of 163 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:47:10] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:47:10] [INFO ] Deduced a trap composed of 187 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 172 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:47:12] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:47:12] [INFO ] Deduced a trap composed of 159 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:47:12] [INFO ] Deduced a trap composed of 172 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:47:12] [INFO ] Deduced a trap composed of 210 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:47:12] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 193 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 192 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 196 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:47:14] [INFO ] Deduced a trap composed of 196 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:47:14] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:47:14] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:47:14] [INFO ] Deduced a trap composed of 211 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:47:14] [INFO ] Deduced a trap composed of 195 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:47:15] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:47:15] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:47:15] [INFO ] Deduced a trap composed of 93 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:47:15] [INFO ] Deduced a trap composed of 187 places in 203 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:16] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 4 ms to minimize.
[2024-06-01 16:47:16] [INFO ] Deduced a trap composed of 153 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:47:16] [INFO ] Deduced a trap composed of 180 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:47:16] [INFO ] Deduced a trap composed of 174 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:47:17] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:47:17] [INFO ] Deduced a trap composed of 180 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:47:17] [INFO ] Deduced a trap composed of 163 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:47:17] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:47:17] [INFO ] Deduced a trap composed of 194 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:47:18] [INFO ] Deduced a trap composed of 193 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:47:18] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 2 ms to minimize.
[2024-06-01 16:47:18] [INFO ] Deduced a trap composed of 176 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:47:19] [INFO ] Deduced a trap composed of 180 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:47:19] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:47:19] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:47:19] [INFO ] Deduced a trap composed of 172 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:47:20] [INFO ] Deduced a trap composed of 171 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:47:20] [INFO ] Deduced a trap composed of 168 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:47:20] [INFO ] Deduced a trap composed of 194 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:47:20] [INFO ] Deduced a trap composed of 168 places in 171 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:21] [INFO ] Deduced a trap composed of 194 places in 201 ms of which 5 ms to minimize.
[2024-06-01 16:47:21] [INFO ] Deduced a trap composed of 196 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:47:21] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:47:21] [INFO ] Deduced a trap composed of 172 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:47:22] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:47:22] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:47:22] [INFO ] Deduced a trap composed of 192 places in 187 ms of which 2 ms to minimize.
[2024-06-01 16:47:22] [INFO ] Deduced a trap composed of 217 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:47:22] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 198 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 153 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 159 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 193 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 178 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 206 places in 257 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 189 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 174 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 168 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:47:28] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:47:28] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 184 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 159 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 174 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 172 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 165 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 159 places in 243 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 183 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 180 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 180 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 186 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 171 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 172 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 174 places in 244 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/1274 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32491 ms.
Refiners :[Positive P Invariants (semi-flows): 75/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 108/108 constraints]
After SMT, in 33086ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 531 transition count 746
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 530 transition count 746
Applied a total of 2 rules in 92 ms. Remains 530 /531 variables (removed 1) and now considering 746/747 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 530/531 places, 746/747 transitions.
RANDOM walk for 40000 steps (2100 resets) in 373 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (191 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 276995 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 276995 steps, saw 82775 distinct states, run finished after 3005 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-01 16:47:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2024-06-01 16:47:43] [INFO ] Computed 97 invariants in 10 ms
[2024-06-01 16:47:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/505 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:43] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:47:44] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/529 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 742/1271 variables, 529/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1271 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1271 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1272 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1272 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1272 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/505 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/529 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:44] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:47:45] [INFO ] Deduced a trap composed of 174 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:47:45] [INFO ] Deduced a trap composed of 173 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:47:45] [INFO ] Deduced a trap composed of 180 places in 173 ms of which 7 ms to minimize.
[2024-06-01 16:47:45] [INFO ] Deduced a trap composed of 161 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:47:45] [INFO ] Deduced a trap composed of 173 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:47:46] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:47:46] [INFO ] Deduced a trap composed of 170 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:47:46] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:47:46] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:47:46] [INFO ] Deduced a trap composed of 170 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 171 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 171 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 180 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 174 places in 378 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:49] [INFO ] Deduced a trap composed of 158 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:47:49] [INFO ] Deduced a trap composed of 152 places in 231 ms of which 5 ms to minimize.
[2024-06-01 16:47:49] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:47:49] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:47:50] [INFO ] Deduced a trap composed of 155 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:47:50] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:47:50] [INFO ] Deduced a trap composed of 179 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:47:50] [INFO ] Deduced a trap composed of 165 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:47:51] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:47:51] [INFO ] Deduced a trap composed of 173 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:47:51] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:47:51] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:47:51] [INFO ] Deduced a trap composed of 179 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 185 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 5 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 182 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 177 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 161 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 173 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:47:55] [INFO ] Deduced a trap composed of 173 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:47:55] [INFO ] Deduced a trap composed of 158 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:47:56] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:47:56] [INFO ] Deduced a trap composed of 170 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:47:56] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:47:56] [INFO ] Deduced a trap composed of 176 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:47:57] [INFO ] Deduced a trap composed of 170 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:47:57] [INFO ] Deduced a trap composed of 173 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:47:57] [INFO ] Deduced a trap composed of 185 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 152 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 161 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 185 places in 244 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 158 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:48:00] [INFO ] Deduced a trap composed of 179 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:48:00] [INFO ] Deduced a trap composed of 161 places in 288 ms of which 7 ms to minimize.
[2024-06-01 16:48:00] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:48:01] [INFO ] Deduced a trap composed of 176 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:48:01] [INFO ] Deduced a trap composed of 173 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:48:01] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:48:01] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:48:02] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:48:02] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:48:02] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:48:02] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:48:03] [INFO ] Deduced a trap composed of 155 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:48:03] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:48:03] [INFO ] Deduced a trap composed of 169 places in 204 ms of which 2 ms to minimize.
[2024-06-01 16:48:03] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:48:03] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:48:04] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:48:04] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:48:04] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:48:04] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:48:04] [INFO ] Deduced a trap composed of 167 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:48:05] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 2 ms to minimize.
[2024-06-01 16:48:05] [INFO ] Deduced a trap composed of 144 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:48:05] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:48:06] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:48:07] [INFO ] Deduced a trap composed of 170 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:48:07] [INFO ] Deduced a trap composed of 93 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:48:07] [INFO ] Deduced a trap composed of 170 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:48:08] [INFO ] Deduced a trap composed of 155 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:48:08] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:48:08] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 2 ms to minimize.
[2024-06-01 16:48:09] [INFO ] Deduced a trap composed of 182 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:48:10] [INFO ] Deduced a trap composed of 188 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:48:11] [INFO ] Deduced a trap composed of 182 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:48:11] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:48:11] [INFO ] Deduced a trap composed of 170 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 93 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 161 places in 231 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 182 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 161 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 176 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 176 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 180 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 188 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 176 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 169 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 188 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 2 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 179 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:48:22] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 5 ms to minimize.
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 176 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 177 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 172 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 185 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 166 places in 268 ms of which 7 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 93 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 149 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 176 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Deduced a trap composed of 161 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 128 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 173 places in 215 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 165 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 152 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 173 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 179 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 150 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 163 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 176 places in 245 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/1272 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 151/151 constraints]
After SMT, in 56949ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 67 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 37 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-06-01 16:48:40] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-06-01 16:48:40] [INFO ] Invariant cache hit.
[2024-06-01 16:48:41] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-06-01 16:48:41] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-06-01 16:48:41] [INFO ] Invariant cache hit.
[2024-06-01 16:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:48:48] [INFO ] Implicit Places using invariants and state equation in 6769 ms returned []
Implicit Place search using SMT with State Equation took 7541 ms to find 0 implicit places.
[2024-06-01 16:48:48] [INFO ] Redundant transitions in 48 ms returned []
Running 740 sub problems to find dead transitions.
[2024-06-01 16:48:48] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-06-01 16:48:48] [INFO ] Invariant cache hit.
[2024-06-01 16:48:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 158 places in 317 ms of which 3 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 140 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 143 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 145 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 148 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 194 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 144 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 142 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 139 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 141 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 145 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 5 (OVERLAPS) 5/530 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 740 unsolved
SMT process timed out in 31390ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 31405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39044 ms. Remains : 530/530 places, 746/746 transitions.
Successfully simplified 26 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:49:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 16:49:19] [INFO ] Flatten gal took : 79 ms
[2024-06-01 16:49:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:49:19] [INFO ] Flatten gal took : 61 ms
[2024-06-01 16:49:19] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 151 out of 629 places (down from 441) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 37 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:49:20] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 16:49:20] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:49:43] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:49:43] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:49:47] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:49:47] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:49:48] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:49:48] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:49:50] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:49:56] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41289ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41302ms
Finished structural reductions in LTL mode , in 1 iterations and 41343 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:50:01] [INFO ] Flatten gal took : 83 ms
[2024-06-01 16:50:01] [INFO ] Flatten gal took : 60 ms
[2024-06-01 16:50:01] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Applied a total of 5 rules in 16 ms. Remains 624 /629 variables (removed 5) and now considering 840/840 (removed 0) transitions.
Running 834 sub problems to find dead transitions.
[2024-06-01 16:50:01] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2024-06-01 16:50:01] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:50:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 6/624 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1460 variables, and 97 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-06-01 16:50:24] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:50:24] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:50:25] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:50:26] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:50:26] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:50:28] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:50:28] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:50:31] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:50:31] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:50:31] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:50:33] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:50:33] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-06-01 16:50:35] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1460 variables, and 105 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/834 constraints, Known Traps: 14/14 constraints]
After SMT, in 41562ms problems are : Problem set: 0 solved, 834 unsolved
Search for dead transitions found 0 dead transitions in 41574ms
Finished structural reductions in LTL mode , in 1 iterations and 41594 ms. Remains : 624/629 places, 840/840 transitions.
[2024-06-01 16:50:43] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:50:43] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:50:43] [INFO ] Input system was already deterministic with 840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 19 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:50:43] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 16:50:43] [INFO ] Computed 97 invariants in 11 ms
[2024-06-01 16:50:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 (/ 1.0 4.0))
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 9.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 (/ 3.0 4.0))
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 3.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 (/ 3.0 4.0))
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 (/ 3.0 4.0))
(s491 0.0)
(s492 timeout
0.0)
(s493 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:51:13] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:51:13] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 1 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41148ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41155ms
Finished structural reductions in LTL mode , in 1 iterations and 41177 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:51:24] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:51:24] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:51:24] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 18 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:51:24] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:51:24] [INFO ] Invariant cache hit.
[2024-06-01 16:51:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 1 ms to minimize.
[2024-06-01 16:51:47] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:51:47] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:51:51] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:51:52] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:51:53] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:51:54] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:51:55] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:51:56] [INFO ] Deduced a trap composed of 98 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:51:56] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:57] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints]
After SMT, in 41246ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41253ms
Finished structural reductions in LTL mode , in 1 iterations and 41273 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:52:05] [INFO ] Flatten gal took : 60 ms
[2024-06-01 16:52:05] [INFO ] Flatten gal took : 51 ms
[2024-06-01 16:52:06] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 90 place count 579 transition count 752
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 176 place count 536 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 535 transition count 751
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 535 transition count 751
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 2 with 4 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 84 ms. Remains 533 /629 variables (removed 96) and now considering 749/840 (removed 91) transitions.
Running 743 sub problems to find dead transitions.
[2024-06-01 16:52:06] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2024-06-01 16:52:06] [INFO ] Computed 97 invariants in 11 ms
[2024-06-01 16:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-06-01 16:52:12] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 157 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 169 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 139 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 139 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 175 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 139 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-06-01 16:52:17] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:52:17] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:52:18] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:52:18] [INFO ] Deduced a trap composed of 143 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:52:18] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:52:18] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:52:19] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:52:19] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:52:19] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:52:19] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:52:19] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:52:19] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 139 places in 193 ms of which 2 ms to minimize.
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 174 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1278 variables, and 132 constraints, problems are : Problem set: 0 solved, 743 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 121 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 146 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 127 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 249 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 247 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 244 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:52:44] [INFO ] Deduced a trap composed of 96 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:52:45] [INFO ] Deduced a trap composed of 169 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:52:45] [INFO ] Deduced a trap composed of 139 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:52:45] [INFO ] Deduced a trap composed of 142 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:52:46] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:52:46] [INFO ] Deduced a trap composed of 142 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:52:46] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:52:47] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:52:47] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1278 variables, and 151 constraints, problems are : Problem set: 0 solved, 743 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/743 constraints, Known Traps: 59/59 constraints]
After SMT, in 41297ms problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 41307ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41393 ms. Remains : 533/629 places, 749/840 transitions.
[2024-06-01 16:52:47] [INFO ] Flatten gal took : 45 ms
[2024-06-01 16:52:47] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:52:47] [INFO ] Input system was already deterministic with 749 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 87 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-06-01 16:52:47] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-06-01 16:52:47] [INFO ] Computed 97 invariants in 11 ms
[2024-06-01 16:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:52:54] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:52:54] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:52:54] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:52:55] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:52:55] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:52:55] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:52:55] [INFO ] Deduced a trap composed of 139 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:52:55] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:52:56] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:52:56] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:52:56] [INFO ] Deduced a trap composed of 145 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 184 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 153 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 161 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:52:58] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:52:58] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:52:59] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:53:00] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:53:00] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:53:00] [INFO ] Deduced a trap composed of 142 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:53:01] [INFO ] Deduced a trap composed of 143 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:53:01] [INFO ] Deduced a trap composed of 143 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:53:01] [INFO ] Deduced a trap composed of 144 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:53:01] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:53:02] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:53:02] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:53:03] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:53:03] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:53:03] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:53:03] [INFO ] Deduced a trap composed of 180 places in 192 ms of which 2 ms to minimize.
[2024-06-01 16:53:03] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:53:04] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:53:04] [INFO ] Deduced a trap composed of 157 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:53:04] [INFO ] Deduced a trap composed of 179 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:53:04] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:53:29] [INFO ] Deduced a trap composed of 167 places in 267 ms of which 4 ms to minimize.
SMT process timed out in 41487ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41495ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41584 ms. Remains : 532/629 places, 748/840 transitions.
[2024-06-01 16:53:29] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:53:29] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:53:29] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 81 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-06-01 16:53:29] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-06-01 16:53:29] [INFO ] Invariant cache hit.
[2024-06-01 16:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 157 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 2 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 138 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 175 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 140 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 169 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 196 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 172 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 184 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:53:59] [INFO ] Deduced a trap composed of 220 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:53:59] [INFO ] Deduced a trap composed of 158 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 2 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 206 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 153 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 157 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 218 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 163 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 212 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:54:04] [INFO ] Deduced a trap composed of 171 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:54:04] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 2 ms to minimize.
[2024-06-01 16:54:04] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:54:04] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:54:05] [INFO ] Deduced a trap composed of 153 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:54:05] [INFO ] Deduced a trap composed of 207 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:54:05] [INFO ] Deduced a trap composed of 206 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:54:06] [INFO ] Deduced a trap composed of 154 places in 245 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 152 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 60/60 constraints]
After SMT, in 41191ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41199ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41293 ms. Remains : 532/629 places, 748/840 transitions.
[2024-06-01 16:54:10] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:54:10] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:54:10] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 21 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:54:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 16:54:10] [INFO ] Computed 97 invariants in 9 ms
[2024-06-01 16:54:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:54:33] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:54:33] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 1 ms to minimize.
[2024-06-01 16:54:38] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:54:38] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:54:38] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:54:38] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:54:41] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:54:41] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2024-06-01 16:54:41] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:54:41] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 8)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 1)
(s369 0)
(s370 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41244ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41252ms
Finished structural reductions in LTL mode , in 1 iterations and 41275 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:54:52] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:54:52] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:54:52] [INFO ] Input system was already deterministic with 839 transitions.
[2024-06-01 16:54:52] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:54:52] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:54:52] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 24 ms.
[2024-06-01 16:54:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 629 places, 840 transitions and 4204 arcs took 24 ms.
Total runtime 562508 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLFireability-2024-14

BK_STOP 1717260892761

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/2516/ctl_0_
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/2516/ctl_1_
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2516/ctl_2_
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/2516/ctl_3_
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2516/ctl_4_
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/2516/ctl_5_
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/2516/ctl_6_
ctl formula name PolyORBNT-PT-S05J40-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/2516/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S05J40, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447200458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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