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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 13 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 674K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716354709865

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 05:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:11:53] [INFO ] Load time of PNML (sax parser for PT used): 631 ms
[2024-05-22 05:11:53] [INFO ] Transformed 1999 places.
[2024-05-22 05:11:53] [INFO ] Transformed 2887 transitions.
[2024-05-22 05:11:53] [INFO ] Found NUPN structural information;
[2024-05-22 05:11:53] [INFO ] Parsed PT model containing 1999 places and 2887 transitions and 7649 arcs in 939 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-05b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1999/1999 places, 2887/2887 transitions.
Discarding 339 places :
Symmetric choice reduction at 0 with 339 rule applications. Total rules 339 place count 1660 transition count 2548
Iterating global reduction 0 with 339 rules applied. Total rules applied 678 place count 1660 transition count 2548
Discarding 259 places :
Symmetric choice reduction at 0 with 259 rule applications. Total rules 937 place count 1401 transition count 2289
Iterating global reduction 0 with 259 rules applied. Total rules applied 1196 place count 1401 transition count 2289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1202 place count 1401 transition count 2283
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 1250 place count 1353 transition count 2199
Iterating global reduction 1 with 48 rules applied. Total rules applied 1298 place count 1353 transition count 2199
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 1331 place count 1320 transition count 2166
Iterating global reduction 1 with 33 rules applied. Total rules applied 1364 place count 1320 transition count 2166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1368 place count 1320 transition count 2162
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1385 place count 1303 transition count 2145
Iterating global reduction 2 with 17 rules applied. Total rules applied 1402 place count 1303 transition count 2145
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1419 place count 1286 transition count 2128
Iterating global reduction 2 with 17 rules applied. Total rules applied 1436 place count 1286 transition count 2128
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1453 place count 1269 transition count 2111
Iterating global reduction 2 with 17 rules applied. Total rules applied 1470 place count 1269 transition count 2111
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1480 place count 1259 transition count 2101
Iterating global reduction 2 with 10 rules applied. Total rules applied 1490 place count 1259 transition count 2101
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1495 place count 1254 transition count 2096
Iterating global reduction 2 with 5 rules applied. Total rules applied 1500 place count 1254 transition count 2096
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1505 place count 1249 transition count 2091
Iterating global reduction 2 with 5 rules applied. Total rules applied 1510 place count 1249 transition count 2091
Applied a total of 1510 rules in 2952 ms. Remains 1249 /1999 variables (removed 750) and now considering 2091/2887 (removed 796) transitions.
// Phase 1: matrix 2091 rows 1249 cols
[2024-05-22 05:11:56] [INFO ] Computed 88 invariants in 42 ms
[2024-05-22 05:11:58] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2024-05-22 05:11:58] [INFO ] Invariant cache hit.
[2024-05-22 05:12:00] [INFO ] Implicit Places using invariants and state equation in 2244 ms returned []
Implicit Place search using SMT with State Equation took 3587 ms to find 0 implicit places.
Running 2090 sub problems to find dead transitions.
[2024-05-22 05:12:00] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1248/3340 variables, and 0 constraints, problems are : Problem set: 0 solved, 2090 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 2090/2090 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2090 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(timeout
s756 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1248/3340 variables, and 0 constraints, problems are : Problem set: 0 solved, 2090 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/2090 constraints, Known Traps: 0/0 constraints]
After SMT, in 61766ms problems are : Problem set: 0 solved, 2090 unsolved
Search for dead transitions found 0 dead transitions in 61862ms
Starting structural reductions in LTL mode, iteration 1 : 1249/1999 places, 2091/2887 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68480 ms. Remains : 1249/1999 places, 2091/2887 transitions.
Support contains 43 out of 1249 places after structural reductions.
[2024-05-22 05:13:03] [INFO ] Flatten gal took : 236 ms
[2024-05-22 05:13:03] [INFO ] Flatten gal took : 155 ms
[2024-05-22 05:13:03] [INFO ] Input system was already deterministic with 2091 transitions.
RANDOM walk for 40000 steps (8 resets) in 2174 ms. (18 steps per ms) remains 2/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
[2024-05-22 05:13:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 168/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1249 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1249 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2091/3340 variables, 1249/1337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3340 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3340 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3340/3340 variables, and 1337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1249/1249 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 168/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1249 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1249 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2091/3340 variables, 1249/1337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3340 variables, 2/1339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3340 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3340 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3340/3340 variables, and 1339 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1542 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1249/1249 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2850ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 224 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=74 )
Parikh walk visited 2 properties in 222 ms.
Computed a total of 178 stabilizing places and 178 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' '!((G(p0)||F(p1)))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1142 edges and 1249 vertex of which 328 / 1249 are part of one of the 27 SCC in 9 ms
Free SCC test removed 301 places
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 217 place count 947 transition count 1549
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 246 rules applied. Total rules applied 463 place count 731 transition count 1519
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 484 place count 711 transition count 1518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 485 place count 710 transition count 1518
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 485 place count 710 transition count 1429
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 663 place count 621 transition count 1429
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 708 place count 576 transition count 1225
Iterating global reduction 4 with 45 rules applied. Total rules applied 753 place count 576 transition count 1225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 756 place count 576 transition count 1222
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 756 place count 576 transition count 1215
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 770 place count 569 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 771 place count 568 transition count 1209
Iterating global reduction 5 with 1 rules applied. Total rules applied 772 place count 568 transition count 1209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 773 place count 568 transition count 1208
Performed 213 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 213 places in 1 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 6 with 426 rules applied. Total rules applied 1199 place count 355 transition count 990
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1206 place count 355 transition count 983
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1228 place count 333 transition count 794
Iterating global reduction 7 with 22 rules applied. Total rules applied 1250 place count 333 transition count 794
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1265 place count 333 transition count 779
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 8 with 2 rules applied. Total rules applied 1267 place count 332 transition count 778
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1301 place count 315 transition count 894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1302 place count 315 transition count 893
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1307 place count 310 transition count 825
Iterating global reduction 9 with 5 rules applied. Total rules applied 1312 place count 310 transition count 825
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1337 place count 310 transition count 800
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1363 place count 310 transition count 774
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1375 place count 298 transition count 750
Iterating global reduction 10 with 12 rules applied. Total rules applied 1387 place count 298 transition count 750
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1399 place count 286 transition count 640
Iterating global reduction 10 with 12 rules applied. Total rules applied 1411 place count 286 transition count 640
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1423 place count 286 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1424 place count 285 transition count 627
Applied a total of 1424 rules in 944 ms. Remains 285 /1249 variables (removed 964) and now considering 627/2091 (removed 1464) transitions.
[2024-05-22 05:13:09] [INFO ] Flow matrix only has 607 transitions (discarded 20 similar events)
// Phase 1: matrix 607 rows 285 cols
[2024-05-22 05:13:09] [INFO ] Computed 88 invariants in 3 ms
[2024-05-22 05:13:09] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-22 05:13:09] [INFO ] Flow matrix only has 607 transitions (discarded 20 similar events)
[2024-05-22 05:13:09] [INFO ] Invariant cache hit.
[2024-05-22 05:13:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 05:13:10] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2024-05-22 05:13:10] [INFO ] Redundant transitions in 43 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-22 05:13:10] [INFO ] Flow matrix only has 607 transitions (discarded 20 similar events)
[2024-05-22 05:13:10] [INFO ] Invariant cache hit.
[2024-05-22 05:13:10] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/285 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 606/891 variables, 285/373 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 36/409 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 891/892 variables, and 409 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 285/285 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/285 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 606/891 variables, 285/373 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 36/409 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 571/980 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 891/892 variables, and 980 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 285/285 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 0/0 constraints]
After SMT, in 60797ms problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60804ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/1249 places, 627/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62578 ms. Remains : 285/1249 places, 627/2091 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-00 finished in 63055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1228 transition count 2054
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1228 transition count 2054
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 1220 transition count 2046
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1218 transition count 2044
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1211 transition count 2037
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1211 transition count 2037
Applied a total of 76 rules in 591 ms. Remains 1211 /1249 variables (removed 38) and now considering 2037/2091 (removed 54) transitions.
// Phase 1: matrix 2037 rows 1211 cols
[2024-05-22 05:14:11] [INFO ] Computed 88 invariants in 17 ms
[2024-05-22 05:14:12] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-22 05:14:12] [INFO ] Invariant cache hit.
[2024-05-22 05:14:14] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
Running 2036 sub problems to find dead transitions.
[2024-05-22 05:14:14] [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 1210/3248 variables, and 0 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 2036/2036 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/3248 variables, and 0 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 0/2036 constraints, Known Traps: 0/0 constraints]
After SMT, in 61059ms problems are : Problem set: 0 solved, 2036 unsolved
Search for dead transitions found 0 dead transitions in 61092ms
Starting structural reductions in LTL mode, iteration 1 : 1211/1249 places, 2037/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64286 ms. Remains : 1211/1249 places, 2037/2091 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 190 steps with 0 reset in 7 ms.
FORMULA DLCround-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-01 finished in 64461 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(p0) U X((G(p0)&&X(G(p1))))))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1228 transition count 2054
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1228 transition count 2054
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 1220 transition count 2046
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1218 transition count 2044
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1211 transition count 2037
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1211 transition count 2037
Applied a total of 76 rules in 624 ms. Remains 1211 /1249 variables (removed 38) and now considering 2037/2091 (removed 54) transitions.
[2024-05-22 05:15:16] [INFO ] Invariant cache hit.
[2024-05-22 05:15:17] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-05-22 05:15:17] [INFO ] Invariant cache hit.
[2024-05-22 05:15:18] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
Running 2036 sub problems to find dead transitions.
[2024-05-22 05:15:18] [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)timeout

