fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r114-tall-174876422100123
Last Updated
June 24, 2025

About the Execution of ITS-Tools for HirschbergSinclair-PT-45

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 678743.00 0.00 0.00 FFFFTTFTFTTTTFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 616K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748785430353

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 13:43:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 13:43:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:43:51] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2025-06-01 13:43:51] [INFO ] Transformed 1138 places.
[2025-06-01 13:43:51] [INFO ] Transformed 1042 transitions.
[2025-06-01 13:43:51] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1096 transition count 1042
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 80 place count 1058 transition count 1004
Iterating global reduction 1 with 38 rules applied. Total rules applied 118 place count 1058 transition count 1004
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 154 place count 1022 transition count 968
Iterating global reduction 1 with 36 rules applied. Total rules applied 190 place count 1022 transition count 968
Applied a total of 190 rules in 325 ms. Remains 1022 /1138 variables (removed 116) and now considering 968/1042 (removed 74) transitions.
// Phase 1: matrix 968 rows 1022 cols
[2025-06-01 13:43:52] [INFO ] Computed 54 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:43:53] [INFO ] Implicit Places using invariants in 798 ms returned []
[2025-06-01 13:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:44:03] [INFO ] Implicit Places using invariants and state equation in 10142 ms returned []
Implicit Place search using SMT with State Equation took 10979 ms to find 0 implicit places.
Running 923 sub problems to find dead transitions.
[2025-06-01 13:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 974/1990 variables, and 6 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1022 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/974 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (OVERLAPS) 6/980 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s3 1)
(s5 1)
(s6 0)
(s7 1)
(s9 1)
(s11 1)
(s13 1)
(s15 1)
(s17 1)
(s19 1)
(s21 1)
(s23 1)
(s25 1)
(s27 1)
(s29 1)
(s31 1)
(s33 1)
(s35 1)
(s37 1)
(s39 1)
(s41 1)
(s42 0)
(s43 1)
(s45 1)
(s47 1)
(s49 1)
(s51 1)
(s53 1)
(s55 1)
(s57 1)
(s59 1)
(s61 1)
(s63 1)
(s65 1)
(s67 1)
(s69 1)
(s70 0)
(s71 1)
(s73 1)
(s75 1)
(s77 1)
(s79 1)
(s81 1)
(s83 1)
(s85 1)
(s87 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)timeout

