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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 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 3.4M 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-07b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717247699122

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:15:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:15:00] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2024-06-01 13:15:00] [INFO ] Transformed 971 places.
[2024-06-01 13:15:00] [INFO ] Transformed 5542 transitions.
[2024-06-01 13:15:00] [INFO ] Found NUPN structural information;
[2024-06-01 13:15:00] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyElection-PT-07b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 971 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 849 transition count 5420
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 849 transition count 5420
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 309 place count 784 transition count 5355
Iterating global reduction 0 with 65 rules applied. Total rules applied 374 place count 784 transition count 5355
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 388 place count 770 transition count 5341
Iterating global reduction 0 with 14 rules applied. Total rules applied 402 place count 770 transition count 5341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 409 place count 763 transition count 5334
Iterating global reduction 0 with 7 rules applied. Total rules applied 416 place count 763 transition count 5334
Applied a total of 416 rules in 350 ms. Remains 763 /971 variables (removed 208) and now considering 5334/5542 (removed 208) transitions.
// Phase 1: matrix 5334 rows 763 cols
[2024-06-01 13:15:01] [INFO ] Computed 8 invariants in 140 ms
[2024-06-01 13:15:01] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-06-01 13:15:01] [INFO ] Invariant cache hit.
[2024-06-01 13:15:03] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-06-01 13:15:03] [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 timeout
1.0)
(s664 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 118939ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 119022ms
Starting structural reductions in LTL mode, iteration 1 : 763/971 places, 5334/5542 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121493 ms. Remains : 763/971 places, 5334/5542 transitions.
Support contains 43 out of 763 places after structural reductions.
[2024-06-01 13:17:03] [INFO ] Flatten gal took : 595 ms
[2024-06-01 13:17:03] [INFO ] Flatten gal took : 411 ms
[2024-06-01 13:17:04] [INFO ] Input system was already deterministic with 5334 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (331 resets) in 2107 ms. (18 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 163295 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 18
Probabilistic random walk after 163295 steps, saw 31588 distinct states, run finished after 3005 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 13:17:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 707/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 707/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 772 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10449ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 740 edges and 763 vertex of which 118 / 763 are part of one of the 21 SCC in 9 ms
Free SCC test removed 97 places
Drop transitions (Empty/Sink Transition effects.) removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Graph (complete) has 1761 edges and 666 vertex of which 659 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.35 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 436 rules applied. Total rules applied 438 place count 659 transition count 4767
Reduce places removed 429 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 443 rules applied. Total rules applied 881 place count 230 transition count 4753
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 888 place count 223 transition count 4753
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 888 place count 223 transition count 4717
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 960 place count 187 transition count 4717
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 961 place count 187 transition count 4716
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1033 place count 151 transition count 4680
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1046 place count 151 transition count 4667
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1060 place count 137 transition count 4640
Iterating global reduction 5 with 14 rules applied. Total rules applied 1074 place count 137 transition count 4640
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1075 place count 137 transition count 4639
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1081 place count 131 transition count 4633
Iterating global reduction 6 with 6 rules applied. Total rules applied 1087 place count 131 transition count 4633
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 1103 place count 123 transition count 4625
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 1109 place count 120 transition count 4633
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1118 place count 120 transition count 4624
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 1120 place count 119 transition count 4630
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 1128 place count 119 transition count 4622
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 1130 place count 118 transition count 4628
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 1138 place count 118 transition count 4620
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 1140 place count 117 transition count 4626
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 1148 place count 117 transition count 4618
Free-agglomeration rule applied 50 times.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1198 place count 117 transition count 4568
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 1248 place count 67 transition count 4568
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1255 place count 60 transition count 4561
Iterating global reduction 7 with 7 rules applied. Total rules applied 1262 place count 60 transition count 4561
Applied a total of 1262 rules in 2168 ms. Remains 60 /763 variables (removed 703) and now considering 4561/5334 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2170 ms. Remains : 60/763 places, 4561/5334 transitions.
RANDOM walk for 40000 steps (2819 resets) in 1849 ms. (21 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 1/3 properties
BEST_FIRST walk for 436 steps (0 resets) in 6 ms. (62 steps per ms) remains 0/1 properties
Computed a total of 105 stabilizing places and 112 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(p0) U (p0||X(X(F(p0)))))))'
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 70 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-06-01 13:17:22] [INFO ] Invariant cache hit.
[2024-06-01 13:17:23] [INFO ] Implicit Places using invariants in 1379 ms returned []
[2024-06-01 13:17:23] [INFO ] Invariant cache hit.
[2024-06-01 13:17:26] [INFO ] Implicit Places using invariants and state equation in 2931 ms returned []
Implicit Place search using SMT with State Equation took 4314 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-06-01 13:17:26] [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 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120988ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 121049ms
Finished structural reductions in LTL mode , in 1 iterations and 125460 ms. Remains : 763/763 places, 5334/5334 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-00
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07b-LTLFireability-00 finished in 125754 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((X(p1)||p0))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 47 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-06-01 13:19:28] [INFO ] Invariant cache hit.
[2024-06-01 13:19:29] [INFO ] Implicit Places using invariants in 1403 ms returned []
[2024-06-01 13:19:29] [INFO ] Invariant cache hit.
[2024-06-01 13:19:31] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 3958 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-06-01 13:19:32] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 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 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120980ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 121033ms
Finished structural reductions in LTL mode , in 1 iterations and 125051 ms. Remains : 763/763 places, 5334/5334 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-01
Product exploration explored 100000 steps with 825 reset in 426 ms.
Product exploration explored 100000 steps with 822 reset in 440 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (326 resets) in 550 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (47 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (44 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 403 ms. (99 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 160130 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 3
Probabilistic random walk after 160130 steps, saw 31000 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 13:21:38] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1896 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4141ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 140 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 2 properties in 13 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 38 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-06-01 13:21:42] [INFO ] Invariant cache hit.
[2024-06-01 13:21:43] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2024-06-01 13:21:43] [INFO ] Invariant cache hit.
[2024-06-01 13:21:46] [INFO ] Implicit Places using invariants and state equation in 2631 ms returned []
Implicit Place search using SMT with State Equation took 3947 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-06-01 13:21:46] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 121032ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 121079ms
Finished structural reductions in LTL mode , in 1 iterations and 125112 ms. Remains : 763/763 places, 5334/5334 transitions.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40000 steps (325 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (46 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 192699 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 192699 steps, saw 36645 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-06-01 13:23:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 742/749 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/763 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3066ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 776 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 2 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 1759 edges and 665 vertex of which 658 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 464 transitions
Trivial Post-agglo rules discarded 464 transitions
Performed 464 trivial Post agglomeration. Transition count delta: 464
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 658 transition count 4730
Reduce places removed 464 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 478 rules applied. Total rules applied 951 place count 194 transition count 4716
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 958 place count 187 transition count 4716
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 958 place count 187 transition count 4680
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1030 place count 151 transition count 4680
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 1031 place count 151 transition count 4679
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1103 place count 115 transition count 4643
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1117 place count 115 transition count 4629
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1140 place count 92 transition count 1813
Iterating global reduction 5 with 23 rules applied. Total rules applied 1163 place count 92 transition count 1813
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1172 place count 92 transition count 1804
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1179 place count 85 transition count 1797
Iterating global reduction 6 with 7 rules applied. Total rules applied 1186 place count 85 transition count 1797
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1200 place count 78 transition count 1790
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 1206 place count 75 transition count 1798
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 1214 place count 75 transition count 1790
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 1216 place count 74 transition count 1796
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 1224 place count 74 transition count 1788
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 1226 place count 73 transition count 1794
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 1234 place count 73 transition count 1786
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 1236 place count 72 transition count 1792
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 1244 place count 72 transition count 1784
Free-agglomeration rule applied 42 times.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1286 place count 72 transition count 1742
Reduce places removed 42 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 107 rules applied. Total rules applied 1393 place count 30 transition count 1677
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1400 place count 23 transition count 1670
Iterating global reduction 7 with 7 rules applied. Total rules applied 1407 place count 23 transition count 1670
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 7 with 127 rules applied. Total rules applied 1534 place count 23 transition count 1543
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 2136 place count 23 transition count 941
Applied a total of 2136 rules in 1358 ms. Remains 23 /763 variables (removed 740) and now considering 941/5334 (removed 4393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1359 ms. Remains : 23/763 places, 941/5334 transitions.
RANDOM walk for 150 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 822 reset in 294 ms.
Product exploration explored 100000 steps with 822 reset in 304 ms.
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 40 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-06-01 13:23:57] [INFO ] Invariant cache hit.
[2024-06-01 13:23:58] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2024-06-01 13:23:58] [INFO ] Invariant cache hit.
[2024-06-01 13:24:00] [INFO ] Implicit Places using invariants and state equation in 2562 ms returned []
Implicit Place search using SMT with State Equation took 3623 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-06-01 13:24:00] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120503ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120552ms
Finished structural reductions in LTL mode , in 1 iterations and 124228 ms. Remains : 763/763 places, 5334/5334 transitions.
Treatment of property StigmergyElection-PT-07b-LTLFireability-01 finished in 394220 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 U p1)))'
Support contains 14 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 38 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-06-01 13:26:02] [INFO ] Invariant cache hit.
[2024-06-01 13:26:03] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-06-01 13:26:03] [INFO ] Invariant cache hit.
[2024-06-01 13:26:05] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 3346 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-06-01 13:26:05] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 119355ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 119405ms
Finished structural reductions in LTL mode , in 1 iterations and 122807 ms. Remains : 763/763 places, 5334/5334 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07b-LTLFireability-02 finished in 122933 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((F(p1)||p0))))'
Support contains 12 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 771 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 446 place count 664 transition count 4776
Reduce places removed 445 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 459 rules applied. Total rules applied 905 place count 219 transition count 4762
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 912 place count 212 transition count 4762
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 912 place count 212 transition count 4733
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 970 place count 183 transition count 4733
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 976 place count 177 transition count 4727
Iterating global reduction 3 with 6 rules applied. Total rules applied 982 place count 177 transition count 4727
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1050 place count 143 transition count 4693
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1071 place count 122 transition count 2613
Iterating global reduction 3 with 21 rules applied. Total rules applied 1092 place count 122 transition count 2613
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1099 place count 122 transition count 2606
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1106 place count 115 transition count 2592
Iterating global reduction 4 with 7 rules applied. Total rules applied 1113 place count 115 transition count 2592
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1120 place count 108 transition count 2578
Iterating global reduction 4 with 7 rules applied. Total rules applied 1127 place count 108 transition count 2578
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1149 place count 97 transition count 2585
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1150 place count 96 transition count 2571
Iterating global reduction 4 with 1 rules applied. Total rules applied 1151 place count 96 transition count 2571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1152 place count 96 transition count 2570
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1159 place count 96 transition count 2563
Applied a total of 1159 rules in 1082 ms. Remains 96 /763 variables (removed 667) and now considering 2563/5334 (removed 2771) transitions.
[2024-06-01 13:28:06] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
// Phase 1: matrix 2555 rows 96 cols
[2024-06-01 13:28:06] [INFO ] Computed 2 invariants in 35 ms
[2024-06-01 13:28:06] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-06-01 13:28:06] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
[2024-06-01 13:28:06] [INFO ] Invariant cache hit.
[2024-06-01 13:28:07] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-06-01 13:28:08] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
[2024-06-01 13:28:08] [INFO ] Redundant transitions in 158 ms returned []
Running 2546 sub problems to find dead transitions.
[2024-06-01 13:28:08] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
[2024-06-01 13:28:08] [INFO ] Invariant cache hit.
[2024-06-01 13:28:08] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
[2024-06-01 13:28:58] [INFO ] Deduced a trap composed of 20 places in 1198 ms of which 6 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 24 places in 1004 ms of which 2 ms to minimize.
[2024-06-01 13:29:01] [INFO ] Deduced a trap composed of 29 places in 1377 ms of which 2 ms to minimize.
[2024-06-01 13:29:01] [INFO ] Deduced a trap composed of 15 places in 821 ms of which 1 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 15 places in 915 ms of which 2 ms to minimize.
[2024-06-01 13:29:03] [INFO ] Deduced a trap composed of 19 places in 910 ms of which 1 ms to minimize.
[2024-06-01 13:29:04] [INFO ] Deduced a trap composed of 14 places in 893 ms of which 1 ms to minimize.
[2024-06-01 13:29:05] [INFO ] Deduced a trap composed of 23 places in 797 ms of which 2 ms to minimize.
[2024-06-01 13:29:06] [INFO ] Deduced a trap composed of 16 places in 731 ms of which 1 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 21 places in 782 ms of which 1 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 23 places in 746 ms of which 1 ms to minimize.
[2024-06-01 13:29:08] [INFO ] Deduced a trap composed of 15 places in 698 ms of which 1 ms to minimize.
[2024-06-01 13:29:09] [INFO ] Deduced a trap composed of 31 places in 829 ms of which 1 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 15 places in 735 ms of which 1 ms to minimize.
[2024-06-01 13:29:11] [INFO ] Deduced a trap composed of 23 places in 863 ms of which 1 ms to minimize.
[2024-06-01 13:29:11] [INFO ] Deduced a trap composed of 16 places in 807 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 96/2651 variables, and 18 constraints, problems are : Problem set: 0 solved, 2546 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/96 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2546/190 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
[2024-06-01 13:29:44] [INFO ] Deduced a trap composed of 23 places in 822 ms of which 1 ms to minimize.
SMT process timed out in 96018ms, After SMT, problems are : Problem set: 0 solved, 2546 unsolved
Search for dead transitions found 0 dead transitions in 96041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/763 places, 2563/5334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99388 ms. Remains : 96/763 places, 2563/5334 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-03
Product exploration explored 100000 steps with 7258 reset in 698 ms.
Product exploration explored 100000 steps with 7274 reset in 615 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2904 resets) in 1225 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (230 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (244 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (239 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (230 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 313519 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 4
Probabilistic random walk after 313519 steps, saw 67370 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-01 13:29:49] [INFO ] Flow matrix only has 2555 transitions (discarded 8 similar events)
[2024-06-01 13:29:49] [INFO ] Invariant cache hit.
[2024-06-01 13:29:49] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/94 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2553/2647 variables, 94/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2647 variables, 126/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2647 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/2650 variables, 2/223 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2650 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2650 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/2651 variables, 1/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2651/2651 variables, and 225 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/94 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2553/2647 variables, 94/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2647 variables, 126/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2647 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/2650 variables, 2/223 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2650 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2650 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/2651 variables, 1/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2651 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2651/2651 variables, and 225 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4682ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 3 properties in 18 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07b-LTLFireability-03 finished in 109117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 11 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 772 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 446 transitions
Trivial Post-agglo rules discarded 446 transitions
Performed 446 trivial Post agglomeration. Transition count delta: 446
Iterating post reduction 0 with 446 rules applied. Total rules applied 447 place count 664 transition count 4775
Reduce places removed 446 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 460 rules applied. Total rules applied 907 place count 218 transition count 4761
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 914 place count 211 transition count 4761
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 914 place count 211 transition count 4732
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 972 place count 182 transition count 4732
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 978 place count 176 transition count 4726
Iterating global reduction 3 with 6 rules applied. Total rules applied 984 place count 176 transition count 4726
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1052 place count 142 transition count 4692
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1074 place count 120 transition count 1883
Iterating global reduction 3 with 22 rules applied. Total rules applied 1096 place count 120 transition count 1883
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1104 place count 120 transition count 1875
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1111 place count 113 transition count 1861
Iterating global reduction 4 with 7 rules applied. Total rules applied 1118 place count 113 transition count 1861
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1125 place count 106 transition count 1847
Iterating global reduction 4 with 7 rules applied. Total rules applied 1132 place count 106 transition count 1847
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1154 place count 95 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1155 place count 94 transition count 1840
Iterating global reduction 4 with 1 rules applied. Total rules applied 1156 place count 94 transition count 1840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1157 place count 94 transition count 1839
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1164 place count 94 transition count 1832
Applied a total of 1164 rules in 501 ms. Remains 94 /763 variables (removed 669) and now considering 1832/5334 (removed 3502) transitions.
[2024-06-01 13:29:54] [INFO ] Flow matrix only has 1824 transitions (discarded 8 similar events)
// Phase 1: matrix 1824 rows 94 cols
[2024-06-01 13:29:54] [INFO ] Computed 2 invariants in 24 ms
[2024-06-01 13:29:55] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 13:29:55] [INFO ] Flow matrix only has 1824 transitions (discarded 8 similar events)
[2024-06-01 13:29:55] [INFO ] Invariant cache hit.
[2024-06-01 13:29:55] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-06-01 13:29:56] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2024-06-01 13:29:56] [INFO ] Redundant transitions in 97 ms returned []
Running 1815 sub problems to find dead transitions.
[2024-06-01 13:29:56] [INFO ] Flow matrix only has 1824 transitions (discarded 8 similar events)
[2024-06-01 13:29:56] [INFO ] Invariant cache hit.
[2024-06-01 13:29:56] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
[2024-06-01 13:30:29] [INFO ] Deduced a trap composed of 22 places in 616 ms of which 1 ms to minimize.
[2024-06-01 13:30:29] [INFO ] Deduced a trap composed of 22 places in 630 ms of which 1 ms to minimize.
[2024-06-01 13:30:30] [INFO ] Deduced a trap composed of 23 places in 591 ms of which 1 ms to minimize.
[2024-06-01 13:30:30] [INFO ] Deduced a trap composed of 15 places in 579 ms of which 1 ms to minimize.
[2024-06-01 13:30:31] [INFO ] Deduced a trap composed of 29 places in 574 ms of which 1 ms to minimize.
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 38 places in 616 ms of which 1 ms to minimize.
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 17 places in 586 ms of which 1 ms to minimize.
[2024-06-01 13:30:33] [INFO ] Deduced a trap composed of 16 places in 551 ms of which 0 ms to minimize.
[2024-06-01 13:30:33] [INFO ] Deduced a trap composed of 19 places in 503 ms of which 1 ms to minimize.
[2024-06-01 13:30:34] [INFO ] Deduced a trap composed of 15 places in 555 ms of which 3 ms to minimize.
[2024-06-01 13:30:34] [INFO ] Deduced a trap composed of 17 places in 566 ms of which 1 ms to minimize.
[2024-06-01 13:30:35] [INFO ] Deduced a trap composed of 26 places in 481 ms of which 1 ms to minimize.
[2024-06-01 13:30:36] [INFO ] Deduced a trap composed of 22 places in 603 ms of which 1 ms to minimize.
[2024-06-01 13:30:36] [INFO ] Deduced a trap composed of 18 places in 537 ms of which 1 ms to minimize.
[2024-06-01 13:30:37] [INFO ] Deduced a trap composed of 16 places in 578 ms of which 1 ms to minimize.
[2024-06-01 13:30:37] [INFO ] Deduced a trap composed of 15 places in 582 ms of which 1 ms to minimize.
[2024-06-01 13:30:38] [INFO ] Deduced a trap composed of 22 places in 569 ms of which 1 ms to minimize.
[2024-06-01 13:30:38] [INFO ] Deduced a trap composed of 24 places in 528 ms of which 2 ms to minimize.
[2024-06-01 13:30:39] [INFO ] Deduced a trap composed of 23 places in 531 ms of which 0 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 23 places in 532 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
[2024-06-01 13:30:45] [INFO ] Deduced a trap composed of 21 places in 542 ms of which 1 ms to minimize.
[2024-06-01 13:30:45] [INFO ] Deduced a trap composed of 14 places in 502 ms of which 1 ms to minimize.
[2024-06-01 13:30:46] [INFO ] Deduced a trap composed of 23 places in 540 ms of which 2 ms to minimize.
[2024-06-01 13:30:48] [INFO ] Deduced a trap composed of 13 places in 517 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/1918 variables, and 26 constraints, problems are : Problem set: 0 solved, 1815 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/94 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1815/195 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1815 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
[2024-06-01 13:30:56] [INFO ] Deduced a trap composed of 22 places in 527 ms of which 1 ms to minimize.
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 24 places in 562 ms of which 1 ms to minimize.
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 24 places in 521 ms of which 1 ms to minimize.
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 25 places in 488 ms of which 1 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 94/1918 variables, and 31 constraints, problems are : Problem set: 0 solved, 1815 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/94 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1620/195 constraints, Known Traps: 29/29 constraints]
After SMT, in 84000ms problems are : Problem set: 0 solved, 1815 unsolved
Search for dead transitions found 0 dead transitions in 84021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/763 places, 1832/5334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86238 ms. Remains : 94/763 places, 1832/5334 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-04
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07b-LTLFireability-04 finished in 86366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 776 edges and 763 vertex of which 119 / 763 are part of one of the 21 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 450 transitions
Trivial Post-agglo rules discarded 450 transitions
Performed 450 trivial Post agglomeration. Transition count delta: 450
Iterating post reduction 0 with 450 rules applied. Total rules applied 451 place count 664 transition count 4771
Reduce places removed 450 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 464 rules applied. Total rules applied 915 place count 214 transition count 4757
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 922 place count 207 transition count 4757
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 922 place count 207 transition count 4728
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 980 place count 178 transition count 4728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 986 place count 172 transition count 4722
Iterating global reduction 3 with 6 rules applied. Total rules applied 992 place count 172 transition count 4722
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1060 place count 138 transition count 4688
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1083 place count 115 transition count 1393
Iterating global reduction 3 with 23 rules applied. Total rules applied 1106 place count 115 transition count 1393
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1115 place count 115 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1122 place count 108 transition count 1370
Iterating global reduction 4 with 7 rules applied. Total rules applied 1129 place count 108 transition count 1370
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1136 place count 101 transition count 1356
Iterating global reduction 4 with 7 rules applied. Total rules applied 1143 place count 101 transition count 1356
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1165 place count 90 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1166 place count 89 transition count 1349
Iterating global reduction 4 with 1 rules applied. Total rules applied 1167 place count 89 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1168 place count 89 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1175 place count 89 transition count 1341
Applied a total of 1175 rules in 399 ms. Remains 89 /763 variables (removed 674) and now considering 1341/5334 (removed 3993) transitions.
[2024-06-01 13:31:21] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
// Phase 1: matrix 1333 rows 89 cols
[2024-06-01 13:31:21] [INFO ] Computed 2 invariants in 19 ms
[2024-06-01 13:31:21] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 13:31:21] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:31:21] [INFO ] Invariant cache hit.
[2024-06-01 13:31:21] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-06-01 13:31:22] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2024-06-01 13:31:22] [INFO ] Redundant transitions in 25 ms returned []
Running 1324 sub problems to find dead transitions.
[2024-06-01 13:31:22] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:31:22] [INFO ] Invariant cache hit.
[2024-06-01 13:31:22] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 1 ms to minimize.
[2024-06-01 13:31:51] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 0 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 20 places in 398 ms of which 1 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 19 places in 413 ms of which 2 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 15 places in 426 ms of which 0 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 15 places in 342 ms of which 1 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 1 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 1 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 7 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 21 places in 427 ms of which 1 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 1 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 1 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 1 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 1 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 22 places in 339 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 5 (OVERLAPS) 1332/1421 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
SMT process timed out in 52730ms, After SMT, problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 52744ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/763 places, 1341/5334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54263 ms. Remains : 89/763 places, 1341/5334 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLFireability-05
Product exploration explored 100000 steps with 7553 reset in 371 ms.
Product exploration explored 100000 steps with 7579 reset in 400 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3006 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (235 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 682507 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 1
Probabilistic random walk after 682507 steps, saw 157904 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
[2024-06-01 13:32:19] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:32:19] [INFO ] Invariant cache hit.
[2024-06-01 13:32:19] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1421 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1421 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1422 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1422/1422 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1418 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1421 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1421 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1422 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1422/1422 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1998ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
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 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1341/1341 transitions.
Applied a total of 0 rules in 69 ms. Remains 89 /89 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
[2024-06-01 13:32:21] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:32:21] [INFO ] Invariant cache hit.
[2024-06-01 13:32:21] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 13:32:21] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:32:21] [INFO ] Invariant cache hit.
[2024-06-01 13:32:21] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-06-01 13:32:22] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2024-06-01 13:32:22] [INFO ] Redundant transitions in 22 ms returned []
Running 1324 sub problems to find dead transitions.
[2024-06-01 13:32:22] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:32:22] [INFO ] Invariant cache hit.
[2024-06-01 13:32:22] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 14 places in 416 ms of which 1 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 19 places in 445 ms of which 1 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 20 places in 449 ms of which 0 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 1 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 1 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 0 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 15 places in 402 ms of which 1 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 15 places in 366 ms of which 1 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 15 places in 350 ms of which 0 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 1 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 14 places in 401 ms of which 1 ms to minimize.
[2024-06-01 13:33:03] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 1 ms to minimize.
[2024-06-01 13:33:03] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 1 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 23 places in 362 ms of which 1 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 1 ms to minimize.
[2024-06-01 13:33:05] [INFO ] Deduced a trap composed of 26 places in 371 ms of which 1 ms to minimize.
[2024-06-01 13:33:05] [INFO ] Deduced a trap composed of 22 places in 346 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 5 (OVERLAPS) 1332/1421 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
SMT process timed out in 53544ms, After SMT, problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 53559ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54734 ms. Remains : 89/89 places, 1341/1341 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3029 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (241 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667533 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667533 steps, saw 155149 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-06-01 13:33:19] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:33:19] [INFO ] Invariant cache hit.
[2024-06-01 13:33:19] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1421 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1421 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1422 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1422 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1422/1422 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1418 variables, 87/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1418 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1418 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1421 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1421 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1421 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1422 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1422 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1422/1422 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2027ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
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 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7577 reset in 374 ms.
Product exploration explored 100000 steps with 7584 reset in 377 ms.
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1341/1341 transitions.
Applied a total of 0 rules in 55 ms. Remains 89 /89 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
[2024-06-01 13:33:22] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:33:22] [INFO ] Invariant cache hit.
[2024-06-01 13:33:22] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 13:33:22] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:33:22] [INFO ] Invariant cache hit.
[2024-06-01 13:33:22] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-06-01 13:33:23] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2024-06-01 13:33:23] [INFO ] Redundant transitions in 19 ms returned []
Running 1324 sub problems to find dead transitions.
[2024-06-01 13:33:23] [INFO ] Flow matrix only has 1333 transitions (discarded 8 similar events)
[2024-06-01 13:33:23] [INFO ] Invariant cache hit.
[2024-06-01 13:33:23] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-06-01 13:33:52] [INFO ] Deduced a trap composed of 14 places in 428 ms of which 1 ms to minimize.
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 19 places in 424 ms of which 1 ms to minimize.
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 20 places in 433 ms of which 1 ms to minimize.
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 1 ms to minimize.
[2024-06-01 13:33:54] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 0 ms to minimize.
[2024-06-01 13:33:54] [INFO ] Deduced a trap composed of 13 places in 583 ms of which 1 ms to minimize.
[2024-06-01 13:33:55] [INFO ] Deduced a trap composed of 15 places in 434 ms of which 1 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 15 places in 402 ms of which 0 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 1 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 1 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 1 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 21 places in 459 ms of which 1 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 1 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 1 ms to minimize.
[2024-06-01 13:34:05] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 1 ms to minimize.
[2024-06-01 13:34:05] [INFO ] Deduced a trap composed of 26 places in 380 ms of which 1 ms to minimize.
[2024-06-01 13:34:06] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 5 (OVERLAPS) 1332/1421 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1421 variables, 126/234 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1421/1422 variables, and 234 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 1324/1205 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
FORMULA StigmergyElection-PT-07b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyElection-PT-07b-LTLFireability-01
FORMULA StigmergyElection-PT-07b-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyElection-PT-07b-LTLFireability-03
FORMULA StigmergyElection-PT-07b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyElection-PT-07b-LTLFireability-05
FORMULA StigmergyElection-PT-07b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-07b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-07b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-07b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyElection-PT-07b-LTLFireability-10
FORMULA StigmergyElection-PT-07b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyElection-PT-07b-LTLFireability-12
FORMULA StigmergyElection-PT-07b-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-07b-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-07b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717250009486

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-07b-LTLFireability-00
ltl formula formula --ltl=/tmp/1407/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.650 real 0.250 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5544 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~121!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 446
pnml2lts-mc( 0/ 4): unique transitions count: 2186
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 455
pnml2lts-mc( 0/ 4): - cum. max stack depth: 455
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 455 states 2206 transitions, fanout: 4.848
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5056, Transitions per second: 24511
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-01
ltl formula formula --ltl=/tmp/1407/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.240 user 0.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5548 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~129 levels ~10000 states ~29816 transitions
pnml2lts-mc( 2/ 4): ~129 levels ~20000 states ~64688 transitions
pnml2lts-mc( 1/ 4): ~147 levels ~40000 states ~100832 transitions
pnml2lts-mc( 1/ 4): ~147 levels ~80000 states ~219424 transitions
pnml2lts-mc( 1/ 4): ~147 levels ~160000 states ~456336 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~320000 states ~1083772 transitions
pnml2lts-mc( 1/ 4): ~147 levels ~640000 states ~2281388 transitions
pnml2lts-mc( 1/ 4): ~147 levels ~1280000 states ~4768056 transitions
ltl formula name StigmergyElection-PT-07b-LTLFireability-02
ltl formula formula --ltl=/tmp/1407/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.250 user 0.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5554 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~106!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 402
pnml2lts-mc( 0/ 4): unique transitions count: 2370
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 411
pnml2lts-mc( 0/ 4): - cum. max stack depth: 411
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 411 states 2393 transitions, fanout: 5.822
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.070 sec minimum, 0.072 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5138, Transitions per second: 29912
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-03
ltl formula formula --ltl=/tmp/1407/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.250 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 972 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5548 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~120 levels ~10000 states ~27016 transitions
pnml2lts-mc( 2/ 4): ~120 levels ~20000 states ~50984 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~40000 states ~106024 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~80000 states ~217192 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~160000 states ~458376 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~320000 states ~1074816 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~640000 states ~2308716 transitions
pnml2lts-mc( 2/ 4): ~136 levels ~1280000 states ~4619436 transitions
ltl formula name StigmergyElection-PT-07b-LTLFireability-04
ltl formula formula --ltl=/tmp/1407/ltl_4_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.290 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 972 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5548 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~122!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 447
pnml2lts-mc( 0/ 4): unique transitions count: 2231
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 457
pnml2lts-mc( 0/ 4): - cum. max stack depth: 457
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 457 states 2259 transitions, fanout: 4.943
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5712, Transitions per second: 28238
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-05
ltl formula formula --ltl=/tmp/1407/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.230 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5545 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~130 levels ~10000 states ~27868 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~20000 states ~60564 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~40000 states ~133824 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~80000 states ~283236 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~160000 states ~579304 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~320000 states ~1159812 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~640000 states ~2562488 transitions
pnml2lts-mc( 3/ 4): ~146 levels ~1280000 states ~5385784 transitions
ltl formula name StigmergyElection-PT-07b-LTLFireability-06
ltl formula formula --ltl=/tmp/1407/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.280 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 972 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5546 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~112!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 436
pnml2lts-mc( 0/ 4): unique transitions count: 2101
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 444
pnml2lts-mc( 0/ 4): - cum. max stack depth: 444
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 444 states 2119 transitions, fanout: 4.773
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4933, Transitions per second: 23544
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.5 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-07
ltl formula formula --ltl=/tmp/1407/ltl_7_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.280 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5551 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~106!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 410
pnml2lts-mc( 0/ 4): unique transitions count: 2225
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 420
pnml2lts-mc( 0/ 4): - cum. max stack depth: 420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 420 states 2251 transitions, fanout: 5.360
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5250, Transitions per second: 28138
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-08
ltl formula formula --ltl=/tmp/1407/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.270 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5553 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~105!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 409
pnml2lts-mc( 0/ 4): unique transitions count: 2033
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 418
pnml2lts-mc( 0/ 4): - cum. max stack depth: 418
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 418 states 2054 transitions, fanout: 4.914
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5225, Transitions per second: 25675
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-09
ltl formula formula --ltl=/tmp/1407/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.290 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5545 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~112!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 442
pnml2lts-mc( 0/ 4): unique transitions count: 2069
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 451
pnml2lts-mc( 0/ 4): - cum. max stack depth: 451
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 451 states 2089 transitions, fanout: 4.632
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5638, Transitions per second: 26112
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-10
ltl formula formula --ltl=/tmp/1407/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.650 real 0.270 user 0.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 972 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5551 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~162 levels ~10000 states ~28616 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~20000 states ~63836 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~40000 states ~135360 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~80000 states ~277360 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~160000 states ~544928 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~320000 states ~1096944 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~640000 states ~2322668 transitions
pnml2lts-mc( 2/ 4): ~163 levels ~1280000 states ~4659048 transitions
ltl formula name StigmergyElection-PT-07b-LTLFireability-11
ltl formula formula --ltl=/tmp/1407/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.690 real 0.270 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5543 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~104!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 381
pnml2lts-mc( 0/ 4): unique transitions count: 1933
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 390
pnml2lts-mc( 0/ 4): - cum. max stack depth: 390
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 390 states 1954 transitions, fanout: 5.010
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4875, Transitions per second: 24425
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-12
ltl formula formula --ltl=/tmp/1407/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.230 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5548 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~130 levels ~10000 states ~33220 transitions
pnml2lts-mc( 2/ 4): ~130 levels ~20000 states ~66392 transitions
pnml2lts-mc( 2/ 4): ~138 levels ~40000 states ~128220 transitions
pnml2lts-mc( 2/ 4): ~138 levels ~80000 states ~278580 transitions
pnml2lts-mc( 2/ 4): ~138 levels ~160000 states ~564616 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~320000 states ~1185228 transitions
pnml2lts-mc( 1/ 4): ~130 levels ~640000 states ~2505160 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~1280000 states ~5099116 transitions
ltl formula name StigmergyElection-PT-07b-LTLFireability-13
ltl formula formula --ltl=/tmp/1407/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.260 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 973 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5544 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~113!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 416
pnml2lts-mc( 0/ 4): unique transitions count: 2036
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 425
pnml2lts-mc( 0/ 4): - cum. max stack depth: 425
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 425 states 2058 transitions, fanout: 4.842
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5312, Transitions per second: 25725
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.5 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-14
ltl formula formula --ltl=/tmp/1407/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.240 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 972 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5556 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 80.0 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07b-LTLFireability-15
ltl formula formula --ltl=/tmp/1407/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 971 places, 5542 transitions and 65199 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyElection-PT-07b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.210 user 0.240 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 972 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 972, there are 5561 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~114!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 443
pnml2lts-mc( 0/ 4): unique transitions count: 2169
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 451
pnml2lts-mc( 0/ 4): - cum. max stack depth: 451
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 451 states 2187 transitions, fanout: 4.849
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5011, Transitions per second: 24300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.7 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-07b, 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 r536-tall-171690532100340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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