(s55 1.0)
(s56 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1210/3248 variables, and 0 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 2036/2036 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/3248 variables, and 0 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 0/2036 constraints, Known Traps: 0/0 constraints]
After SMT, in 61069ms problems are : Problem set: 0 solved, 2036 unsolved
Search for dead transitions found 0 dead transitions in 61108ms
Starting structural reductions in LTL mode, iteration 1 : 1211/1249 places, 2037/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64243 ms. Remains : 1211/1249 places, 2037/2091 transitions.
Stuttering acceptance computed with spot in 495 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1413 steps with 0 reset in 16 ms.
FORMULA DLCround-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-02 finished in 64818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||(p1&&F(G(!p2))))))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1141 edges and 1249 vertex of which 343 / 1249 are part of one of the 28 SCC in 3 ms
Free SCC test removed 315 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 213 place count 933 transition count 1537
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 242 rules applied. Total rules applied 455 place count 721 transition count 1507
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 475 place count 701 transition count 1507
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 475 place count 701 transition count 1419
Deduced a syphon composed of 88 places in 5 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 651 place count 613 transition count 1419
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 697 place count 567 transition count 1201
Iterating global reduction 3 with 46 rules applied. Total rules applied 743 place count 567 transition count 1201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 747 place count 567 transition count 1197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 747 place count 567 transition count 1193
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 755 place count 563 transition count 1193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 756 place count 562 transition count 1187
Iterating global reduction 4 with 1 rules applied. Total rules applied 757 place count 562 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 758 place count 562 transition count 1186
Performed 211 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 211 places in 1 ms
Reduce places removed 211 places and 0 transitions.
Iterating global reduction 5 with 422 rules applied. Total rules applied 1180 place count 351 transition count 969
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1186 place count 351 transition count 963
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1207 place count 330 transition count 780
Iterating global reduction 6 with 21 rules applied. Total rules applied 1228 place count 330 transition count 780
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1242 place count 330 transition count 766
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1276 place count 313 transition count 882
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1280 place count 309 transition count 826
Iterating global reduction 7 with 4 rules applied. Total rules applied 1284 place count 309 transition count 826
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1309 place count 309 transition count 801
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 1339 place count 309 transition count 771
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1351 place count 297 transition count 747
Iterating global reduction 8 with 12 rules applied. Total rules applied 1363 place count 297 transition count 747
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1375 place count 285 transition count 637
Iterating global reduction 8 with 12 rules applied. Total rules applied 1387 place count 285 transition count 637
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1399 place count 285 transition count 625
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1400 place count 284 transition count 624
Applied a total of 1400 rules in 356 ms. Remains 284 /1249 variables (removed 965) and now considering 624/2091 (removed 1467) transitions.
[2024-05-22 05:16:20] [INFO ] Flow matrix only has 601 transitions (discarded 23 similar events)
// Phase 1: matrix 601 rows 284 cols
[2024-05-22 05:16:20] [INFO ] Computed 88 invariants in 5 ms
[2024-05-22 05:16:21] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-22 05:16:21] [INFO ] Flow matrix only has 601 transitions (discarded 23 similar events)
[2024-05-22 05:16:21] [INFO ] Invariant cache hit.
[2024-05-22 05:16:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 05:16:22] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2024-05-22 05:16:22] [INFO ] Redundant transitions in 14 ms returned []
Running 567 sub problems to find dead transitions.
[2024-05-22 05:16:22] [INFO ] Flow matrix only has 601 transitions (discarded 23 similar events)
[2024-05-22 05:16:22] [INFO ] Invariant cache hit.
[2024-05-22 05:16:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 4 (OVERLAPS) 600/884 variables, 284/372 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 38/410 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/885 variables, and 410 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 284/284 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 4 (OVERLAPS) 600/884 variables, 284/372 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 38/410 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 567/977 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 977 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 284/284 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 567 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Starting structural reductions in SI_LTL mode, iteration 1 : 284/1249 places, 624/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61977 ms. Remains : 284/1249 places, 624/2091 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-03 finished in 62243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(p1))))'
Support contains 2 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1222 transition count 2048
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1220 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Applied a total of 72 rules in 616 ms. Remains 1213 /1249 variables (removed 36) and now considering 2039/2091 (removed 52) transitions.
// Phase 1: matrix 2039 rows 1213 cols
[2024-05-22 05:17:23] [INFO ] Computed 88 invariants in 15 ms
[2024-05-22 05:17:24] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-05-22 05:17:24] [INFO ] Invariant cache hit.
[2024-05-22 05:17:25] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 2496 ms to find 0 implicit places.
Running 2038 sub problems to find dead transitions.
[2024-05-22 05:17:26] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 2038/2038 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2038 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 0/2038 constraints, Known Traps: 0/0 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 2038 unsolved
Search for dead transitions found 0 dead transitions in 60938ms
Starting structural reductions in LTL mode, iteration 1 : 1213/1249 places, 2039/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64056 ms. Remains : 1213/1249 places, 2039/2091 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 753 ms.
Product exploration explored 100000 steps with 33333 reset in 620 ms.
Computed a total of 173 stabilizing places and 173 stable transitions
Computed a total of 173 stabilizing places and 173 stable transitions
Detected a total of 173/1213 stabilizing places and 173/2039 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-04 finished in 65879 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(p0)||X(p1)))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1222 transition count 2048
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1220 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Applied a total of 72 rules in 385 ms. Remains 1213 /1249 variables (removed 36) and now considering 2039/2091 (removed 52) transitions.
// Phase 1: matrix 2039 rows 1213 cols
[2024-05-22 05:18:29] [INFO ] Computed 88 invariants in 9 ms
[2024-05-22 05:18:29] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-22 05:18:29] [INFO ] Invariant cache hit.
[2024-05-22 05:18:31] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
Running 2038 sub problems to find dead transitions.
[2024-05-22 05:18:31] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 2038/2038 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2038 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 0/2038 constraints, Known Traps: 0/0 constraints]
After SMT, in 61043ms problems are : Problem set: 0 solved, 2038 unsolved
Search for dead transitions found 0 dead transitions in 61073ms
Starting structural reductions in LTL mode, iteration 1 : 1213/1249 places, 2039/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63896 ms. Remains : 1213/1249 places, 2039/2091 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4441 steps with 0 reset in 30 ms.
FORMULA DLCround-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-05 finished in 64167 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((G(F((p0||G(p1)))) U p2))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1140 edges and 1249 vertex of which 329 / 1249 are part of one of the 29 SCC in 2 ms
Free SCC test removed 300 places
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 948 transition count 1550
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 247 rules applied. Total rules applied 465 place count 731 transition count 1520
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 486 place count 711 transition count 1519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 487 place count 710 transition count 1519
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 487 place count 710 transition count 1430
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 665 place count 621 transition count 1430
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 710 place count 576 transition count 1221
Iterating global reduction 4 with 45 rules applied. Total rules applied 755 place count 576 transition count 1221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 759 place count 576 transition count 1217
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 759 place count 576 transition count 1211
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 771 place count 570 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 772 place count 569 transition count 1205
Iterating global reduction 5 with 1 rules applied. Total rules applied 773 place count 569 transition count 1205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 774 place count 569 transition count 1204
Performed 213 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 213 places in 0 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 6 with 426 rules applied. Total rules applied 1200 place count 356 transition count 985
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1206 place count 356 transition count 979
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1225 place count 337 transition count 817
Iterating global reduction 7 with 19 rules applied. Total rules applied 1244 place count 337 transition count 817
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1257 place count 337 transition count 804
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 8 with 2 rules applied. Total rules applied 1259 place count 336 transition count 803
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1293 place count 319 transition count 923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1294 place count 319 transition count 922
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1298 place count 315 transition count 868
Iterating global reduction 9 with 4 rules applied. Total rules applied 1302 place count 315 transition count 868
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1327 place count 315 transition count 843
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 10 with 23 rules applied. Total rules applied 1350 place count 315 transition count 820
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1358 place count 307 transition count 804
Iterating global reduction 10 with 8 rules applied. Total rules applied 1366 place count 307 transition count 804
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1374 place count 299 transition count 731
Iterating global reduction 10 with 8 rules applied. Total rules applied 1382 place count 299 transition count 731
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1390 place count 299 transition count 723
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1391 place count 298 transition count 722
Applied a total of 1391 rules in 325 ms. Remains 298 /1249 variables (removed 951) and now considering 722/2091 (removed 1369) transitions.
[2024-05-22 05:19:33] [INFO ] Flow matrix only has 697 transitions (discarded 25 similar events)
// Phase 1: matrix 697 rows 298 cols
[2024-05-22 05:19:33] [INFO ] Computed 88 invariants in 5 ms
[2024-05-22 05:19:33] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-22 05:19:33] [INFO ] Flow matrix only has 697 transitions (discarded 25 similar events)
[2024-05-22 05:19:33] [INFO ] Invariant cache hit.
[2024-05-22 05:19:33] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 05:19:34] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2024-05-22 05:19:34] [INFO ] Redundant transitions in 17 ms returned []
Running 666 sub problems to find dead transitions.
[2024-05-22 05:19:34] [INFO ] Flow matrix only has 697 transitions (discarded 25 similar events)
[2024-05-22 05:19:34] [INFO ] Invariant cache hit.
[2024-05-22 05:19:34] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (OVERLAPS) 2/298 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (OVERLAPS) 696/994 variables, 298/386 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/994 variables, 47/433 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 994/995 variables, and 433 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 298/298 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (OVERLAPS) 2/298 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (OVERLAPS) 696/994 variables, 298/386 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/994 variables, 47/433 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/994 variables, 666/1099 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 994/995 variables, and 1099 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 298/298 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 0/0 constraints]
After SMT, in 60597ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60609ms
Starting structural reductions in SI_LTL mode, iteration 1 : 298/1249 places, 722/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62122 ms. Remains : 298/1249 places, 722/2091 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-06 finished in 62405 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((X(p1) U (p2&&X(p1))))||p0)))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 1221 transition count 2047
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1219 transition count 2045
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Applied a total of 74 rules in 619 ms. Remains 1212 /1249 variables (removed 37) and now considering 2038/2091 (removed 53) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2024-05-22 05:20:35] [INFO ] Computed 88 invariants in 11 ms
[2024-05-22 05:20:36] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-05-22 05:20:36] [INFO ] Invariant cache hit.
[2024-05-22 05:20:39] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 3084 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2024-05-22 05:20:39] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints]
After SMT, in 61222ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 61255ms
Starting structural reductions in LTL mode, iteration 1 : 1212/1249 places, 2038/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64966 ms. Remains : 1212/1249 places, 2038/2091 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 732 ms.
Product exploration explored 100000 steps with 50000 reset in 484 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-07 finished in 66476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((p0&&((F(p1)&&G(p2)) U p3)))))))'
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1232 transition count 2066
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1232 transition count 2066
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1227 transition count 2061
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1227 transition count 2061
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1226 transition count 2060
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1226 transition count 2060
Applied a total of 46 rules in 142 ms. Remains 1226 /1249 variables (removed 23) and now considering 2060/2091 (removed 31) transitions.
// Phase 1: matrix 2060 rows 1226 cols
[2024-05-22 05:21:41] [INFO ] Computed 88 invariants in 9 ms
[2024-05-22 05:21:42] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-22 05:21:42] [INFO ] Invariant cache hit.
[2024-05-22 05:21:44] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2326 ms to find 0 implicit places.
Running 2059 sub problems to find dead transitions.
[2024-05-22 05:21:44] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1225/3286 variables, and 0 constraints, problems are : Problem set: 0 solved, 2059 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1226 constraints, PredecessorRefiner: 2059/2059 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2059 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1225/3286 variables, and 0 constraints, problems are : Problem set: 0 solved, 2059 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1226 constraints, PredecessorRefiner: 0/2059 constraints, Known Traps: 0/0 constraints]
After SMT, in 61226ms problems are : Problem set: 0 solved, 2059 unsolved
Search for dead transitions found 0 dead transitions in 61270ms
Starting structural reductions in LTL mode, iteration 1 : 1226/1249 places, 2060/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63746 ms. Remains : 1226/1249 places, 2060/2091 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 2 reset in 683 ms.
Product exploration explored 100000 steps with 4 reset in 704 ms.
Computed a total of 173 stabilizing places and 173 stable transitions
Computed a total of 173 stabilizing places and 173 stable transitions
Detected a total of 173/1226 stabilizing places and 173/2060 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X p2), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (NOT p0)), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (AND (NOT p3) p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p1) p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 175 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 11 states, 32 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 591 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p2 (NOT p3)), false, false, (AND p2 (NOT p3) p0 (NOT p1)), (AND p2 (NOT p3) p0 p1), false, false]
RANDOM walk for 40000 steps (8 resets) in 1150 ms. (34 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
[2024-05-22 05:22:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 234/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 987/1226 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1226 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2060/3286 variables, 1226/1314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3286 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/3286 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3286/3286 variables, and 1314 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3066 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1226/1226 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 234/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 987/1226 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 05:22:53] [INFO ] Deduced a trap composed of 68 places in 545 ms of which 56 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1226 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1226 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2060/3286 variables, 1226/1315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3286 variables, 7/1322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3286 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/3286 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3286/3286 variables, and 1322 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3978 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1226/1226 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 7070ms problems are : Problem set: 0 solved, 7 unsolved
Finished Parikh walk after 22575 steps, including 40 resets, run visited all 1 properties in 96 ms. (steps per millisecond=235 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 814 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X p2), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (NOT p0)), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (AND (NOT p3) p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p1) p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p2 (NOT p3) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND p2 (NOT p3) (NOT p1)))), (F p3), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0) p1))), (F (NOT (AND (OR p2 p3) (OR p2 p0)))), (F (NOT (OR (NOT p2) p3 (NOT p0) p1))), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (OR p2 (NOT p3) (NOT p0) p1))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F p1), (F (NOT (OR (NOT p2) p3 (NOT p0) (NOT p1)))), (F (NOT (OR (AND p2 (NOT p3)) (AND p2 (NOT p0)))))]
Knowledge based reduction with 22 factoid took 1293 ms. Reduced automaton from 11 states, 32 edges and 4 AP (stutter insensitive) to 11 states, 32 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 643 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p2 (NOT p3)), false, false, (AND p2 (NOT p3) p0 (NOT p1)), (AND p2 (NOT p3) p0 p1), false, false]
Stuttering acceptance computed with spot in 612 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p2 (NOT p3)), false, false, (AND p2 (NOT p3) p0 (NOT p1)), (AND p2 (NOT p3) p0 p1), false, false]
[2024-05-22 05:22:59] [INFO ] Invariant cache hit.
[2024-05-22 05:23:01] [INFO ] [Real]Absence check using 88 positive place invariants in 93 ms returned sat
[2024-05-22 05:23:04] [INFO ] [Real]Absence check using state equation in 2944 ms returned sat
[2024-05-22 05:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 05:23:05] [INFO ] [Nat]Absence check using 88 positive place invariants in 98 ms returned sat
[2024-05-22 05:23:08] [INFO ] [Nat]Absence check using state equation in 3126 ms returned sat
[2024-05-22 05:23:09] [INFO ] Computed and/alt/rep : 1946/3434/1946 causal constraints (skipped 113 transitions) in 139 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 05:23:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
[2024-05-22 05:23:19] [INFO ] Invariant cache hit.
[2024-05-22 05:23:20] [INFO ] [Real]Absence check using 88 positive place invariants in 94 ms returned sat
[2024-05-22 05:23:23] [INFO ] [Real]Absence check using state equation in 3036 ms returned sat
[2024-05-22 05:23:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 05:23:25] [INFO ] [Nat]Absence check using 88 positive place invariants in 97 ms returned sat
[2024-05-22 05:23:29] [INFO ] [Nat]Absence check using state equation in 3428 ms returned sat
[2024-05-22 05:23:29] [INFO ] Computed and/alt/rep : 1946/3434/1946 causal constraints (skipped 113 transitions) in 158 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 05:23:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 5 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2060/2060 transitions.
Graph (trivial) has 1116 edges and 1226 vertex of which 342 / 1226 are part of one of the 28 SCC in 2 ms
Free SCC test removed 314 places
Ensure Unique test removed 340 transitions
Reduce isomorphic transitions removed 340 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 911 transition count 1516
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 233 rules applied. Total rules applied 437 place count 708 transition count 1486
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 457 place count 688 transition count 1486
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 457 place count 688 transition count 1396
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 637 place count 598 transition count 1396
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 681 place count 554 transition count 1140
Iterating global reduction 3 with 44 rules applied. Total rules applied 725 place count 554 transition count 1140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 729 place count 554 transition count 1136
Performed 204 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 204 places in 1 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 4 with 408 rules applied. Total rules applied 1137 place count 350 transition count 927
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1143 place count 350 transition count 921
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1158 place count 335 transition count 795
Iterating global reduction 5 with 15 rules applied. Total rules applied 1173 place count 335 transition count 795
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1188 place count 335 transition count 780
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1220 place count 319 transition count 890
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1224 place count 315 transition count 836
Iterating global reduction 6 with 4 rules applied. Total rules applied 1228 place count 315 transition count 836
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1253 place count 315 transition count 811
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 1279 place count 315 transition count 785
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1290 place count 304 transition count 763
Iterating global reduction 7 with 11 rules applied. Total rules applied 1301 place count 304 transition count 763
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1312 place count 293 transition count 662
Iterating global reduction 7 with 11 rules applied. Total rules applied 1323 place count 293 transition count 662
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1334 place count 293 transition count 651
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1335 place count 293 transition count 651
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1336 place count 293 transition count 650
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1337 place count 292 transition count 648
Iterating global reduction 8 with 1 rules applied. Total rules applied 1338 place count 292 transition count 648
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1339 place count 291 transition count 639
Iterating global reduction 8 with 1 rules applied. Total rules applied 1340 place count 291 transition count 639
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1341 place count 291 transition count 638
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1342 place count 290 transition count 637
Applied a total of 1342 rules in 307 ms. Remains 290 /1226 variables (removed 936) and now considering 637/2060 (removed 1423) transitions.
[2024-05-22 05:23:39] [INFO ] Flow matrix only has 617 transitions (discarded 20 similar events)
// Phase 1: matrix 617 rows 290 cols
[2024-05-22 05:23:39] [INFO ] Computed 88 invariants in 2 ms
[2024-05-22 05:23:39] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-22 05:23:39] [INFO ] Flow matrix only has 617 transitions (discarded 20 similar events)
[2024-05-22 05:23:39] [INFO ] Invariant cache hit.
[2024-05-22 05:23:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 05:23:40] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2024-05-22 05:23:40] [INFO ] Redundant transitions in 8 ms returned []
Running 582 sub problems to find dead transitions.
[2024-05-22 05:23:40] [INFO ] Flow matrix only has 617 transitions (discarded 20 similar events)
[2024-05-22 05:23:40] [INFO ] Invariant cache hit.
[2024-05-22 05:23:40] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (OVERLAPS) 2/290 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 616/906 variables, 290/378 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 43/421 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/907 variables, and 421 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 290/290 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (OVERLAPS) 2/290 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 616/906 variables, 290/378 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 43/421 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 582/1003 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/907 variables, and 1003 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 290/290 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints]
After SMT, in 60493ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 290/1226 places, 637/2060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61586 ms. Remains : 290/1226 places, 637/2060 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Detected a total of 3/290 stabilizing places and 18/637 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT p3)), (X (AND p2 (NOT p3) (NOT p1))), (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) p3 p0 p1))), (X (NOT (AND p2 p3 p0 p1))), (X (OR (AND p2 (NOT p3)) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p3) p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p2 p3 p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (NOT (AND p2 p3 p0 p1)))), (X (X (OR (AND p2 (NOT p3)) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p2 p3 p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND p2 (NOT p3) p0 (NOT p1))), (X (NOT (AND p2 (NOT p3) p0 (NOT p1)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND p2 (NOT p3) p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) p0 (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 28 factoid took 1671 ms. Reduced automaton from 11 states, 32 edges and 4 AP (stutter insensitive) to 11 states, 32 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 726 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p2 (NOT p3)), (AND (NOT p3) p2 p0 (NOT p1)), false, false, (AND (NOT p3) p2 p0 p1), false, false]
RANDOM walk for 40000 steps (8 resets) in 1573 ms. (25 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
[2024-05-22 05:24:43] [INFO ] Flow matrix only has 617 transitions (discarded 20 similar events)
[2024-05-22 05:24:43] [INFO ] Invariant cache hit.
[2024-05-22 05:24:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 224/255 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 585/840 variables, 255/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 38/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 66/906 variables, 35/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/906 variables, 7/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/906 variables, 5/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/906 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/906 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/907 variables, and 421 constraints, problems are : Problem set: 0 solved, 2 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 290/290 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 224/255 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 585/840 variables, 255/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 38/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 66/906 variables, 35/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/906 variables, 7/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/906 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/906 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/906 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/907 variables, and 423 constraints, problems are : Problem set: 0 solved, 2 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 290/290 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1134ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 70 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT p3)), (X (AND p2 (NOT p3) (NOT p1))), (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) p3 p0 p1))), (X (NOT (AND p2 p3 p0 p1))), (X (OR (AND p2 (NOT p3)) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p3) p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p2 p3 p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (NOT (AND p2 p3 p0 p1)))), (X (X (OR (AND p2 (NOT p3)) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p2 p3 p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND p2 (NOT p3) p0 (NOT p1))), (X (NOT (AND p2 (NOT p3) p0 (NOT p1)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND p2 (NOT p3) p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) p0 (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p0))))), (F (NOT (OR p3 (NOT p0) (NOT p2)))), (F p1), (F (NOT (AND (OR p3 p2) (OR p0 p2)))), (F (NOT (OR (AND (NOT p3) p2) (AND (NOT p0) p2)))), (F (NOT (OR p1 p3 (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p3) p2))), (F (NOT (AND (NOT p1) (NOT p3) p2))), (F (NOT (OR (AND (NOT p3) (NOT p2)) (NOT p0)))), (F (NOT p2)), (F p3), (F (NOT (OR (NOT p1) p3 (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p3) (NOT p0) p2))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p0) p2))), (F (NOT (OR p1 (NOT p3) (NOT p0) (NOT p2))))]
Knowledge based reduction with 28 factoid took 2839 ms. Reduced automaton from 11 states, 32 edges and 4 AP (stutter insensitive) to 11 states, 32 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 706 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p2 (NOT p3)), (AND (NOT p3) p2 p0 (NOT p1)), false, false, (AND (NOT p3) p2 p0 p1), false, false]
Stuttering acceptance computed with spot in 623 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p2 (NOT p3)), (AND (NOT p3) p2 p0 (NOT p1)), false, false, (AND (NOT p3) p2 p0 p1), false, false]
[2024-05-22 05:24:49] [INFO ] Flow matrix only has 617 transitions (discarded 20 similar events)
[2024-05-22 05:24:49] [INFO ] Invariant cache hit.
[2024-05-22 05:24:49] [INFO ] [Real]Absence check using 88 positive place invariants in 48 ms returned sat
[2024-05-22 05:24:50] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2024-05-22 05:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 05:24:50] [INFO ] [Nat]Absence check using 88 positive place invariants in 45 ms returned sat
[2024-05-22 05:24:51] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2024-05-22 05:24:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 05:24:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2024-05-22 05:24:51] [INFO ] Computed and/alt/rep : 382/952/382 causal constraints (skipped 188 transitions) in 47 ms.
[2024-05-22 05:24:51] [INFO ] Added : 3 causal constraints over 1 iterations in 125 ms. Result :sat
Could not prove EG (NOT p3)
[2024-05-22 05:24:51] [INFO ] Flow matrix only has 617 transitions (discarded 20 similar events)
[2024-05-22 05:24:51] [INFO ] Invariant cache hit.
[2024-05-22 05:24:51] [INFO ] [Real]Absence check using 88 positive place invariants in 52 ms returned sat
[2024-05-22 05:24:52] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-05-22 05:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 05:24:52] [INFO ] [Nat]Absence check using 88 positive place invariants in 51 ms returned sat
[2024-05-22 05:24:53] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2024-05-22 05:24:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 05:24:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2024-05-22 05:24:53] [INFO ] Computed and/alt/rep : 382/952/382 causal constraints (skipped 188 transitions) in 46 ms.
[2024-05-22 05:24:53] [INFO ] Added : 3 causal constraints over 1 iterations in 123 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 589 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p2 (NOT p3)), (AND (NOT p3) p2 p0 (NOT p1)), false, false, (AND (NOT p3) p2 p0 p1), false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-08 finished in 192280 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(F((p0&&(X(p2)||p1))))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1230 transition count 2056
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1230 transition count 2056
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 1222 transition count 2048
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1220 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Applied a total of 72 rules in 614 ms. Remains 1213 /1249 variables (removed 36) and now considering 2039/2091 (removed 52) transitions.
// Phase 1: matrix 2039 rows 1213 cols
[2024-05-22 05:24:54] [INFO ] Computed 88 invariants in 6 ms
[2024-05-22 05:24:55] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-05-22 05:24:55] [INFO ] Invariant cache hit.
[2024-05-22 05:24:57] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
Running 2038 sub problems to find dead transitions.
[2024-05-22 05:24:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 2038/2038 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2038 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 0/2038 constraints, Known Traps: 0/0 constraints]
After SMT, in 61245ms problems are : Problem set: 0 solved, 2038 unsolved
Search for dead transitions found 0 dead transitions in 61276ms
Starting structural reductions in LTL mode, iteration 1 : 1213/1249 places, 2039/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64265 ms. Remains : 1213/1249 places, 2039/2091 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 518 ms.
Product exploration explored 100000 steps with 33333 reset in 392 ms.
Computed a total of 172 stabilizing places and 172 stable transitions
Computed a total of 172 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-09 finished in 65570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p1)||p0)))&&F(p2)))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1231 transition count 2057
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1231 transition count 2057
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 1223 transition count 2049
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 1223 transition count 2049
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1221 transition count 2047
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1220 transition count 2046
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Applied a total of 70 rules in 588 ms. Remains 1214 /1249 variables (removed 35) and now considering 2040/2091 (removed 51) transitions.
// Phase 1: matrix 2040 rows 1214 cols
[2024-05-22 05:26:00] [INFO ] Computed 88 invariants in 5 ms
[2024-05-22 05:26:00] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-22 05:26:00] [INFO ] Invariant cache hit.
[2024-05-22 05:26:02] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2636 ms to find 0 implicit places.
Running 2039 sub problems to find dead transitions.
[2024-05-22 05:26:02] [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 1213/3254 variables, and 0 constraints, problems are : Problem set: 0 solved, 2039 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1214 constraints, PredecessorRefiner: 2039/2039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1213/3254 variables, and 0 constraints, problems are : Problem set: 0 solved, 2039 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1214 constraints, PredecessorRefiner: 0/2039 constraints, Known Traps: 0/0 constraints]
After SMT, in 61140ms problems are : Problem set: 0 solved, 2039 unsolved
Search for dead transitions found 0 dead transitions in 61174ms
Starting structural reductions in LTL mode, iteration 1 : 1214/1249 places, 2040/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64405 ms. Remains : 1214/1249 places, 2040/2091 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 470 ms.
Product exploration explored 100000 steps with 0 reset in 601 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
[2024-05-22 05:27:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 213/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 998/1214 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2040/3254 variables, 1214/1302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3254 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3254 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3254/3254 variables, and 1302 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1214/1214 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 213/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 998/1214 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2040/3254 variables, 1214/1302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3254 variables, 5/1307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3254 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/3254 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3254/3254 variables, and 1307 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2533 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1214/1214 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4649ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 1193 steps, including 1 resets, run visited all 5 properties in 38 ms. (steps per millisecond=31 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 45 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 587 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
[2024-05-22 05:27:12] [INFO ] Invariant cache hit.
[2024-05-22 05:27:14] [INFO ] [Real]Absence check using 88 positive place invariants in 143 ms returned sat
[2024-05-22 05:27:18] [INFO ] [Real]Absence check using state equation in 3695 ms returned sat
[2024-05-22 05:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 05:27:19] [INFO ] [Nat]Absence check using 88 positive place invariants in 124 ms returned sat
[2024-05-22 05:27:23] [INFO ] [Nat]Absence check using state equation in 3408 ms returned sat
[2024-05-22 05:27:23] [INFO ] Computed and/alt/rep : 1927/3419/1927 causal constraints (skipped 112 transitions) in 155 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 05:27:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 3 out of 1214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1214/1214 places, 2040/2040 transitions.
Graph (trivial) has 1109 edges and 1214 vertex of which 342 / 1214 are part of one of the 28 SCC in 1 ms
Free SCC test removed 314 places
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 899 transition count 1504
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 226 rules applied. Total rules applied 423 place count 703 transition count 1474
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 443 place count 683 transition count 1474
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 443 place count 683 transition count 1384
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 623 place count 593 transition count 1384
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 665 place count 551 transition count 1146
Iterating global reduction 3 with 42 rules applied. Total rules applied 707 place count 551 transition count 1146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 711 place count 551 transition count 1142
Performed 204 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 204 places in 0 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 4 with 408 rules applied. Total rules applied 1119 place count 347 transition count 932
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1125 place count 347 transition count 926
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1141 place count 331 transition count 794
Iterating global reduction 5 with 16 rules applied. Total rules applied 1157 place count 331 transition count 794
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1173 place count 331 transition count 778
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1205 place count 315 transition count 887
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1209 place count 311 transition count 833
Iterating global reduction 6 with 4 rules applied. Total rules applied 1213 place count 311 transition count 833
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1238 place count 311 transition count 808
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 1263 place count 311 transition count 783
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1273 place count 301 transition count 763
Iterating global reduction 7 with 10 rules applied. Total rules applied 1283 place count 301 transition count 763
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1293 place count 291 transition count 671
Iterating global reduction 7 with 10 rules applied. Total rules applied 1303 place count 291 transition count 671
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1313 place count 291 transition count 661
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1314 place count 290 transition count 660
Applied a total of 1314 rules in 150 ms. Remains 290 /1214 variables (removed 924) and now considering 660/2040 (removed 1380) transitions.
[2024-05-22 05:27:33] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
// Phase 1: matrix 638 rows 290 cols
[2024-05-22 05:27:33] [INFO ] Computed 88 invariants in 2 ms
[2024-05-22 05:27:33] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 05:27:33] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
[2024-05-22 05:27:33] [INFO ] Invariant cache hit.
[2024-05-22 05:27:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 05:27:34] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2024-05-22 05:27:34] [INFO ] Redundant transitions in 9 ms returned []
Running 601 sub problems to find dead transitions.
[2024-05-22 05:27:34] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
[2024-05-22 05:27:34] [INFO ] Invariant cache hit.
[2024-05-22 05:27:34] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 1/290 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 637/927 variables, 290/378 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/927 variables, 36/414 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 927/928 variables, and 414 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 290/290 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 1/290 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 637/927 variables, 290/378 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/927 variables, 36/414 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 601/1015 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 927/928 variables, and 1015 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 290/290 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Starting structural reductions in SI_LTL mode, iteration 1 : 290/1214 places, 660/2040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61302 ms. Remains : 290/1214 places, 660/2040 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 161 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
RANDOM walk for 7575 steps (0 resets) in 136 ms. (55 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 448 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
[2024-05-22 05:28:36] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
[2024-05-22 05:28:36] [INFO ] Invariant cache hit.
[2024-05-22 05:28:36] [INFO ] [Real]Absence check using 88 positive place invariants in 35 ms returned sat
[2024-05-22 05:28:37] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2024-05-22 05:28:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 05:28:37] [INFO ] [Nat]Absence check using 88 positive place invariants in 38 ms returned sat
[2024-05-22 05:28:37] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-05-22 05:28:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 05:28:37] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2024-05-22 05:28:38] [INFO ] Computed and/alt/rep : 407/1008/407 causal constraints (skipped 181 transitions) in 52 ms.
[2024-05-22 05:28:38] [INFO ] Added : 3 causal constraints over 1 iterations in 139 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-10 finished in 158776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0)) U p1))'
Support contains 2 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 1221 transition count 2047
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1219 transition count 2045
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Applied a total of 74 rules in 386 ms. Remains 1212 /1249 variables (removed 37) and now considering 2038/2091 (removed 53) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2024-05-22 05:28:38] [INFO ] Computed 88 invariants in 8 ms
[2024-05-22 05:28:39] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-22 05:28:39] [INFO ] Invariant cache hit.
[2024-05-22 05:28:41] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2024-05-22 05:28:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints]
After SMT, in 60803ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Starting structural reductions in LTL mode, iteration 1 : 1212/1249 places, 2038/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63566 ms. Remains : 1212/1249 places, 2038/2091 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1), true]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-13 finished in 63724 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)||G(p1))))'
Support contains 2 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1143 edges and 1249 vertex of which 343 / 1249 are part of one of the 28 SCC in 0 ms
Free SCC test removed 315 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 214 place count 933 transition count 1536
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 243 rules applied. Total rules applied 457 place count 720 transition count 1506
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 477 place count 700 transition count 1506
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 477 place count 700 transition count 1419
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 651 place count 613 transition count 1419
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 698 place count 566 transition count 1200
Iterating global reduction 3 with 47 rules applied. Total rules applied 745 place count 566 transition count 1200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 749 place count 566 transition count 1196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 749 place count 566 transition count 1191
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 759 place count 561 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 760 place count 560 transition count 1185
Iterating global reduction 4 with 1 rules applied. Total rules applied 761 place count 560 transition count 1185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 762 place count 560 transition count 1184
Performed 209 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 209 places in 0 ms
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 5 with 418 rules applied. Total rules applied 1180 place count 351 transition count 969
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1186 place count 351 transition count 963
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1207 place count 330 transition count 783
Iterating global reduction 6 with 21 rules applied. Total rules applied 1228 place count 330 transition count 783
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1243 place count 330 transition count 768
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1275 place count 314 transition count 878
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1279 place count 310 transition count 824
Iterating global reduction 7 with 4 rules applied. Total rules applied 1283 place count 310 transition count 824
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1308 place count 310 transition count 799
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1334 place count 310 transition count 773
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1345 place count 299 transition count 751
Iterating global reduction 8 with 11 rules applied. Total rules applied 1356 place count 299 transition count 751
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1367 place count 288 transition count 651
Iterating global reduction 8 with 11 rules applied. Total rules applied 1378 place count 288 transition count 651
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1389 place count 288 transition count 640
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1390 place count 287 transition count 639
Applied a total of 1390 rules in 157 ms. Remains 287 /1249 variables (removed 962) and now considering 639/2091 (removed 1452) transitions.
[2024-05-22 05:29:42] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
// Phase 1: matrix 618 rows 287 cols
[2024-05-22 05:29:42] [INFO ] Computed 88 invariants in 2 ms
[2024-05-22 05:29:42] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 05:29:42] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
[2024-05-22 05:29:42] [INFO ] Invariant cache hit.
[2024-05-22 05:29:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 05:29:42] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2024-05-22 05:29:43] [INFO ] Redundant transitions in 9 ms returned []
Running 582 sub problems to find dead transitions.
[2024-05-22 05:29:43] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
[2024-05-22 05:29:43] [INFO ] Invariant cache hit.
[2024-05-22 05:29:43] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 617/904 variables, 287/375 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 38/413 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/905 variables, and 413 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 287/287 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 617/904 variables, 287/375 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 38/413 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 582/995 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/905 variables, and 995 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 287/287 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 287/1249 places, 639/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61198 ms. Remains : 287/1249 places, 639/2091 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-14 finished in 61260 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(((p0&&X(p1)) U p2)))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1230 transition count 2056
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1230 transition count 2056
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 1223 transition count 2049
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 1223 transition count 2049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1222 transition count 2048
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1221 transition count 2047
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1220 transition count 2046
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Applied a total of 68 rules in 394 ms. Remains 1215 /1249 variables (removed 34) and now considering 2041/2091 (removed 50) transitions.
// Phase 1: matrix 2041 rows 1215 cols
[2024-05-22 05:30:43] [INFO ] Computed 88 invariants in 6 ms
[2024-05-22 05:30:44] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-22 05:30:44] [INFO ] Invariant cache hit.
[2024-05-22 05:30:45] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
Running 2040 sub problems to find dead transitions.
[2024-05-22 05:30:45] [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 1214/3256 variables, and 0 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1215 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1214/3256 variables, and 0 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1215 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 0/0 constraints]
After SMT, in 60793ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 60816ms
Starting structural reductions in LTL mode, iteration 1 : 1215/1249 places, 2041/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63191 ms. Remains : 1215/1249 places, 2041/2091 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 28422 steps with 0 reset in 149 ms.
FORMULA DLCround-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-15 finished in 63475 ms.
All properties solved by simple procedures.
Total runtime 1194437 ms.
ITS solved all properties within timeout

BK_STOP 1716355906929

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="DLCround-PT-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DLCround-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r113-smll-171624274300156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-05b.tgz
mv DLCround-PT-05b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;