Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600044.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 StigmergyCommit-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 627K May 29 14:33 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 StigmergyCommit-PT-04b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749061103109

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 18:18:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 18:18:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 18:18:26] [INFO ] Load time of PNML (sax parser for PT used): 461 ms
[2025-06-04 18:18:26] [INFO ] Transformed 1534 places.
[2025-06-04 18:18:26] [INFO ] Transformed 2136 transitions.
[2025-06-04 18:18:26] [INFO ] Found NUPN structural information;
[2025-06-04 18:18:26] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 730 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-04b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 1534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 119 place count 1415 transition count 2017
Iterating global reduction 0 with 119 rules applied. Total rules applied 238 place count 1415 transition count 2017
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 310 place count 1343 transition count 1945
Iterating global reduction 0 with 72 rules applied. Total rules applied 382 place count 1343 transition count 1945
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 422 place count 1303 transition count 1905
Iterating global reduction 0 with 40 rules applied. Total rules applied 462 place count 1303 transition count 1905
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 496 place count 1269 transition count 1871
Iterating global reduction 0 with 34 rules applied. Total rules applied 530 place count 1269 transition count 1871
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 559 place count 1240 transition count 1842
Iterating global reduction 0 with 29 rules applied. Total rules applied 588 place count 1240 transition count 1842
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 616 place count 1212 transition count 1814
Iterating global reduction 0 with 28 rules applied. Total rules applied 644 place count 1212 transition count 1814
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 672 place count 1184 transition count 1786
Iterating global reduction 0 with 28 rules applied. Total rules applied 700 place count 1184 transition count 1786
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 727 place count 1157 transition count 1759
Iterating global reduction 0 with 27 rules applied. Total rules applied 754 place count 1157 transition count 1759
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 778 place count 1133 transition count 1735
Iterating global reduction 0 with 24 rules applied. Total rules applied 802 place count 1133 transition count 1735
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 821 place count 1114 transition count 1716
Iterating global reduction 0 with 19 rules applied. Total rules applied 840 place count 1114 transition count 1716
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 843 place count 1114 transition count 1713
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 850 place count 1107 transition count 1706
Iterating global reduction 1 with 7 rules applied. Total rules applied 857 place count 1107 transition count 1706
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 863 place count 1101 transition count 1700
Iterating global reduction 1 with 6 rules applied. Total rules applied 869 place count 1101 transition count 1700
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 871 place count 1099 transition count 1698
Iterating global reduction 1 with 2 rules applied. Total rules applied 873 place count 1099 transition count 1698
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 875 place count 1097 transition count 1696
Iterating global reduction 1 with 2 rules applied. Total rules applied 877 place count 1097 transition count 1696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 879 place count 1095 transition count 1694
Iterating global reduction 1 with 2 rules applied. Total rules applied 881 place count 1095 transition count 1694
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 883 place count 1093 transition count 1692
Iterating global reduction 1 with 2 rules applied. Total rules applied 885 place count 1093 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 886 place count 1092 transition count 1691
Iterating global reduction 1 with 1 rules applied. Total rules applied 887 place count 1092 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 888 place count 1091 transition count 1690
Iterating global reduction 1 with 1 rules applied. Total rules applied 889 place count 1091 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 890 place count 1090 transition count 1689
Iterating global reduction 1 with 1 rules applied. Total rules applied 891 place count 1090 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 892 place count 1089 transition count 1688
Iterating global reduction 1 with 1 rules applied. Total rules applied 893 place count 1089 transition count 1688
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 894 place count 1088 transition count 1687
Iterating global reduction 1 with 1 rules applied. Total rules applied 895 place count 1088 transition count 1687
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 896 place count 1087 transition count 1686
Iterating global reduction 1 with 1 rules applied. Total rules applied 897 place count 1087 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 898 place count 1087 transition count 1685
Applied a total of 898 rules in 2508 ms. Remains 1087 /1534 variables (removed 447) and now considering 1685/2136 (removed 451) transitions.
// Phase 1: matrix 1685 rows 1087 cols
[2025-06-04 18:18:29] [INFO ] Computed 6 invariants in 61 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:18:30] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2025-06-04 18:18:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:18:32] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 3404 ms to find 0 implicit places.
Running 1684 sub problems to find dead transitions.
[2025-06-04 18:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1086/2772 variables, and 0 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30159 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1087 constraints, PredecessorRefiner: 1684/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1684 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1086/2772 variables, and 0 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1087 constraints, PredecessorRefiner: 0/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62888ms problems are : Problem set: 0 solved, 1684 unsolved
Search for dead transitions found 0 dead transitions in 62946ms
Starting structural reductions in LTL mode, iteration 1 : 1087/1534 places, 1685/2136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68911 ms. Remains : 1087/1534 places, 1685/2136 transitions.
Support contains 66 out of 1087 places after structural reductions.
[2025-06-04 18:19:36] [INFO ] Flatten gal took : 366 ms
[2025-06-04 18:19:36] [INFO ] Flatten gal took : 144 ms
[2025-06-04 18:19:37] [INFO ] Input system was already deterministic with 1685 transitions.
Support contains 62 out of 1087 places (down from 66) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 43 to 42
RANDOM walk for 40000 steps (420 resets) in 2432 ms. (16 steps per ms) remains 28/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
[2025-06-04 18:19:38] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1037/1087 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1087 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1685/2772 variables, 1087/1093 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2772/2772 variables, and 1093 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1087/1087 constraints, PredecessorRefiner: 28/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1037/1087 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:19:45] [INFO ] Deduced a trap composed of 307 places in 1213 ms of which 279 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:19:47] [INFO ] Deduced a trap composed of 316 places in 863 ms of which 54 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1087 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1087/2772 variables, and 8 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/1087 constraints, PredecessorRefiner: 1/27 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10139ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 1087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Graph (trivial) has 980 edges and 1087 vertex of which 86 / 1087 are part of one of the 15 SCC in 11 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 1707 edges and 1016 vertex of which 1011 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.18 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 680 transitions
Trivial Post-agglo rules discarded 680 transitions
Performed 680 trivial Post agglomeration. Transition count delta: 680
Iterating post reduction 0 with 684 rules applied. Total rules applied 686 place count 1011 transition count 905
Reduce places removed 680 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 692 rules applied. Total rules applied 1378 place count 331 transition count 893
Reduce places removed 4 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 40 rules applied. Total rules applied 1418 place count 327 transition count 857
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 1454 place count 291 transition count 857
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 1454 place count 291 transition count 798
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1572 place count 232 transition count 798
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1646 place count 195 transition count 761
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1655 place count 195 transition count 752
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1672 place count 178 transition count 726
Iterating global reduction 5 with 17 rules applied. Total rules applied 1689 place count 178 transition count 726
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1692 place count 178 transition count 723
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1705 place count 165 transition count 710
Iterating global reduction 6 with 13 rules applied. Total rules applied 1718 place count 165 transition count 710
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1727 place count 156 transition count 701
Iterating global reduction 6 with 9 rules applied. Total rules applied 1736 place count 156 transition count 701
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1740 place count 156 transition count 697
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1752 place count 150 transition count 691
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1758 place count 147 transition count 706
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1759 place count 147 transition count 705
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1766 place count 147 transition count 698
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1773 place count 140 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1774 place count 140 transition count 697
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1775 place count 140 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1776 place count 139 transition count 696
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 1786 place count 139 transition count 696
Applied a total of 1786 rules in 542 ms. Remains 139 /1087 variables (removed 948) and now considering 696/1685 (removed 989) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 139/1087 places, 696/1685 transitions.
RANDOM walk for 40000 steps (2355 resets) in 698 ms. (57 steps per ms) remains 23/28 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (34 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (37 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
// Phase 1: matrix 696 rows 139 cols
[2025-06-04 18:19:49] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 80/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 688/808 variables, 120/125 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 27/835 variables, 19/144 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/835 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 144 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 23/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 80/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 688/808 variables, 120/125 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 27/835 variables, 19/152 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/835 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 166 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 23/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6710ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 5 properties in 451 ms.
Support contains 33 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 696/696 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 139 transition count 687
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 131 transition count 686
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 130 transition count 686
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 130 transition count 685
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 129 transition count 685
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 24 place count 126 transition count 682
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 126 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 126 transition count 681
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 44 place count 118 transition count 673
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 118 transition count 672
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 48 place count 115 transition count 669
Iterating global reduction 5 with 3 rules applied. Total rules applied 51 place count 115 transition count 669
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 59 place count 115 transition count 661
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 60 place count 114 transition count 660
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 114 transition count 660
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 62 place count 114 transition count 659
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 66 place count 114 transition count 655
Free-agglomeration rule applied 39 times.
Iterating global reduction 7 with 39 rules applied. Total rules applied 105 place count 114 transition count 616
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 7 with 39 rules applied. Total rules applied 144 place count 75 transition count 616
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 149 place count 70 transition count 611
Iterating global reduction 8 with 5 rules applied. Total rules applied 154 place count 70 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 184 place count 70 transition count 581
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 187 place count 70 transition count 581
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 189 place count 70 transition count 579
Applied a total of 189 rules in 394 ms. Remains 70 /139 variables (removed 69) and now considering 579/696 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 70/139 places, 579/696 transitions.
RANDOM walk for 40000 steps (2522 resets) in 2266 ms. (17 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (362 resets) in 78 ms. (506 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (366 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
// Phase 1: matrix 579 rows 70 cols
[2025-06-04 18:19:57] [INFO ] Computed 6 invariants in 4 ms
[2025-06-04 18:19:57] [INFO ] State equation strengthened by 335 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 579/649 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 335/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/649 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 335/335 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:19:58] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:19:58] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 579/649 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 335/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/649 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 335/335 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1770ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 17 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
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) U X(((F(p1) U p2)&&X(p1)))))'
Support contains 3 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1075 transition count 1673
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1075 transition count 1673
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1067 transition count 1665
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1067 transition count 1665
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1060 transition count 1658
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1060 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 1053 transition count 1651
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 1053 transition count 1651
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 1046 transition count 1644
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 1046 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 1039 transition count 1637
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 1039 transition count 1637
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 1032 transition count 1630
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 1032 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 117 place count 1025 transition count 1623
Iterating global reduction 0 with 7 rules applied. Total rules applied 124 place count 1025 transition count 1623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 1025 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 129 place count 1021 transition count 1618
Iterating global reduction 1 with 4 rules applied. Total rules applied 133 place count 1021 transition count 1618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 134 place count 1021 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 1018 transition count 1614
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 1018 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 1015 transition count 1611
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 1015 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 1012 transition count 1608
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 1012 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 1009 transition count 1605
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 1009 transition count 1605
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 1006 transition count 1602
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 1006 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 167 place count 1003 transition count 1599
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 1003 transition count 1599
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 173 place count 1000 transition count 1596
Iterating global reduction 2 with 3 rules applied. Total rules applied 176 place count 1000 transition count 1596
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 997 transition count 1593
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 997 transition count 1593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 183 place count 997 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 995 transition count 1590
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 995 transition count 1590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 995 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 189 place count 994 transition count 1588
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 994 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 191 place count 993 transition count 1587
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 993 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 992 transition count 1586
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 992 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 991 transition count 1585
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 991 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 991 transition count 1584
Applied a total of 197 rules in 1483 ms. Remains 991 /1087 variables (removed 96) and now considering 1584/1685 (removed 101) transitions.
// Phase 1: matrix 1584 rows 991 cols
[2025-06-04 18:20:01] [INFO ] Computed 6 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:20:02] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2025-06-04 18:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:20:05] [INFO ] Implicit Places using invariants and state equation in 2444 ms returned []
Implicit Place search using SMT with State Equation took 3515 ms to find 0 implicit places.
Running 1583 sub problems to find dead transitions.
[2025-06-04 18:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 990/2575 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 1583/1583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1583 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2575 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 0/1583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62145ms problems are : Problem set: 0 solved, 1583 unsolved
Search for dead transitions found 0 dead transitions in 62153ms
Starting structural reductions in LTL mode, iteration 1 : 991/1087 places, 1584/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67161 ms. Remains : 991/1087 places, 1584/1685 transitions.
Stuttering acceptance computed with spot in 851 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2), true, (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-00
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 6 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-00 finished in 68151 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((G(p0) U (p1 U p2))) U (!p0||X((G(!p3) U (!p0&&G(!p3)))))))'
Support contains 15 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1073 transition count 1671
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1073 transition count 1671
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 1064 transition count 1662
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 1064 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 1056 transition count 1654
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1056 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 1048 transition count 1646
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 1048 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 1040 transition count 1638
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 1040 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 1032 transition count 1630
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 1032 transition count 1630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 1032 transition count 1629
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 1025 transition count 1622
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 1025 transition count 1622
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 1018 transition count 1615
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 1018 transition count 1615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 1018 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 1014 transition count 1610
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 1014 transition count 1610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 1014 transition count 1609
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 1011 transition count 1606
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 1011 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 1008 transition count 1603
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 1008 transition count 1603
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 1005 transition count 1600
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 1005 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 1002 transition count 1597
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 1002 transition count 1597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 999 transition count 1594
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 999 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 996 transition count 1591
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 996 transition count 1591
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 993 transition count 1588
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 993 transition count 1588
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 990 transition count 1585
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 990 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 990 transition count 1584
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 988 transition count 1582
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 988 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 987 transition count 1580
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 986 transition count 1579
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 985 transition count 1578
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 984 transition count 1577
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 984 transition count 1576
Applied a total of 212 rules in 1579 ms. Remains 984 /1087 variables (removed 103) and now considering 1576/1685 (removed 109) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2025-06-04 18:21:10] [INFO ] Computed 6 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:21:11] [INFO ] Implicit Places using invariants in 914 ms returned []
[2025-06-04 18:21:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:21:12] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2025-06-04 18:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 983/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1575 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/984 constraints, PredecessorRefiner: 1575/1575 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1575 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 983/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1575 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/984 constraints, PredecessorRefiner: 0/1575 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62012ms problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 62020ms
Starting structural reductions in LTL mode, iteration 1 : 984/1087 places, 1576/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66392 ms. Remains : 984/1087 places, 1576/1685 transitions.
Stuttering acceptance computed with spot in 470 ms :[p0, (AND (NOT p2) p3), true, (OR p0 (AND (NOT p2) p3)), (NOT p2), (OR p0 p3), (OR (NOT p2) p0), p3]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-01
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-01 finished in 66922 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(p0)))'
Support contains 1 out of 1087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Graph (trivial) has 1081 edges and 1087 vertex of which 86 / 1087 are part of one of the 15 SCC in 6 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 758 transitions
Trivial Post-agglo rules discarded 758 transitions
Performed 758 trivial Post agglomeration. Transition count delta: 758
Iterating post reduction 0 with 758 rules applied. Total rules applied 759 place count 1015 transition count 845
Reduce places removed 758 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 773 rules applied. Total rules applied 1532 place count 257 transition count 830
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1537 place count 252 transition count 830
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1537 place count 252 transition count 774
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1649 place count 196 transition count 774
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1660 place count 185 transition count 762
Iterating global reduction 3 with 11 rules applied. Total rules applied 1671 place count 185 transition count 762
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1671 place count 185 transition count 759
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1677 place count 182 transition count 759
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1682 place count 177 transition count 673
Iterating global reduction 3 with 5 rules applied. Total rules applied 1687 place count 177 transition count 673
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1689 place count 177 transition count 671
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1690 place count 176 transition count 669
Iterating global reduction 4 with 1 rules applied. Total rules applied 1691 place count 176 transition count 669
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1765 place count 139 transition count 630
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 1793 place count 111 transition count 266
Iterating global reduction 4 with 28 rules applied. Total rules applied 1821 place count 111 transition count 266
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1834 place count 111 transition count 253
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1851 place count 94 transition count 232
Iterating global reduction 5 with 17 rules applied. Total rules applied 1868 place count 94 transition count 232
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1885 place count 77 transition count 211
Iterating global reduction 5 with 17 rules applied. Total rules applied 1902 place count 77 transition count 211
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1910 place count 77 transition count 203
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1928 place count 68 transition count 210
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1929 place count 67 transition count 200
Iterating global reduction 6 with 1 rules applied. Total rules applied 1930 place count 67 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1931 place count 67 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1936 place count 67 transition count 194
Applied a total of 1936 rules in 239 ms. Remains 67 /1087 variables (removed 1020) and now considering 194/1685 (removed 1491) transitions.
[2025-06-04 18:22:15] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
// Phase 1: matrix 188 rows 67 cols
[2025-06-04 18:22:15] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:22:15] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-04 18:22:15] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2025-06-04 18:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:22:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 18:22:16] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:22:16] [INFO ] Redundant transitions in 14 ms returned []
Running 177 sub problems to find dead transitions.
[2025-06-04 18:22:16] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2025-06-04 18:22:16] [INFO ] Invariant cache hit.
[2025-06-04 18:22:16] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:18] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:18] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:18] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:18] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:19] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:19] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:19] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:19] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:19] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:20] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:20] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:20] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:20] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:20] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:20] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:20] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:21] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:21] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:21] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:21] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:22] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:23] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:24] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:24] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:25] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:25] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 187/254 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 1/255 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (OVERLAPS) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 126 constraints, problems are : Problem set: 0 solved, 177 unsolved in 25143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 187/254 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 177/302 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:22:49] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 1/255 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 255/255 variables, and 304 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55304ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 55306ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/1087 places, 194/1685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55944 ms. Remains : 67/1087 places, 194/1685 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-02
Product exploration explored 100000 steps with 1994 reset in 280 ms.
Product exploration explored 100000 steps with 7941 reset in 330 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4634 resets) in 522 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (485 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 536951 steps, run visited all 1 properties in 966 ms. (steps per millisecond=555 )
Probabilistic random walk after 536951 steps, saw 101055 distinct states, run finished after 971 ms. (steps per millisecond=552 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 194/194 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-06-04 18:23:13] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2025-06-04 18:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:23:13] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-04 18:23:13] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2025-06-04 18:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:23:13] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 18:23:14] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:23:14] [INFO ] Redundant transitions in 18 ms returned []
Running 177 sub problems to find dead transitions.
[2025-06-04 18:23:14] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2025-06-04 18:23:14] [INFO ] Invariant cache hit.
[2025-06-04 18:23:14] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:16] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:16] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:16] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:16] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:17] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:17] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:17] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:17] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:17] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:17] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:18] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:18] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:18] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:18] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:18] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:18] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:18] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:19] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:19] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:19] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:20] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:21] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:21] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:21] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:22] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:23] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 187/254 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 1/255 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (OVERLAPS) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 126 constraints, problems are : Problem set: 0 solved, 177 unsolved in 25886 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 187/254 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 177/302 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:23:49] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 177 unsolved
SMT process timed out in 56011ms, After SMT, problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 56013ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56417 ms. Remains : 67/67 places, 194/194 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4577 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (479 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 536951 steps, run visited all 1 properties in 767 ms. (steps per millisecond=700 )
Probabilistic random walk after 536951 steps, saw 101055 distinct states, run finished after 768 ms. (steps per millisecond=699 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11539 reset in 166 ms.
Product exploration explored 100000 steps with 6270 reset in 333 ms.
Built C files in :
/tmp/ltsmin13960850064736292177
[2025-06-04 18:24:11] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2025-06-04 18:24:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:24:11] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2025-06-04 18:24:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:24:11] [INFO ] Computing Do-Not-Accords matrix : 194 transitions.
[2025-06-04 18:24:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:24:11] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13960850064736292177
Running compilation step : cd /tmp/ltsmin13960850064736292177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1054 ms.
Running link step : cd /tmp/ltsmin13960850064736292177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin13960850064736292177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1096301909635156383.hoa' '--buchi-type=spotba'
LTSmin run took 425 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-04b-LTLFireability-02 finished in 118142 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((p0 U p1))))'
Support contains 10 out of 1087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Graph (trivial) has 1071 edges and 1087 vertex of which 86 / 1087 are part of one of the 15 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 749 transitions
Trivial Post-agglo rules discarded 749 transitions
Performed 749 trivial Post agglomeration. Transition count delta: 749
Iterating post reduction 0 with 749 rules applied. Total rules applied 750 place count 1015 transition count 854
Reduce places removed 749 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 764 rules applied. Total rules applied 1514 place count 266 transition count 839
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1521 place count 261 transition count 837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1523 place count 259 transition count 837
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1523 place count 259 transition count 782
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1633 place count 204 transition count 782
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1644 place count 193 transition count 770
Iterating global reduction 4 with 11 rules applied. Total rules applied 1655 place count 193 transition count 770
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1655 place count 193 transition count 767
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1661 place count 190 transition count 767
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1664 place count 187 transition count 763
Iterating global reduction 4 with 3 rules applied. Total rules applied 1667 place count 187 transition count 763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1668 place count 187 transition count 762
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1669 place count 186 transition count 760
Iterating global reduction 5 with 1 rules applied. Total rules applied 1670 place count 186 transition count 760
Performed 37 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1744 place count 149 transition count 720
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1768 place count 125 transition count 486
Iterating global reduction 5 with 24 rules applied. Total rules applied 1792 place count 125 transition count 486
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1800 place count 125 transition count 478
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1817 place count 108 transition count 457
Iterating global reduction 6 with 17 rules applied. Total rules applied 1834 place count 108 transition count 457
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1851 place count 91 transition count 436
Iterating global reduction 6 with 17 rules applied. Total rules applied 1868 place count 91 transition count 436
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1876 place count 91 transition count 428
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1894 place count 82 transition count 435
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1895 place count 81 transition count 425
Iterating global reduction 7 with 1 rules applied. Total rules applied 1896 place count 81 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1897 place count 81 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1902 place count 81 transition count 419
Applied a total of 1902 rules in 176 ms. Remains 81 /1087 variables (removed 1006) and now considering 419/1685 (removed 1266) transitions.
[2025-06-04 18:24:13] [INFO ] Flow matrix only has 413 transitions (discarded 6 similar events)
// Phase 1: matrix 413 rows 81 cols
[2025-06-04 18:24:13] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:24:13] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-04 18:24:13] [INFO ] Flow matrix only has 413 transitions (discarded 6 similar events)
[2025-06-04 18:24:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:24:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 18:24:14] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:24:14] [INFO ] Redundant transitions in 14 ms returned []
Running 402 sub problems to find dead transitions.
[2025-06-04 18:24:14] [INFO ] Flow matrix only has 413 transitions (discarded 6 similar events)
[2025-06-04 18:24:14] [INFO ] Invariant cache hit.
[2025-06-04 18:24:14] [INFO ] State equation strengthened by 31 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 2/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:20] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:20] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:20] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:21] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:21] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:23] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:23] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:23] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:23] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:24] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:24] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:25] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:25] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:25] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:25] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:28] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:30] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:32] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:32] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:32] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (OVERLAPS) 412/493 variables, 81/103 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 30/133 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:24:43] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/494 variables, and 134 constraints, problems are : Problem set: 0 solved, 402 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 402/376 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 402 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 2/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (OVERLAPS) 412/493 variables, 81/104 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 376/510 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/494 variables, and 510 constraints, problems are : Problem set: 0 solved, 402 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 402/376 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60925ms problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 60928ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/1087 places, 419/1685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61857 ms. Remains : 81/1087 places, 419/1685 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-03
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-03 finished in 61997 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(X(p0)))&&G((p1||(p2 U (p3||G(p2)))))))'
Support contains 3 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1074 transition count 1672
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1074 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1065 transition count 1663
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1065 transition count 1663
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 1057 transition count 1655
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 1057 transition count 1655
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1049 transition count 1647
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1049 transition count 1647
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 1041 transition count 1639
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 1041 transition count 1639
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 1033 transition count 1631
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 1033 transition count 1631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 1033 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 116 place count 1026 transition count 1623
Iterating global reduction 1 with 7 rules applied. Total rules applied 123 place count 1026 transition count 1623
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 130 place count 1019 transition count 1616
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 1019 transition count 1616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 1019 transition count 1615
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 1016 transition count 1612
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 1016 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 1013 transition count 1609
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 1013 transition count 1609
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 1010 transition count 1606
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 1010 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 1007 transition count 1603
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 1007 transition count 1603
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 1004 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 1004 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 171 place count 1001 transition count 1597
Iterating global reduction 2 with 3 rules applied. Total rules applied 174 place count 1001 transition count 1597
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 998 transition count 1594
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 998 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 995 transition count 1591
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 995 transition count 1591
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 189 place count 992 transition count 1588
Iterating global reduction 2 with 3 rules applied. Total rules applied 192 place count 992 transition count 1588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 992 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 990 transition count 1585
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 990 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 990 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 989 transition count 1583
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 989 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 988 transition count 1582
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 988 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 987 transition count 1581
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 987 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 205 place count 986 transition count 1580
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 986 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 207 place count 986 transition count 1579
Applied a total of 207 rules in 1374 ms. Remains 986 /1087 variables (removed 101) and now considering 1579/1685 (removed 106) transitions.
// Phase 1: matrix 1579 rows 986 cols
[2025-06-04 18:25:16] [INFO ] Computed 6 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:25:17] [INFO ] Implicit Places using invariants in 814 ms returned []
[2025-06-04 18:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:25:19] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
Running 1578 sub problems to find dead transitions.
[2025-06-04 18:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 985/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 1578/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 0/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61891ms problems are : Problem set: 0 solved, 1578 unsolved
Search for dead transitions found 0 dead transitions in 61898ms
Starting structural reductions in LTL mode, iteration 1 : 986/1087 places, 1579/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65827 ms. Remains : 986/1087 places, 1579/1685 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (NOT p0), (AND p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-04
Product exploration explored 100000 steps with 1988 reset in 422 ms.
Product exploration explored 100000 steps with 2028 reset in 440 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND p1 p3 p2 p0), (X p2), (X p3), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (OR p1 p3 p2)), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (OR p1 p3 p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 148 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (NOT p0), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (419 resets) in 190 ms. (209 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (77 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (77 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (75 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
[2025-06-04 18:26:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 583/586 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 400/986 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/986 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1579/2565 variables, 986/992 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2565 variables, 0/992 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2565 variables, 0/992 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2565/2565 variables, and 992 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1790 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 986/986 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 583/586 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:26] [INFO ] Deduced a trap composed of 292 places in 700 ms of which 243 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:26] [INFO ] Deduced a trap composed of 292 places in 730 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:27] [INFO ] Deduced a trap composed of 297 places in 711 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:28] [INFO ] Deduced a trap composed of 293 places in 623 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:28] [INFO ] Deduced a trap composed of 297 places in 537 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 400/986 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:30] [INFO ] Deduced a trap composed of 293 places in 853 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:30] [INFO ] Deduced a trap composed of 294 places in 839 ms of which 147 ms to minimize.
SMT process timed out in 7500ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 986 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 1579/1579 transitions.
Graph (trivial) has 980 edges and 986 vertex of which 85 / 986 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1584 edges and 916 vertex of which 911 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 691 rules applied. Total rules applied 693 place count 911 transition count 793
Reduce places removed 686 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 699 rules applied. Total rules applied 1392 place count 225 transition count 780
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1397 place count 221 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1398 place count 220 transition count 779
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1398 place count 220 transition count 723
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1510 place count 164 transition count 723
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1511 place count 164 transition count 722
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1583 place count 128 transition count 686
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1593 place count 128 transition count 676
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 1624 place count 97 transition count 224
Iterating global reduction 6 with 31 rules applied. Total rules applied 1655 place count 97 transition count 224
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1671 place count 97 transition count 208
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1685 place count 83 transition count 194
Iterating global reduction 7 with 14 rules applied. Total rules applied 1699 place count 83 transition count 194
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1709 place count 73 transition count 184
Iterating global reduction 7 with 10 rules applied. Total rules applied 1719 place count 73 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1724 place count 73 transition count 179
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1734 place count 68 transition count 174
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1740 place count 65 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1742 place count 65 transition count 180
Free-agglomeration rule applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1768 place count 65 transition count 154
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 35 rules applied. Total rules applied 1803 place count 39 transition count 145
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1808 place count 34 transition count 140
Iterating global reduction 9 with 5 rules applied. Total rules applied 1813 place count 34 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 9 with 34 rules applied. Total rules applied 1847 place count 34 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1851 place count 32 transition count 116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1852 place count 32 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1853 place count 31 transition count 115
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1858 place count 31 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1861 place count 31 transition count 112
Applied a total of 1861 rules in 85 ms. Remains 31 /986 variables (removed 955) and now considering 112/1579 (removed 1467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 31/986 places, 112/1579 transitions.
RANDOM walk for 590 steps (0 resets) in 8 ms. (65 steps per ms) remains 0/4 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p3 p2 p0), (X p2), (X p3), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (OR p1 p3 p2)), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (OR p1 p3 p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (G (OR (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p3)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2 p3)))
Knowledge based reduction with 18 factoid took 196 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04b-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04b-LTLFireability-04 finished in 75676 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(((X(p0) U p1)||p1)))'
Support contains 1 out of 1087 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Graph (trivial) has 1076 edges and 1087 vertex of which 86 / 1087 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 752 transitions
Trivial Post-agglo rules discarded 752 transitions
Performed 752 trivial Post agglomeration. Transition count delta: 752
Iterating post reduction 0 with 752 rules applied. Total rules applied 753 place count 1015 transition count 851
Reduce places removed 752 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 767 rules applied. Total rules applied 1520 place count 263 transition count 836
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1526 place count 258 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1527 place count 257 transition count 835
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1527 place count 257 transition count 779
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1639 place count 201 transition count 779
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1650 place count 190 transition count 767
Iterating global reduction 4 with 11 rules applied. Total rules applied 1661 place count 190 transition count 767
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1661 place count 190 transition count 764
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1667 place count 187 transition count 764
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1672 place count 182 transition count 678
Iterating global reduction 4 with 5 rules applied. Total rules applied 1677 place count 182 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1679 place count 182 transition count 676
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1680 place count 181 transition count 674
Iterating global reduction 5 with 1 rules applied. Total rules applied 1681 place count 181 transition count 674
Performed 37 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1755 place count 144 transition count 634
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1779 place count 120 transition count 400
Iterating global reduction 5 with 24 rules applied. Total rules applied 1803 place count 120 transition count 400
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1812 place count 120 transition count 391
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1829 place count 103 transition count 370
Iterating global reduction 6 with 17 rules applied. Total rules applied 1846 place count 103 transition count 370
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1863 place count 86 transition count 349
Iterating global reduction 6 with 17 rules applied. Total rules applied 1880 place count 86 transition count 349
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1888 place count 86 transition count 341
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1906 place count 77 transition count 348
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1907 place count 76 transition count 338
Iterating global reduction 7 with 1 rules applied. Total rules applied 1908 place count 76 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1909 place count 76 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1914 place count 76 transition count 332
Applied a total of 1914 rules in 113 ms. Remains 76 /1087 variables (removed 1011) and now considering 332/1685 (removed 1353) transitions.
[2025-06-04 18:26:31] [INFO ] Flow matrix only has 326 transitions (discarded 6 similar events)
// Phase 1: matrix 326 rows 76 cols
[2025-06-04 18:26:31] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:26:31] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-04 18:26:31] [INFO ] Flow matrix only has 326 transitions (discarded 6 similar events)
[2025-06-04 18:26:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:26:31] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 18:26:31] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:26:31] [INFO ] Redundant transitions in 6 ms returned []
Running 315 sub problems to find dead transitions.
[2025-06-04 18:26:31] [INFO ] Flow matrix only has 326 transitions (discarded 6 similar events)
[2025-06-04 18:26:31] [INFO ] Invariant cache hit.
[2025-06-04 18:26:31] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:35] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:35] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:36] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:36] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:36] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:37] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:37] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:38] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:38] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:38] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:39] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:41] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:41] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:42] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:43] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:43] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:46] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:46] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:48] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:26:49] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 11 (OVERLAPS) 325/401 variables, 76/98 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 315 unsolved
SMT process timed out in 30438ms, After SMT, problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 30438ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/1087 places, 332/1685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30987 ms. Remains : 76/1087 places, 332/1685 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-05 finished in 31050 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((p1 U X(p2)))&&p0))&&(p2 U X(p1))))'
Support contains 7 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1074 transition count 1672
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1074 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1066 transition count 1664
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1066 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1059 transition count 1657
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1059 transition count 1657
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1052 transition count 1650
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1052 transition count 1650
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 1045 transition count 1643
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 1045 transition count 1643
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 1038 transition count 1636
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 1038 transition count 1636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 1038 transition count 1635
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 1032 transition count 1629
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 1032 transition count 1629
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 1026 transition count 1623
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 1026 transition count 1623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 1026 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 1022 transition count 1618
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 1022 transition count 1618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 1022 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 136 place count 1019 transition count 1614
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 1019 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 1016 transition count 1611
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 1016 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 1013 transition count 1608
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 1013 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 1010 transition count 1605
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 1010 transition count 1605
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 1007 transition count 1602
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 1007 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 1004 transition count 1599
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 1004 transition count 1599
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 1001 transition count 1596
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 1001 transition count 1596
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 998 transition count 1593
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 998 transition count 1593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 998 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 996 transition count 1590
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 996 transition count 1590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 995 transition count 1588
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 994 transition count 1587
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 993 transition count 1586
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 992 transition count 1585
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 992 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 992 transition count 1584
Applied a total of 196 rules in 1466 ms. Remains 992 /1087 variables (removed 95) and now considering 1584/1685 (removed 101) transitions.
// Phase 1: matrix 1584 rows 992 cols
[2025-06-04 18:27:03] [INFO ] Computed 6 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:27:04] [INFO ] Implicit Places using invariants in 685 ms returned []
[2025-06-04 18:27:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:27:06] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
Running 1583 sub problems to find dead transitions.
[2025-06-04 18:27:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 991/2576 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 1583/1583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1583 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/2576 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 0/1583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61736ms problems are : Problem set: 0 solved, 1583 unsolved
Search for dead transitions found 0 dead transitions in 61740ms
Starting structural reductions in LTL mode, iteration 1 : 992/1087 places, 1584/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65665 ms. Remains : 992/1087 places, 1584/1685 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p1), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-06 finished in 66045 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((X((p1 U p2))||p0))))'
Support contains 5 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1076 transition count 1674
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1076 transition count 1674
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 1067 transition count 1665
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 1067 transition count 1665
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 1059 transition count 1657
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1059 transition count 1657
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1052 transition count 1650
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1052 transition count 1650
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 1045 transition count 1643
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 1045 transition count 1643
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 1038 transition count 1636
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 1038 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 1031 transition count 1629
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 1031 transition count 1629
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 1024 transition count 1622
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 1024 transition count 1622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 1024 transition count 1621
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 131 place count 1020 transition count 1617
Iterating global reduction 1 with 4 rules applied. Total rules applied 135 place count 1020 transition count 1617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 136 place count 1020 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 1017 transition count 1613
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 1017 transition count 1613
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 1014 transition count 1610
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 1014 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 1011 transition count 1607
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 1011 transition count 1607
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 1008 transition count 1604
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 1008 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 1005 transition count 1601
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 1005 transition count 1601
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 1002 transition count 1598
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 1002 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 999 transition count 1595
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 999 transition count 1595
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 996 transition count 1592
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 996 transition count 1592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 996 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 187 place count 994 transition count 1589
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 994 transition count 1589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 994 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 191 place count 993 transition count 1587
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 993 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 992 transition count 1586
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 992 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 991 transition count 1585
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 991 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 990 transition count 1584
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 990 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 990 transition count 1583
Applied a total of 199 rules in 1540 ms. Remains 990 /1087 variables (removed 97) and now considering 1583/1685 (removed 102) transitions.
// Phase 1: matrix 1583 rows 990 cols
[2025-06-04 18:28:09] [INFO ] Computed 6 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:28:10] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2025-06-04 18:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:28:13] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
Running 1582 sub problems to find dead transitions.
[2025-06-04 18:28:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 989/2573 variables, and 0 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/990 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/2573 variables, and 0 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/990 constraints, PredecessorRefiner: 0/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62068ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 62073ms
Starting structural reductions in LTL mode, iteration 1 : 990/1087 places, 1583/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66943 ms. Remains : 990/1087 places, 1583/1685 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 700 ms.
Product exploration explored 100000 steps with 33333 reset in 373 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04b-LTLFireability-07 finished in 68329 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(((G(p1)&&p0)||(F((F(p3)&&p2))&&F(p4)))))'
Support contains 8 out of 1087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Graph (trivial) has 1072 edges and 1087 vertex of which 86 / 1087 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 749 transitions
Trivial Post-agglo rules discarded 749 transitions
Performed 749 trivial Post agglomeration. Transition count delta: 749
Iterating post reduction 0 with 749 rules applied. Total rules applied 750 place count 1015 transition count 854
Reduce places removed 749 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 764 rules applied. Total rules applied 1514 place count 266 transition count 839
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1521 place count 261 transition count 837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1523 place count 259 transition count 837
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1523 place count 259 transition count 781
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1635 place count 203 transition count 781
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1646 place count 192 transition count 769
Iterating global reduction 4 with 11 rules applied. Total rules applied 1657 place count 192 transition count 769
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1657 place count 192 transition count 766
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1663 place count 189 transition count 766
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1667 place count 185 transition count 761
Iterating global reduction 4 with 4 rules applied. Total rules applied 1671 place count 185 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1672 place count 185 transition count 760
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1673 place count 184 transition count 758
Iterating global reduction 5 with 1 rules applied. Total rules applied 1674 place count 184 transition count 758
Performed 37 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1748 place count 147 transition count 718
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 1775 place count 120 transition count 313
Iterating global reduction 5 with 27 rules applied. Total rules applied 1802 place count 120 transition count 313
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1814 place count 120 transition count 301
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1831 place count 103 transition count 280
Iterating global reduction 6 with 17 rules applied. Total rules applied 1848 place count 103 transition count 280
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1864 place count 87 transition count 260
Iterating global reduction 6 with 16 rules applied. Total rules applied 1880 place count 87 transition count 260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1887 place count 87 transition count 253
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1905 place count 78 transition count 267
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1906 place count 77 transition count 257
Iterating global reduction 7 with 1 rules applied. Total rules applied 1907 place count 77 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1908 place count 77 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1913 place count 77 transition count 251
Applied a total of 1913 rules in 114 ms. Remains 77 /1087 variables (removed 1010) and now considering 251/1685 (removed 1434) transitions.
[2025-06-04 18:29:16] [INFO ] Flow matrix only has 245 transitions (discarded 6 similar events)
// Phase 1: matrix 245 rows 77 cols
[2025-06-04 18:29:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:29:16] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-04 18:29:16] [INFO ] Flow matrix only has 245 transitions (discarded 6 similar events)
[2025-06-04 18:29:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:29:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 18:29:17] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:29:17] [INFO ] Redundant transitions in 3 ms returned []
Running 226 sub problems to find dead transitions.
[2025-06-04 18:29:17] [INFO ] Flow matrix only has 245 transitions (discarded 6 similar events)
[2025-06-04 18:29:17] [INFO ] Invariant cache hit.
[2025-06-04 18:29:17] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:20] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:20] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:20] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:21] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:21] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:21] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:21] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:21] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:22] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:22] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:22] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:22] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:23] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:23] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:23] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:23] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:23] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:25] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:27] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:27] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 244/321 variables, 77/99 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:40] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:40] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:29:41] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/322 variables, and 133 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 244/321 variables, 77/102 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 226/358 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:30:06] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:30:06] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:30:07] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:30:07] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/322 variables, and 362 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1087 places, 251/1685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60871 ms. Remains : 77/1087 places, 251/1685 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p4), (NOT p3)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-08
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-08 finished in 61178 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(X((F((p0&&G(p1))) U X(p2))))))'
Support contains 7 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1075 transition count 1673
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1075 transition count 1673
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 1068 transition count 1666
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 1068 transition count 1666
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 1062 transition count 1660
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 1062 transition count 1660
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1056 transition count 1654
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1056 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1050 transition count 1648
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1050 transition count 1648
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 1044 transition count 1642
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 1044 transition count 1642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 1044 transition count 1641
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 1039 transition count 1636
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 1039 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1034 transition count 1631
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1034 transition count 1631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 1034 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 1031 transition count 1627
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 1031 transition count 1627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 1031 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 1029 transition count 1624
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 1029 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 1027 transition count 1622
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 1027 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 1025 transition count 1620
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 1025 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 1023 transition count 1618
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 1023 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 1021 transition count 1616
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 1021 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 1019 transition count 1614
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 1019 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 1017 transition count 1612
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 1017 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 1015 transition count 1610
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 1015 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 1013 transition count 1608
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 1013 transition count 1608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 1013 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 1012 transition count 1606
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 1012 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 1011 transition count 1605
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 1011 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 1010 transition count 1604
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 1010 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 1009 transition count 1603
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 1009 transition count 1603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 1009 transition count 1602
Applied a total of 161 rules in 2011 ms. Remains 1009 /1087 variables (removed 78) and now considering 1602/1685 (removed 83) transitions.
// Phase 1: matrix 1602 rows 1009 cols
[2025-06-04 18:30:19] [INFO ] Computed 6 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:30:20] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2025-06-04 18:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:30:23] [INFO ] Implicit Places using invariants and state equation in 2381 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
Running 1601 sub problems to find dead transitions.
[2025-06-04 18:30:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2611 variables, and 0 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1601/1601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2611 variables, and 0 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62485ms problems are : Problem set: 0 solved, 1601 unsolved
Search for dead transitions found 0 dead transitions in 62490ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1087 places, 1602/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68016 ms. Remains : 1009/1087 places, 1602/1685 transitions.
Stuttering acceptance computed with spot in 490 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-09
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-09 finished in 68552 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 X(X(!p1))))))'
Support contains 3 out of 1087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Graph (trivial) has 1077 edges and 1087 vertex of which 86 / 1087 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 753 transitions
Trivial Post-agglo rules discarded 753 transitions
Performed 753 trivial Post agglomeration. Transition count delta: 753
Iterating post reduction 0 with 753 rules applied. Total rules applied 754 place count 1015 transition count 850
Reduce places removed 753 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 768 rules applied. Total rules applied 1522 place count 262 transition count 835
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1528 place count 257 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1529 place count 256 transition count 834
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1529 place count 256 transition count 777
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1643 place count 199 transition count 777
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1653 place count 189 transition count 766
Iterating global reduction 4 with 10 rules applied. Total rules applied 1663 place count 189 transition count 766
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1663 place count 189 transition count 764
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1667 place count 187 transition count 764
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1672 place count 182 transition count 678
Iterating global reduction 4 with 5 rules applied. Total rules applied 1677 place count 182 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1679 place count 182 transition count 676
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1680 place count 181 transition count 674
Iterating global reduction 5 with 1 rules applied. Total rules applied 1681 place count 181 transition count 674
Performed 38 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 1757 place count 143 transition count 634
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 1784 place count 116 transition count 271
Iterating global reduction 5 with 27 rules applied. Total rules applied 1811 place count 116 transition count 271
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1823 place count 116 transition count 259
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1839 place count 100 transition count 239
Iterating global reduction 6 with 16 rules applied. Total rules applied 1855 place count 100 transition count 239
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1871 place count 84 transition count 219
Iterating global reduction 6 with 16 rules applied. Total rules applied 1887 place count 84 transition count 219
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1894 place count 84 transition count 212
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1912 place count 75 transition count 219
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1913 place count 74 transition count 209
Iterating global reduction 7 with 1 rules applied. Total rules applied 1914 place count 74 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1915 place count 74 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1920 place count 74 transition count 203
Applied a total of 1920 rules in 142 ms. Remains 74 /1087 variables (removed 1013) and now considering 203/1685 (removed 1482) transitions.
[2025-06-04 18:31:26] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
// Phase 1: matrix 197 rows 74 cols
[2025-06-04 18:31:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:31:26] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-04 18:31:26] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
[2025-06-04 18:31:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:31:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 18:31:27] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:31:27] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-06-04 18:31:27] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
[2025-06-04 18:31:27] [INFO ] Invariant cache hit.
[2025-06-04 18:31:27] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:29] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:29] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:29] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:29] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:29] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:30] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:30] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:30] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:30] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:30] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:30] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:31] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:31] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:31] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 196/270 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:35] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:31:42] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 123 constraints, problems are : Problem set: 0 solved, 186 unsolved in 29561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 196/270 variables, 74/92 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 186/308 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:05] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:15] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/271 variables, and 310 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59694ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 59695ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/1087 places, 203/1685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60345 ms. Remains : 74/1087 places, 203/1685 transitions.
Stuttering acceptance computed with spot in 374 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-10
Product exploration explored 100000 steps with 28670 reset in 650 ms.
Product exploration explored 100000 steps with 28564 reset in 538 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 337 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false, false]
RANDOM walk for 40000 steps (4458 resets) in 218 ms. (182 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (490 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (473 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
[2025-06-04 18:32:28] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
[2025-06-04 18:32:28] [INFO ] Invariant cache hit.
[2025-06-04 18:32:28] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:29] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:29] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:29] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 195/267 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 30/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/270 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/271 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:29] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/267 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/270 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/271 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/271 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1371ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 203/203 transitions.
Graph (complete) has 348 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 73 transition count 191
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 68 transition count 186
Free-agglomeration rule applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 50 place count 68 transition count 158
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 39 transition count 134
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 32 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 27 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 27 transition count 129
Performed 10 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 140 place count 17 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 164 place count 17 transition count 47
Performed 4 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 174 place count 11 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 186 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 10 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 190 place count 10 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 193 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 195 place count 8 transition count 9
Applied a total of 195 rules in 21 ms. Remains 8 /74 variables (removed 66) and now considering 9/203 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 8/74 places, 9/203 transitions.
RANDOM walk for 43 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false]
Stuttering acceptance computed with spot in 264 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 203/203 transitions.
Applied a total of 0 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2025-06-04 18:32:31] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
[2025-06-04 18:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:32:31] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-04 18:32:31] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
[2025-06-04 18:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:32:31] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 18:32:31] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:32:31] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-06-04 18:32:31] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
[2025-06-04 18:32:31] [INFO ] Invariant cache hit.
[2025-06-04 18:32:31] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:34] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:34] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:34] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:34] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:34] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:34] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:35] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:35] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:35] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:35] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:35] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:36] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:36] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:36] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 196/270 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:41] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:32:48] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 123 constraints, problems are : Problem set: 0 solved, 186 unsolved in 28955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 196/270 variables, 74/92 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 186/308 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:33:09] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:33:18] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/271 variables, and 310 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59130ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 59131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59638 ms. Remains : 74/74 places, 203/203 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false]
RANDOM walk for 40000 steps (4479 resets) in 188 ms. (211 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (473 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (469 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
[2025-06-04 18:33:31] [INFO ] Flow matrix only has 197 transitions (discarded 6 similar events)
[2025-06-04 18:33:31] [INFO ] Invariant cache hit.
[2025-06-04 18:33:31] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:33:31] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:33:31] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:33:31] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 195/267 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 30/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/270 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/271 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:33:32] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/267 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/270 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/271 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/271 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1369ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 203/203 transitions.
Graph (complete) has 348 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 73 transition count 191
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 68 transition count 186
Free-agglomeration rule applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 50 place count 68 transition count 158
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 39 transition count 134
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 32 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 27 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 27 transition count 129
Performed 10 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 140 place count 17 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 164 place count 17 transition count 47
Performed 4 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 174 place count 11 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 186 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 10 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 190 place count 10 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 193 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 195 place count 8 transition count 9
Applied a total of 195 rules in 21 ms. Remains 8 /74 variables (removed 66) and now considering 9/203 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 8/74 places, 9/203 transitions.
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false]
Stuttering acceptance computed with spot in 254 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false]
Stuttering acceptance computed with spot in 250 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, false]
Product exploration explored 100000 steps with 11231 reset in 345 ms.
Product exploration explored 100000 steps with 11246 reset in 407 ms.
Built C files in :
/tmp/ltsmin18312195986722118713
[2025-06-04 18:33:34] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2025-06-04 18:33:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:33:34] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2025-06-04 18:33:34] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:33:34] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2025-06-04 18:33:34] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:33:34] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18312195986722118713
Running compilation step : cd /tmp/ltsmin18312195986722118713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1137 ms.
Running link step : cd /tmp/ltsmin18312195986722118713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin18312195986722118713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3289332330098527275.hoa' '--buchi-type=spotba'
LTSmin run took 6935 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-04b-LTLFireability-10 finished in 136581 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(G(p0))||(p1&&G(p2))))))'
Support contains 6 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1074 transition count 1672
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1074 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1066 transition count 1664
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1066 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 1058 transition count 1656
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 1058 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 1050 transition count 1648
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 1050 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 1042 transition count 1640
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 1042 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 1034 transition count 1632
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 1034 transition count 1632
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 1034 transition count 1631
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 114 place count 1027 transition count 1624
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 1027 transition count 1624
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 128 place count 1020 transition count 1617
Iterating global reduction 1 with 7 rules applied. Total rules applied 135 place count 1020 transition count 1617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 136 place count 1020 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 140 place count 1016 transition count 1612
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 1016 transition count 1612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 1016 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 1013 transition count 1608
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 1013 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 1010 transition count 1605
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 1010 transition count 1605
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 1007 transition count 1602
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 1007 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 1004 transition count 1599
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 1004 transition count 1599
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 1001 transition count 1596
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 1001 transition count 1596
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 998 transition count 1593
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 998 transition count 1593
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 995 transition count 1590
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 995 transition count 1590
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 992 transition count 1587
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 992 transition count 1587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 992 transition count 1586
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 196 place count 990 transition count 1584
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 990 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 989 transition count 1582
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 988 transition count 1581
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 987 transition count 1580
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 986 transition count 1579
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 986 transition count 1579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 986 transition count 1578
Applied a total of 208 rules in 1287 ms. Remains 986 /1087 variables (removed 101) and now considering 1578/1685 (removed 107) transitions.
// Phase 1: matrix 1578 rows 986 cols
[2025-06-04 18:33:44] [INFO ] Computed 6 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:33:45] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-04 18:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:33:46] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
Running 1577 sub problems to find dead transitions.
[2025-06-04 18:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 1577/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 0/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62525ms problems are : Problem set: 0 solved, 1577 unsolved
Search for dead transitions found 0 dead transitions in 62529ms
Starting structural reductions in LTL mode, iteration 1 : 986/1087 places, 1578/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66237 ms. Remains : 986/1087 places, 1578/1685 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-11
Product exploration explored 100000 steps with 1037 reset in 267 ms.
Product exploration explored 100000 steps with 1053 reset in 276 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (423 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (75 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (77 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 306291 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 306291 steps, saw 62174 distinct states, run finished after 3006 ms. (steps per millisecond=101 ) properties seen :0
[2025-06-04 18:34:53] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 966/972 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/986 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/986 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1578/2564 variables, 986/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2564 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2564 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2564/2564 variables, and 992 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 986/986 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 966/972 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/986 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/986 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1578/2564 variables, 986/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2564 variables, 2/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2564 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2564 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2564/2564 variables, and 994 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3561 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 986/986 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5253ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 860 ms.
Support contains 6 out of 986 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 1578/1578 transitions.
Graph (trivial) has 978 edges and 986 vertex of which 85 / 986 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1583 edges and 916 vertex of which 911 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 689 rules applied. Total rules applied 691 place count 911 transition count 794
Reduce places removed 684 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 699 rules applied. Total rules applied 1390 place count 227 transition count 779
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1395 place count 222 transition count 779
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 1395 place count 222 transition count 724
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 1505 place count 167 transition count 724
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1579 place count 130 transition count 687
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1590 place count 130 transition count 676
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 1617 place count 103 transition count 316
Iterating global reduction 4 with 27 rules applied. Total rules applied 1644 place count 103 transition count 316
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1656 place count 103 transition count 304
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1671 place count 88 transition count 289
Iterating global reduction 5 with 15 rules applied. Total rules applied 1686 place count 88 transition count 289
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1696 place count 78 transition count 279
Iterating global reduction 5 with 10 rules applied. Total rules applied 1706 place count 78 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1711 place count 78 transition count 274
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1721 place count 73 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1727 place count 70 transition count 277
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 1757 place count 70 transition count 247
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 1796 place count 40 transition count 238
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1801 place count 35 transition count 233
Iterating global reduction 7 with 5 rules applied. Total rules applied 1806 place count 35 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 1844 place count 35 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1846 place count 34 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1850 place count 32 transition count 212
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1851 place count 32 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1852 place count 31 transition count 211
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1855 place count 31 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1857 place count 31 transition count 209
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1858 place count 30 transition count 207
Iterating global reduction 8 with 1 rules applied. Total rules applied 1859 place count 30 transition count 207
Applied a total of 1859 rules in 132 ms. Remains 30 /986 variables (removed 956) and now considering 207/1578 (removed 1371) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 30/986 places, 207/1578 transitions.
RANDOM walk for 580 steps (0 resets) in 8 ms. (64 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 986 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 986/986 places, 1578/1578 transitions.
Applied a total of 0 rules in 83 ms. Remains 986 /986 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2025-06-04 18:35:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:35:01] [INFO ] Implicit Places using invariants in 962 ms returned []
[2025-06-04 18:35:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:35:03] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2892 ms to find 0 implicit places.
Running 1577 sub problems to find dead transitions.
[2025-06-04 18:35:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 1577/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 0/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62332ms problems are : Problem set: 0 solved, 1577 unsolved
Search for dead transitions found 0 dead transitions in 62336ms
Finished structural reductions in LTL mode , in 1 iterations and 65319 ms. Remains : 986/986 places, 1578/1578 transitions.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (415 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (77 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 331418 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 331418 steps, saw 66844 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2025-06-04 18:36:09] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 966/972 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/986 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/986 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1578/2564 variables, 986/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2564 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2564 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2564/2564 variables, and 992 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 986/986 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 966/972 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/986 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/986 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1578/2564 variables, 986/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2564 variables, 2/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2564 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2564 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2564/2564 variables, and 994 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3290 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 986/986 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4919ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 495 ms.
Support contains 6 out of 986 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 1578/1578 transitions.
Graph (trivial) has 978 edges and 986 vertex of which 85 / 986 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1583 edges and 916 vertex of which 911 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 689 rules applied. Total rules applied 691 place count 911 transition count 794
Reduce places removed 684 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 699 rules applied. Total rules applied 1390 place count 227 transition count 779
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1395 place count 222 transition count 779
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 1395 place count 222 transition count 724
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 1505 place count 167 transition count 724
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1579 place count 130 transition count 687
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1590 place count 130 transition count 676
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 1617 place count 103 transition count 316
Iterating global reduction 4 with 27 rules applied. Total rules applied 1644 place count 103 transition count 316
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1656 place count 103 transition count 304
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1671 place count 88 transition count 289
Iterating global reduction 5 with 15 rules applied. Total rules applied 1686 place count 88 transition count 289
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1696 place count 78 transition count 279
Iterating global reduction 5 with 10 rules applied. Total rules applied 1706 place count 78 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1711 place count 78 transition count 274
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1721 place count 73 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1727 place count 70 transition count 277
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 1757 place count 70 transition count 247
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 1796 place count 40 transition count 238
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1801 place count 35 transition count 233
Iterating global reduction 7 with 5 rules applied. Total rules applied 1806 place count 35 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 1844 place count 35 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1846 place count 34 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1850 place count 32 transition count 212
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1851 place count 32 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1852 place count 31 transition count 211
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1855 place count 31 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1857 place count 31 transition count 209
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1858 place count 30 transition count 207
Iterating global reduction 8 with 1 rules applied. Total rules applied 1859 place count 30 transition count 207
Applied a total of 1859 rules in 106 ms. Remains 30 /986 variables (removed 956) and now considering 207/1578 (removed 1371) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 30/986 places, 207/1578 transitions.
RANDOM walk for 635 steps (0 resets) in 8 ms. (70 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1049 reset in 260 ms.
Product exploration explored 100000 steps with 1040 reset in 288 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 986 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 986/986 places, 1578/1578 transitions.
Graph (trivial) has 978 edges and 986 vertex of which 85 / 986 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 674 rules applied. Total rules applied 675 place count 916 transition count 1498
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 685 place count 916 transition count 1488
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 685 place count 916 transition count 1493
Deduced a syphon composed of 714 places in 1 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 725 place count 916 transition count 1493
Discarding 606 places :
Symmetric choice reduction at 2 with 606 rule applications. Total rules 1331 place count 310 transition count 887
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 2 with 606 rules applied. Total rules applied 1937 place count 310 transition count 887
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1993 place count 310 transition count 902
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 2081 place count 222 transition count 476
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 2169 place count 222 transition count 476
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 2186 place count 222 transition count 459
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 2223 place count 185 transition count 417
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 37 rules applied. Total rules applied 2260 place count 185 transition count 417
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2275 place count 170 transition count 402
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 2290 place count 170 transition count 402
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2295 place count 170 transition count 397
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2305 place count 160 transition count 387
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 2315 place count 160 transition count 387
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 2323 place count 160 transition count 427
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2336 place count 147 transition count 401
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 2349 place count 147 transition count 401
Deduced a syphon composed of 70 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 2359 place count 147 transition count 391
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 2359 rules in 274 ms. Remains 147 /986 variables (removed 839) and now considering 391/1578 (removed 1187) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:36:17] [INFO ] Redundant transitions in 3 ms returned []
Running 383 sub problems to find dead transitions.
[2025-06-04 18:36:17] [INFO ] Flow matrix only has 385 transitions (discarded 6 similar events)
// Phase 1: matrix 385 rows 147 cols
[2025-06-04 18:36:17] [INFO ] Computed 2 invariants in 4 ms
[2025-06-04 18:36:17] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:24] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:24] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:25] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:25] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:25] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:25] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:26] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 6 ms to minimize.
Problem TDEAD317 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:28] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:28] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:28] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 10 ms to minimize.
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 10/12 constraints. Problems are: Problem set: 10 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:29] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:31] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/14 constraints. Problems are: Problem set: 10 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 10 solved, 373 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 5 (OVERLAPS) 384/531 variables, 147/161 constraints. Problems are: Problem set: 103 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 55/216 constraints. Problems are: Problem set: 103 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 216 constraints, problems are : Problem set: 103 solved, 280 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 147/147 constraints, ReadFeed: 55/56 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 103 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 103 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 71/147 variables, 2/2 constraints. Problems are: Problem set: 103 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 12/14 constraints. Problems are: Problem set: 103 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:49] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:49] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:49] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 3/17 constraints. Problems are: Problem set: 103 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:51] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:52] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:52] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:52] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:52] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:53] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 6/23 constraints. Problems are: Problem set: 103 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:55] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:55] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 2/25 constraints. Problems are: Problem set: 103 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:57] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:57] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:36:57] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 3/28 constraints. Problems are: Problem set: 103 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/28 constraints. Problems are: Problem set: 103 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 384/531 variables, 147/175 constraints. Problems are: Problem set: 103 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 55/230 constraints. Problems are: Problem set: 103 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 280/510 constraints. Problems are: Problem set: 103 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 510 constraints, problems are : Problem set: 103 solved, 280 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 147/147 constraints, ReadFeed: 55/56 constraints, PredecessorRefiner: 280/383 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60472ms problems are : Problem set: 103 solved, 280 unsolved
Search for dead transitions found 103 dead transitions in 60480ms
Found 103 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 103 transitions
Dead transitions reduction (with SMT) removed 103 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 147/986 places, 288/1578 transitions.
Graph (complete) has 457 edges and 147 vertex of which 77 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 296
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 77 /147 variables (removed 70) and now considering 296/288 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/986 places, 296/1578 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60782 ms. Remains : 77/986 places, 296/1578 transitions.
Built C files in :
/tmp/ltsmin1888236804381544771
[2025-06-04 18:37:17] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1888236804381544771
Running compilation step : cd /tmp/ltsmin1888236804381544771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1888236804381544771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1888236804381544771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 986 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 986/986 places, 1578/1578 transitions.
Applied a total of 0 rules in 39 ms. Remains 986 /986 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
// Phase 1: matrix 1578 rows 986 cols
[2025-06-04 18:37:20] [INFO ] Computed 6 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:37:21] [INFO ] Implicit Places using invariants in 836 ms returned []
[2025-06-04 18:37:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:37:24] [INFO ] Implicit Places using invariants and state equation in 2584 ms returned []
Implicit Place search using SMT with State Equation took 3423 ms to find 0 implicit places.
Running 1577 sub problems to find dead transitions.
[2025-06-04 18:37:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 1577/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 0/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62728ms problems are : Problem set: 0 solved, 1577 unsolved
Search for dead transitions found 0 dead transitions in 62733ms
Finished structural reductions in LTL mode , in 1 iterations and 66209 ms. Remains : 986/986 places, 1578/1578 transitions.
Built C files in :
/tmp/ltsmin8886250932606364962
[2025-06-04 18:38:27] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8886250932606364962
Running compilation step : cd /tmp/ltsmin8886250932606364962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8886250932606364962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8886250932606364962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-04 18:38:30] [INFO ] Flatten gal took : 123 ms
[2025-06-04 18:38:30] [INFO ] Flatten gal took : 119 ms
[2025-06-04 18:38:30] [INFO ] Time to serialize gal into /tmp/LTL16875327633578416252.gal : 50 ms
[2025-06-04 18:38:30] [INFO ] Time to serialize properties into /tmp/LTL10346959908079403054.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16875327633578416252.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2321425186574046801.hoa' '-atoms' '/tmp/LTL10346959908079403054.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10346959908079403054.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2321425186574046801.hoa
Detected timeout of ITS tools.
[2025-06-04 18:38:45] [INFO ] Flatten gal took : 69 ms
[2025-06-04 18:38:45] [INFO ] Flatten gal took : 69 ms
[2025-06-04 18:38:45] [INFO ] Time to serialize gal into /tmp/LTL3107746335916539008.gal : 21 ms
[2025-06-04 18:38:45] [INFO ] Time to serialize properties into /tmp/LTL3606664281002293071.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3107746335916539008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3606664281002293071.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((p50==1)&&(p375==1))&&((p654==1)&&(p934==1)))&&(p1236==1))")))||((G("(p1346==0)"))&&("((((p50==0)||(p375==0))||((p654=...191
Formula 0 simplified : XX(GF!"((((p50==1)&&(p375==1))&&((p654==1)&&(p934==1)))&&(p1236==1))" & (!"((((p50==0)||(p375==0))||((p654==0)||(p934==0)))||(p1236=...179
Detected timeout of ITS tools.
[2025-06-04 18:39:00] [INFO ] Flatten gal took : 63 ms
[2025-06-04 18:39:00] [INFO ] Applying decomposition
[2025-06-04 18:39:01] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18091357918135355611.txt' '-o' '/tmp/graph18091357918135355611.bin' '-w' '/tmp/graph18091357918135355611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18091357918135355611.bin' '-l' '-1' '-v' '-w' '/tmp/graph18091357918135355611.weights' '-q' '0' '-e' '0.001'
[2025-06-04 18:39:01] [INFO ] Decomposing Gal with order
[2025-06-04 18:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:39:01] [INFO ] Removed a total of 2827 redundant transitions.
[2025-06-04 18:39:01] [INFO ] Flatten gal took : 310 ms
[2025-06-04 18:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 57 ms.
[2025-06-04 18:39:02] [INFO ] Time to serialize gal into /tmp/LTL1877557455621710124.gal : 34 ms
[2025-06-04 18:39:02] [INFO ] Time to serialize properties into /tmp/LTL9546494395406257882.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1877557455621710124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9546494395406257882.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((i1.u18.p50==1)&&(i1.u83.p375==1))&&((i1.u164.p654==1)&&(i1.u250.p934==1)))&&(i1.u329.p1236==1))")))||((G("(i31.i1.i1....285
Formula 0 simplified : XX(GF!"((((i1.u18.p50==1)&&(i1.u83.p375==1))&&((i1.u164.p654==1)&&(i1.u250.p934==1)))&&(i1.u329.p1236==1))" & (!"((((i1.u18.p50==0)|...273
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-04b-LTLFireability-11 finished in 334167 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(p0)) U (p1&&X(!p0))))'
Support contains 2 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1073 transition count 1671
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1073 transition count 1671
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 1064 transition count 1662
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 1064 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 1056 transition count 1654
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1056 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 1048 transition count 1646
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 1048 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 1040 transition count 1638
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 1040 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 1032 transition count 1630
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 1032 transition count 1630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 1032 transition count 1629
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 1025 transition count 1622
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 1025 transition count 1622
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 1018 transition count 1615
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 1018 transition count 1615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 1018 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 1014 transition count 1610
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 1014 transition count 1610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 1014 transition count 1609
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 1011 transition count 1606
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 1011 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 1008 transition count 1603
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 1008 transition count 1603
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 1005 transition count 1600
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 1005 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 1002 transition count 1597
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 1002 transition count 1597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 999 transition count 1594
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 999 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 996 transition count 1591
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 996 transition count 1591
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 993 transition count 1588
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 993 transition count 1588
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 990 transition count 1585
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 990 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 990 transition count 1584
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 988 transition count 1582
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 988 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 987 transition count 1580
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 986 transition count 1579
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 985 transition count 1578
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 984 transition count 1577
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 984 transition count 1576
Applied a total of 212 rules in 1397 ms. Remains 984 /1087 variables (removed 103) and now considering 1576/1685 (removed 109) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2025-06-04 18:39:18] [INFO ] Computed 6 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:39:19] [INFO ] Implicit Places using invariants in 927 ms returned []
[2025-06-04 18:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:39:21] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 2944 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2025-06-04 18:39:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 983/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1575 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/984 constraints, PredecessorRefiner: 1575/1575 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1575 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 983/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1575 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/984 constraints, PredecessorRefiner: 0/1575 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62033ms problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 62037ms
Starting structural reductions in LTL mode, iteration 1 : 984/1087 places, 1576/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66382 ms. Remains : 984/1087 places, 1576/1685 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) p0), (NOT p0), p0]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-13
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-13 finished in 66561 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 U p1)&&G((F(p3)||p2)))))'
Support contains 12 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1074 transition count 1672
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1074 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1066 transition count 1664
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1066 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1059 transition count 1657
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1059 transition count 1657
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1052 transition count 1650
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1052 transition count 1650
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 1045 transition count 1643
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 1045 transition count 1643
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 1038 transition count 1636
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 1038 transition count 1636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 1038 transition count 1635
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 1032 transition count 1629
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 1032 transition count 1629
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 1026 transition count 1623
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 1026 transition count 1623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 1026 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 127 place count 1023 transition count 1619
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 1023 transition count 1619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 1023 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 1021 transition count 1616
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 1021 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 1019 transition count 1614
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 1019 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 1017 transition count 1612
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 1017 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 1015 transition count 1610
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 1015 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 1013 transition count 1608
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 1013 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 1011 transition count 1606
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 1011 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 1009 transition count 1604
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 1009 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 1007 transition count 1602
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 1007 transition count 1602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 1007 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 1006 transition count 1600
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 1005 transition count 1599
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 1005 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 1004 transition count 1598
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 1004 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 1003 transition count 1597
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 1003 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 1002 transition count 1596
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 1002 transition count 1596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 175 place count 1002 transition count 1595
Applied a total of 175 rules in 1556 ms. Remains 1002 /1087 variables (removed 85) and now considering 1595/1685 (removed 90) transitions.
// Phase 1: matrix 1595 rows 1002 cols
[2025-06-04 18:40:25] [INFO ] Computed 6 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:40:25] [INFO ] Implicit Places using invariants in 717 ms returned []
[2025-06-04 18:40:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:40:28] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
Running 1594 sub problems to find dead transitions.
[2025-06-04 18:40:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/2597 variables, and 0 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/2597 variables, and 0 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/1594 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62548ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 62553ms
Starting structural reductions in LTL mode, iteration 1 : 1002/1087 places, 1595/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66990 ms. Remains : 1002/1087 places, 1595/1685 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-14 finished in 67259 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)&&X(p1)))'
Support contains 6 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1685/1685 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1073 transition count 1671
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1073 transition count 1671
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 1064 transition count 1662
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 1064 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 1056 transition count 1654
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1056 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 1048 transition count 1646
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 1048 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 1040 transition count 1638
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 1040 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 1032 transition count 1630
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 1032 transition count 1630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 1032 transition count 1629
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 1025 transition count 1622
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 1025 transition count 1622
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 1018 transition count 1615
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 1018 transition count 1615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 1018 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 1014 transition count 1610
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 1014 transition count 1610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 1014 transition count 1609
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 1011 transition count 1606
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 1011 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 1008 transition count 1603
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 1008 transition count 1603
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 1005 transition count 1600
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 1005 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 1002 transition count 1597
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 1002 transition count 1597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 999 transition count 1594
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 999 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 996 transition count 1591
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 996 transition count 1591
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 993 transition count 1588
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 993 transition count 1588
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 990 transition count 1585
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 990 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 990 transition count 1584
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 988 transition count 1582
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 988 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 987 transition count 1580
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 986 transition count 1579
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 985 transition count 1578
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 984 transition count 1577
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 984 transition count 1576
Applied a total of 212 rules in 1178 ms. Remains 984 /1087 variables (removed 103) and now considering 1576/1685 (removed 109) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2025-06-04 18:41:32] [INFO ] Computed 6 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:41:32] [INFO ] Implicit Places using invariants in 687 ms returned []
[2025-06-04 18:41:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:41:34] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2025-06-04 18:41:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 983/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1575 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/984 constraints, PredecessorRefiner: 1575/1575 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1575 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 983/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1575 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/984 constraints, PredecessorRefiner: 0/1575 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62021ms problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 62025ms
Starting structural reductions in LTL mode, iteration 1 : 984/1087 places, 1576/1685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65640 ms. Remains : 984/1087 places, 1576/1685 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-15 finished in 65873 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(G(p0))||(p1&&G(p2))))))'
[2025-06-04 18:42:37] [INFO ] Flatten gal took : 161 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12409443794974897159
[2025-06-04 18:42:37] [INFO ] Too many transitions (1685) to apply POR reductions. Disabling POR matrices.
[2025-06-04 18:42:37] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12409443794974897159
Running compilation step : cd /tmp/ltsmin12409443794974897159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 18:42:37] [INFO ] Applying decomposition
[2025-06-04 18:42:37] [INFO ] Flatten gal took : 208 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14227999812365836143.txt' '-o' '/tmp/graph14227999812365836143.bin' '-w' '/tmp/graph14227999812365836143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14227999812365836143.bin' '-l' '-1' '-v' '-w' '/tmp/graph14227999812365836143.weights' '-q' '0' '-e' '0.001'
[2025-06-04 18:42:38] [INFO ] Decomposing Gal with order
[2025-06-04 18:42:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:42:38] [INFO ] Removed a total of 2834 redundant transitions.
[2025-06-04 18:42:38] [INFO ] Flatten gal took : 287 ms
[2025-06-04 18:42:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 58 ms.
[2025-06-04 18:42:38] [INFO ] Time to serialize gal into /tmp/LTLFireability16865499731674187018.gal : 35 ms
[2025-06-04 18:42:38] [INFO ] Time to serialize properties into /tmp/LTLFireability14636107273294947562.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16865499731674187018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14636107273294947562.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((i0.u4.p50==1)&&(i0.u115.p375==1))&&((i0.u193.p654==1)&&(i0.u266.p934==1)))&&(i0.u359.p1236==1))")))||(("((((i0.u4.p50...275
Formula 0 simplified : XX(GF!"((((i0.u4.p50==1)&&(i0.u115.p375==1))&&((i0.u193.p654==1)&&(i0.u266.p934==1)))&&(i0.u359.p1236==1))" & (!"((((i0.u4.p50==0)||...263
Compilation finished in 7030 ms.
Running link step : cd /tmp/ltsmin12409443794974897159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12409443794974897159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t42, t87, t197, t253, t287, t305, t393, t394, t450, t484, t624, t658, t754, t810, t843, t881,...831
Computing Next relation with stutter on 1.37205e+06 deadlock states
Detected timeout of ITS tools.
[2025-06-04 19:10:43] [INFO ] Applying decomposition
[2025-06-04 19:10:43] [INFO ] Flatten gal took : 153 ms
[2025-06-04 19:10:43] [INFO ] Decomposing Gal with order
[2025-06-04 19:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 19:10:44] [INFO ] Removed a total of 2636 redundant transitions.
[2025-06-04 19:10:44] [INFO ] Flatten gal took : 448 ms
[2025-06-04 19:10:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 372 labels/synchronizations in 23 ms.
[2025-06-04 19:10:44] [INFO ] Time to serialize gal into /tmp/LTLFireability15338415399476041817.gal : 14 ms
[2025-06-04 19:10:44] [INFO ] Time to serialize properties into /tmp/LTLFireability5273703703177058657.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15338415399476041817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5273703703177058657.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((i0.i0.i0.i0.u5.p50==1)&&(i0.i0.i0.i0.u6.p375==1))&&((i0.i0.i0.u7.p654==1)&&(i0.i0.u8.p934==1)))&&(i0.u9.p1236==1))"))...311
Formula 0 simplified : XX(GF!"((((i0.i0.i0.i0.u5.p50==1)&&(i0.i0.i0.i0.u6.p375==1))&&((i0.i0.i0.u7.p654==1)&&(i0.i0.u8.p934==1)))&&(i0.u9.p1236==1))" & (!"...299
Reverse transition relation is NOT exact ! Due to transitions t1042, i0.u9.t42, i0.u9.t87, i0.u9.t104, i0.u9.t117, i0.u9.t139, i0.u9.t147, i0.u9.t195, i0.u...1059
Computing Next relation with stutter on 1.37205e+06 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="StigmergyCommit-PT-04b"
export BK_EXAMINATION="LTLFireability"
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 StigmergyCommit-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490600044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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