About the Execution of ITS-Tools for StigmergyElection-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13877.684 | 3600000.00 | 3937191.00 | 9083.00 | FFTFFTFFF?FT???? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532100356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyElection-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 18:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717012955259
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 20:02:36] [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]
[2024-05-29 20:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:02:37] [INFO ] Load time of PNML (sax parser for PT used): 681 ms
[2024-05-29 20:02:37] [INFO ] Transformed 1107 places.
[2024-05-29 20:02:37] [INFO ] Transformed 14564 transitions.
[2024-05-29 20:02:37] [INFO ] Found NUPN structural information;
[2024-05-29 20:02:37] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 854 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyElection-PT-08b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 1107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 139 place count 968 transition count 14425
Iterating global reduction 0 with 139 rules applied. Total rules applied 278 place count 968 transition count 14425
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 352 place count 894 transition count 14351
Iterating global reduction 0 with 74 rules applied. Total rules applied 426 place count 894 transition count 14351
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 442 place count 878 transition count 14335
Iterating global reduction 0 with 16 rules applied. Total rules applied 458 place count 878 transition count 14335
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 466 place count 870 transition count 14327
Iterating global reduction 0 with 8 rules applied. Total rules applied 474 place count 870 transition count 14327
Applied a total of 474 rules in 572 ms. Remains 870 /1107 variables (removed 237) and now considering 14327/14564 (removed 237) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2024-05-29 20:02:38] [INFO ] Computed 9 invariants in 311 ms
[2024-05-29 20:02:38] [INFO ] Implicit Places using invariants in 782 ms returned []
Implicit Place search using SMT only with invariants took 811 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:02:39] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 timeout
1.0)
(s742 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30233 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30183 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 250402ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 250640ms
Starting structural reductions in LTL mode, iteration 1 : 870/1107 places, 14327/14564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252134 ms. Remains : 870/1107 places, 14327/14564 transitions.
Support contains 60 out of 870 places after structural reductions.
[2024-05-29 20:06:51] [INFO ] Flatten gal took : 1423 ms
[2024-05-29 20:06:52] [INFO ] Flatten gal took : 1122 ms
[2024-05-29 20:06:54] [INFO ] Input system was already deterministic with 14327 transitions.
RANDOM walk for 40000 steps (289 resets) in 2731 ms. (14 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 78971 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 24
Probabilistic random walk after 78971 steps, saw 17866 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-29 20:06:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 797/856 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/856 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 14/870 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 23 unsolved
SMT process timed out in 5590ms, After SMT, problems are : Problem set: 1 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 796 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 7 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2184 edges and 758 vertex of which 750 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.70 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 454 transitions
Trivial Post-agglo rules discarded 454 transitions
Performed 454 trivial Post agglomeration. Transition count delta: 454
Iterating post reduction 0 with 462 rules applied. Total rules applied 464 place count 750 transition count 13713
Reduce places removed 454 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 470 rules applied. Total rules applied 934 place count 296 transition count 13697
Reduce places removed 8 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 44 rules applied. Total rules applied 978 place count 288 transition count 13661
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 1014 place count 252 transition count 13661
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 1014 place count 252 transition count 13626
Deduced a syphon composed of 35 places in 6 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1084 place count 217 transition count 13626
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1166 place count 176 transition count 13585
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1182 place count 176 transition count 13569
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1199 place count 159 transition count 13537
Iterating global reduction 5 with 17 rules applied. Total rules applied 1216 place count 159 transition count 13537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1217 place count 159 transition count 13536
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1225 place count 151 transition count 13528
Iterating global reduction 6 with 8 rules applied. Total rules applied 1233 place count 151 transition count 13528
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 74 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1249 place count 143 transition count 13520
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1255 place count 140 transition count 13528
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1263 place count 140 transition count 13520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1265 place count 139 transition count 13526
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1273 place count 139 transition count 13518
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1275 place count 138 transition count 13524
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1283 place count 138 transition count 13516
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1285 place count 137 transition count 13522
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1293 place count 137 transition count 13514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1295 place count 136 transition count 13520
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1303 place count 136 transition count 13512
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 1316 place count 136 transition count 13499
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1329 place count 123 transition count 13499
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1337 place count 115 transition count 13491
Iterating global reduction 7 with 8 rules applied. Total rules applied 1345 place count 115 transition count 13491
Applied a total of 1345 rules in 4664 ms. Remains 115 /870 variables (removed 755) and now considering 13491/14327 (removed 836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4665 ms. Remains : 115/870 places, 13491/14327 transitions.
RANDOM walk for 40000 steps (1472 resets) in 2084 ms. (19 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
// Phase 1: matrix 13491 rows 115 cols
[2024-05-29 20:07:10] [INFO ] Computed 9 invariants in 95 ms
[2024-05-29 20:07:11] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 67/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 13491/13606 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13606 variables, 200/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13606 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/13606 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13606/13606 variables, and 324 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19571 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 67/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 13491/13606 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13606 variables, 200/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13606 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/13606 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13606/13606 variables, and 324 constraints, problems are : Problem set: 0 solved, 20 unsolved in 29449 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 50091ms problems are : Problem set: 0 solved, 20 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 20 properties in 1281 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-08b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 120 stabilizing places and 128 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(!(p0 U p1)) U ((p2 U p0)||p3)))))'
Support contains 21 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 71 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2024-05-29 20:08:02] [INFO ] Computed 9 invariants in 208 ms
[2024-05-29 20:08:04] [INFO ] Implicit Places using invariants in 2500 ms returned []
Implicit Place search using SMT only with invariants took 2502 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:08:04] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30170 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30156 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 252234ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 252370ms
Finished structural reductions in LTL mode , in 1 iterations and 254996 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), p1, (AND (NOT p0) p1)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-01
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 5 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-01 finished in 255444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&X((!p0 U (!p1||G(!p0))))))||(!p0&&X((!p0 U (!p1||G(!p0))))&&F((G(F(p2))||(!p0&&F(p2)&&F(!p1)))))))'
Support contains 17 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 83 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2024-05-29 20:12:17] [INFO ] Invariant cache hit.
[2024-05-29 20:12:20] [INFO ] Implicit Places using invariants in 2639 ms returned []
Implicit Place search using SMT only with invariants took 2641 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:12:20] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30157 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30188 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 250320ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 250450ms
Finished structural reductions in LTL mode , in 1 iterations and 253212 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 181 ms :[p0, true, (AND p0 p1), (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 920 ms.
Product exploration explored 100000 steps with 50000 reset in 788 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08b-LTLFireability-02 finished in 255409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X((X(p0)&&p1)) U p0))||G(p2)))'
Support contains 29 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 72 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2024-05-29 20:16:33] [INFO ] Invariant cache hit.
[2024-05-29 20:16:35] [INFO ] Implicit Places using invariants in 2212 ms returned []
Implicit Place search using SMT only with invariants took 2213 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:16:35] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30154 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 249158ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 249289ms
Finished structural reductions in LTL mode , in 1 iterations and 251613 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-04 finished in 251943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 110 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2024-05-29 20:20:45] [INFO ] Invariant cache hit.
[2024-05-29 20:20:48] [INFO ] Implicit Places using invariants in 3807 ms returned []
Implicit Place search using SMT only with invariants took 3808 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:20:49] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30158 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 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 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30162 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 248404ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 248528ms
Finished structural reductions in LTL mode , in 1 iterations and 252474 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 755 ms.
Product exploration explored 100000 steps with 50000 reset in 765 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08b-LTLFireability-05 finished in 254287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 14 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 81 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2024-05-29 20:24:59] [INFO ] Invariant cache hit.
[2024-05-29 20:25:02] [INFO ] Implicit Places using invariants in 2765 ms returned []
Implicit Place search using SMT only with invariants took 2766 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:25:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30161 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 248304ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 248453ms
Finished structural reductions in LTL mode , in 1 iterations and 251326 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-06
Product exploration explored 100000 steps with 728 reset in 665 ms.
Product exploration explored 100000 steps with 726 reset in 649 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 117 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (288 resets) in 412 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (36 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 68844 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 68844 steps, saw 16284 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-29 20:29:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 848/856 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/856 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/870 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15197/15197 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 848/856 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/856 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/870 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 15197/15197 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3288 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6386ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 885 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 5 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2184 edges and 758 vertex of which 750 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.19 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 537 rules applied. Total rules applied 539 place count 750 transition count 13638
Reduce places removed 529 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 545 rules applied. Total rules applied 1084 place count 221 transition count 13622
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1092 place count 213 transition count 13622
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1092 place count 213 transition count 13581
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1174 place count 172 transition count 13581
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1175 place count 172 transition count 13580
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1257 place count 131 transition count 13539
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1273 place count 131 transition count 13523
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 1300 place count 104 transition count 3541
Iterating global reduction 5 with 27 rules applied. Total rules applied 1327 place count 104 transition count 3541
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1338 place count 104 transition count 3530
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1346 place count 96 transition count 3522
Iterating global reduction 6 with 8 rules applied. Total rules applied 1354 place count 96 transition count 3522
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 6 with 16 rules applied. Total rules applied 1370 place count 88 transition count 3514
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1376 place count 85 transition count 3522
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1384 place count 85 transition count 3514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1386 place count 84 transition count 3520
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1394 place count 84 transition count 3512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1396 place count 83 transition count 3518
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1404 place count 83 transition count 3510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1406 place count 82 transition count 3516
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1414 place count 82 transition count 3508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1416 place count 81 transition count 3514
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1424 place count 81 transition count 3506
Free-agglomeration rule applied 47 times.
Iterating global reduction 6 with 47 rules applied. Total rules applied 1471 place count 81 transition count 3459
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 112 rules applied. Total rules applied 1583 place count 34 transition count 3394
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1591 place count 26 transition count 3386
Iterating global reduction 7 with 8 rules applied. Total rules applied 1599 place count 26 transition count 3386
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 1854 place count 26 transition count 3131
Drop transitions (Redundant composition of simpler transitions.) removed 602 transitions
Redundant transition composition rules discarded 602 transitions
Iterating global reduction 8 with 602 rules applied. Total rules applied 2456 place count 26 transition count 2529
Applied a total of 2456 rules in 4191 ms. Remains 26 /870 variables (removed 844) and now considering 2529/14327 (removed 11798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4191 ms. Remains : 26/870 places, 2529/14327 transitions.
RANDOM walk for 254 steps (0 resets) in 23 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08b-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08b-LTLFireability-06 finished in 267172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 885 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 757 transition count 13685
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 529 rules applied. Total rules applied 1043 place count 244 transition count 13669
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1051 place count 236 transition count 13669
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1051 place count 236 transition count 13636
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1117 place count 203 transition count 13636
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1124 place count 196 transition count 13629
Iterating global reduction 3 with 7 rules applied. Total rules applied 1131 place count 196 transition count 13629
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1209 place count 157 transition count 13590
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1233 place count 133 transition count 7261
Iterating global reduction 3 with 24 rules applied. Total rules applied 1257 place count 133 transition count 7261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1265 place count 133 transition count 7253
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1273 place count 125 transition count 7237
Iterating global reduction 4 with 8 rules applied. Total rules applied 1281 place count 125 transition count 7237
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1289 place count 117 transition count 7221
Iterating global reduction 4 with 8 rules applied. Total rules applied 1297 place count 117 transition count 7221
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1321 place count 105 transition count 7228
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1322 place count 104 transition count 7212
Iterating global reduction 4 with 1 rules applied. Total rules applied 1323 place count 104 transition count 7212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1324 place count 104 transition count 7211
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1332 place count 104 transition count 7203
Applied a total of 1332 rules in 2721 ms. Remains 104 /870 variables (removed 766) and now considering 7203/14327 (removed 7124) transitions.
[2024-05-29 20:29:29] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
// Phase 1: matrix 7194 rows 104 cols
[2024-05-29 20:29:29] [INFO ] Computed 2 invariants in 74 ms
[2024-05-29 20:29:30] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2024-05-29 20:29:30] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:29:30] [INFO ] Invariant cache hit.
[2024-05-29 20:29:32] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:29:37] [INFO ] Implicit Places using invariants and state equation in 7321 ms returned []
Implicit Place search using SMT with State Equation took 8766 ms to find 0 implicit places.
[2024-05-29 20:29:38] [INFO ] Redundant transitions in 943 ms returned []
Running 7186 sub problems to find dead transitions.
[2024-05-29 20:29:38] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:29:38] [INFO ] Invariant cache hit.
[2024-05-29 20:29:40] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/7298 variables, and 1 constraints, problems are : Problem set: 0 solved, 7186 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 7186/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/7298 variables, and 2 constraints, problems are : Problem set: 0 solved, 7186 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 6872/314 constraints, Known Traps: 0/0 constraints]
After SMT, in 154199ms problems are : Problem set: 0 solved, 7186 unsolved
Search for dead transitions found 0 dead transitions in 154257ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/870 places, 7203/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166708 ms. Remains : 104/870 places, 7203/14327 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-09
Product exploration explored 100000 steps with 6629 reset in 1242 ms.
Product exploration explored 100000 steps with 6634 reset in 1248 ms.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2649 resets) in 1179 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 180478 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 180478 steps, saw 67987 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-29 20:32:19] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:32:19] [INFO ] Invariant cache hit.
[2024-05-29 20:32:20] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7294/7298 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 102/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7294/7298 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 102/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4242ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 7203/7203 transitions.
Applied a total of 0 rules in 501 ms. Remains 104 /104 variables (removed 0) and now considering 7203/7203 (removed 0) transitions.
[2024-05-29 20:32:24] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:32:24] [INFO ] Invariant cache hit.
[2024-05-29 20:32:25] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2024-05-29 20:32:25] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:32:25] [INFO ] Invariant cache hit.
[2024-05-29 20:32:27] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:32:33] [INFO ] Implicit Places using invariants and state equation in 7654 ms returned []
Implicit Place search using SMT with State Equation took 9042 ms to find 0 implicit places.
[2024-05-29 20:32:34] [INFO ] Redundant transitions in 826 ms returned []
Running 7186 sub problems to find dead transitions.
[2024-05-29 20:32:34] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:32:34] [INFO ] Invariant cache hit.
[2024-05-29 20:32:35] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/7298 variables, and 1 constraints, problems are : Problem set: 0 solved, 7186 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 7186/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
[2024-05-29 20:35:10] [INFO ] Deduced a trap composed of 14 places in 2453 ms of which 7 ms to minimize.
SMT process timed out in 156790ms, After SMT, problems are : Problem set: 0 solved, 7186 unsolved
Search for dead transitions found 0 dead transitions in 156850ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 167236 ms. Remains : 104/104 places, 7203/7203 transitions.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2641 resets) in 671 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 183129 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 183129 steps, saw 68552 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-29 20:35:14] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:35:14] [INFO ] Invariant cache hit.
[2024-05-29 20:35:15] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7294/7298 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 102/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7294/7298 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 102/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4491ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6615 reset in 1112 ms.
Product exploration explored 100000 steps with 6647 reset in 1133 ms.
Built C files in :
/tmp/ltsmin2740708407884854483
[2024-05-29 20:35:21] [INFO ] Too many transitions (7203) to apply POR reductions. Disabling POR matrices.
[2024-05-29 20:35:21] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2740708407884854483
Running compilation step : cd /tmp/ltsmin2740708407884854483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin2740708407884854483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin2740708407884854483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 7203/7203 transitions.
Applied a total of 0 rules in 470 ms. Remains 104 /104 variables (removed 0) and now considering 7203/7203 (removed 0) transitions.
[2024-05-29 20:35:25] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:35:25] [INFO ] Invariant cache hit.
[2024-05-29 20:35:26] [INFO ] Implicit Places using invariants in 1381 ms returned []
[2024-05-29 20:35:26] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:35:26] [INFO ] Invariant cache hit.
[2024-05-29 20:35:28] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:35:33] [INFO ] Implicit Places using invariants and state equation in 7199 ms returned []
Implicit Place search using SMT with State Equation took 8582 ms to find 0 implicit places.
[2024-05-29 20:35:34] [INFO ] Redundant transitions in 878 ms returned []
Running 7186 sub problems to find dead transitions.
[2024-05-29 20:35:34] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2024-05-29 20:35:34] [INFO ] Invariant cache hit.
[2024-05-29 20:35:35] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/7298 variables, and 1 constraints, problems are : Problem set: 0 solved, 7186 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 7186/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7186 unsolved
[2024-05-29 20:38:11] [INFO ] Deduced a trap composed of 14 places in 2424 ms of which 1 ms to minimize.
SMT process timed out in 157216ms, After SMT, problems are : Problem set: 0 solved, 7186 unsolved
Search for dead transitions found 0 dead transitions in 157275ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 167227 ms. Remains : 104/104 places, 7203/7203 transitions.
Built C files in :
/tmp/ltsmin3033723450678671514
[2024-05-29 20:38:11] [INFO ] Too many transitions (7203) to apply POR reductions. Disabling POR matrices.
[2024-05-29 20:38:11] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3033723450678671514
Running compilation step : cd /tmp/ltsmin3033723450678671514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3033723450678671514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3033723450678671514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-29 20:38:16] [INFO ] Flatten gal took : 918 ms
[2024-05-29 20:38:17] [INFO ] Flatten gal took : 754 ms
[2024-05-29 20:38:17] [INFO ] Time to serialize gal into /tmp/LTL7464150748849499135.gal : 137 ms
[2024-05-29 20:38:17] [INFO ] Time to serialize properties into /tmp/LTL12058927369157672940.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7464150748849499135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1153910103399773150.hoa' '-atoms' '/tmp/LTL12058927369157672940.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12058927369157672940.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1153910103399773150.hoa
Detected timeout of ITS tools.
[2024-05-29 20:38:34] [INFO ] Flatten gal took : 791 ms
[2024-05-29 20:38:35] [INFO ] Flatten gal took : 740 ms
[2024-05-29 20:38:35] [INFO ] Time to serialize gal into /tmp/LTL5525770739894405288.gal : 119 ms
[2024-05-29 20:38:35] [INFO ] Time to serialize properties into /tmp/LTL15556514506032352895.ltl : 2 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5525770739894405288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15556514506032352895.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p56==0)||(p178==0))||((p326==0)||(p448==0)))||(((p596==0)||(p718==0))||((p853==0)||(p988==0))))"))))
Formula 0 simplified : GF!"((((p56==0)||(p178==0))||((p326==0)||(p448==0)))||(((p596==0)||(p718==0))||((p853==0)||(p988==0))))"
Detected timeout of ITS tools.
[2024-05-29 20:38:51] [INFO ] Flatten gal took : 767 ms
[2024-05-29 20:38:51] [INFO ] Applying decomposition
[2024-05-29 20:38:51] [INFO ] Flatten gal took : 731 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15350265076162783775.txt' '-o' '/tmp/graph15350265076162783775.bin' '-w' '/tmp/graph15350265076162783775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15350265076162783775.bin' '-l' '-1' '-v' '-w' '/tmp/graph15350265076162783775.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:38:53] [INFO ] Decomposing Gal with order
[2024-05-29 20:38:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:38:55] [INFO ] Removed a total of 56607 redundant transitions.
[2024-05-29 20:38:55] [INFO ] Flatten gal took : 1323 ms
[2024-05-29 20:38:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 375 ms.
[2024-05-29 20:38:56] [INFO ] Time to serialize gal into /tmp/LTL6371854206455310729.gal : 14 ms
[2024-05-29 20:38:56] [INFO ] Time to serialize properties into /tmp/LTL18145785007656903425.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6371854206455310729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18145785007656903425.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i2.u2.p56==0)||(i2.u4.p178==0))||((i0.u8.p326==0)||(i0.u11.p448==0)))||(((i0.u13.p596==0)||(i2.u16.p718==0))||((i2.u19.p85...186
Formula 0 simplified : GF!"((((i2.u2.p56==0)||(i2.u4.p178==0))||((i0.u8.p326==0)||(i0.u11.p448==0)))||(((i0.u13.p596==0)||(i2.u16.p718==0))||((i2.u19.p853=...180
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-08b-LTLFireability-09 finished in 585036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&X(F(p0))))))'
Support contains 8 out of 870 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 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 878 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 0 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 507 place count 757 transition count 13692
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 522 rules applied. Total rules applied 1029 place count 251 transition count 13676
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1037 place count 243 transition count 13676
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1037 place count 243 transition count 13643
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1103 place count 210 transition count 13643
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1110 place count 203 transition count 13636
Iterating global reduction 3 with 7 rules applied. Total rules applied 1117 place count 203 transition count 13636
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1195 place count 164 transition count 13597
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1219 place count 140 transition count 7268
Iterating global reduction 3 with 24 rules applied. Total rules applied 1243 place count 140 transition count 7268
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1251 place count 140 transition count 7260
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1259 place count 132 transition count 7244
Iterating global reduction 4 with 8 rules applied. Total rules applied 1267 place count 132 transition count 7244
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1275 place count 124 transition count 7228
Iterating global reduction 4 with 8 rules applied. Total rules applied 1283 place count 124 transition count 7228
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1307 place count 112 transition count 7235
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1308 place count 111 transition count 7219
Iterating global reduction 4 with 1 rules applied. Total rules applied 1309 place count 111 transition count 7219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1310 place count 111 transition count 7218
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1318 place count 111 transition count 7210
Applied a total of 1318 rules in 2191 ms. Remains 111 /870 variables (removed 759) and now considering 7210/14327 (removed 7117) transitions.
[2024-05-29 20:39:13] [INFO ] Flow matrix only has 7201 transitions (discarded 9 similar events)
// Phase 1: matrix 7201 rows 111 cols
[2024-05-29 20:39:13] [INFO ] Computed 2 invariants in 73 ms
[2024-05-29 20:39:14] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-29 20:39:14] [INFO ] Flow matrix only has 7201 transitions (discarded 9 similar events)
[2024-05-29 20:39:14] [INFO ] Invariant cache hit.
[2024-05-29 20:39:16] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:39:21] [INFO ] Implicit Places using invariants and state equation in 6976 ms returned []
Implicit Place search using SMT with State Equation took 7923 ms to find 0 implicit places.
[2024-05-29 20:39:22] [INFO ] Redundant transitions in 964 ms returned []
Running 7193 sub problems to find dead transitions.
[2024-05-29 20:39:22] [INFO ] Flow matrix only has 7201 transitions (discarded 9 similar events)
[2024-05-29 20:39:22] [INFO ] Invariant cache hit.
[2024-05-29 20:39:23] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7193 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 110/7312 variables, and 1 constraints, problems are : Problem set: 0 solved, 7193 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/111 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 7193/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7193 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 111/7312 variables, and 2 constraints, problems are : Problem set: 0 solved, 7193 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/111 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 6872/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 154361ms problems are : Problem set: 0 solved, 7193 unsolved
Search for dead transitions found 0 dead transitions in 154423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/870 places, 7210/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165524 ms. Remains : 111/870 places, 7210/14327 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-10
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-10 finished in 165598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||G(p2))))'
Support contains 22 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 70 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2024-05-29 20:41:57] [INFO ] Computed 9 invariants in 213 ms
[2024-05-29 20:41:59] [INFO ] Implicit Places using invariants in 2385 ms returned []
Implicit Place search using SMT only with invariants took 2386 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:41:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)timeout
(s707 1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30158 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30158 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 248872ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 248996ms
Finished structural reductions in LTL mode , in 1 iterations and 251480 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-12
Product exploration explored 100000 steps with 727 reset in 1043 ms.
Product exploration explored 100000 steps with 726 reset in 643 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (290 resets) in 470 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (37 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (35 resets) in 410 ms. (97 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 67123 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 67123 steps, saw 16001 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-29 20:46:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 840/856 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/856 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/870 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15197/15197 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 840/856 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/856 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/870 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 15197/15197 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10123ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 877 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2184 edges and 758 vertex of which 750 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.20 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 521 transitions
Trivial Post-agglo rules discarded 521 transitions
Performed 521 trivial Post agglomeration. Transition count delta: 521
Iterating post reduction 0 with 529 rules applied. Total rules applied 531 place count 750 transition count 13646
Reduce places removed 521 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 537 rules applied. Total rules applied 1068 place count 229 transition count 13630
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1076 place count 221 transition count 13630
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1076 place count 221 transition count 13589
Deduced a syphon composed of 41 places in 5 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1158 place count 180 transition count 13589
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 180 transition count 13588
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1241 place count 139 transition count 13547
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1257 place count 139 transition count 13531
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1277 place count 119 transition count 8882
Iterating global reduction 5 with 20 rules applied. Total rules applied 1297 place count 119 transition count 8882
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1301 place count 119 transition count 8878
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1309 place count 111 transition count 8870
Iterating global reduction 6 with 8 rules applied. Total rules applied 1317 place count 111 transition count 8870
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1333 place count 103 transition count 8862
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1339 place count 100 transition count 8870
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1347 place count 100 transition count 8862
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1349 place count 99 transition count 8868
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1357 place count 99 transition count 8860
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1359 place count 98 transition count 8866
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1367 place count 98 transition count 8858
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1369 place count 97 transition count 8864
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1377 place count 97 transition count 8856
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1379 place count 96 transition count 8862
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1387 place count 96 transition count 8854
Free-agglomeration rule applied 54 times.
Iterating global reduction 6 with 54 rules applied. Total rules applied 1441 place count 96 transition count 8800
Reduce places removed 54 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 1528 place count 42 transition count 8767
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1536 place count 34 transition count 8759
Iterating global reduction 7 with 8 rules applied. Total rules applied 1544 place count 34 transition count 8759
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 1799 place count 34 transition count 8504
Drop transitions (Redundant composition of simpler transitions.) removed 6230 transitions
Redundant transition composition rules discarded 6230 transitions
Iterating global reduction 8 with 6230 rules applied. Total rules applied 8029 place count 34 transition count 2274
Applied a total of 8029 rules in 13422 ms. Remains 34 /870 variables (removed 836) and now considering 2274/14327 (removed 12053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13422 ms. Remains : 34/870 places, 2274/14327 transitions.
RANDOM walk for 31324 steps (1939 resets) in 980 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F p1)]
Knowledge based reduction with 10 factoid took 237 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 16 out of 870 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 68 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2024-05-29 20:46:38] [INFO ] Invariant cache hit.
[2024-05-29 20:46:41] [INFO ] Implicit Places using invariants in 2220 ms returned []
Implicit Place search using SMT only with invariants took 2223 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:46:41] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30363 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 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 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 251079ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 251197ms
Finished structural reductions in LTL mode , in 1 iterations and 253512 ms. Remains : 870/870 places, 14327/14327 transitions.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (288 resets) in 930 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (37 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 66629 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 66629 steps, saw 15899 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-29 20:50:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 840/856 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/856 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/870 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15197/15197 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 840/856 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/856 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/870 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 15197/15197 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10132ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 877 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2184 edges and 758 vertex of which 750 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.19 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 521 transitions
Trivial Post-agglo rules discarded 521 transitions
Performed 521 trivial Post agglomeration. Transition count delta: 521
Iterating post reduction 0 with 529 rules applied. Total rules applied 531 place count 750 transition count 13646
Reduce places removed 521 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 537 rules applied. Total rules applied 1068 place count 229 transition count 13630
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1076 place count 221 transition count 13630
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1076 place count 221 transition count 13589
Deduced a syphon composed of 41 places in 5 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1158 place count 180 transition count 13589
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 180 transition count 13588
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1241 place count 139 transition count 13547
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1257 place count 139 transition count 13531
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1277 place count 119 transition count 8882
Iterating global reduction 5 with 20 rules applied. Total rules applied 1297 place count 119 transition count 8882
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1301 place count 119 transition count 8878
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1309 place count 111 transition count 8870
Iterating global reduction 6 with 8 rules applied. Total rules applied 1317 place count 111 transition count 8870
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1333 place count 103 transition count 8862
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1339 place count 100 transition count 8870
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1347 place count 100 transition count 8862
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1349 place count 99 transition count 8868
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1357 place count 99 transition count 8860
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1359 place count 98 transition count 8866
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1367 place count 98 transition count 8858
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1369 place count 97 transition count 8864
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1377 place count 97 transition count 8856
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1379 place count 96 transition count 8862
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1387 place count 96 transition count 8854
Free-agglomeration rule applied 54 times.
Iterating global reduction 6 with 54 rules applied. Total rules applied 1441 place count 96 transition count 8800
Reduce places removed 54 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 1528 place count 42 transition count 8767
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1536 place count 34 transition count 8759
Iterating global reduction 7 with 8 rules applied. Total rules applied 1544 place count 34 transition count 8759
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 1799 place count 34 transition count 8504
Drop transitions (Redundant composition of simpler transitions.) removed 6230 transitions
Redundant transition composition rules discarded 6230 transitions
Iterating global reduction 8 with 6230 rules applied. Total rules applied 8029 place count 34 transition count 2274
Applied a total of 8029 rules in 13741 ms. Remains 34 /870 variables (removed 836) and now considering 2274/14327 (removed 12053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13742 ms. Remains : 34/870 places, 2274/14327 transitions.
RANDOM walk for 30212 steps (1862 resets) in 858 ms. (35 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F p1)]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 724 reset in 671 ms.
Product exploration explored 100000 steps with 725 reset in 704 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 877 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 505 rules applied. Total rules applied 506 place count 758 transition count 14199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 514 place count 758 transition count 14191
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 514 place count 758 transition count 14199
Deduced a syphon composed of 521 places in 6 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 530 place count 758 transition count 14199
Discarding 430 places :
Symmetric choice reduction at 2 with 430 rule applications. Total rules 960 place count 328 transition count 13769
Deduced a syphon composed of 98 places in 6 ms
Iterating global reduction 2 with 430 rules applied. Total rules applied 1390 place count 328 transition count 13769
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 4 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 1455 place count 328 transition count 13769
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1532 place count 251 transition count 9055
Deduced a syphon composed of 106 places in 2 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1609 place count 251 transition count 9055
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1613 place count 251 transition count 9051
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1633 place count 231 transition count 9023
Deduced a syphon composed of 94 places in 2 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 1653 place count 231 transition count 9023
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1661 place count 223 transition count 9015
Deduced a syphon composed of 94 places in 2 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1669 place count 223 transition count 9015
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 105 places in 2 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1680 place count 223 transition count 9068
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1699 place count 204 transition count 9030
Deduced a syphon composed of 86 places in 2 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 1718 place count 204 transition count 9030
Deduced a syphon composed of 86 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 1738 place count 204 transition count 9010
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 87 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1739 place count 204 transition count 9023
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1740 place count 203 transition count 9021
Deduced a syphon composed of 86 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1741 place count 203 transition count 9021
Deduced a syphon composed of 86 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1745 place count 203 transition count 9017
Deduced a syphon composed of 86 places in 2 ms
Applied a total of 1745 rules in 4238 ms. Remains 203 /870 variables (removed 667) and now considering 9017/14327 (removed 5310) transitions.
[2024-05-29 20:51:28] [INFO ] Redundant transitions in 1638 ms returned []
Running 9013 sub problems to find dead transitions.
[2024-05-29 20:51:29] [INFO ] Flow matrix only has 9008 transitions (discarded 9 similar events)
// Phase 1: matrix 9008 rows 203 cols
[2024-05-29 20:51:29] [INFO ] Computed 2 invariants in 70 ms
[2024-05-29 20:51:30] [INFO ] State equation strengthened by 263 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/9211 variables, and 0 constraints, problems are : Problem set: 0 solved, 9013 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/203 constraints, ReadFeed: 0/263 constraints, PredecessorRefiner: 9013/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9013 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/9211 variables, and 0 constraints, problems are : Problem set: 0 solved, 9013 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/203 constraints, ReadFeed: 0/263 constraints, PredecessorRefiner: 8821/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 183804ms problems are : Problem set: 0 solved, 9013 unsolved
Search for dead transitions found 0 dead transitions in 183881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 203/870 places, 9017/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189784 ms. Remains : 203/870 places, 9017/14327 transitions.
Built C files in :
/tmp/ltsmin9330315945322712030
[2024-05-29 20:54:33] [INFO ] Built C files in 253ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9330315945322712030
Running compilation step : cd /tmp/ltsmin9330315945322712030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin9330315945322712030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin9330315945322712030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 78 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2024-05-29 20:54:36] [INFO ] Computed 9 invariants in 215 ms
[2024-05-29 20:54:39] [INFO ] Implicit Places using invariants in 2937 ms returned []
Implicit Place search using SMT only with invariants took 2938 ms to find 0 implicit places.
Running 14326 sub problems to find dead transitions.
[2024-05-29 20:54:39] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30173 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 14326/1156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/15197 variables, and 0 constraints, problems are : Problem set: 0 solved, 14326 unsolved in 30159 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 13170/1156 constraints, Known Traps: 0/0 constraints]
After SMT, in 251298ms problems are : Problem set: 0 solved, 14326 unsolved
Search for dead transitions found 0 dead transitions in 251423ms
Finished structural reductions in LTL mode , in 1 iterations and 254467 ms. Remains : 870/870 places, 14327/14327 transitions.
Built C files in :
/tmp/ltsmin16984890869723686077
[2024-05-29 20:58:50] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16984890869723686077
Running compilation step : cd /tmp/ltsmin16984890869723686077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16984890869723686077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16984890869723686077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-29 20:58:55] [INFO ] Flatten gal took : 1015 ms
[2024-05-29 20:58:56] [INFO ] Flatten gal took : 1032 ms
[2024-05-29 20:58:56] [INFO ] Time to serialize gal into /tmp/LTL15547194471109208267.gal : 195 ms
[2024-05-29 20:58:56] [INFO ] Time to serialize properties into /tmp/LTL4618647178855822484.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15547194471109208267.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5231044785695204504.hoa' '-atoms' '/tmp/LTL4618647178855822484.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4618647178855822484.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5231044785695204504.hoa
Detected timeout of ITS tools.
[2024-05-29 20:59:14] [INFO ] Flatten gal took : 1009 ms
[2024-05-29 20:59:15] [INFO ] Flatten gal took : 1022 ms
[2024-05-29 20:59:15] [INFO ] Time to serialize gal into /tmp/LTL7314050715623795103.gal : 187 ms
[2024-05-29 20:59:15] [INFO ] Time to serialize properties into /tmp/LTL13988269424137691288.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7314050715623795103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13988269424137691288.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((p90==1)&&(p238==1))&&((p360==1)&&(p495==1)))&&(((p630==1)&&(p765==1))&&((p913==1)&&(p1035==1))))"))||(G("((((p56==0)||(p...351
Formula 0 simplified : X(!"((((p31==1)&&(p178==1))&&((p301==1)&&(p436==1)))&&(((p596==1)&&(p706==1))&&((p853==1)&&(p988==1))))" & G!"((((p90==1)&&(p238==1)...341
Detected timeout of ITS tools.
[2024-05-29 20:59:31] [INFO ] Flatten gal took : 998 ms
[2024-05-29 20:59:31] [INFO ] Applying decomposition
[2024-05-29 20:59:32] [INFO ] Flatten gal took : 1012 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15711059287885985212.txt' '-o' '/tmp/graph15711059287885985212.bin' '-w' '/tmp/graph15711059287885985212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15711059287885985212.bin' '-l' '-1' '-v' '-w' '/tmp/graph15711059287885985212.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:59:35] [INFO ] Decomposing Gal with order
[2024-05-29 20:59:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:59:38] [INFO ] Removed a total of 107157 redundant transitions.
[2024-05-29 20:59:38] [INFO ] Flatten gal took : 1782 ms
[2024-05-29 20:59:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 393 ms.
[2024-05-29 20:59:38] [INFO ] Time to serialize gal into /tmp/LTL7011103302816096199.gal : 90 ms
[2024-05-29 20:59:38] [INFO ] Time to serialize properties into /tmp/LTL8884641658458146922.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7011103302816096199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8884641658458146922.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((i20.u5.p90==1)&&(i20.u63.p238==1))&&((i20.u93.p360==1)&&(i4.u140.p495==1)))&&(((i4.u197.p630==1)&&(i4.u230.p765==1))&&((...545
Formula 0 simplified : X(!"((((i1.u10.p31==1)&&(i4.u48.p178==1))&&((i1.u100.p301==1)&&(i1.u147.p436==1)))&&(((i20.u186.p596==1)&&(i1.u237.p706==1))&&((i4.u...535
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-08b-LTLFireability-12 finished in 1076994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 885 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 757 transition count 13685
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 529 rules applied. Total rules applied 1043 place count 244 transition count 13669
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1051 place count 236 transition count 13669
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1051 place count 236 transition count 13636
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1117 place count 203 transition count 13636
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1124 place count 196 transition count 13629
Iterating global reduction 3 with 7 rules applied. Total rules applied 1131 place count 196 transition count 13629
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1209 place count 157 transition count 13590
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1237 place count 129 transition count 1996
Iterating global reduction 3 with 28 rules applied. Total rules applied 1265 place count 129 transition count 1996
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1277 place count 129 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1285 place count 121 transition count 1968
Iterating global reduction 4 with 8 rules applied. Total rules applied 1293 place count 121 transition count 1968
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1301 place count 113 transition count 1952
Iterating global reduction 4 with 8 rules applied. Total rules applied 1309 place count 113 transition count 1952
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1333 place count 101 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1334 place count 100 transition count 1943
Iterating global reduction 4 with 1 rules applied. Total rules applied 1335 place count 100 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1336 place count 100 transition count 1942
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1344 place count 100 transition count 1934
Applied a total of 1344 rules in 1679 ms. Remains 100 /870 variables (removed 770) and now considering 1934/14327 (removed 12393) transitions.
[2024-05-29 20:59:55] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
// Phase 1: matrix 1925 rows 100 cols
[2024-05-29 20:59:55] [INFO ] Computed 2 invariants in 21 ms
[2024-05-29 20:59:56] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-29 20:59:56] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2024-05-29 20:59:56] [INFO ] Invariant cache hit.
[2024-05-29 20:59:56] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:59:57] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2024-05-29 20:59:57] [INFO ] Redundant transitions in 56 ms returned []
Running 1917 sub problems to find dead transitions.
[2024-05-29 20:59:57] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2024-05-29 20:59:57] [INFO ] Invariant cache hit.
[2024-05-29 20:59:58] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
[2024-05-29 21:00:31] [INFO ] Deduced a trap composed of 14 places in 674 ms of which 1 ms to minimize.
[2024-05-29 21:00:32] [INFO ] Deduced a trap composed of 14 places in 646 ms of which 1 ms to minimize.
[2024-05-29 21:00:32] [INFO ] Deduced a trap composed of 14 places in 633 ms of which 1 ms to minimize.
[2024-05-29 21:00:33] [INFO ] Deduced a trap composed of 14 places in 621 ms of which 1 ms to minimize.
[2024-05-29 21:00:34] [INFO ] Deduced a trap composed of 21 places in 638 ms of which 2 ms to minimize.
[2024-05-29 21:00:34] [INFO ] Deduced a trap composed of 22 places in 590 ms of which 1 ms to minimize.
[2024-05-29 21:00:35] [INFO ] Deduced a trap composed of 22 places in 587 ms of which 1 ms to minimize.
[2024-05-29 21:00:36] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2024-05-29 21:00:36] [INFO ] Deduced a trap composed of 14 places in 581 ms of which 1 ms to minimize.
[2024-05-29 21:00:37] [INFO ] Deduced a trap composed of 22 places in 592 ms of which 0 ms to minimize.
[2024-05-29 21:00:41] [INFO ] Deduced a trap composed of 15 places in 527 ms of which 1 ms to minimize.
[2024-05-29 21:00:42] [INFO ] Deduced a trap composed of 14 places in 520 ms of which 1 ms to minimize.
[2024-05-29 21:00:49] [INFO ] Deduced a trap composed of 21 places in 441 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/2025 variables, and 15 constraints, problems are : Problem set: 0 solved, 1917 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1917/348 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1917 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
[2024-05-29 21:01:11] [INFO ] Deduced a trap composed of 23 places in 456 ms of which 0 ms to minimize.
[2024-05-29 21:01:12] [INFO ] Deduced a trap composed of 23 places in 474 ms of which 1 ms to minimize.
[2024-05-29 21:01:12] [INFO ] Deduced a trap composed of 22 places in 453 ms of which 1 ms to minimize.
[2024-05-29 21:01:13] [INFO ] Deduced a trap composed of 22 places in 589 ms of which 0 ms to minimize.
[2024-05-29 21:01:14] [INFO ] Deduced a trap composed of 23 places in 573 ms of which 1 ms to minimize.
[2024-05-29 21:01:14] [INFO ] Deduced a trap composed of 22 places in 568 ms of which 2 ms to minimize.
[2024-05-29 21:01:15] [INFO ] Deduced a trap composed of 25 places in 546 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
[2024-05-29 21:01:16] [INFO ] Deduced a trap composed of 26 places in 620 ms of which 0 ms to minimize.
[2024-05-29 21:01:16] [INFO ] Deduced a trap composed of 22 places in 604 ms of which 1 ms to minimize.
[2024-05-29 21:01:17] [INFO ] Deduced a trap composed of 22 places in 562 ms of which 1 ms to minimize.
[2024-05-29 21:01:18] [INFO ] Deduced a trap composed of 22 places in 604 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/2025 variables, and 26 constraints, problems are : Problem set: 0 solved, 1917 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1569/348 constraints, Known Traps: 24/24 constraints]
After SMT, in 83608ms problems are : Problem set: 0 solved, 1917 unsolved
Search for dead transitions found 0 dead transitions in 83625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/870 places, 1934/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87545 ms. Remains : 100/870 places, 1934/14327 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-13
Product exploration explored 100000 steps with 6594 reset in 457 ms.
Product exploration explored 100000 steps with 6586 reset in 465 ms.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 123 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2650 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (198 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 570995 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 570995 steps, saw 141412 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-29 21:01:25] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2024-05-29 21:01:25] [INFO ] Invariant cache hit.
[2024-05-29 21:01:26] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1923/2021 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2021 variables, 254/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2021 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/2024 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2024 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2024 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/2025 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2025 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2025 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1923/2021 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2021 variables, 254/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2021 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/2024 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2024 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2024 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/2025 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2025 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2025 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2830ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 1934/1934 transitions.
Applied a total of 0 rules in 113 ms. Remains 100 /100 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2024-05-29 21:01:28] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2024-05-29 21:01:28] [INFO ] Invariant cache hit.
[2024-05-29 21:01:29] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-29 21:01:29] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2024-05-29 21:01:29] [INFO ] Invariant cache hit.
[2024-05-29 21:01:29] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 21:01:31] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2024-05-29 21:01:31] [INFO ] Redundant transitions in 58 ms returned []
Running 1917 sub problems to find dead transitions.
[2024-05-29 21:01:31] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2024-05-29 21:01:31] [INFO ] Invariant cache hit.
[2024-05-29 21:01:31] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
[2024-05-29 21:02:06] [INFO ] Deduced a trap composed of 14 places in 677 ms of which 1 ms to minimize.
[2024-05-29 21:02:07] [INFO ] Deduced a trap composed of 14 places in 645 ms of which 1 ms to minimize.
[2024-05-29 21:02:07] [INFO ] Deduced a trap composed of 14 places in 633 ms of which 1 ms to minimize.
[2024-05-29 21:02:08] [INFO ] Deduced a trap composed of 14 places in 618 ms of which 1 ms to minimize.
[2024-05-29 21:02:09] [INFO ] Deduced a trap composed of 21 places in 610 ms of which 1 ms to minimize.
[2024-05-29 21:02:09] [INFO ] Deduced a trap composed of 22 places in 603 ms of which 0 ms to minimize.
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 22 places in 591 ms of which 1 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 13 places in 592 ms of which 1 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 14 places in 595 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 22 places in 581 ms of which 1 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 15 places in 511 ms of which 1 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 14 places in 493 ms of which 1 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 21 places in 434 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/2025 variables, and 15 constraints, problems are : Problem set: 0 solved, 1917 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1917/348 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1917 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="StigmergyElection-PT-08b"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-08b, 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 r400-tall-171690532100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08b.tgz
mv StigmergyElection-PT-08b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;