Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 489K 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 ShieldRVt-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717084761134

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 15:59:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 15:59:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:59:22] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-30 15:59:22] [INFO ] Transformed 2003 places.
[2024-05-30 15:59:22] [INFO ] Transformed 2003 transitions.
[2024-05-30 15:59:22] [INFO ] Found NUPN structural information;
[2024-05-30 15:59:22] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVt-PT-040B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 426 places :
Symmetric choice reduction at 0 with 426 rule applications. Total rules 426 place count 1577 transition count 1577
Iterating global reduction 0 with 426 rules applied. Total rules applied 852 place count 1577 transition count 1577
Applied a total of 852 rules in 437 ms. Remains 1577 /2003 variables (removed 426) and now considering 1577/2003 (removed 426) transitions.
// Phase 1: matrix 1577 rows 1577 cols
[2024-05-30 15:59:23] [INFO ] Computed 161 invariants in 30 ms
[2024-05-30 15:59:24] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-05-30 15:59:24] [INFO ] Invariant cache hit.
[2024-05-30 15:59:25] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
Running 1576 sub problems to find dead transitions.
[2024-05-30 15:59:25] [INFO ] Invariant cache hit.
(s1503 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1576/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1577 constraints, PredecessorRefiner: 1576/1576 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1576/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1577 constraints, PredecessorRefiner: 0/1576 constraints, Known Traps: 0/0 constraints]
After SMT, in 60504ms problems are : Problem set: 0 solved, 1576 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Starting structural reductions in LTL mode, iteration 1 : 1577/2003 places, 1577/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63158 ms. Remains : 1577/2003 places, 1577/2003 transitions.
Support contains 33 out of 1577 places after structural reductions.
[2024-05-30 16:00:26] [INFO ] Flatten gal took : 122 ms
[2024-05-30 16:00:26] [INFO ] Flatten gal took : 67 ms
[2024-05-30 16:00:26] [INFO ] Input system was already deterministic with 1577 transitions.
RANDOM walk for 40000 steps (8 resets) in 1250 ms. (31 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
[2024-05-30 16:00:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 210/224 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1353/1577 variables, 145/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1577 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1577/3154 variables, 1577/1738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3154 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/3154 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3154/3154 variables, and 1738 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1577/1577 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 210/224 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1353/1577 variables, 145/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 16:00:29] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 43 ms to minimize.
[2024-05-30 16:00:29] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-05-30 16:00:30] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-05-30 16:00:30] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-30 16:00:30] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-30 16:00:30] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 3 ms to minimize.
[2024-05-30 16:00:30] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 3 ms to minimize.
[2024-05-30 16:00:30] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 3 ms to minimize.
[2024-05-30 16:00:31] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-30 16:00:31] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-30 16:00:31] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-30 16:00:31] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
[2024-05-30 16:00:31] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-05-30 16:00:31] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1577 variables, 14/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1577 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1577/3154 variables, 1577/1752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3154 variables, 7/1759 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 16:00:33] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 6 ms to minimize.
[2024-05-30 16:00:33] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 5 ms to minimize.
[2024-05-30 16:00:33] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 5 ms to minimize.
[2024-05-30 16:00:34] [INFO ] Deduced a trap composed of 53 places in 276 ms of which 5 ms to minimize.
SMT process timed out in 6572ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 1577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 434 rules applied. Total rules applied 434 place count 1577 transition count 1143
Reduce places removed 434 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 435 rules applied. Total rules applied 869 place count 1143 transition count 1142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 870 place count 1142 transition count 1142
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 870 place count 1142 transition count 831
Deduced a syphon composed of 311 places in 12 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1492 place count 831 transition count 831
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1496 place count 827 transition count 827
Iterating global reduction 3 with 4 rules applied. Total rules applied 1500 place count 827 transition count 827
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1500 place count 827 transition count 823
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1508 place count 823 transition count 823
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 1 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2232 place count 461 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2233 place count 461 transition count 460
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2235 place count 460 transition count 459
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2437 place count 359 transition count 554
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2469 place count 343 transition count 570
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2470 place count 343 transition count 569
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2472 place count 343 transition count 567
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2474 place count 341 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2476 place count 341 transition count 565
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2477 place count 341 transition count 565
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2478 place count 340 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2479 place count 339 transition count 564
Applied a total of 2479 rules in 387 ms. Remains 339 /1577 variables (removed 1238) and now considering 564/1577 (removed 1013) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 339/1577 places, 564/1577 transitions.
RANDOM walk for 40000 steps (11 resets) in 369 ms. (108 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 124 ms. (320 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
// Phase 1: matrix 564 rows 339 cols
[2024-05-30 16:00:34] [INFO ] Computed 160 invariants in 6 ms
[2024-05-30 16:00:35] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 118/186 variables, 68/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 43/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 121/307 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/308 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 87/395 variables, 32/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 16/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 67/462 variables, 26/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 13/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 68/530 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 11/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 1/531 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/531 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/531 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 60/591 variables, 24/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/591 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/591 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 27/618 variables, 12/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/618 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/618 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/618 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 2/620 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/620 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 25/645 variables, 10/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/645 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/645 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 1/646 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/646 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/646 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 22/668 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/668 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/668 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 22/690 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/690 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/690 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 22/712 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/712 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/712 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 22/734 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/734 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/734 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 22/756 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/756 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/756 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 22/778 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/778 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/778 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 22/800 variables, 8/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/800 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/800 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 22/822 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/822 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/822 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 22/844 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/844 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/844 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 22/866 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/866 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/866 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 20/886 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/886 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/886 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 14/900 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/900 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/900 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 3/903 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/903 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/903 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (OVERLAPS) 0/903 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 903/903 variables, and 549 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 339/339 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 118/186 variables, 68/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 43/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 121/307 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/308 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 87/395 variables, 32/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 67/462 variables, 26/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 13/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 68/530 variables, 24/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 11/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/530 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 1/531 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/531 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/531 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 60/591 variables, 24/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/591 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/591 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 27/618 variables, 12/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/618 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/618 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/618 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 2/620 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/620 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 25/645 variables, 10/405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/645 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/645 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 1/646 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/646 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 22/668 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/668 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/668 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 22/690 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/690 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/690 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 22/712 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/712 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/712 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 22/734 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/734 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/734 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 22/756 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/756 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/756 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 22/778 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/778 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/778 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 22/800 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/800 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/800 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 22/822 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/822 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/822 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 22/844 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/844 variables, 4/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/844 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 22/866 variables, 8/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/866 variables, 4/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/866 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (OVERLAPS) 20/886 variables, 8/538 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/886 variables, 4/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/886 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 14/900 variables, 6/548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/900 variables, 3/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/900 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 3/903 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/903 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/903 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (OVERLAPS) 0/903 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 903/903 variables, and 554 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 339/339 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3658ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 246 ms.
Support contains 9 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 339 transition count 562
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 337 transition count 562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 337 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 336 transition count 561
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 10 place count 334 transition count 561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 333 transition count 560
Applied a total of 11 rules in 37 ms. Remains 333 /339 variables (removed 6) and now considering 560/564 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 333/339 places, 560/564 transitions.
RANDOM walk for 40000 steps (14 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 213137 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 5
Probabilistic random walk after 213137 steps, saw 138781 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 560 rows 333 cols
[2024-05-30 16:00:42] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 16:00:42] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/37 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/67 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 117/184 variables, 67/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 120/304 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 87/391 variables, 32/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 16/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 69/460 variables, 26/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 13/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/460 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 66/526 variables, 24/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 12/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 60/586 variables, 24/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/586 variables, 12/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/586 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 28/614 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/614 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/614 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 22/636 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/636 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/636 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 22/658 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/658 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/658 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 22/680 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/680 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/680 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 22/702 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/702 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/702 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 22/724 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/724 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/724 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 22/746 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/746 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/746 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 22/768 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/768 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/768 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 22/790 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/790 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/790 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 22/812 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/812 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/812 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 22/834 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/834 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/834 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 22/856 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/856 variables, 4/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/856 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 20/876 variables, 8/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/876 variables, 4/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/876 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 14/890 variables, 6/536 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/890 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/890 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 3/893 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/893 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/893 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 0/893 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/893 variables, and 542 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 333/333 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/37 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/67 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 117/184 variables, 67/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 120/304 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 87/391 variables, 32/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 16/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 69/460 variables, 26/288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/460 variables, 13/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/460 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 66/526 variables, 24/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 60/586 variables, 24/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/586 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/586 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 28/614 variables, 12/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/614 variables, 6/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/614 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 22/636 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/636 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/636 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 22/658 variables, 8/411 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/658 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/658 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 22/680 variables, 8/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/680 variables, 4/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/680 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 22/702 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/702 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/702 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 22/724 variables, 8/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/724 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/724 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 22/746 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/746 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/746 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 22/768 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/768 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/768 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 22/790 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/790 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/790 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 22/812 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/812 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/812 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 22/834 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/834 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/834 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 22/856 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/856 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/856 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 20/876 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/876 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/876 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 14/890 variables, 6/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/890 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/890 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 3/893 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/893 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/893 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 0/893 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/893 variables, and 547 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 333/333 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3454ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 777 ms.
Support contains 9 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 560/560 transitions.
Applied a total of 0 rules in 26 ms. Remains 333 /333 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 333/333 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 560/560 transitions.
Applied a total of 0 rules in 8 ms. Remains 333 /333 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2024-05-30 16:00:46] [INFO ] Invariant cache hit.
[2024-05-30 16:00:46] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-30 16:00:46] [INFO ] Invariant cache hit.
[2024-05-30 16:00:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-30 16:00:47] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-30 16:00:47] [INFO ] Redundant transitions in 28 ms returned []
Running 555 sub problems to find dead transitions.
[2024-05-30 16:00:47] [INFO ] Invariant cache hit.
[2024-05-30 16:00:47] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (OVERLAPS) 2/333 variables, 22/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 560/893 variables, 333/493 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 49/542 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 7 (OVERLAPS) 0/893 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 555 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/893 variables, and 542 constraints, problems are : Problem set: 0 solved, 555 unsolved in 26190 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 333/333 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (OVERLAPS) 2/333 variables, 22/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 560/893 variables, 333/493 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 49/542 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 555/1097 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/893 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 8 (OVERLAPS) 0/893 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 555 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/893 variables, and 1097 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 333/333 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints]
After SMT, in 56417ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 56425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57140 ms. Remains : 333/333 places, 560/560 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 153 edges and 333 vertex of which 4 / 333 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1136 edges and 331 vertex of which 329 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 150 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 325 transition count 551
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 149 edges and 323 vertex of which 6 / 323 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 320 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 147 edges and 317 vertex of which 8 / 317 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 313 transition count 531
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 309 vertex of which 8 / 309 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 305 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 301 vertex of which 8 / 301 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 297 transition count 503
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 293 vertex of which 8 / 293 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 289 transition count 489
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 285 vertex of which 8 / 285 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 281 transition count 475
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 277 vertex of which 8 / 277 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 273 transition count 461
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 269 vertex of which 8 / 269 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 265 transition count 447
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 261 vertex of which 8 / 261 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 257 transition count 433
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 253 vertex of which 8 / 253 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 249 transition count 419
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 245 vertex of which 8 / 245 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 241 transition count 405
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 237 vertex of which 8 / 237 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 233 transition count 391
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 225 transition count 377
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 221 vertex of which 8 / 221 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 217 transition count 363
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 213 vertex of which 8 / 213 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 209 transition count 349
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 201 transition count 335
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 197 vertex of which 8 / 197 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 193 transition count 321
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 189 vertex of which 6 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 186 transition count 307
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 78 edges and 184 vertex of which 2 / 184 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 19 with 13 rules applied. Total rules applied 352 place count 183 transition count 297
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 77 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 20 with 5 rules applied. Total rules applied 357 place count 181 transition count 294
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 76 edges and 180 vertex of which 2 / 180 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 6 rules applied. Total rules applied 363 place count 179 transition count 290
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 367 place count 178 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 367 place count 178 transition count 286
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 369 place count 177 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 3 rules applied. Total rules applied 372 place count 175 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 375 place count 175 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 377 place count 175 transition count 280
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 24 with 5 rules applied. Total rules applied 382 place count 175 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 24 with 4 rules applied. Total rules applied 386 place count 175 transition count 276
Applied a total of 386 rules in 174 ms. Remains 175 /333 variables (removed 158) and now considering 276/560 (removed 284) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 276 rows 175 cols
[2024-05-30 16:01:43] [INFO ] Computed 82 invariants in 1 ms
[2024-05-30 16:01:43] [INFO ] [Real]Absence check using 82 positive place invariants in 9 ms returned sat
[2024-05-30 16:01:44] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-30 16:01:44] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2024-05-30 16:01:44] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-30 16:01:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-30 16:01:44] [INFO ] After 48ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-30 16:01:44] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-30 16:01:44] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 776 ms.
Computed a total of 483 stabilizing places and 483 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1567 transition count 1567
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1567 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1566 transition count 1566
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1566 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1565 transition count 1565
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1565 transition count 1565
Applied a total of 24 rules in 279 ms. Remains 1565 /1577 variables (removed 12) and now considering 1565/1577 (removed 12) transitions.
// Phase 1: matrix 1565 rows 1565 cols
[2024-05-30 16:01:45] [INFO ] Computed 161 invariants in 6 ms
[2024-05-30 16:01:45] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-30 16:01:45] [INFO ] Invariant cache hit.
[2024-05-30 16:01:46] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
Running 1564 sub problems to find dead transitions.
[2024-05-30 16:01:46] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 1564/1564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1564 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 0/1564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 1564 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in LTL mode, iteration 1 : 1565/1577 places, 1565/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62354 ms. Remains : 1565/1577 places, 1565/1577 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 382 ms.
Product exploration explored 100000 steps with 33333 reset in 339 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLCardinality-01 finished in 63438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1576 transition count 1131
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 1131 transition count 1131
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 890 place count 1131 transition count 820
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 1512 place count 820 transition count 820
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1520 place count 812 transition count 812
Iterating global reduction 2 with 8 rules applied. Total rules applied 1528 place count 812 transition count 812
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1528 place count 812 transition count 806
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1540 place count 806 transition count 806
Performed 361 Post agglomeration using F-continuation condition.Transition count delta: 361
Deduced a syphon composed of 361 places in 0 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 2 with 722 rules applied. Total rules applied 2262 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2263 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2265 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2467 place count 343 transition count 542
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2503 place count 325 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2505 place count 323 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2506 place count 322 transition count 558
Applied a total of 2506 rules in 185 ms. Remains 322 /1577 variables (removed 1255) and now considering 558/1577 (removed 1019) transitions.
// Phase 1: matrix 558 rows 322 cols
[2024-05-30 16:02:48] [INFO ] Computed 160 invariants in 1 ms
[2024-05-30 16:02:48] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-30 16:02:48] [INFO ] Invariant cache hit.
[2024-05-30 16:02:49] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-30 16:02:49] [INFO ] Redundant transitions in 10 ms returned []
Running 553 sub problems to find dead transitions.
[2024-05-30 16:02:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 2 (OVERLAPS) 1/322 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 4 (OVERLAPS) 557/879 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 6 (OVERLAPS) 0/879 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
No progress, stopping.
After SMT solving in domain Real declared 879/880 variables, and 482 constraints, problems are : Problem set: 0 solved, 553 unsolved in 26468 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 553 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 2 (OVERLAPS) 1/322 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 4 (OVERLAPS) 557/879 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 553/1035 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 7 (OVERLAPS) 0/879 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 553 unsolved
No progress, stopping.
After SMT solving in domain Int declared 879/880 variables, and 1035 constraints, problems are : Problem set: 0 solved, 553 unsolved in 25112 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 0/0 constraints]
After SMT, in 51757ms problems are : Problem set: 0 solved, 553 unsolved
Search for dead transitions found 0 dead transitions in 51762ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1577 places, 558/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52603 ms. Remains : 322/1577 places, 558/1577 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-02 finished in 52664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(!p0) U p1))&&X(G(p2)))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 1576 transition count 1134
Reduce places removed 442 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 443 rules applied. Total rules applied 885 place count 1134 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 886 place count 1133 transition count 1133
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 310 Pre rules applied. Total rules applied 886 place count 1133 transition count 823
Deduced a syphon composed of 310 places in 3 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1506 place count 823 transition count 823
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1514 place count 815 transition count 815
Iterating global reduction 3 with 8 rules applied. Total rules applied 1522 place count 815 transition count 815
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1522 place count 815 transition count 809
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1534 place count 809 transition count 809
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2254 place count 449 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2255 place count 449 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2257 place count 448 transition count 447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2459 place count 347 transition count 547
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2495 place count 329 transition count 565
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2497 place count 327 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2498 place count 326 transition count 563
Applied a total of 2498 rules in 206 ms. Remains 326 /1577 variables (removed 1251) and now considering 563/1577 (removed 1014) transitions.
// Phase 1: matrix 563 rows 326 cols
[2024-05-30 16:03:41] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 16:03:41] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-30 16:03:41] [INFO ] Invariant cache hit.
[2024-05-30 16:03:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-30 16:03:41] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2024-05-30 16:03:41] [INFO ] Redundant transitions in 4 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-30 16:03:41] [INFO ] Invariant cache hit.
[2024-05-30 16:03:41] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-30 16:03:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-30 16:03:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 562/888 variables, 326/488 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (OVERLAPS) 0/888 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 888/889 variables, and 492 constraints, problems are : Problem set: 0 solved, 558 unsolved in 29107 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 326/326 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (OVERLAPS) 1/326 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 562/888 variables, 326/488 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 558/1050 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 9 (OVERLAPS) 0/888 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Int declared 888/889 variables, and 1050 constraints, problems are : Problem set: 0 solved, 558 unsolved in 25483 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 326/326 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
After SMT, in 54748ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 54754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 326/1577 places, 563/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55621 ms. Remains : 326/1577 places, 563/1577 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-03 finished in 55885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))&&F(p2)))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1564 transition count 1564
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1564 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1563 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1563 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1562 transition count 1562
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1562 transition count 1562
Applied a total of 30 rules in 197 ms. Remains 1562 /1577 variables (removed 15) and now considering 1562/1577 (removed 15) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-30 16:04:36] [INFO ] Computed 161 invariants in 14 ms
[2024-05-30 16:04:37] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-30 16:04:37] [INFO ] Invariant cache hit.
[2024-05-30 16:04:38] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 16:04:38] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1577 places, 1562/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62162 ms. Remains : 1562/1577 places, 1562/1577 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-07
Stuttering criterion allowed to conclude after 41669 steps with 33 reset in 173 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-07 finished in 62550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p0)))))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1565 transition count 1565
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1565 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1564 transition count 1564
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1564 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1563 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1563 transition count 1563
Applied a total of 28 rules in 186 ms. Remains 1563 /1577 variables (removed 14) and now considering 1563/1577 (removed 14) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2024-05-30 16:05:39] [INFO ] Computed 161 invariants in 12 ms
[2024-05-30 16:05:39] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-30 16:05:39] [INFO ] Invariant cache hit.
[2024-05-30 16:05:41] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
Running 1562 sub problems to find dead transitions.
[2024-05-30 16:05:41] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 1562/1562 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 0/1562 constraints, Known Traps: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Starting structural reductions in LTL mode, iteration 1 : 1563/1577 places, 1563/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62231 ms. Remains : 1563/1577 places, 1563/1577 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-08
Product exploration explored 100000 steps with 3 reset in 422 ms.
Stack based approach found an accepted trace after 1397 steps with 0 reset with depth 1398 and stack size 1397 in 7 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-08 finished in 62860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p1))&&p0))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1563 transition count 1563
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1563 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1562 transition count 1562
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1562 transition count 1562
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1561 transition count 1561
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1561 transition count 1561
Applied a total of 32 rules in 177 ms. Remains 1561 /1577 variables (removed 16) and now considering 1561/1577 (removed 16) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2024-05-30 16:06:42] [INFO ] Computed 161 invariants in 8 ms
[2024-05-30 16:06:42] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-30 16:06:42] [INFO ] Invariant cache hit.
[2024-05-30 16:06:43] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2024-05-30 16:06:43] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1577 places, 1561/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62051 ms. Remains : 1561/1577 places, 1561/1577 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-10 finished in 62298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||G(p2))))))'
Support contains 6 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1576 transition count 1135
Reduce places removed 441 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 442 rules applied. Total rules applied 883 place count 1135 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 884 place count 1134 transition count 1134
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 884 place count 1134 transition count 823
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1506 place count 823 transition count 823
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1513 place count 816 transition count 816
Iterating global reduction 3 with 7 rules applied. Total rules applied 1520 place count 816 transition count 816
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1520 place count 816 transition count 810
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1532 place count 810 transition count 810
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 0 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 3 with 716 rules applied. Total rules applied 2248 place count 452 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2249 place count 452 transition count 451
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2251 place count 451 transition count 450
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2453 place count 350 transition count 549
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2489 place count 332 transition count 567
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2490 place count 332 transition count 567
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2492 place count 330 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2493 place count 329 transition count 565
Applied a total of 2493 rules in 204 ms. Remains 329 /1577 variables (removed 1248) and now considering 565/1577 (removed 1012) transitions.
// Phase 1: matrix 565 rows 329 cols
[2024-05-30 16:07:44] [INFO ] Computed 160 invariants in 1 ms
[2024-05-30 16:07:45] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-05-30 16:07:45] [INFO ] Invariant cache hit.
[2024-05-30 16:07:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 16:07:45] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2024-05-30 16:07:45] [INFO ] Redundant transitions in 4 ms returned []
Running 559 sub problems to find dead transitions.
[2024-05-30 16:07:45] [INFO ] Invariant cache hit.
[2024-05-30 16:07:45] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 2/329 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (OVERLAPS) 564/893 variables, 329/489 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 18/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (OVERLAPS) 0/893 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/894 variables, and 507 constraints, problems are : Problem set: 0 solved, 559 unsolved in 28684 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 329/329 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 2/329 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (OVERLAPS) 564/893 variables, 329/489 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 18/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 559/1066 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/893 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 8 (OVERLAPS) 0/893 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 559 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/894 variables, and 1066 constraints, problems are : Problem set: 0 solved, 559 unsolved in 29485 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 329/329 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints]
After SMT, in 58349ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 58354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 329/1577 places, 565/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59726 ms. Remains : 329/1577 places, 565/1577 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-11 finished in 59848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||G(p2))))))'
Support contains 6 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1576 transition count 1139
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1139 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1138 transition count 1138
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 876 place count 1138 transition count 826
Deduced a syphon composed of 312 places in 0 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1500 place count 826 transition count 826
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1509 place count 817 transition count 817
Iterating global reduction 3 with 9 rules applied. Total rules applied 1518 place count 817 transition count 817
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1518 place count 817 transition count 810
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1532 place count 810 transition count 810
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2246 place count 453 transition count 453
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2448 place count 352 transition count 553
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2484 place count 334 transition count 571
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 2486 place count 334 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2488 place count 332 transition count 569
Applied a total of 2488 rules in 189 ms. Remains 332 /1577 variables (removed 1245) and now considering 569/1577 (removed 1008) transitions.
// Phase 1: matrix 569 rows 332 cols
[2024-05-30 16:08:44] [INFO ] Computed 161 invariants in 1 ms
[2024-05-30 16:08:44] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-30 16:08:44] [INFO ] Invariant cache hit.
[2024-05-30 16:08:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-30 16:08:45] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-05-30 16:08:45] [INFO ] Redundant transitions in 4 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-30 16:08:45] [INFO ] Invariant cache hit.
[2024-05-30 16:08:45] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/332 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (OVERLAPS) 568/900 variables, 332/493 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (OVERLAPS) 0/900 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/901 variables, and 497 constraints, problems are : Problem set: 0 solved, 564 unsolved in 28657 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 332/332 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/332 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (OVERLAPS) 568/900 variables, 332/493 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 564/1061 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 8 (OVERLAPS) 0/900 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 564 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/901 variables, and 1061 constraints, problems are : Problem set: 0 solved, 564 unsolved in 26282 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 332/332 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 55138ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 55143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 332/1577 places, 569/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56047 ms. Remains : 332/1577 places, 569/1577 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-14 finished in 56162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 444 rules applied. Total rules applied 444 place count 1576 transition count 1132
Reduce places removed 444 places and 0 transitions.
Iterating post reduction 1 with 444 rules applied. Total rules applied 888 place count 1132 transition count 1132
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 888 place count 1132 transition count 820
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1512 place count 820 transition count 820
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1521 place count 811 transition count 811
Iterating global reduction 2 with 9 rules applied. Total rules applied 1530 place count 811 transition count 811
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1530 place count 811 transition count 804
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1544 place count 804 transition count 804
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2258 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2259 place count 447 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2261 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2463 place count 345 transition count 545
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2499 place count 327 transition count 563
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2501 place count 325 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2502 place count 324 transition count 561
Applied a total of 2502 rules in 139 ms. Remains 324 /1577 variables (removed 1253) and now considering 561/1577 (removed 1016) transitions.
// Phase 1: matrix 561 rows 324 cols
[2024-05-30 16:09:40] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 16:09:40] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-30 16:09:40] [INFO ] Invariant cache hit.
[2024-05-30 16:09:41] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-30 16:09:41] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2024-05-30 16:09:41] [INFO ] Redundant transitions in 4 ms returned []
Running 556 sub problems to find dead transitions.
[2024-05-30 16:09:41] [INFO ] Invariant cache hit.
[2024-05-30 16:09:41] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 77/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 560/884 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 190/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (OVERLAPS) 0/884 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/885 variables, and 674 constraints, problems are : Problem set: 0 solved, 556 unsolved in 29823 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 77/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 560/884 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 190/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 556/1230 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 1230 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1577 places, 561/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61508 ms. Remains : 324/1577 places, 561/1577 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-15 finished in 61583 ms.
All properties solved by simple procedures.
Total runtime 679753 ms.

BK_STOP 1717085442119

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

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

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="ShieldRVt-PT-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-PT-040B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762301019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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