(s672 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/1990 variables, and 9 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1022 constraints, PredecessorRefiner: 0/923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 1022/1138 places, 968/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71713 ms. Remains : 1022/1138 places, 968/1042 transitions.
Support contains 62 out of 1022 places after structural reductions.
[2025-06-01 13:45:04] [INFO ] Flatten gal took : 107 ms
[2025-06-01 13:45:04] [INFO ] Flatten gal took : 56 ms
[2025-06-01 13:45:04] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 61 out of 1022 places (down from 62) after GAL structural reductions.
RANDOM walk for 40000 steps (36 resets) in 1464 ms. (27 steps per ms) remains 10/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
[2025-06-01 13:45:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 900/918 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 6/924 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/924 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 8/932 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 9 (OVERLAPS) 968/1900 variables, 932/986 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1900 variables, 0/986 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 90/1990 variables, 90/1076 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1990 variables, 0/1076 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1990 variables, 0/1076 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1076 constraints, problems are : Problem set: 9 solved, 1 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 1022/1022 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 820/827 variables, 46/47 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/47 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/833 variables, 2/49 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/49 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 99/932 variables, 5/54 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 968/1900 variables, 932/986 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1900 variables, 1/987 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1900 variables, 0/987 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/1990 variables, 90/1077 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1990 variables, 0/1077 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1990 variables, 0/1077 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1990/1990 variables, and 1077 constraints, problems are : Problem set: 9 solved, 1 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 1022/1022 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2314ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 1022 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Graph (complete) has 1941 edges and 1022 vertex of which 975 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.3 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 476 rules applied. Total rules applied 477 place count 975 transition count 492
Reduce places removed 431 places and 0 transitions.
Graph (complete) has 939 edges and 544 vertex of which 155 are kept as prefixes of interest. Removing 389 places using SCC suffix rule.0 ms
Discarding 389 places :
Also discarding 171 output transitions
Drop transitions (Output transitions of discarded places.) removed 171 transitions
Iterating post reduction 1 with 432 rules applied. Total rules applied 909 place count 155 transition count 321
Drop transitions (Empty/Sink Transition effects.) removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 2 with 198 rules applied. Total rules applied 1107 place count 155 transition count 123
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1107 place count 155 transition count 121
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1111 place count 153 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1113 place count 151 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 1115 place count 151 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1117 place count 151 transition count 117
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 216 edges and 149 vertex of which 145 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 1120 place count 145 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1124 place count 145 transition count 113
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 1151 place count 118 transition count 86
Reduce places removed 26 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 6 with 94 rules applied. Total rules applied 1245 place count 92 transition count 18
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 7 with 68 rules applied. Total rules applied 1313 place count 24 transition count 18
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1313 place count 24 transition count 7
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1339 place count 9 transition count 7
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 2 rules applied. Total rules applied 1341 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1343 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1343 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1345 place count 6 transition count 4
Applied a total of 1345 rules in 48 ms. Remains 6 /1022 variables (removed 1016) and now considering 4/968 (removed 964) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 6/1022 places, 4/968 transitions.
RANDOM walk for 108 steps (20 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-45-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1022 stabilizing places and 968 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1022 transition count 968
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1022 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Graph (complete) has 1941 edges and 1022 vertex of which 1019 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 430 transitions
Trivial Post-agglo rules discarded 430 transitions
Performed 430 trivial Post agglomeration. Transition count delta: 430
Iterating post reduction 0 with 430 rules applied. Total rules applied 431 place count 975 transition count 494
Reduce places removed 430 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 431 rules applied. Total rules applied 862 place count 545 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 863 place count 544 transition count 493
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 872 place count 535 transition count 484
Iterating global reduction 3 with 9 rules applied. Total rules applied 881 place count 535 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 883 place count 535 transition count 482
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 885 place count 533 transition count 482
Applied a total of 885 rules in 92 ms. Remains 533 /1022 variables (removed 489) and now considering 482/968 (removed 486) transitions.
// Phase 1: matrix 482 rows 533 cols
[2025-06-01 13:45:08] [INFO ] Computed 51 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:45:09] [INFO ] Implicit Places using invariants in 792 ms returned []
[2025-06-01 13:45:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:45:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 13:45:25] [INFO ] Implicit Places using invariants and state equation in 16816 ms returned []
Implicit Place search using SMT with State Equation took 17612 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:45:25] [INFO ] Redundant transitions in 29 ms returned []
Running 396 sub problems to find dead transitions.
[2025-06-01 13:45:25] [INFO ] Invariant cache hit.
[2025-06-01 13:45:25] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 3/450 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 400/850 variables, 450/501 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/850 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 850/1015 variables, and 509 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 450/533 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 3/450 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 400/850 variables, 450/501 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/850 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/1015 variables, and 897 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 450/533 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 388/396 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 533/1022 places, 482/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77829 ms. Remains : 533/1022 places, 482/968 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-01
Stuttering criterion allowed to conclude after 622 steps with 3 reset in 13 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-01 finished in 78114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1022 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1019 transition count 968
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 1010 transition count 959
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 1010 transition count 959
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1003 transition count 952
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1003 transition count 952
Applied a total of 35 rules in 101 ms. Remains 1003 /1022 variables (removed 19) and now considering 952/968 (removed 16) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2025-06-01 13:46:26] [INFO ] Computed 51 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:46:26] [INFO ] Implicit Places using invariants in 523 ms returned []
[2025-06-01 13:46:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:46:38] [INFO ] Implicit Places using invariants and state equation in 11769 ms returned []
Implicit Place search using SMT with State Equation took 12299 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 13:46:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 30026 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1022 places, 952/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72608 ms. Remains : 1003/1022 places, 952/968 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-05
Product exploration explored 100000 steps with 2278 reset in 681 ms.
Product exploration explored 100000 steps with 2272 reset in 689 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-05 finished in 74410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 4 out of 1022 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1019 transition count 968
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 1011 transition count 960
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 1011 transition count 960
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 1004 transition count 953
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 1004 transition count 953
Applied a total of 33 rules in 100 ms. Remains 1004 /1022 variables (removed 18) and now considering 953/968 (removed 15) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2025-06-01 13:47:40] [INFO ] Computed 51 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:47:41] [INFO ] Implicit Places using invariants in 532 ms returned []
[2025-06-01 13:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:47:52] [INFO ] Implicit Places using invariants and state equation in 11065 ms returned []
Implicit Place search using SMT with State Equation took 11602 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2025-06-01 13:47:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 30019 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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: ((s0 722)
(s1 1)
(s2 0)
(s3 723)
(s4 0)
(s5 723)
(s6 722)
(s7 1)
(s8 722)
(s9 1)
(s10 0)
(s11 1)
(s12 720)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 719)
(s19 1)
(s20 718)
(s21 1)
(s22 717)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 712)
(s31 1)
(s32 0)
(s33 713)
(s34 0)
(s35 1)
(s36 710)
(s37 1)
(s38 709)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 708)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 702)
(s56 0)
(s57 700)
(s58 0)
(s59 698)
(s60 0)
(s61 1)
(s62 0)
(s63 697)
(s64 0)
(s65 1)
(s66 695)
(s67 1)
(s68 694)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 692)
(s74 0)
(s75 1)
(s76 0)
(s77 689)
(s78 0)
(s79 1)
(s80 685)
(s81 1)
(s82 0)
(s83 684)
(s84 681)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 724)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 722)
(s116 1)
(s117 1)
(s118 721)
(s119 1)
(s120 1)
(s121 1)
(s122 721)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 716)
(s139 1)
(s140 1)
(s141 1)
(s142 714)
(s143 1)
(s144 1)
(s145 1)
(s146 713)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 712)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 709)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 706)
(s183 1)
(s184 707)
(s185 1)
(s186 705)
(s187 1)
(s188 1)
(s189 1)
(s190 704)
(s191 1)
(s192 1)
(s193 1)
(s194 703)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 697)
(s217 1)
(s218 697)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 694)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 690)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 688)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 680)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 timeout
1 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 30027 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 1004/1022 places, 953/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71899 ms. Remains : 1004/1022 places, 953/968 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-06 finished in 72116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X((p0||X(p1))))||F(p0)))))'
Support contains 4 out of 1022 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Graph (complete) has 1941 edges and 1022 vertex of which 1019 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Discarding 3 places :
Also discarding 0 output 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 428 place count 974 transition count 496
Reduce places removed 427 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 429 rules applied. Total rules applied 857 place count 547 transition count 494
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 859 place count 545 transition count 494
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 868 place count 536 transition count 485
Iterating global reduction 3 with 9 rules applied. Total rules applied 877 place count 536 transition count 485
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 879 place count 536 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 881 place count 534 transition count 483
Applied a total of 881 rules in 68 ms. Remains 534 /1022 variables (removed 488) and now considering 483/968 (removed 485) transitions.
// Phase 1: matrix 483 rows 534 cols
[2025-06-01 13:48:52] [INFO ] Computed 51 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:48:53] [INFO ] Implicit Places using invariants in 947 ms returned []
[2025-06-01 13:48:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:49:05] [INFO ] Implicit Places using invariants and state equation in 11613 ms returned []
Implicit Place search using SMT with State Equation took 12562 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:49:05] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2025-06-01 13:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 397/844 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 844/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 397/844 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 383/881 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 844/1017 variables, and 881 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 383/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1022 places, 483/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72708 ms. Remains : 534/1022 places, 483/968 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-07
Product exploration explored 100000 steps with 189 reset in 314 ms.
Product exploration explored 100000 steps with 189 reset in 356 ms.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 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-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-07 finished in 73678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(F(p0)) U ((p0 U p1)||p0))))'
Support contains 4 out of 1022 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Graph (complete) has 1941 edges and 1022 vertex of which 1019 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 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 428 place count 975 transition count 497
Reduce places removed 427 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 430 rules applied. Total rules applied 858 place count 548 transition count 494
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 861 place count 545 transition count 494
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 869 place count 537 transition count 486
Iterating global reduction 3 with 8 rules applied. Total rules applied 877 place count 537 transition count 486
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 879 place count 537 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 881 place count 535 transition count 484
Applied a total of 881 rules in 60 ms. Remains 535 /1022 variables (removed 487) and now considering 484/968 (removed 484) transitions.
// Phase 1: matrix 484 rows 535 cols
[2025-06-01 13:50:06] [INFO ] Computed 51 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:50:07] [INFO ] Implicit Places using invariants in 775 ms returned []
[2025-06-01 13:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:50:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 13:50:26] [INFO ] Implicit Places using invariants and state equation in 18690 ms returned []
Implicit Place search using SMT with State Equation took 19472 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:50:26] [INFO ] Redundant transitions in 3 ms returned []
Running 398 sub problems to find dead transitions.
[2025-06-01 13:50:26] [INFO ] Invariant cache hit.
[2025-06-01 13:50:26] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 3/452 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 401/853 variables, 452/503 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/853 variables, 10/513 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 853/1019 variables, and 513 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 452/535 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 3/452 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 401/853 variables, 452/503 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/853 variables, 10/513 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 853/1019 variables, and 911 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 452/535 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 535/1022 places, 484/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79624 ms. Remains : 535/1022 places, 484/968 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR p1 p0), p0]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-08
Stuttering criterion allowed to conclude after 523 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-08 finished in 79737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(p1 U X(p2)))) U X(p3)))'
Support contains 8 out of 1022 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1021 transition count 968
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 1014 transition count 961
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 1014 transition count 961
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 1009 transition count 956
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 1009 transition count 956
Applied a total of 25 rules in 144 ms. Remains 1009 /1022 variables (removed 13) and now considering 956/968 (removed 12) transitions.
// Phase 1: matrix 956 rows 1009 cols
[2025-06-01 13:51:26] [INFO ] Computed 53 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:51:26] [INFO ] Implicit Places using invariants in 508 ms returned []
[2025-06-01 13:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:51:37] [INFO ] Implicit Places using invariants and state equation in 10973 ms returned []
Implicit Place search using SMT with State Equation took 11485 ms to find 0 implicit places.
Running 911 sub problems to find dead transitions.
[2025-06-01 13:51:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/1965 variables, and 6 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 911/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 911 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/962 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 2 (OVERLAPS) 4/966 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/1965 variables, and 8 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 911 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1022 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71824 ms. Remains : 1009/1022 places, 956/968 transitions.
Stuttering acceptance computed with spot in 404 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 466 ms.
Product exploration explored 100000 steps with 50000 reset in 518 ms.
Computed a total of 1009 stabilizing places and 956 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1009 transition count 956
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 36 factoid took 19 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-11 finished in 73549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 1022 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Graph (complete) has 1941 edges and 1022 vertex of which 1019 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output 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 428 place count 974 transition count 496
Reduce places removed 427 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 429 rules applied. Total rules applied 857 place count 547 transition count 494
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 859 place count 545 transition count 494
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 868 place count 536 transition count 485
Iterating global reduction 3 with 9 rules applied. Total rules applied 877 place count 536 transition count 485
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 879 place count 536 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 881 place count 534 transition count 483
Applied a total of 881 rules in 63 ms. Remains 534 /1022 variables (removed 488) and now considering 483/968 (removed 485) transitions.
// Phase 1: matrix 483 rows 534 cols
[2025-06-01 13:52:39] [INFO ] Computed 51 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:52:40] [INFO ] Implicit Places using invariants in 792 ms returned []
[2025-06-01 13:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:52:52] [INFO ] Implicit Places using invariants and state equation in 12165 ms returned []
Implicit Place search using SMT with State Equation took 12960 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:52:52] [INFO ] Redundant transitions in 3 ms returned []
Running 394 sub problems to find dead transitions.
[2025-06-01 13:52:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1022 places, 483/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73104 ms. Remains : 534/1022 places, 483/968 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-12
Product exploration explored 100000 steps with 189 reset in 278 ms.
Product exploration explored 100000 steps with 189 reset in 305 ms.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40001 steps (72 resets) in 361 ms. (110 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
[2025-06-01 13:53:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/405 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/447 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/405 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/447 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 843/1017 variables, and 498 constraints, problems are : Problem set: 1 solved, 0 unsolved in 244 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-12 finished in 75079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 1022 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1022/1022 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1020 transition count 968
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 1013 transition count 961
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 1013 transition count 961
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 1008 transition count 956
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 1008 transition count 956
Applied a total of 26 rules in 133 ms. Remains 1008 /1022 variables (removed 14) and now considering 956/968 (removed 12) transitions.
// Phase 1: matrix 956 rows 1008 cols
[2025-06-01 13:53:55] [INFO ] Computed 52 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:53:55] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-06-01 13:53:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:54:07] [INFO ] Implicit Places using invariants and state equation in 11697 ms returned []
Implicit Place search using SMT with State Equation took 12199 ms to find 0 implicit places.
Running 911 sub problems to find dead transitions.
[2025-06-01 13:54:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/1964 variables, and 6 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 911/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 911 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/962 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 2 (OVERLAPS) 2/964 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 964/1964 variables, and 7 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 0/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 911 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 1008/1022 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72539 ms. Remains : 1008/1022 places, 956/968 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Computed a total of 1008 stabilizing places and 956 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1008 transition count 956
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-14 finished in 73866 ms.
All properties solved by simple procedures.
Total runtime 677018 ms.

BK_STOP 1748786109096

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-45, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422100123"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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