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.r417-tall-171690555900183.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 gold2023
Input is StigmergyElection-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555900183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 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 203K 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-04b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717125320065

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 03:15:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 03:15:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:15:21] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-31 03:15:21] [INFO ] Transformed 563 places.
[2024-05-31 03:15:21] [INFO ] Transformed 780 transitions.
[2024-05-31 03:15:21] [INFO ] Found NUPN structural information;
[2024-05-31 03:15:21] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyElection-PT-04b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 493 transition count 710
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 493 transition count 710
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 175 place count 458 transition count 675
Iterating global reduction 0 with 35 rules applied. Total rules applied 210 place count 458 transition count 675
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 217 place count 451 transition count 668
Iterating global reduction 0 with 7 rules applied. Total rules applied 224 place count 451 transition count 668
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 227 place count 448 transition count 665
Iterating global reduction 0 with 3 rules applied. Total rules applied 230 place count 448 transition count 665
Applied a total of 230 rules in 149 ms. Remains 448 /563 variables (removed 115) and now considering 665/780 (removed 115) transitions.
// Phase 1: matrix 665 rows 448 cols
[2024-05-31 03:15:22] [INFO ] Computed 5 invariants in 26 ms
[2024-05-31 03:15:22] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-31 03:15:22] [INFO ] Invariant cache hit.
[2024-05-31 03:15:22] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-31 03:15:22] [INFO ] Invariant cache hit.
[2024-05-31 03:15:22] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/563 places, 665/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 977 ms. Remains : 448/563 places, 665/780 transitions.
Support contains 36 out of 448 places after structural reductions.
[2024-05-31 03:15:23] [INFO ] Flatten gal took : 70 ms
[2024-05-31 03:15:23] [INFO ] Flatten gal took : 36 ms
[2024-05-31 03:15:23] [INFO ] Input system was already deterministic with 665 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 25) seen :12
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-31 03:15:24] [INFO ] Invariant cache hit.
[2024-05-31 03:15:24] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-31 03:15:24] [INFO ] After 186ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2024-05-31 03:15:24] [INFO ] After 247ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-31 03:15:24] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:8
[2024-05-31 03:15:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-31 03:15:25] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-31 03:15:25] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 1 ms to minimize.
[2024-05-31 03:15:26] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 1 ms to minimize.
[2024-05-31 03:15:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2024-05-31 03:15:26] [INFO ] After 1158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 239 ms.
[2024-05-31 03:15:26] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 4 properties in 107 ms.
Support contains 12 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 445 edges and 448 vertex of which 61 / 448 are part of one of the 11 SCC in 7 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 762 edges and 398 vertex of which 394 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 394 transition count 326
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 278 rules applied. Total rules applied 551 place count 127 transition count 315
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 557 place count 121 transition count 315
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 557 place count 121 transition count 293
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 601 place count 99 transition count 293
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 603 place count 97 transition count 290
Iterating global reduction 3 with 2 rules applied. Total rules applied 605 place count 97 transition count 290
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 606 place count 97 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 607 place count 96 transition count 289
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 608 place count 95 transition count 287
Iterating global reduction 5 with 1 rules applied. Total rules applied 609 place count 95 transition count 287
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 647 place count 76 transition count 268
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 654 place count 76 transition count 261
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 664 place count 66 transition count 184
Iterating global reduction 6 with 10 rules applied. Total rules applied 674 place count 66 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 679 place count 66 transition count 179
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 681 place count 64 transition count 177
Iterating global reduction 7 with 2 rules applied. Total rules applied 683 place count 64 transition count 177
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 693 place count 59 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 701 place count 55 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 702 place count 55 transition count 179
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 710 place count 55 transition count 171
Free-agglomeration rule applied 25 times.
Iterating global reduction 8 with 25 rules applied. Total rules applied 735 place count 55 transition count 146
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 761 place count 30 transition count 145
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 765 place count 26 transition count 141
Iterating global reduction 9 with 4 rules applied. Total rules applied 769 place count 26 transition count 141
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 776 place count 26 transition count 134
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 783 place count 26 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 784 place count 25 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 785 place count 24 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 785 place count 24 transition count 125
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 787 place count 23 transition count 125
Performed 4 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 795 place count 19 transition count 106
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 802 place count 19 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 803 place count 19 transition count 99
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 804 place count 19 transition count 98
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 805 place count 18 transition count 97
Iterating global reduction 12 with 1 rules applied. Total rules applied 806 place count 18 transition count 97
Applied a total of 806 rules in 122 ms. Remains 18 /448 variables (removed 430) and now considering 97/665 (removed 568) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 18/448 places, 97/665 transitions.
Finished random walk after 534 steps, including 0 resets, run visited all 5 properties in 12 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 60 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&(!p0 U (p1||G(!p0)))))))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 452 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 265 place count 391 transition count 336
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 272 rules applied. Total rules applied 537 place count 127 transition count 328
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 542 place count 123 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 543 place count 122 transition count 327
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 543 place count 122 transition count 311
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 575 place count 106 transition count 311
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 580 place count 101 transition count 305
Iterating global reduction 4 with 5 rules applied. Total rules applied 585 place count 101 transition count 305
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 101 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 587 place count 100 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 587 place count 100 transition count 303
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 589 place count 99 transition count 303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 590 place count 98 transition count 301
Iterating global reduction 6 with 1 rules applied. Total rules applied 591 place count 98 transition count 301
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 592 place count 97 transition count 299
Iterating global reduction 6 with 1 rules applied. Total rules applied 593 place count 97 transition count 299
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 625 place count 81 transition count 283
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 636 place count 70 transition count 189
Iterating global reduction 6 with 11 rules applied. Total rules applied 647 place count 70 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 651 place count 70 transition count 185
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 654 place count 67 transition count 179
Iterating global reduction 7 with 3 rules applied. Total rules applied 657 place count 67 transition count 179
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 660 place count 64 transition count 173
Iterating global reduction 7 with 3 rules applied. Total rules applied 663 place count 64 transition count 173
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 683 place count 54 transition count 196
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 684 place count 53 transition count 188
Iterating global reduction 7 with 1 rules applied. Total rules applied 685 place count 53 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 686 place count 53 transition count 187
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 690 place count 53 transition count 183
Applied a total of 690 rules in 63 ms. Remains 53 /448 variables (removed 395) and now considering 183/665 (removed 482) transitions.
[2024-05-31 03:15:26] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
// Phase 1: matrix 178 rows 53 cols
[2024-05-31 03:15:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:15:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 03:15:27] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
[2024-05-31 03:15:27] [INFO ] Invariant cache hit.
[2024-05-31 03:15:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:15:27] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-31 03:15:27] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 03:15:27] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
[2024-05-31 03:15:27] [INFO ] Invariant cache hit.
[2024-05-31 03:15:27] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/448 places, 183/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 53/448 places, 183/665 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 292 ms :[true, (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}]], initial=3, aps=[p2:(AND (EQ s8 1) (EQ s20 1) (EQ s31 1) (EQ s44 1)), p0:(OR (EQ s24 1) (EQ s5 1)), p1:(AND (NEQ s5 1) (NOT (OR (EQ s24 1) (EQ s5 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 67 steps with 7 reset in 3 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-00 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||p0))&&(p2 U (p3||G(p2)))))'
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 78 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-31 03:15:27] [INFO ] Computed 5 invariants in 8 ms
[2024-05-31 03:15:27] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 03:15:27] [INFO ] Invariant cache hit.
[2024-05-31 03:15:28] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-31 03:15:28] [INFO ] Invariant cache hit.
[2024-05-31 03:15:28] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (NEQ s195 1) (NEQ s96 1)), p2:(NEQ s96 1), p0:(OR (EQ s135 0) (EQ s306 1)), p1:(OR (EQ s32 0) (EQ s149 0) (EQ s244 0) (EQ s339 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p3 p2 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-04b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-04b-LTLFireability-02 finished in 1717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p0)&&F(G(p1)))) U p2)))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 451 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 263 place count 391 transition count 338
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 270 rules applied. Total rules applied 533 place count 129 transition count 330
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 539 place count 125 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 541 place count 123 transition count 328
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 541 place count 123 transition count 312
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 573 place count 107 transition count 312
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 579 place count 101 transition count 305
Iterating global reduction 4 with 6 rules applied. Total rules applied 585 place count 101 transition count 305
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 101 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 587 place count 100 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 587 place count 100 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 589 place count 99 transition count 303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 590 place count 98 transition count 301
Iterating global reduction 6 with 1 rules applied. Total rules applied 591 place count 98 transition count 301
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 592 place count 97 transition count 299
Iterating global reduction 6 with 1 rules applied. Total rules applied 593 place count 97 transition count 299
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 625 place count 81 transition count 283
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 638 place count 68 transition count 163
Iterating global reduction 6 with 13 rules applied. Total rules applied 651 place count 68 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 657 place count 68 transition count 157
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 660 place count 65 transition count 151
Iterating global reduction 7 with 3 rules applied. Total rules applied 663 place count 65 transition count 151
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 666 place count 62 transition count 145
Iterating global reduction 7 with 3 rules applied. Total rules applied 669 place count 62 transition count 145
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 687 place count 53 transition count 162
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 688 place count 52 transition count 154
Iterating global reduction 7 with 1 rules applied. Total rules applied 689 place count 52 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 690 place count 52 transition count 153
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 694 place count 52 transition count 149
Applied a total of 694 rules in 50 ms. Remains 52 /448 variables (removed 396) and now considering 149/665 (removed 516) transitions.
[2024-05-31 03:15:29] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
// Phase 1: matrix 144 rows 52 cols
[2024-05-31 03:15:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:15:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 03:15:29] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
[2024-05-31 03:15:29] [INFO ] Invariant cache hit.
[2024-05-31 03:15:29] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:15:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-31 03:15:29] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 03:15:29] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
[2024-05-31 03:15:29] [INFO ] Invariant cache hit.
[2024-05-31 03:15:29] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/448 places, 149/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 52/448 places, 149/665 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s17 1), p0:(EQ s37 1), p1:(AND (EQ s4 1) (EQ s15 1) (EQ s29 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-04 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 58 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-31 03:15:29] [INFO ] Computed 5 invariants in 13 ms
[2024-05-31 03:15:29] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 03:15:29] [INFO ] Invariant cache hit.
[2024-05-31 03:15:30] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-31 03:15:30] [INFO ] Invariant cache hit.
[2024-05-31 03:15:30] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 743 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s140 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 434 steps with 5 reset in 3 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-06 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 41 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
[2024-05-31 03:15:30] [INFO ] Invariant cache hit.
[2024-05-31 03:15:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 03:15:30] [INFO ] Invariant cache hit.
[2024-05-31 03:15:31] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-31 03:15:31] [INFO ] Invariant cache hit.
[2024-05-31 03:15:31] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 680 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s43 1) (EQ s149 1) (EQ s244 1) (EQ s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-07 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 455 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 391 transition count 332
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 276 rules applied. Total rules applied 545 place count 123 transition count 324
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 551 place count 119 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 553 place count 117 transition count 322
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 553 place count 117 transition count 307
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 583 place count 102 transition count 307
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 589 place count 96 transition count 300
Iterating global reduction 4 with 6 rules applied. Total rules applied 595 place count 96 transition count 300
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 596 place count 96 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 597 place count 95 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 597 place count 95 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 599 place count 94 transition count 298
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 600 place count 93 transition count 296
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 93 transition count 296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 602 place count 92 transition count 294
Iterating global reduction 6 with 1 rules applied. Total rules applied 603 place count 92 transition count 294
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 635 place count 76 transition count 278
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 649 place count 62 transition count 139
Iterating global reduction 6 with 14 rules applied. Total rules applied 663 place count 62 transition count 139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 671 place count 62 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 674 place count 59 transition count 125
Iterating global reduction 7 with 3 rules applied. Total rules applied 677 place count 59 transition count 125
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 680 place count 56 transition count 119
Iterating global reduction 7 with 3 rules applied. Total rules applied 683 place count 56 transition count 119
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 703 place count 46 transition count 142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 704 place count 45 transition count 134
Iterating global reduction 7 with 1 rules applied. Total rules applied 705 place count 45 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 706 place count 45 transition count 133
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 710 place count 45 transition count 129
Applied a total of 710 rules in 40 ms. Remains 45 /448 variables (removed 403) and now considering 129/665 (removed 536) transitions.
[2024-05-31 03:15:31] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
// Phase 1: matrix 124 rows 45 cols
[2024-05-31 03:15:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:15:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 03:15:31] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-31 03:15:31] [INFO ] Invariant cache hit.
[2024-05-31 03:15:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:15:31] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-31 03:15:31] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 03:15:31] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-31 03:15:31] [INFO ] Invariant cache hit.
[2024-05-31 03:15:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/448 places, 129/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 45/448 places, 129/665 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20 steps with 1 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-08 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1||X(X(F((p1||X(p2))))))&&p0)))'
Support contains 9 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 41 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-31 03:15:31] [INFO ] Computed 5 invariants in 5 ms
[2024-05-31 03:15:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 03:15:31] [INFO ] Invariant cache hit.
[2024-05-31 03:15:32] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-31 03:15:32] [INFO ] Invariant cache hit.
[2024-05-31 03:15:32] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(EQ s385 1), p2:(AND (EQ s95 1) (EQ s202 1) (EQ s308 1) (EQ s413 1)), p0:(AND (EQ s32 1) (EQ s127 1) (EQ s244 1) (EQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-09 finished in 827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 446 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 663
Applied a total of 4 rules in 20 ms. Remains 446 /448 variables (removed 2) and now considering 663/665 (removed 2) transitions.
// Phase 1: matrix 663 rows 446 cols
[2024-05-31 03:15:32] [INFO ] Computed 5 invariants in 7 ms
[2024-05-31 03:15:32] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 03:15:32] [INFO ] Invariant cache hit.
[2024-05-31 03:15:32] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-31 03:15:32] [INFO ] Invariant cache hit.
[2024-05-31 03:15:33] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/448 places, 663/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 446/448 places, 663/665 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s403 1), p1:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-10 finished in 827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 454 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 267 place count 391 transition count 334
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 274 rules applied. Total rules applied 541 place count 125 transition count 326
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 547 place count 121 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 119 transition count 324
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 549 place count 119 transition count 308
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 581 place count 103 transition count 308
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 587 place count 97 transition count 301
Iterating global reduction 4 with 6 rules applied. Total rules applied 593 place count 97 transition count 301
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 594 place count 97 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 595 place count 96 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 595 place count 96 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 597 place count 95 transition count 299
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 598 place count 94 transition count 297
Iterating global reduction 6 with 1 rules applied. Total rules applied 599 place count 94 transition count 297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 600 place count 93 transition count 295
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 93 transition count 295
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 633 place count 77 transition count 279
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 648 place count 62 transition count 139
Iterating global reduction 6 with 15 rules applied. Total rules applied 663 place count 62 transition count 139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 671 place count 62 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 674 place count 59 transition count 125
Iterating global reduction 7 with 3 rules applied. Total rules applied 677 place count 59 transition count 125
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 679 place count 57 transition count 121
Iterating global reduction 7 with 2 rules applied. Total rules applied 681 place count 57 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 701 place count 47 transition count 146
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 711 place count 47 transition count 136
Applied a total of 711 rules in 33 ms. Remains 47 /448 variables (removed 401) and now considering 136/665 (removed 529) transitions.
[2024-05-31 03:15:33] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 47 cols
[2024-05-31 03:15:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:15:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 03:15:33] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2024-05-31 03:15:33] [INFO ] Invariant cache hit.
[2024-05-31 03:15:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:15:33] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-31 03:15:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 03:15:33] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2024-05-31 03:15:33] [INFO ] Invariant cache hit.
[2024-05-31 03:15:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/448 places, 136/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 47/448 places, 136/665 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s22 1), p0:(OR (AND (EQ s6 1) (EQ s45 1)) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-12 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)||X((p2 U (p3||G(p2))))))))'
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 446 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Applied a total of 10 rules in 31 ms. Remains 443 /448 variables (removed 5) and now considering 660/665 (removed 5) transitions.
// Phase 1: matrix 660 rows 443 cols
[2024-05-31 03:15:33] [INFO ] Computed 5 invariants in 24 ms
[2024-05-31 03:15:33] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 03:15:33] [INFO ] Invariant cache hit.
[2024-05-31 03:15:33] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-31 03:15:33] [INFO ] Invariant cache hit.
[2024-05-31 03:15:34] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 443/448 places, 660/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 443/448 places, 660/665 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s164 0), p1:(EQ s224 0), p3:(AND (NEQ s242 1) (NEQ s164 1)), p2:(NEQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1365 reset in 133 ms.
Product exploration explored 100000 steps with 1358 reset in 147 ms.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Incomplete random walk after 10000 steps, including 137 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 614743 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614743 steps, saw 122079 distinct states, run finished after 3003 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-31 03:15:38] [INFO ] Invariant cache hit.
[2024-05-31 03:15:38] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 03:15:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-31 03:15:38] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-31 03:15:38] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 1 ms to minimize.
[2024-05-31 03:15:38] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 0 ms to minimize.
[2024-05-31 03:15:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2024-05-31 03:15:39] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-31 03:15:39] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 660/660 transitions.
Graph (trivial) has 450 edges and 443 vertex of which 61 / 443 are part of one of the 11 SCC in 0 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 757 edges and 393 vertex of which 389 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 276 rules applied. Total rules applied 278 place count 389 transition count 316
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 283 rules applied. Total rules applied 561 place count 117 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 567 place count 111 transition count 305
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 567 place count 111 transition count 283
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 611 place count 89 transition count 283
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 612 place count 89 transition count 282
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 654 place count 68 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 661 place count 68 transition count 254
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 677 place count 52 transition count 109
Iterating global reduction 5 with 16 rules applied. Total rules applied 693 place count 52 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 702 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 705 place count 49 transition count 97
Iterating global reduction 6 with 3 rules applied. Total rules applied 708 place count 49 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 718 place count 44 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 726 place count 40 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 727 place count 40 transition count 99
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 735 place count 40 transition count 91
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 756 place count 40 transition count 70
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 782 place count 19 transition count 65
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 786 place count 15 transition count 61
Iterating global reduction 8 with 4 rules applied. Total rules applied 790 place count 15 transition count 61
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 801 place count 15 transition count 50
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 808 place count 15 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 809 place count 14 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 810 place count 13 transition count 42
Performed 4 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 820 place count 7 transition count 18
Drop transitions removed 4 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 829 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 831 place count 6 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 832 place count 6 transition count 7
Applied a total of 832 rules in 26 ms. Remains 6 /443 variables (removed 437) and now considering 7/660 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 6/443 places, 7/660 transitions.
Finished random walk after 33 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 443 /443 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-31 03:15:39] [INFO ] Invariant cache hit.
[2024-05-31 03:15:39] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-31 03:15:39] [INFO ] Invariant cache hit.
[2024-05-31 03:15:40] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-31 03:15:40] [INFO ] Invariant cache hit.
[2024-05-31 03:15:40] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 443/443 places, 660/660 transitions.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 809375 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 809375 steps, saw 159644 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 03:15:43] [INFO ] Invariant cache hit.
[2024-05-31 03:15:43] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 03:15:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 03:15:44] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 03:15:44] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 1 ms to minimize.
[2024-05-31 03:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-31 03:15:44] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-31 03:15:44] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 660/660 transitions.
Graph (trivial) has 450 edges and 443 vertex of which 61 / 443 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 757 edges and 393 vertex of which 389 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 276 rules applied. Total rules applied 278 place count 389 transition count 316
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 283 rules applied. Total rules applied 561 place count 117 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 567 place count 111 transition count 305
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 567 place count 111 transition count 283
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 611 place count 89 transition count 283
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 612 place count 89 transition count 282
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 654 place count 68 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 661 place count 68 transition count 254
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 677 place count 52 transition count 109
Iterating global reduction 5 with 16 rules applied. Total rules applied 693 place count 52 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 702 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 705 place count 49 transition count 97
Iterating global reduction 6 with 3 rules applied. Total rules applied 708 place count 49 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 718 place count 44 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 726 place count 40 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 727 place count 40 transition count 99
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 735 place count 40 transition count 91
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 756 place count 40 transition count 70
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 782 place count 19 transition count 65
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 786 place count 15 transition count 61
Iterating global reduction 8 with 4 rules applied. Total rules applied 790 place count 15 transition count 61
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 801 place count 15 transition count 50
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 808 place count 15 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 809 place count 14 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 810 place count 13 transition count 42
Performed 4 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 820 place count 7 transition count 18
Drop transitions removed 4 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 829 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 831 place count 6 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 832 place count 6 transition count 7
Applied a total of 832 rules in 21 ms. Remains 6 /443 variables (removed 437) and now considering 7/660 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 6/443 places, 7/660 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 648 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 1357 reset in 107 ms.
Product exploration explored 100000 steps with 1361 reset in 114 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Graph (trivial) has 448 edges and 443 vertex of which 61 / 443 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 393 transition count 603
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 270 place count 393 transition count 598
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 270 place count 393 transition count 603
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 280 place count 393 transition count 603
Discarding 222 places :
Symmetric choice reduction at 2 with 222 rule applications. Total rules 502 place count 171 transition count 381
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 724 place count 171 transition count 381
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 757 place count 171 transition count 381
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 802 place count 126 transition count 204
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 847 place count 126 transition count 204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 856 place count 126 transition count 195
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 872 place count 110 transition count 176
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 888 place count 110 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 891 place count 107 transition count 173
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 894 place count 107 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 895 place count 107 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 896 place count 106 transition count 172
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 897 place count 106 transition count 172
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 907 place count 106 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 908 place count 106 transition count 229
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 921 place count 93 transition count 203
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 934 place count 93 transition count 203
Deduced a syphon composed of 43 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 946 place count 93 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 947 place count 93 transition count 204
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 948 place count 92 transition count 202
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 949 place count 92 transition count 202
Deduced a syphon composed of 43 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 953 place count 92 transition count 198
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 953 rules in 53 ms. Remains 92 /443 variables (removed 351) and now considering 198/660 (removed 462) transitions.
[2024-05-31 03:15:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 03:15:46] [INFO ] Flow matrix only has 193 transitions (discarded 5 similar events)
// Phase 1: matrix 193 rows 92 cols
[2024-05-31 03:15:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:15:46] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/443 places, 198/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 92/443 places, 198/660 transitions.
Built C files in :
/tmp/ltsmin2803753987246271570
[2024-05-31 03:15:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2803753987246271570
Running compilation step : cd /tmp/ltsmin2803753987246271570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1083 ms.
Running link step : cd /tmp/ltsmin2803753987246271570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 124 ms.
Running LTSmin : cd /tmp/ltsmin2803753987246271570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2370466054541009574.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Applied a total of 0 rules in 21 ms. Remains 443 /443 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 443 cols
[2024-05-31 03:16:01] [INFO ] Computed 5 invariants in 5 ms
[2024-05-31 03:16:01] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-31 03:16:01] [INFO ] Invariant cache hit.
[2024-05-31 03:16:02] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-31 03:16:02] [INFO ] Invariant cache hit.
[2024-05-31 03:16:02] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 443/443 places, 660/660 transitions.
Built C files in :
/tmp/ltsmin12138381685900543313
[2024-05-31 03:16:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12138381685900543313
Running compilation step : cd /tmp/ltsmin12138381685900543313;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 960 ms.
Running link step : cd /tmp/ltsmin12138381685900543313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12138381685900543313;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16720498344233590203.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 03:16:17] [INFO ] Flatten gal took : 31 ms
[2024-05-31 03:16:17] [INFO ] Flatten gal took : 31 ms
[2024-05-31 03:16:17] [INFO ] Time to serialize gal into /tmp/LTL16133513829962782441.gal : 6 ms
[2024-05-31 03:16:17] [INFO ] Time to serialize properties into /tmp/LTL11751046511429000745.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16133513829962782441.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6560689466850950970.hoa' '-atoms' '/tmp/LTL11751046511429000745.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11751046511429000745.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6560689466850950970.hoa
Detected timeout of ITS tools.
[2024-05-31 03:16:32] [INFO ] Flatten gal took : 28 ms
[2024-05-31 03:16:32] [INFO ] Flatten gal took : 25 ms
[2024-05-31 03:16:32] [INFO ] Time to serialize gal into /tmp/LTL4623896031803400869.gal : 5 ms
[2024-05-31 03:16:32] [INFO ] Time to serialize properties into /tmp/LTL6043188000177745944.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4623896031803400869.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6043188000177745944.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((("(p210==0)")||(F("(p283==0)")))||(X(("(p210!=1)")U(("((p305!=1)&&(p210!=1))")||(G("(p210!=1)")))))))))
Formula 0 simplified : XF(!"(p210==0)" & G!"(p283==0)" & X(!"(p210!=1)" M !"((p305!=1)&&(p210!=1))"))
Detected timeout of ITS tools.
[2024-05-31 03:16:47] [INFO ] Flatten gal took : 23 ms
[2024-05-31 03:16:47] [INFO ] Applying decomposition
[2024-05-31 03:16:47] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6466996778913072081.txt' '-o' '/tmp/graph6466996778913072081.bin' '-w' '/tmp/graph6466996778913072081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6466996778913072081.bin' '-l' '-1' '-v' '-w' '/tmp/graph6466996778913072081.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:16:47] [INFO ] Decomposing Gal with order
[2024-05-31 03:16:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:16:48] [INFO ] Removed a total of 790 redundant transitions.
[2024-05-31 03:16:48] [INFO ] Flatten gal took : 98 ms
[2024-05-31 03:16:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-31 03:16:48] [INFO ] Time to serialize gal into /tmp/LTL5618561452799421118.gal : 6 ms
[2024-05-31 03:16:48] [INFO ] Time to serialize properties into /tmp/LTL6122234185128842784.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5618561452799421118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6122234185128842784.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((("(i11.u68.p210==0)")||(F("(i15.u93.p283==0)")))||(X(("(i11.u68.p210!=1)")U(("((i16.u102.p305!=1)&&(i11.u68.p210!=1))")||(G("(...181
Formula 0 simplified : XF(!"(i11.u68.p210==0)" & G!"(i15.u93.p283==0)" & X(!"(i11.u68.p210!=1)" M !"((i16.u102.p305!=1)&&(i11.u68.p210!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t60, t107, t141, t143, t160, t240, t242, t259, t305, t339, t341, t357, t402, t436, t438, t459...475
Computing Next relation with stutter on 11256 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13575647400478138045
[2024-05-31 03:17:03] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13575647400478138045
Running compilation step : cd /tmp/ltsmin13575647400478138045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 926 ms.
Running link step : cd /tmp/ltsmin13575647400478138045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13575647400478138045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true))||X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyElection-PT-04b-LTLFireability-13 finished in 104743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)||X((p2 U (p3||G(p2))))))))'
Found a Lengthening insensitive property : StigmergyElection-PT-04b-LTLFireability-13
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 453 edges and 448 vertex of which 61 / 448 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 268 place count 397 transition count 340
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 278 rules applied. Total rules applied 546 place count 130 transition count 329
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 553 place count 124 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 554 place count 123 transition count 328
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 554 place count 123 transition count 311
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 588 place count 106 transition count 311
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 594 place count 100 transition count 304
Iterating global reduction 4 with 6 rules applied. Total rules applied 600 place count 100 transition count 304
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 601 place count 100 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 602 place count 99 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 602 place count 99 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 604 place count 98 transition count 302
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 605 place count 97 transition count 300
Iterating global reduction 6 with 1 rules applied. Total rules applied 606 place count 97 transition count 300
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 607 place count 96 transition count 298
Iterating global reduction 6 with 1 rules applied. Total rules applied 608 place count 96 transition count 298
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 640 place count 80 transition count 282
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 654 place count 66 transition count 144
Iterating global reduction 6 with 14 rules applied. Total rules applied 668 place count 66 transition count 144
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 676 place count 66 transition count 136
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 678 place count 64 transition count 132
Iterating global reduction 7 with 2 rules applied. Total rules applied 680 place count 64 transition count 132
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 682 place count 62 transition count 128
Iterating global reduction 7 with 2 rules applied. Total rules applied 684 place count 62 transition count 128
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 708 place count 50 transition count 150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 709 place count 49 transition count 140
Iterating global reduction 7 with 1 rules applied. Total rules applied 710 place count 49 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 711 place count 49 transition count 139
Applied a total of 711 rules in 31 ms. Remains 49 /448 variables (removed 399) and now considering 139/665 (removed 526) transitions.
[2024-05-31 03:17:18] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 49 cols
[2024-05-31 03:17:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 03:17:18] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 03:17:18] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-31 03:17:18] [INFO ] Invariant cache hit.
[2024-05-31 03:17:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:17:18] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-31 03:17:18] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-31 03:17:18] [INFO ] Invariant cache hit.
[2024-05-31 03:17:18] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 49/448 places, 139/665 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 220 ms. Remains : 49/448 places, 139/665 transitions.
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s17 0), p1:(EQ s24 0), p3:(AND (NEQ s27 1) (NEQ s17 1)), p2:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 81 ms.
Product exploration explored 100000 steps with 83 reset in 83 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1317 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2024-05-31 03:17:19] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-31 03:17:19] [INFO ] Invariant cache hit.
[2024-05-31 03:17:19] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 03:17:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 03:17:19] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 03:17:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:17:19] [INFO ] After 11ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-31 03:17:19] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-31 03:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 03:17:19] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-31 03:17:19] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 139/139 transitions.
Graph (complete) has 225 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 48 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 46 transition count 129
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 40 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 40 transition count 119
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 49 place count 40 transition count 98
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 76 place count 18 transition count 93
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 80 place count 14 transition count 89
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 14 transition count 89
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 95 place count 14 transition count 78
Performed 4 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 103 place count 10 transition count 34
Drop transitions removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 124 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 9 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 127 place count 9 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 128 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 7 transition count 10
Applied a total of 129 rules in 7 ms. Remains 7 /49 variables (removed 42) and now considering 10/139 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 7/49 places, 10/139 transitions.
Finished random walk after 5 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 7 factoid took 163 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-31 03:17:20] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-31 03:17:20] [INFO ] Invariant cache hit.
[2024-05-31 03:17:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 03:17:20] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-31 03:17:20] [INFO ] Invariant cache hit.
[2024-05-31 03:17:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:17:20] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-31 03:17:20] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-31 03:17:20] [INFO ] Invariant cache hit.
[2024-05-31 03:17:20] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 49/49 places, 139/139 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1302 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:17:20] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-31 03:17:20] [INFO ] Invariant cache hit.
[2024-05-31 03:17:20] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:17:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 03:17:20] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:17:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 03:17:20] [INFO ] After 10ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 03:17:20] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-31 03:17:20] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 139/139 transitions.
Graph (complete) has 225 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 48 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 46 transition count 129
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 40 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 40 transition count 119
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 49 place count 40 transition count 98
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 76 place count 18 transition count 93
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 80 place count 14 transition count 89
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 14 transition count 89
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 95 place count 14 transition count 78
Performed 4 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 103 place count 10 transition count 34
Drop transitions removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 124 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 9 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 127 place count 9 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 128 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 7 transition count 10
Applied a total of 129 rules in 13 ms. Remains 7 /49 variables (removed 42) and now considering 10/139 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 7/49 places, 10/139 transitions.
Finished random walk after 35 steps, including 7 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 489 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 472 reset in 53 ms.
Product exploration explored 100000 steps with 247 reset in 150 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 139/139 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 135
Applied a total of 4 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 135/139 (removed 4) transitions.
[2024-05-31 03:17:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 03:17:22] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
// Phase 1: matrix 130 rows 49 cols
[2024-05-31 03:17:22] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 03:17:22] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/49 places, 135/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 49/49 places, 135/139 transitions.
Built C files in :
/tmp/ltsmin7724523250975471744
[2024-05-31 03:17:23] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7724523250975471744
Running compilation step : cd /tmp/ltsmin7724523250975471744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin7724523250975471744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7724523250975471744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8663329151865402279.hoa' '--buchi-type=spotba'
LTSmin run took 338 ms.
Treatment of property StigmergyElection-PT-04b-LTLFireability-13 finished in 5314 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-31 03:17:23] [INFO ] Flatten gal took : 18 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 122084 ms.

BK_STOP 1717125447147

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is StigmergyElection-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690555900183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 ;