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.r500-smll-171649587500124.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 ltsminxred
Input is HirschbergSinclair-PT-45, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K 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.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 02:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 02:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 02:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 616K 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 HirschbergSinclair-PT-45-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717252865983

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:41:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:41:08] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2024-06-01 14:41:08] [INFO ] Transformed 1138 places.
[2024-06-01 14:41:08] [INFO ] Transformed 1042 transitions.
[2024-06-01 14:41:08] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 652 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-45-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1093 transition count 1042
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 89 place count 1049 transition count 998
Iterating global reduction 1 with 44 rules applied. Total rules applied 133 place count 1049 transition count 998
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 176 place count 1006 transition count 955
Iterating global reduction 1 with 43 rules applied. Total rules applied 219 place count 1006 transition count 955
Applied a total of 219 rules in 642 ms. Remains 1006 /1138 variables (removed 132) and now considering 955/1042 (removed 87) transitions.
// Phase 1: matrix 955 rows 1006 cols
[2024-06-01 14:41:10] [INFO ] Computed 51 invariants in 48 ms
[2024-06-01 14:41:11] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2024-06-01 14:41:11] [INFO ] Invariant cache hit.
[2024-06-01 14:41:18] [INFO ] Implicit Places using invariants and state equation in 7036 ms returned []
Implicit Place search using SMT with State Equation took 8479 ms to find 0 implicit places.
Running 910 sub problems to find dead transitions.
[2024-06-01 14:41:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 910 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 961/1961 variables, and 6 constraints, problems are : Problem set: 0 solved, 910 unsolved in 30082 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 910/910 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 910 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/961 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 2 (OVERLAPS) 45/1006 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 910 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 1006/1961 variables, and 51 constraints, problems are : Problem set: 0 solved, 910 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/910 constraints, Known Traps: 0/0 constraints]
After SMT, in 60994ms problems are : Problem set: 0 solved, 910 unsolved
Search for dead transitions found 0 dead transitions in 61053ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1138 places, 955/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70236 ms. Remains : 1006/1138 places, 955/1042 transitions.
Support contains 36 out of 1006 places after structural reductions.
[2024-06-01 14:42:20] [INFO ] Flatten gal took : 231 ms
[2024-06-01 14:42:20] [INFO ] Flatten gal took : 83 ms
[2024-06-01 14:42:20] [INFO ] Input system was already deterministic with 955 transitions.
Support contains 35 out of 1006 places (down from 36) after GAL structural reductions.
RANDOM walk for 3618 steps (0 resets) in 649 ms. (5 steps per ms) remains 0/24 properties
Computed a total of 1006 stabilizing places and 955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1006 transition count 955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 43 places and 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 963 transition count 494
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 545 transition count 494
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 838 place count 543 transition count 492
Iterating global reduction 2 with 2 rules applied. Total rules applied 840 place count 543 transition count 492
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 841 place count 543 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 842 place count 542 transition count 491
Applied a total of 842 rules in 128 ms. Remains 542 /1006 variables (removed 464) and now considering 491/955 (removed 464) transitions.
// Phase 1: matrix 491 rows 542 cols
[2024-06-01 14:42:21] [INFO ] Computed 51 invariants in 8 ms
[2024-06-01 14:42:22] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-06-01 14:42:22] [INFO ] Invariant cache hit.
[2024-06-01 14:42:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 14:42:26] [INFO ] Implicit Places using invariants and state equation in 4221 ms returned []
Implicit Place search using SMT with State Equation took 4960 ms to find 0 implicit places.
[2024-06-01 14:42:26] [INFO ] Redundant transitions in 54 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-01 14:42:26] [INFO ] Invariant cache hit.
[2024-06-01 14:42:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 4/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/1033 variables, and 520 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/542 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 4/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/871 variables, 406/926 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/1033 variables, and 926 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/542 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 542/1006 places, 491/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65387 ms. Remains : 542/1006 places, 491/955 transitions.
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-00
Product exploration explored 100000 steps with 337 reset in 951 ms.
Product exploration explored 100000 steps with 337 reset in 765 ms.
Computed a total of 542 stabilizing places and 491 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 542 transition count 491
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be false thanks to negative knowledge :(X (X (AND p1 (NOT p0))))
Knowledge based reduction with 8 factoid took 256 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-00 finished in 68135 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)))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 43 places and 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 403 transitions
Trivial Post-agglo rules discarded 403 transitions
Performed 403 trivial Post agglomeration. Transition count delta: 403
Iterating post reduction 0 with 403 rules applied. Total rules applied 403 place count 963 transition count 509
Reduce places removed 403 places and 0 transitions.
Iterating post reduction 1 with 403 rules applied. Total rules applied 806 place count 560 transition count 509
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 808 place count 558 transition count 507
Iterating global reduction 2 with 2 rules applied. Total rules applied 810 place count 558 transition count 507
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 811 place count 558 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 812 place count 557 transition count 506
Applied a total of 812 rules in 165 ms. Remains 557 /1006 variables (removed 449) and now considering 506/955 (removed 449) transitions.
// Phase 1: matrix 506 rows 557 cols
[2024-06-01 14:43:29] [INFO ] Computed 51 invariants in 9 ms
[2024-06-01 14:43:30] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2024-06-01 14:43:30] [INFO ] Invariant cache hit.
[2024-06-01 14:43:34] [INFO ] Implicit Places using invariants and state equation in 3747 ms returned []
Implicit Place search using SMT with State Equation took 4907 ms to find 0 implicit places.
[2024-06-01 14:43:34] [INFO ] Redundant transitions in 11 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-01 14:43:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 4/478 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 427/905 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 905/1063 variables, and 529 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 478/557 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 4/478 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 427/905 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 423/952 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 905/1063 variables, and 952 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 478/557 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1006 places, 506/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65309 ms. Remains : 557/1006 places, 506/955 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-01
Product exploration explored 100000 steps with 451 reset in 995 ms.
Product exploration explored 100000 steps with 420 reset in 577 ms.
Computed a total of 557 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 557 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-01 finished in 67399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 962 transition count 492
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 543 transition count 492
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 840 place count 541 transition count 490
Iterating global reduction 2 with 2 rules applied. Total rules applied 842 place count 541 transition count 490
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 843 place count 541 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 540 transition count 489
Applied a total of 844 rules in 124 ms. Remains 540 /1006 variables (removed 466) and now considering 489/955 (removed 466) transitions.
// Phase 1: matrix 489 rows 540 cols
[2024-06-01 14:44:36] [INFO ] Computed 51 invariants in 6 ms
[2024-06-01 14:44:38] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2024-06-01 14:44:38] [INFO ] Invariant cache hit.
[2024-06-01 14:44:42] [INFO ] Implicit Places using invariants and state equation in 3922 ms returned []
Implicit Place search using SMT with State Equation took 5229 ms to find 0 implicit places.
[2024-06-01 14:44:42] [INFO ] Redundant transitions in 8 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 14:44:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 3/457 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 406/863 variables, 457/508 constraints. Problems are: Problem set: 0 solved, 403 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 863/1029 variables, and 508 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 457/540 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 3/457 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 406/863 variables, 457/508 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/863 variables, 403/911 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/1029 variables, and 911 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 457/540 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 540/1006 places, 489/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65517 ms. Remains : 540/1006 places, 489/955 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-02
Stuttering criterion allowed to conclude after 533 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-02 finished in 65604 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 p1)))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 201 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2024-06-01 14:45:42] [INFO ] Computed 51 invariants in 14 ms
[2024-06-01 14:45:43] [INFO ] Implicit Places using invariants in 1357 ms returned []
[2024-06-01 14:45:43] [INFO ] Invariant cache hit.
[2024-06-01 14:45:53] [INFO ] Implicit Places using invariants and state equation in 9232 ms returned []
Implicit Place search using SMT with State Equation took 10594 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 14:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60471ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71269 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-04 finished in 71505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U X(X(G(p1))))&&X(F(p2)))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1005 transition count 954
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1005 transition count 954
Applied a total of 2 rules in 129 ms. Remains 1005 /1006 variables (removed 1) and now considering 954/955 (removed 1) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2024-06-01 14:46:53] [INFO ] Computed 51 invariants in 13 ms
[2024-06-01 14:46:55] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2024-06-01 14:46:55] [INFO ] Invariant cache hit.
[2024-06-01 14:47:04] [INFO ] Implicit Places using invariants and state equation in 9393 ms returned []
Implicit Place search using SMT with State Equation took 10814 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2024-06-01 14:47:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 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 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 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 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1006 places, 954/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71527 ms. Remains : 1005/1006 places, 954/955 transitions.
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-05
Stuttering criterion allowed to conclude after 1042 steps with 0 reset in 13 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-05 finished in 72128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 961 transition count 483
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 534 transition count 483
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 856 place count 532 transition count 481
Iterating global reduction 2 with 2 rules applied. Total rules applied 858 place count 532 transition count 481
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 532 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 531 transition count 480
Applied a total of 860 rules in 133 ms. Remains 531 /1006 variables (removed 475) and now considering 480/955 (removed 475) transitions.
// Phase 1: matrix 480 rows 531 cols
[2024-06-01 14:48:06] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 14:48:07] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-06-01 14:48:07] [INFO ] Invariant cache hit.
[2024-06-01 14:48:10] [INFO ] Implicit Places using invariants and state equation in 2807 ms returned []
Implicit Place search using SMT with State Equation took 4130 ms to find 0 implicit places.
[2024-06-01 14:48:10] [INFO ] Redundant transitions in 4 ms returned []
Running 391 sub problems to find dead transitions.
[2024-06-01 14:48:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 531/1006 places, 480/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64387 ms. Remains : 531/1006 places, 480/955 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-06
Product exploration explored 100000 steps with 328 reset in 768 ms.
Product exploration explored 100000 steps with 322 reset in 585 ms.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-06 finished in 66186 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)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 140 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2024-06-01 14:49:12] [INFO ] Computed 51 invariants in 11 ms
[2024-06-01 14:49:13] [INFO ] Implicit Places using invariants in 1403 ms returned []
[2024-06-01 14:49:13] [INFO ] Invariant cache hit.
[2024-06-01 14:49:23] [INFO ] Implicit Places using invariants and state equation in 9392 ms returned []
Implicit Place search using SMT with State Equation took 10798 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 14:49:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71332 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-08
Product exploration explored 100000 steps with 127 reset in 664 ms.
Product exploration explored 100000 steps with 127 reset in 510 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3121 steps (0 resets) in 52 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:50:25] [INFO ] Invariant cache hit.
[2024-06-01 14:50:27] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 250 ms returned sat
[2024-06-01 14:50:28] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2024-06-01 14:50:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:29] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 314 ms returned sat
[2024-06-01 14:50:43] [INFO ] [Nat]Absence check using state equation in 13869 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 958 transition count 480
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 531 transition count 480
Applied a total of 854 rules in 60 ms. Remains 531 /1003 variables (removed 472) and now considering 480/952 (removed 472) transitions.
// Phase 1: matrix 480 rows 531 cols
[2024-06-01 14:50:43] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 14:50:44] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2024-06-01 14:50:44] [INFO ] Invariant cache hit.
[2024-06-01 14:50:48] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned []
Implicit Place search using SMT with State Equation took 4827 ms to find 0 implicit places.
[2024-06-01 14:50:48] [INFO ] Redundant transitions in 4 ms returned []
Running 391 sub problems to find dead transitions.
[2024-06-01 14:50:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 531/1003 places, 480/952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65040 ms. Remains : 531/1003 places, 480/952 transitions.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1554 steps (0 resets) in 18 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:51:49] [INFO ] Invariant cache hit.
[2024-06-01 14:51:50] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 353 ms returned sat
[2024-06-01 14:51:53] [INFO ] [Real]Absence check using state equation in 3278 ms returned sat
[2024-06-01 14:51:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:51:54] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 420 ms returned sat
[2024-06-01 14:51:55] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2024-06-01 14:51:55] [INFO ] Computed and/alt/rep : 391/398/391 causal constraints (skipped 0 transitions) in 60 ms.
[2024-06-01 14:51:59] [INFO ] Added : 246 causal constraints over 50 iterations in 4150 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 269 reset in 439 ms.
Product exploration explored 100000 steps with 269 reset in 422 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 480/480 transitions.
Applied a total of 0 rules in 22 ms. Remains 531 /531 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 14:52:00] [INFO ] Invariant cache hit.
[2024-06-01 14:52:01] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2024-06-01 14:52:01] [INFO ] Invariant cache hit.
[2024-06-01 14:52:04] [INFO ] Implicit Places using invariants and state equation in 2993 ms returned []
Implicit Place search using SMT with State Equation took 4114 ms to find 0 implicit places.
[2024-06-01 14:52:04] [INFO ] Redundant transitions in 4 ms returned []
Running 391 sub problems to find dead transitions.
[2024-06-01 14:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(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)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64275 ms. Remains : 531/531 places, 480/480 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-08 finished in 232611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 188 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2024-06-01 14:53:04] [INFO ] Computed 51 invariants in 11 ms
[2024-06-01 14:53:06] [INFO ] Implicit Places using invariants in 1375 ms returned []
[2024-06-01 14:53:06] [INFO ] Invariant cache hit.
[2024-06-01 14:53:15] [INFO ] Implicit Places using invariants and state equation in 9514 ms returned []
Implicit Place search using SMT with State Equation took 10892 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 14:53:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 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 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 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 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71436 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-09
Product exploration explored 100000 steps with 149 reset in 559 ms.
Product exploration explored 100000 steps with 147 reset in 603 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 259 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 2897 steps (0 resets) in 42 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 309 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
[2024-06-01 14:54:19] [INFO ] Invariant cache hit.
[2024-06-01 14:54:20] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 343 ms returned sat
[2024-06-01 14:54:34] [INFO ] [Real]Absence check using state equation in 13487 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1003 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Reduce places removed 43 places and 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 412 transitions
Trivial Post-agglo rules discarded 412 transitions
Performed 412 trivial Post agglomeration. Transition count delta: 412
Iterating post reduction 0 with 412 rules applied. Total rules applied 412 place count 960 transition count 497
Reduce places removed 412 places and 0 transitions.
Iterating post reduction 1 with 412 rules applied. Total rules applied 824 place count 548 transition count 497
Applied a total of 824 rules in 43 ms. Remains 548 /1003 variables (removed 455) and now considering 497/952 (removed 455) transitions.
// Phase 1: matrix 497 rows 548 cols
[2024-06-01 14:54:34] [INFO ] Computed 51 invariants in 3 ms
[2024-06-01 14:54:35] [INFO ] Implicit Places using invariants in 1294 ms returned []
[2024-06-01 14:54:35] [INFO ] Invariant cache hit.
[2024-06-01 14:54:38] [INFO ] Implicit Places using invariants and state equation in 3550 ms returned []
Implicit Place search using SMT with State Equation took 4847 ms to find 0 implicit places.
[2024-06-01 14:54:38] [INFO ] Redundant transitions in 5 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:54:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 4/467 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/883 variables, 467/518 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 883/1045 variables, and 518 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 467/548 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 4/467 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/883 variables, 467/518 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 412/930 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 883/1045 variables, and 930 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 467/548 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 548/1003 places, 497/952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65044 ms. Remains : 548/1003 places, 497/952 transitions.
Computed a total of 548 stabilizing places and 497 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 548 transition count 497
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1536 steps (0 resets) in 13 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
[2024-06-01 14:55:39] [INFO ] Invariant cache hit.
[2024-06-01 14:55:40] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 318 ms returned sat
[2024-06-01 14:55:48] [INFO ] [Real]Absence check using state equation in 7561 ms returned sat
[2024-06-01 14:55:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:55:49] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 334 ms returned sat
[2024-06-01 14:55:55] [INFO ] [Nat]Absence check using state equation in 6428 ms returned sat
[2024-06-01 14:55:56] [INFO ] Computed and/alt/rep : 396/420/396 causal constraints (skipped 16 transitions) in 59 ms.
[2024-06-01 14:56:03] [INFO ] Added : 235 causal constraints over 47 iterations in 7466 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 273 reset in 668 ms.
Product exploration explored 100000 steps with 273 reset in 595 ms.
Support contains 2 out of 548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 548/548 places, 497/497 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 547 transition count 489
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 540 transition count 489
Applied a total of 14 rules in 27 ms. Remains 540 /548 variables (removed 8) and now considering 489/497 (removed 8) transitions.
// Phase 1: matrix 489 rows 540 cols
[2024-06-01 14:56:04] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 14:56:05] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-06-01 14:56:05] [INFO ] Invariant cache hit.
[2024-06-01 14:56:09] [INFO ] Implicit Places using invariants and state equation in 3737 ms returned []
Implicit Place search using SMT with State Equation took 4783 ms to find 0 implicit places.
[2024-06-01 14:56:09] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 14:56:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 3/457 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 406/863 variables, 457/508 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/1029 variables, and 508 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 457/540 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 3/457 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 406/863 variables, 457/508 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/863 variables, 403/911 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/1029 variables, and 911 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 457/540 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 540/548 places, 489/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64912 ms. Remains : 540/548 places, 489/497 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-09 finished in 245179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 961 transition count 483
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 534 transition count 483
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 856 place count 532 transition count 481
Iterating global reduction 2 with 2 rules applied. Total rules applied 858 place count 532 transition count 481
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 532 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 531 transition count 480
Applied a total of 860 rules in 118 ms. Remains 531 /1006 variables (removed 475) and now considering 480/955 (removed 475) transitions.
// Phase 1: matrix 480 rows 531 cols
[2024-06-01 14:57:10] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 14:57:11] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2024-06-01 14:57:11] [INFO ] Invariant cache hit.
[2024-06-01 14:57:15] [INFO ] Implicit Places using invariants and state equation in 3881 ms returned []
Implicit Place search using SMT with State Equation took 5301 ms to find 0 implicit places.
[2024-06-01 14:57:15] [INFO ] Redundant transitions in 4 ms returned []
Running 391 sub problems to find dead transitions.
[2024-06-01 14:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 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)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(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)
(s132 0)
(s133 0)
(s134 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 531/1006 places, 480/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65552 ms. Remains : 531/1006 places, 480/955 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-10
Product exploration explored 100000 steps with 391 reset in 463 ms.
Product exploration explored 100000 steps with 391 reset in 514 ms.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1090 steps (0 resets) in 13 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-10 finished in 67312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 186 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2024-06-01 14:58:17] [INFO ] Computed 51 invariants in 7 ms
[2024-06-01 14:58:18] [INFO ] Implicit Places using invariants in 1350 ms returned []
[2024-06-01 14:58:18] [INFO ] Invariant cache hit.
[2024-06-01 14:58:27] [INFO ] Implicit Places using invariants and state equation in 9107 ms returned []
Implicit Place search using SMT with State Equation took 10459 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 14:58:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70999 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-11 finished in 71201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 412 transitions
Trivial Post-agglo rules discarded 412 transitions
Performed 412 trivial Post agglomeration. Transition count delta: 412
Iterating post reduction 0 with 412 rules applied. Total rules applied 412 place count 962 transition count 499
Reduce places removed 412 places and 0 transitions.
Iterating post reduction 1 with 412 rules applied. Total rules applied 824 place count 550 transition count 499
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 826 place count 548 transition count 497
Iterating global reduction 2 with 2 rules applied. Total rules applied 828 place count 548 transition count 497
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 829 place count 548 transition count 496
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 830 place count 547 transition count 496
Applied a total of 830 rules in 50 ms. Remains 547 /1006 variables (removed 459) and now considering 496/955 (removed 459) transitions.
// Phase 1: matrix 496 rows 547 cols
[2024-06-01 14:59:28] [INFO ] Computed 51 invariants in 6 ms
[2024-06-01 14:59:29] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2024-06-01 14:59:29] [INFO ] Invariant cache hit.
[2024-06-01 14:59:32] [INFO ] Implicit Places using invariants and state equation in 3156 ms returned []
Implicit Place search using SMT with State Equation took 4442 ms to find 0 implicit places.
[2024-06-01 14:59:32] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 14:59:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/461 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/1043 variables, and 512 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/547 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/461 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 409/921 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/1043 variables, and 921 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/547 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in SI_LTL mode, iteration 1 : 547/1006 places, 496/955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64625 ms. Remains : 547/1006 places, 496/955 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-12
Product exploration explored 100000 steps with 576 reset in 581 ms.
Product exploration explored 100000 steps with 620 reset in 665 ms.
Computed a total of 547 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 547 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 25 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-12 finished in 66384 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((p0 U X(p1)))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 198 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2024-06-01 15:00:34] [INFO ] Computed 51 invariants in 10 ms
[2024-06-01 15:00:36] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2024-06-01 15:00:36] [INFO ] Invariant cache hit.
[2024-06-01 15:00:45] [INFO ] Implicit Places using invariants and state equation in 8874 ms returned []
Implicit Place search using SMT with State Equation took 10173 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 15:00:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70887 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-13
Product exploration explored 100000 steps with 271 reset in 648 ms.
Product exploration explored 100000 steps with 271 reset in 722 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 3616 steps (0 resets) in 38 ms. (92 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
[2024-06-01 15:01:48] [INFO ] Invariant cache hit.
[2024-06-01 15:01:49] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 277 ms returned sat
[2024-06-01 15:01:51] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2024-06-01 15:01:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:01:52] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 305 ms returned sat
[2024-06-01 15:02:00] [INFO ] [Nat]Absence check using state equation in 7709 ms returned sat
[2024-06-01 15:02:00] [INFO ] Computed and/alt/rep : 434/440/434 causal constraints (skipped 473 transitions) in 95 ms.
[2024-06-01 15:02:04] [INFO ] Added : 134 causal constraints over 27 iterations in 4740 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Applied a total of 0 rules in 38 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-06-01 15:02:05] [INFO ] Invariant cache hit.
[2024-06-01 15:02:05] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-06-01 15:02:05] [INFO ] Invariant cache hit.
[2024-06-01 15:02:14] [INFO ] Implicit Places using invariants and state equation in 8246 ms returned []
Implicit Place search using SMT with State Equation took 9192 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 15:02:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Finished structural reductions in LTL mode , in 1 iterations and 69562 ms. Remains : 1003/1003 places, 952/952 transitions.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 3617 steps (0 resets) in 63 ms. (56 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
[2024-06-01 15:03:15] [INFO ] Invariant cache hit.
[2024-06-01 15:03:17] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 273 ms returned sat
[2024-06-01 15:03:18] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2024-06-01 15:03:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:03:19] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 315 ms returned sat
[2024-06-01 15:03:27] [INFO ] [Nat]Absence check using state equation in 7646 ms returned sat
[2024-06-01 15:03:27] [INFO ] Computed and/alt/rep : 434/440/434 causal constraints (skipped 473 transitions) in 85 ms.
[2024-06-01 15:03:32] [INFO ] Added : 134 causal constraints over 27 iterations in 4784 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 271 reset in 643 ms.
Product exploration explored 100000 steps with 271 reset in 718 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Performed 426 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 426 rules applied. Total rules applied 426 place count 1003 transition count 952
Deduced a syphon composed of 426 places in 5 ms
Applied a total of 426 rules in 291 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-06-01 15:03:34] [INFO ] Redundant transitions in 10 ms returned []
Running 907 sub problems to find dead transitions.
// Phase 1: matrix 952 rows 1003 cols
[2024-06-01 15:03:34] [INFO ] Computed 51 invariants in 12 ms
[2024-06-01 15:03:34] [INFO ] State equation strengthened by 426 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 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 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/426 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 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 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/426 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 952/952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60617 ms. Remains : 1003/1003 places, 952/952 transitions.
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Applied a total of 0 rules in 70 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2024-06-01 15:04:34] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 15:04:35] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-06-01 15:04:35] [INFO ] Invariant cache hit.
[2024-06-01 15:04:44] [INFO ] Implicit Places using invariants and state equation in 8582 ms returned []
Implicit Place search using SMT with State Equation took 9573 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 15:04:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 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 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60332ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Finished structural reductions in LTL mode , in 1 iterations and 69989 ms. Remains : 1003/1003 places, 952/952 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-13 finished in 310151 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(G(p0))&&F(p1)))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 139 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
[2024-06-01 15:05:45] [INFO ] Invariant cache hit.
[2024-06-01 15:05:46] [INFO ] Implicit Places using invariants in 988 ms returned []
[2024-06-01 15:05:46] [INFO ] Invariant cache hit.
[2024-06-01 15:05:54] [INFO ] Implicit Places using invariants and state equation in 8786 ms returned []
Implicit Place search using SMT with State Equation took 9776 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2024-06-01 15:05:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 723)
(s4 0)
(s5 1)
(s6 722)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 720)
(s13 1)
(s14 720)
(s15 1)
(s16 0)
(s17 721)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 717)
(s23 1)
(s24 715)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 713)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 709)
(s39 1)
(s40 0)
(s41 1)
(s42 707)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 704)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 699)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 697)
(s62 696)
(s63 1)
(s64 0)
(s65 697)
(s66 695)
(s67 1)
(s68 694)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 690)
(s76 688)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 684)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 724)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 723)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 723)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 722)
(s110 1)
(s111 723)
(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 720)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 719)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 714)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 713)
(s150 1)
(s151 1)
(s152 1)
(s153 713)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 712)
(s164 1)
(s165 1)
(s166 1)
(s167 711)
(s168 1)
(s169 709)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 707)
(s178 1)
(s179 1)
(s180 1)
(s181 706)
(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 704)
(s196 1)
(s197 702)
(s198 1)
(s199 703)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 698)
(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 692)
(s234 1)
(s235 694)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 688)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 686)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 680)
(s262 1)
(s263 682)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70240 ms. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-14
Stuttering criterion allowed to conclude after 4144 steps with 4 reset in 18 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-14 finished in 70497 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))||F(p1)))'
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1005 transition count 954
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1005 transition count 954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1004 transition count 953
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1004 transition count 953
Applied a total of 4 rules in 131 ms. Remains 1004 /1006 variables (removed 2) and now considering 953/955 (removed 2) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2024-06-01 15:06:55] [INFO ] Computed 51 invariants in 9 ms
[2024-06-01 15:06:56] [INFO ] Implicit Places using invariants in 943 ms returned []
[2024-06-01 15:06:56] [INFO ] Invariant cache hit.
[2024-06-01 15:07:04] [INFO ] Implicit Places using invariants and state equation in 7959 ms returned []
Implicit Place search using SMT with State Equation took 8920 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2024-06-01 15:07:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 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 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Starting structural reductions in LTL mode, iteration 1 : 1004/1006 places, 953/955 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69415 ms. Remains : 1004/1006 places, 953/955 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-15
Product exploration explored 100000 steps with 1413 reset in 795 ms.
Product exploration explored 100000 steps with 1428 reset in 842 ms.
Computed a total of 1004 stabilizing places and 953 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1004 transition count 953
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 349 steps (0 resets) in 7 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1)]
Knowledge based reduction with 9 factoid took 360 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 15:08:08] [INFO ] Invariant cache hit.
[2024-06-01 15:08:09] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 295 ms returned sat
[2024-06-01 15:08:13] [INFO ] [Real]Absence check using state equation in 4097 ms returned sat
[2024-06-01 15:08:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:08:14] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 323 ms returned sat
[2024-06-01 15:08:28] [INFO ] [Nat]Absence check using state equation in 13764 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 1004 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 953/953 transitions.
Applied a total of 0 rules in 46 ms. Remains 1004 /1004 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-06-01 15:08:28] [INFO ] Invariant cache hit.
[2024-06-01 15:08:29] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-06-01 15:08:29] [INFO ] Invariant cache hit.
[2024-06-01 15:08:36] [INFO ] Implicit Places using invariants and state equation in 7611 ms returned []
Implicit Place search using SMT with State Equation took 8377 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2024-06-01 15:08:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Finished structural reductions in LTL mode , in 1 iterations and 68790 ms. Remains : 1004/1004 places, 953/953 transitions.
Computed a total of 1004 stabilizing places and 953 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1004 transition count 953
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 263 steps (0 resets) in 8 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 15:09:38] [INFO ] Invariant cache hit.
[2024-06-01 15:09:39] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 284 ms returned sat
[2024-06-01 15:09:43] [INFO ] [Real]Absence check using state equation in 4270 ms returned sat
[2024-06-01 15:09:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:09:45] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 316 ms returned sat
[2024-06-01 15:09:58] [INFO ] [Nat]Absence check using state equation in 13795 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1410 reset in 790 ms.
Product exploration explored 100000 steps with 1396 reset in 849 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 953/953 transitions.
Performed 411 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 411 rules applied. Total rules applied 411 place count 1004 transition count 953
Deduced a syphon composed of 411 places in 5 ms
Applied a total of 411 rules in 146 ms. Remains 1004 /1004 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-06-01 15:10:01] [INFO ] Redundant transitions in 11 ms returned []
Running 908 sub problems to find dead transitions.
// Phase 1: matrix 953 rows 1004 cols
[2024-06-01 15:10:01] [INFO ] Computed 51 invariants in 8 ms
[2024-06-01 15:10:01] [INFO ] State equation strengthened by 411 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, ReadFeed: 0/411 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, ReadFeed: 0/411 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/1004 places, 953/953 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60453 ms. Remains : 1004/1004 places, 953/953 transitions.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 953/953 transitions.
Applied a total of 0 rules in 44 ms. Remains 1004 /1004 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2024-06-01 15:11:01] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 15:11:02] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-06-01 15:11:02] [INFO ] Invariant cache hit.
[2024-06-01 15:11:09] [INFO ] Implicit Places using invariants and state equation in 7730 ms returned []
Implicit Place search using SMT with State Equation took 8533 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2024-06-01 15:11:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 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 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Finished structural reductions in LTL mode , in 1 iterations and 68919 ms. Remains : 1004/1004 places, 953/953 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-15 finished in 314931 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)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-45-LTLFireability-08
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 961 transition count 483
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 534 transition count 483
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 856 place count 532 transition count 481
Iterating global reduction 2 with 2 rules applied. Total rules applied 858 place count 532 transition count 481
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 532 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 531 transition count 480
Applied a total of 860 rules in 60 ms. Remains 531 /1006 variables (removed 475) and now considering 480/955 (removed 475) transitions.
// Phase 1: matrix 480 rows 531 cols
[2024-06-01 15:12:10] [INFO ] Computed 51 invariants in 2 ms
[2024-06-01 15:12:11] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-06-01 15:12:11] [INFO ] Invariant cache hit.
[2024-06-01 15:12:14] [INFO ] Implicit Places using invariants and state equation in 2915 ms returned []
Implicit Place search using SMT with State Equation took 3724 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-06-01 15:12:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LI_LTL mode, iteration 1 : 531/1006 places, 480/955 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63913 ms. Remains : 531/1006 places, 480/955 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-08
Product exploration explored 100000 steps with 269 reset in 656 ms.
Product exploration explored 100000 steps with 269 reset in 458 ms.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1574 steps (0 resets) in 16 ms. (92 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:13:16] [INFO ] Invariant cache hit.
[2024-06-01 15:13:17] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 198 ms returned sat
[2024-06-01 15:13:19] [INFO ] [Real]Absence check using state equation in 2329 ms returned sat
[2024-06-01 15:13:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:13:21] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 677 ms returned sat
[2024-06-01 15:13:21] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2024-06-01 15:13:21] [INFO ] Computed and/alt/rep : 391/398/391 causal constraints (skipped 0 transitions) in 56 ms.
[2024-06-01 15:13:25] [INFO ] Added : 246 causal constraints over 50 iterations in 3881 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 480/480 transitions.
Applied a total of 0 rules in 19 ms. Remains 531 /531 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 15:13:25] [INFO ] Invariant cache hit.
[2024-06-01 15:13:26] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-06-01 15:13:26] [INFO ] Invariant cache hit.
[2024-06-01 15:13:29] [INFO ] Implicit Places using invariants and state equation in 3004 ms returned []
Implicit Place search using SMT with State Equation took 4082 ms to find 0 implicit places.
[2024-06-01 15:13:29] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2024-06-01 15:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 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 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64195 ms. Remains : 531/531 places, 480/480 transitions.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1566 steps (0 resets) in 15 ms. (97 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:14:30] [INFO ] Invariant cache hit.
[2024-06-01 15:14:31] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 324 ms returned sat
[2024-06-01 15:14:34] [INFO ] [Real]Absence check using state equation in 2714 ms returned sat
[2024-06-01 15:14:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:14:35] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 413 ms returned sat
[2024-06-01 15:14:35] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-06-01 15:14:36] [INFO ] Computed and/alt/rep : 391/398/391 causal constraints (skipped 0 transitions) in 40 ms.
[2024-06-01 15:14:39] [INFO ] Added : 246 causal constraints over 50 iterations in 3457 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 269 reset in 407 ms.
Product exploration explored 100000 steps with 269 reset in 463 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 480/480 transitions.
Applied a total of 0 rules in 18 ms. Remains 531 /531 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 15:14:40] [INFO ] Invariant cache hit.
[2024-06-01 15:14:41] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-06-01 15:14:41] [INFO ] Invariant cache hit.
[2024-06-01 15:14:44] [INFO ] Implicit Places using invariants and state equation in 3072 ms returned []
Implicit Place search using SMT with State Equation took 3928 ms to find 0 implicit places.
[2024-06-01 15:14:44] [INFO ] Redundant transitions in 4 ms returned []
Running 391 sub problems to find dead transitions.
[2024-06-01 15:14:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64073 ms. Remains : 531/531 places, 480/480 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-08 finished in 214203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-45-LTLFireability-15
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 42 places and 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 411 transitions
Trivial Post-agglo rules discarded 411 transitions
Performed 411 trivial Post agglomeration. Transition count delta: 411
Iterating post reduction 0 with 411 rules applied. Total rules applied 411 place count 964 transition count 502
Reduce places removed 411 places and 0 transitions.
Iterating post reduction 1 with 411 rules applied. Total rules applied 822 place count 553 transition count 502
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 823 place count 552 transition count 501
Iterating global reduction 2 with 1 rules applied. Total rules applied 824 place count 552 transition count 501
Applied a total of 824 rules in 47 ms. Remains 552 /1006 variables (removed 454) and now considering 501/955 (removed 454) transitions.
// Phase 1: matrix 501 rows 552 cols
[2024-06-01 15:15:45] [INFO ] Computed 51 invariants in 3 ms
[2024-06-01 15:15:46] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-06-01 15:15:46] [INFO ] Invariant cache hit.
[2024-06-01 15:15:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:15:50] [INFO ] Implicit Places using invariants and state equation in 4457 ms returned []
Implicit Place search using SMT with State Equation took 5357 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-06-01 15:15:50] [INFO ] Invariant cache hit.
[2024-06-01 15:15:50] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 419/953 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 953 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LI_LTL mode, iteration 1 : 552/1006 places, 501/955 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 65535 ms. Remains : 552/1006 places, 501/955 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-15
Product exploration explored 100000 steps with 1358 reset in 1083 ms.
Product exploration explored 100000 steps with 1330 reset in 939 ms.
Computed a total of 552 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 552 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 422 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 419 steps (0 resets) in 9 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1)]
Knowledge based reduction with 9 factoid took 541 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 15:16:54] [INFO ] Invariant cache hit.
[2024-06-01 15:16:56] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 868 ms returned sat
[2024-06-01 15:17:09] [INFO ] [Real]Absence check using state equation in 13373 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 552 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Applied a total of 0 rules in 13 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-06-01 15:17:09] [INFO ] Invariant cache hit.
[2024-06-01 15:17:10] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2024-06-01 15:17:10] [INFO ] Invariant cache hit.
[2024-06-01 15:17:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:17:15] [INFO ] Implicit Places using invariants and state equation in 4595 ms returned []
Implicit Place search using SMT with State Equation took 5719 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-06-01 15:17:15] [INFO ] Invariant cache hit.
[2024-06-01 15:17:15] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
(s3 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 419/953 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 953 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Finished structural reductions in LTL mode , in 1 iterations and 65863 ms. Remains : 552/552 places, 501/501 transitions.
Computed a total of 552 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 552 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 387 steps (0 resets) in 8 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 15:18:16] [INFO ] Invariant cache hit.
[2024-06-01 15:18:17] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 551 ms returned sat
[2024-06-01 15:18:31] [INFO ] [Real]Absence check using state equation in 13909 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1343 reset in 869 ms.
Product exploration explored 100000 steps with 1360 reset in 1271 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 552 transition count 501
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 35 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-06-01 15:18:33] [INFO ] Redundant transitions in 5 ms returned []
Running 419 sub problems to find dead transitions.
// Phase 1: matrix 501 rows 552 cols
[2024-06-01 15:18:33] [INFO ] Computed 51 invariants in 3 ms
[2024-06-01 15:18:33] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Problem TDEAD312 is UNSAT
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 1 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 1 solved, 418 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 6/475 variables, 47/51 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 418/952 constraints. Problems are: Problem set: 1 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 952 constraints, problems are : Problem set: 1 solved, 418 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 418/419 constraints, Known Traps: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 1 solved, 418 unsolved
Search for dead transitions found 1 dead transitions in 60136ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 552/552 places, 500/501 transitions.
Graph (complete) has 1380 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 551 /552 variables (removed 1) and now considering 500/500 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 551/552 places, 500/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60211 ms. Remains : 551/552 places, 500/501 transitions.
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Applied a total of 0 rules in 13 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 552 cols
[2024-06-01 15:19:34] [INFO ] Computed 51 invariants in 4 ms
[2024-06-01 15:19:35] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2024-06-01 15:19:35] [INFO ] Invariant cache hit.
[2024-06-01 15:19:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:19:39] [INFO ] Implicit Places using invariants and state equation in 4869 ms returned []
Implicit Place search using SMT with State Equation took 5881 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-06-01 15:19:39] [INFO ] Invariant cache hit.
[2024-06-01 15:19:39] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 419/953 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 953 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in LTL mode , in 1 iterations and 66028 ms. Remains : 552/552 places, 501/501 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-15 finished in 295268 ms.
[2024-06-01 15:20:40] [INFO ] Flatten gal took : 91 ms
[2024-06-01 15:20:40] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 15:20:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1006 places, 955 transitions and 2870 arcs took 12 ms.
Total runtime 2372245 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2024

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-45, 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 r500-smll-171649587500124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-45.tgz
mv HirschbergSinclair-PT-45 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 ;