fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872700308
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyElection-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1570.487 288890.00 569157.00 1123.80 FFFTFFFFFFFFFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872700308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.9K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 30 14:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 428K May 29 12:20 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-05b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654849502176

Running Version 202205111006
[2022-06-10 08:25:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 08:25:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 08:25:04] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2022-06-10 08:25:04] [INFO ] Transformed 699 places.
[2022-06-10 08:25:04] [INFO ] Transformed 1266 transitions.
[2022-06-10 08:25:04] [INFO ] Found NUPN structural information;
[2022-06-10 08:25:04] [INFO ] Parsed PT model containing 699 places and 1266 transitions in 578 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-05b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 613 transition count 1180
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 613 transition count 1180
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 217 place count 568 transition count 1135
Iterating global reduction 0 with 45 rules applied. Total rules applied 262 place count 568 transition count 1135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 271 place count 559 transition count 1126
Iterating global reduction 0 with 9 rules applied. Total rules applied 280 place count 559 transition count 1126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 284 place count 555 transition count 1122
Iterating global reduction 0 with 4 rules applied. Total rules applied 288 place count 555 transition count 1122
Applied a total of 288 rules in 256 ms. Remains 555 /699 variables (removed 144) and now considering 1122/1266 (removed 144) transitions.
// Phase 1: matrix 1122 rows 555 cols
[2022-06-10 08:25:05] [INFO ] Computed 6 place invariants in 47 ms
[2022-06-10 08:25:05] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 1122 rows 555 cols
[2022-06-10 08:25:05] [INFO ] Computed 6 place invariants in 15 ms
[2022-06-10 08:25:06] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
// Phase 1: matrix 1122 rows 555 cols
[2022-06-10 08:25:06] [INFO ] Computed 6 place invariants in 20 ms
[2022-06-10 08:25:07] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 555/699 places, 1122/1266 transitions.
Finished structural reductions, in 1 iterations. Remains : 555/699 places, 1122/1266 transitions.
Support contains 52 out of 555 places after structural reductions.
[2022-06-10 08:25:08] [INFO ] Flatten gal took : 224 ms
[2022-06-10 08:25:08] [INFO ] Flatten gal took : 124 ms
[2022-06-10 08:25:08] [INFO ] Input system was already deterministic with 1122 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 33) seen :11
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 1122 rows 555 cols
[2022-06-10 08:25:09] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-10 08:25:10] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-10 08:25:10] [INFO ] After 476ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:21
[2022-06-10 08:25:10] [INFO ] After 565ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:21
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-06-10 08:25:11] [INFO ] After 1107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:21
[2022-06-10 08:25:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-10 08:25:13] [INFO ] After 1925ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :19
[2022-06-10 08:25:15] [INFO ] Deduced a trap composed of 165 places in 378 ms of which 2 ms to minimize.
[2022-06-10 08:25:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2022-06-10 08:25:15] [INFO ] After 4299ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :19
Attempting to minimize the solution found.
Minimization took 1445 ms.
[2022-06-10 08:25:17] [INFO ] After 6406ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :19
Fused 22 Parikh solutions to 17 different solutions.
Parikh walk visited 14 properties in 186 ms.
Support contains 5 out of 555 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 560 edges and 555 vertex of which 78 / 555 are part of one of the 14 SCC in 8 ms
Free SCC test removed 64 places
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 1055 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.14 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 343 rules applied. Total rules applied 345 place count 486 transition count 692
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 351 rules applied. Total rules applied 696 place count 148 transition count 679
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 706 place count 141 transition count 676
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 709 place count 138 transition count 676
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 709 place count 138 transition count 651
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 759 place count 113 transition count 651
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 762 place count 110 transition count 647
Iterating global reduction 4 with 3 rules applied. Total rules applied 765 place count 110 transition count 647
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 766 place count 110 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 767 place count 109 transition count 646
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 767 place count 109 transition count 645
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 769 place count 108 transition count 645
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 770 place count 108 transition count 644
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 771 place count 107 transition count 642
Iterating global reduction 7 with 1 rules applied. Total rules applied 772 place count 107 transition count 642
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 7 with 42 rules applied. Total rules applied 814 place count 86 transition count 621
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 822 place count 86 transition count 613
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 838 place count 70 transition count 177
Iterating global reduction 8 with 16 rules applied. Total rules applied 854 place count 70 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 865 place count 70 transition count 166
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 868 place count 67 transition count 163
Iterating global reduction 9 with 3 rules applied. Total rules applied 871 place count 67 transition count 163
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 9 with 12 rules applied. Total rules applied 883 place count 61 transition count 157
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 9 with 8 rules applied. Total rules applied 891 place count 57 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 892 place count 57 transition count 164
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 900 place count 57 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 902 place count 56 transition count 162
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 910 place count 56 transition count 154
Free-agglomeration rule applied 26 times.
Iterating global reduction 10 with 26 rules applied. Total rules applied 936 place count 56 transition count 128
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 43 rules applied. Total rules applied 979 place count 30 transition count 111
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 984 place count 25 transition count 106
Iterating global reduction 11 with 5 rules applied. Total rules applied 989 place count 25 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 992 place count 25 transition count 103
Applied a total of 992 rules in 237 ms. Remains 25 /555 variables (removed 530) and now considering 103/1122 (removed 1019) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/555 places, 103/1122 transitions.
Finished random walk after 49 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=12 )
FORMULA StigmergyElection-PT-05b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Computed a total of 75 stabilizing places and 80 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 567 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 484 transition count 709
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 342 rules applied. Total rules applied 675 place count 152 transition count 699
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 681 place count 147 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 682 place count 146 transition count 698
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 682 place count 146 transition count 678
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 722 place count 126 transition count 678
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 730 place count 118 transition count 669
Iterating global reduction 4 with 8 rules applied. Total rules applied 738 place count 118 transition count 669
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 738 place count 118 transition count 668
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 740 place count 117 transition count 668
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 741 place count 116 transition count 666
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 116 transition count 666
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 743 place count 115 transition count 664
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 115 transition count 664
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 788 place count 93 transition count 642
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 807 place count 74 transition count 207
Iterating global reduction 4 with 19 rules applied. Total rules applied 826 place count 74 transition count 207
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 836 place count 74 transition count 197
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 840 place count 70 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 844 place count 70 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 848 place count 66 transition count 181
Iterating global reduction 5 with 4 rules applied. Total rules applied 852 place count 66 transition count 181
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 870 place count 57 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 871 place count 56 transition count 178
Iterating global reduction 5 with 1 rules applied. Total rules applied 872 place count 56 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 873 place count 56 transition count 177
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 878 place count 56 transition count 172
Applied a total of 878 rules in 162 ms. Remains 56 /555 variables (removed 499) and now considering 172/1122 (removed 950) transitions.
[2022-06-10 08:25:18] [INFO ] Flow matrix only has 166 transitions (discarded 6 similar events)
// Phase 1: matrix 166 rows 56 cols
[2022-06-10 08:25:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:25:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-06-10 08:25:18] [INFO ] Flow matrix only has 166 transitions (discarded 6 similar events)
// Phase 1: matrix 166 rows 56 cols
[2022-06-10 08:25:18] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:25:18] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:25:18] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2022-06-10 08:25:18] [INFO ] Redundant transitions in 7 ms returned []
[2022-06-10 08:25:18] [INFO ] Flow matrix only has 166 transitions (discarded 6 similar events)
// Phase 1: matrix 166 rows 56 cols
[2022-06-10 08:25:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:25:18] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/555 places, 172/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/555 places, 172/1122 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(G(F(G(p0))))))))'
Support contains 1 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 567 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 484 transition count 709
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 342 rules applied. Total rules applied 675 place count 152 transition count 699
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 680 place count 147 transition count 699
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 680 place count 147 transition count 679
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 720 place count 127 transition count 679
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 728 place count 119 transition count 670
Iterating global reduction 3 with 8 rules applied. Total rules applied 736 place count 119 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 736 place count 119 transition count 669
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 738 place count 118 transition count 669
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 739 place count 117 transition count 667
Iterating global reduction 3 with 1 rules applied. Total rules applied 740 place count 117 transition count 667
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 741 place count 116 transition count 665
Iterating global reduction 3 with 1 rules applied. Total rules applied 742 place count 116 transition count 665
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
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 786 place count 94 transition count 643
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 805 place count 75 transition count 208
Iterating global reduction 3 with 19 rules applied. Total rules applied 824 place count 75 transition count 208
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 833 place count 75 transition count 199
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 837 place count 71 transition count 191
Iterating global reduction 4 with 4 rules applied. Total rules applied 841 place count 71 transition count 191
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 845 place count 67 transition count 183
Iterating global reduction 4 with 4 rules applied. Total rules applied 849 place count 67 transition count 183
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 867 place count 58 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 868 place count 57 transition count 180
Iterating global reduction 4 with 1 rules applied. Total rules applied 869 place count 57 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 870 place count 57 transition count 179
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 875 place count 57 transition count 174
Applied a total of 875 rules in 127 ms. Remains 57 /555 variables (removed 498) and now considering 174/1122 (removed 948) transitions.
[2022-06-10 08:25:19] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:25:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:25:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-06-10 08:25:19] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:25:19] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:25:19] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:25:19] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2022-06-10 08:25:19] [INFO ] Redundant transitions in 7 ms returned []
[2022-06-10 08:25:19] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:25:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:25:19] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/555 places, 174/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/555 places, 174/1122 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-02 finished in 643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(p1)))||F(p2)))'
Support contains 7 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 552 transition count 1119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 552 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 550 transition count 1117
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 550 transition count 1117
Applied a total of 10 rules in 57 ms. Remains 550 /555 variables (removed 5) and now considering 1117/1122 (removed 5) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2022-06-10 08:25:19] [INFO ] Computed 6 place invariants in 23 ms
[2022-06-10 08:25:20] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 1117 rows 550 cols
[2022-06-10 08:25:20] [INFO ] Computed 6 place invariants in 33 ms
[2022-06-10 08:25:21] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
// Phase 1: matrix 1117 rows 550 cols
[2022-06-10 08:25:21] [INFO ] Computed 6 place invariants in 16 ms
[2022-06-10 08:25:21] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 550/555 places, 1117/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 550/555 places, 1117/1122 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(OR (EQ s309 1) (EQ s324 1)), p1:(AND (EQ s44 1) (EQ s139 1) (EQ s245 1) (EQ s341 1) (EQ s447 1)), p0:(EQ s324 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13955 reset in 454 ms.
Product exploration explored 100000 steps with 13985 reset in 381 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Detected a total of 75/550 stabilizing places and 80/1117 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 338 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 318 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
// Phase 1: matrix 1117 rows 550 cols
[2022-06-10 08:25:24] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-10 08:25:24] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 08:25:25] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2022-06-10 08:25:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 08:25:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 08:25:26] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2022-06-10 08:25:26] [INFO ] Computed and/alt/rep : 1073/3233/1073 causal constraints (skipped 43 transitions) in 123 ms.
[2022-06-10 08:25:26] [INFO ] Added : 17 causal constraints over 4 iterations in 446 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 550 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1117/1117 transitions.
Graph (trivial) has 557 edges and 550 vertex of which 85 / 550 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 324 place count 479 transition count 713
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 333 rules applied. Total rules applied 657 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 663 place count 151 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 664 place count 150 transition count 702
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 664 place count 150 transition count 683
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 702 place count 131 transition count 683
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 706 place count 127 transition count 679
Iterating global reduction 4 with 4 rules applied. Total rules applied 710 place count 127 transition count 679
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 762 place count 101 transition count 653
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 779 place count 84 transition count 292
Iterating global reduction 4 with 17 rules applied. Total rules applied 796 place count 84 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 803 place count 84 transition count 285
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 808 place count 79 transition count 275
Iterating global reduction 5 with 5 rules applied. Total rules applied 813 place count 79 transition count 275
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 818 place count 74 transition count 265
Iterating global reduction 5 with 5 rules applied. Total rules applied 823 place count 74 transition count 265
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 839 place count 66 transition count 266
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 840 place count 65 transition count 256
Iterating global reduction 5 with 1 rules applied. Total rules applied 841 place count 65 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 842 place count 65 transition count 255
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 847 place count 65 transition count 250
Applied a total of 847 rules in 78 ms. Remains 65 /550 variables (removed 485) and now considering 250/1117 (removed 867) transitions.
[2022-06-10 08:25:26] [INFO ] Flow matrix only has 245 transitions (discarded 5 similar events)
// Phase 1: matrix 245 rows 65 cols
[2022-06-10 08:25:26] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 08:25:26] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-06-10 08:25:26] [INFO ] Flow matrix only has 245 transitions (discarded 5 similar events)
// Phase 1: matrix 245 rows 65 cols
[2022-06-10 08:25:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:25:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:25:27] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2022-06-10 08:25:27] [INFO ] Redundant transitions in 14 ms returned []
[2022-06-10 08:25:27] [INFO ] Flow matrix only has 245 transitions (discarded 5 similar events)
// Phase 1: matrix 245 rows 65 cols
[2022-06-10 08:25:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:25:27] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/550 places, 250/1117 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/550 places, 250/1117 transitions.
Computed a total of 3 stabilizing places and 12 stable transitions
Computed a total of 3 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
[2022-06-10 08:25:27] [INFO ] Flow matrix only has 245 transitions (discarded 5 similar events)
// Phase 1: matrix 245 rows 65 cols
[2022-06-10 08:25:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:25:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 08:25:27] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-06-10 08:25:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 08:25:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-10 08:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 08:25:28] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-06-10 08:25:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:25:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 13 ms returned sat
[2022-06-10 08:25:28] [INFO ] Computed and/alt/rep : 166/766/166 causal constraints (skipped 76 transitions) in 27 ms.
[2022-06-10 08:25:28] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 40 ms :[(NOT p2)]
Product exploration explored 100000 steps with 27474 reset in 198 ms.
Product exploration explored 100000 steps with 27442 reset in 484 ms.
Built C files in :
/tmp/ltsmin15684447171765282533
[2022-06-10 08:25:29] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-06-10 08:25:29] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:25:29] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-06-10 08:25:29] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:25:29] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-06-10 08:25:29] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:25:29] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15684447171765282533
Running compilation step : cd /tmp/ltsmin15684447171765282533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1153 ms.
Running link step : cd /tmp/ltsmin15684447171765282533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin15684447171765282533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12820813136455873514.hoa' '--buchi-type=spotba'
LTSmin run took 445 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05b-LTLFireability-03 finished in 10893 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(F(p1)||F(p2)))))'
Support contains 10 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 551 transition count 1118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 549 transition count 1116
Applied a total of 12 rules in 49 ms. Remains 549 /555 variables (removed 6) and now considering 1116/1122 (removed 6) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:30] [INFO ] Computed 6 place invariants in 12 ms
[2022-06-10 08:25:31] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:31] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:25:31] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:31] [INFO ] Computed 6 place invariants in 11 ms
[2022-06-10 08:25:32] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/555 places, 1116/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 549/555 places, 1116/1122 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s69 1) (EQ s164 1) (EQ s292 1) (EQ s398 1) (EQ s493 1)), p2:(AND (EQ s80 1) (EQ s186 1) (EQ s270 1) (EQ s376 1) (EQ s482 1)), p0:(OR (EQ s69 0...], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 97 steps with 1 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-04 finished in 2127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(X(p0))))))'
Support contains 1 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 567 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 484 transition count 709
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 342 rules applied. Total rules applied 675 place count 152 transition count 699
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 680 place count 147 transition count 699
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 680 place count 147 transition count 679
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 720 place count 127 transition count 679
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 728 place count 119 transition count 670
Iterating global reduction 3 with 8 rules applied. Total rules applied 736 place count 119 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 736 place count 119 transition count 669
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 738 place count 118 transition count 669
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 739 place count 117 transition count 667
Iterating global reduction 3 with 1 rules applied. Total rules applied 740 place count 117 transition count 667
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 741 place count 116 transition count 665
Iterating global reduction 3 with 1 rules applied. Total rules applied 742 place count 116 transition count 665
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
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 786 place count 94 transition count 643
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 805 place count 75 transition count 208
Iterating global reduction 3 with 19 rules applied. Total rules applied 824 place count 75 transition count 208
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 833 place count 75 transition count 199
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 837 place count 71 transition count 191
Iterating global reduction 4 with 4 rules applied. Total rules applied 841 place count 71 transition count 191
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 845 place count 67 transition count 183
Iterating global reduction 4 with 4 rules applied. Total rules applied 849 place count 67 transition count 183
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 867 place count 58 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 868 place count 57 transition count 180
Iterating global reduction 4 with 1 rules applied. Total rules applied 869 place count 57 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 870 place count 57 transition count 179
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 875 place count 57 transition count 174
Applied a total of 875 rules in 104 ms. Remains 57 /555 variables (removed 498) and now considering 174/1122 (removed 948) transitions.
[2022-06-10 08:25:33] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:25:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:25:33] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-06-10 08:25:33] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:25:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:25:33] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:25:33] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-10 08:25:33] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 08:25:33] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:25:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:25:33] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/555 places, 174/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/555 places, 174/1122 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-05 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:(EQ s29 0)], 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 2273 steps with 258 reset in 10 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-05 finished in 553 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!(X(p0) U X(X(p1))) U X(p2)) U (G(p3)||p1)))'
Support contains 12 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 551 transition count 1118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 549 transition count 1116
Applied a total of 12 rules in 49 ms. Remains 549 /555 variables (removed 6) and now considering 1116/1122 (removed 6) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:33] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:25:33] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:33] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:25:34] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:34] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:25:35] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/555 places, 1116/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 549/555 places, 1116/1122 transitions.
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), p1, p1, true, (AND (NOT p3) p1), (AND p1 (NOT p3)), (NOT p3)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=2 dest: 7}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p3), acceptance={} source=6 dest: 8}], [{ cond=(NOT p3), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 4}, { cond=p3, acceptance={} source=7 dest: 6}, { cond=(AND p3 p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 5}, { cond=p3, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s150 1) (EQ s245 1) (EQ s340 1) (EQ s446 1)), p3:(EQ s406 1), p2:(EQ s63 1), p0:(AND (EQ s58 1) (EQ s186 1) (EQ s292 1) (EQ s387 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19938 reset in 461 ms.
Product exploration explored 100000 steps with 20017 reset in 431 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p3) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1561 ms. Reduced automaton from 9 states, 25 edges and 4 AP to 9 states, 25 edges and 4 AP.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), p1, p1, true, (AND (NOT p3) p1), (AND p1 (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 109 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:40] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:25:40] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-10 08:25:41] [INFO ] After 1127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-10 08:25:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:25:42] [INFO ] After 1019ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2022-06-10 08:25:43] [INFO ] After 2004ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 666 ms.
[2022-06-10 08:25:44] [INFO ] After 3013ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :10
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 7 properties in 65 ms.
Support contains 7 out of 549 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 555 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 335 rules applied. Total rules applied 337 place count 474 transition count 686
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 340 rules applied. Total rules applied 677 place count 144 transition count 676
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 684 place count 139 transition count 674
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 686 place count 137 transition count 674
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 686 place count 137 transition count 648
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 738 place count 111 transition count 648
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 739 place count 111 transition count 647
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 789 place count 86 transition count 622
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 799 place count 86 transition count 612
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 816 place count 69 transition count 247
Iterating global reduction 6 with 17 rules applied. Total rules applied 833 place count 69 transition count 247
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 841 place count 69 transition count 239
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 846 place count 64 transition count 234
Iterating global reduction 7 with 5 rules applied. Total rules applied 851 place count 64 transition count 234
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 861 place count 59 transition count 229
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 867 place count 56 transition count 237
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 875 place count 56 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 877 place count 55 transition count 235
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 885 place count 55 transition count 227
Free-agglomeration rule applied 29 times.
Iterating global reduction 7 with 29 rules applied. Total rules applied 914 place count 55 transition count 198
Reduce places removed 29 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 34 rules applied. Total rules applied 948 place count 26 transition count 193
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 953 place count 21 transition count 188
Iterating global reduction 8 with 5 rules applied. Total rules applied 958 place count 21 transition count 188
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 969 place count 21 transition count 177
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 981 place count 21 transition count 165
Applied a total of 981 rules in 149 ms. Remains 21 /549 variables (removed 528) and now considering 165/1116 (removed 951) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/549 places, 165/1116 transitions.
Finished random walk after 585 steps, including 29 resets, run visited all 3 properties in 34 ms. (steps per millisecond=17 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p3) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p3 (NOT p2) p0))), (G (NOT (AND p3 p0))), (G (NOT (AND p3 p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p3) (NOT p2)))), (F (AND (NOT p2) p0)), (F (AND (NOT p3) p0)), (F (AND (NOT p3) (NOT p2) p0)), (F p3), (F (AND p3 (NOT p2))), (F (AND p3 (NOT p1))), (F p2), (F (NOT (AND (NOT p3) (NOT p1)))), (F (AND (NOT p3) p1))]
Knowledge based reduction with 28 factoid took 1718 ms. Reduced automaton from 9 states, 25 edges and 4 AP to 6 states, 14 edges and 4 AP.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND p1 (NOT p2) p3) (AND (NOT p1) (NOT p3))), (NOT p2), (AND p1 (NOT p2)), p1, p1, true]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND p1 (NOT p2) p3) (AND (NOT p1) (NOT p3))), (NOT p2), (AND p1 (NOT p2)), p1, p1, true]
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:46] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:25:47] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-10 08:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 08:25:48] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2022-06-10 08:25:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 08:25:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 08:25:49] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2022-06-10 08:25:49] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 129 ms.
[2022-06-10 08:25:51] [INFO ] Added : 93 causal constraints over 19 iterations in 1571 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 12 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 27 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:51] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:25:51] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:51] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:25:52] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:52] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:25:53] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p3))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 648 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 6 states, 14 edges and 4 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND p1 (NOT p2) p3) (AND (NOT p1) (NOT p3))), (NOT p2), (AND p1 (NOT p2)), p1, p1, true]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:25:55] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:25:55] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:25:56] [INFO ] After 721ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2022-06-10 08:25:56] [INFO ] After 1316ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:1
Attempting to minimize the solution found.
Minimization took 460 ms.
[2022-06-10 08:25:57] [INFO ] After 2007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:1
[2022-06-10 08:25:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:25:58] [INFO ] After 801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-10 08:25:58] [INFO ] After 1333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 348 ms.
[2022-06-10 08:25:58] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 27 ms.
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 562 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 343 rules applied. Total rules applied 345 place count 474 transition count 678
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 348 rules applied. Total rules applied 693 place count 136 transition count 668
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 699 place count 131 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 700 place count 130 transition count 667
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 700 place count 130 transition count 641
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 752 place count 104 transition count 641
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 753 place count 104 transition count 640
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 803 place count 79 transition count 615
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 813 place count 79 transition count 605
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 833 place count 59 transition count 164
Iterating global reduction 6 with 20 rules applied. Total rules applied 853 place count 59 transition count 164
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 864 place count 59 transition count 153
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 869 place count 54 transition count 148
Iterating global reduction 7 with 5 rules applied. Total rules applied 874 place count 54 transition count 148
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 884 place count 49 transition count 143
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 890 place count 46 transition count 151
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 898 place count 46 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 900 place count 45 transition count 149
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 908 place count 45 transition count 141
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 934 place count 45 transition count 115
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 59 rules applied. Total rules applied 993 place count 19 transition count 82
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 998 place count 14 transition count 77
Iterating global reduction 8 with 5 rules applied. Total rules applied 1003 place count 14 transition count 77
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1018 place count 14 transition count 62
Applied a total of 1018 rules in 68 ms. Remains 14 /549 variables (removed 535) and now considering 62/1116 (removed 1054) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/549 places, 62/1116 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p3))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) p0)), (F p0), (F p1), (F p3), (F p2), (F (NOT (AND (NOT p3) (NOT p1))))]
Knowledge based reduction with 14 factoid took 1096 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 6 states, 14 edges and 4 AP.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND p1 (NOT p2) p3) (AND (NOT p1) (NOT p3))), (NOT p2), (AND p1 (NOT p2)), p1, p1, true]
Stuttering acceptance computed with spot in 232 ms :[(OR (AND p1 (NOT p2) p3) (AND (NOT p1) (NOT p3))), (NOT p2), (AND p1 (NOT p2)), p1, p1, true]
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:26:00] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:26:01] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 08:26:02] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2022-06-10 08:26:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 08:26:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 08:26:03] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2022-06-10 08:26:03] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 86 ms.
[2022-06-10 08:26:04] [INFO ] Added : 93 causal constraints over 19 iterations in 1381 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 259 ms :[(OR (AND p1 (NOT p2) p3) (AND (NOT p1) (NOT p3))), (NOT p2), (AND p1 (NOT p2)), p1, p1, true]
Product exploration explored 100000 steps with 19964 reset in 351 ms.
Product exploration explored 100000 steps with 19910 reset in 362 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 214 ms :[(OR (AND p1 (NOT p2) p3) (AND (NOT p1) (NOT p3))), (NOT p2), (AND p1 (NOT p2)), p1, p1, true]
Support contains 12 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 550 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Performed 317 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 317 rules applied. Total rules applied 318 place count 479 transition count 1036
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 323 place count 479 transition count 1031
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 323 place count 479 transition count 1036
Deduced a syphon composed of 327 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 333 place count 479 transition count 1036
Discarding 268 places :
Symmetric choice reduction at 2 with 268 rule applications. Total rules 601 place count 211 transition count 768
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 2 with 268 rules applied. Total rules applied 869 place count 211 transition count 768
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 909 place count 211 transition count 768
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 957 place count 163 transition count 493
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 1005 place count 163 transition count 493
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1009 place count 163 transition count 489
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1022 place count 150 transition count 471
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1035 place count 150 transition count 471
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1040 place count 145 transition count 466
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 1045 place count 145 transition count 466
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1053 place count 145 transition count 506
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1066 place count 132 transition count 480
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1079 place count 132 transition count 480
Deduced a syphon composed of 55 places in 0 ms
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 1093 place count 132 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1094 place count 132 transition count 479
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1095 place count 131 transition count 477
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1096 place count 131 transition count 477
Deduced a syphon composed of 55 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1100 place count 131 transition count 473
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 1100 rules in 155 ms. Remains 131 /549 variables (removed 418) and now considering 473/1116 (removed 643) transitions.
[2022-06-10 08:26:06] [INFO ] Redundant transitions in 13 ms returned []
[2022-06-10 08:26:06] [INFO ] Flow matrix only has 467 transitions (discarded 6 similar events)
// Phase 1: matrix 467 rows 131 cols
[2022-06-10 08:26:06] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-10 08:26:06] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/549 places, 473/1116 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/549 places, 473/1116 transitions.
Product exploration explored 100000 steps with 19955 reset in 911 ms.
Product exploration explored 100000 steps with 19937 reset in 804 ms.
Built C files in :
/tmp/ltsmin2818538790491619901
[2022-06-10 08:26:08] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2818538790491619901
Running compilation step : cd /tmp/ltsmin2818538790491619901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2818538790491619901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2818538790491619901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 12 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 46 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:26:11] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:26:11] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:26:11] [INFO ] Computed 6 place invariants in 11 ms
[2022-06-10 08:26:12] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:26:12] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:26:13] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 549/549 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin17859223462427677998
[2022-06-10 08:26:13] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17859223462427677998
Running compilation step : cd /tmp/ltsmin17859223462427677998;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17859223462427677998;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17859223462427677998;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-10 08:26:17] [INFO ] Flatten gal took : 124 ms
[2022-06-10 08:26:17] [INFO ] Flatten gal took : 85 ms
[2022-06-10 08:26:17] [INFO ] Time to serialize gal into /tmp/LTL12293437954855529349.gal : 23 ms
[2022-06-10 08:26:17] [INFO ] Time to serialize properties into /tmp/LTL12742487599101921572.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12293437954855529349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12742487599101921572.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1229343...268
Read 1 LTL properties
Checking formula 0 : !((((!((X("((((p75==1)&&(p235==1))&&((p370==1)&&(p492==1)))&&(p627==1))"))U(X(X("((((p53==1)&&(p188==1))&&((p310==1)&&(p433==1)))&&(p5...272
Formula 0 simplified : !((!(X"((((p75==1)&&(p235==1))&&((p370==1)&&(p492==1)))&&(p627==1))" U XX"((((p53==1)&&(p188==1))&&((p310==1)&&(p433==1)))&&(p568==1...257
Detected timeout of ITS tools.
[2022-06-10 08:26:32] [INFO ] Flatten gal took : 92 ms
[2022-06-10 08:26:32] [INFO ] Applying decomposition
[2022-06-10 08:26:32] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10390787334803645327.txt' '-o' '/tmp/graph10390787334803645327.bin' '-w' '/tmp/graph10390787334803645327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10390787334803645327.bin' '-l' '-1' '-v' '-w' '/tmp/graph10390787334803645327.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:26:32] [INFO ] Decomposing Gal with order
[2022-06-10 08:26:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:26:33] [INFO ] Removed a total of 2736 redundant transitions.
[2022-06-10 08:26:33] [INFO ] Flatten gal took : 263 ms
[2022-06-10 08:26:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 29 ms.
[2022-06-10 08:26:33] [INFO ] Time to serialize gal into /tmp/LTL10855935328017968101.gal : 17 ms
[2022-06-10 08:26:33] [INFO ] Time to serialize properties into /tmp/LTL3690712376909732472.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10855935328017968101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3690712376909732472.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1085593...246
Read 1 LTL properties
Checking formula 0 : !((((!((X("((((i0.u23.p75==1)&&(i0.u62.p235==1))&&((i0.u104.p370==1)&&(i0.u130.p492==1)))&&(i0.u172.p627==1))"))U(X(X("((((i0.u3.p53==...398
Formula 0 simplified : !((!(X"((((i0.u23.p75==1)&&(i0.u62.p235==1))&&((i0.u104.p370==1)&&(i0.u130.p492==1)))&&(i0.u172.p627==1))" U XX"((((i0.u3.p53==1)&&(...383
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1641904755366099886
[2022-06-10 08:26:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1641904755366099886
Running compilation step : cd /tmp/ltsmin1641904755366099886;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1641904755366099886;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1641904755366099886;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyElection-PT-05b-LTLFireability-06 finished in 77995 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0)||X(p1)) U p0)))'
Support contains 2 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 552 transition count 1119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 551 transition count 1118
Applied a total of 8 rules in 43 ms. Remains 551 /555 variables (removed 4) and now considering 1118/1122 (removed 4) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:26:51] [INFO ] Computed 6 place invariants in 12 ms
[2022-06-10 08:26:51] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:26:51] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:26:52] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:26:52] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:26:53] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/555 places, 1118/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 551/555 places, 1118/1122 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s299 1), p1:(EQ s368 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-07 finished in 2180 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 567 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 484 transition count 710
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 341 rules applied. Total rules applied 673 place count 153 transition count 700
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 679 place count 148 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 680 place count 147 transition count 699
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 680 place count 147 transition count 679
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 720 place count 127 transition count 679
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 728 place count 119 transition count 670
Iterating global reduction 4 with 8 rules applied. Total rules applied 736 place count 119 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 736 place count 119 transition count 669
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 738 place count 118 transition count 669
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 739 place count 117 transition count 667
Iterating global reduction 4 with 1 rules applied. Total rules applied 740 place count 117 transition count 667
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 741 place count 116 transition count 665
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 116 transition count 665
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 786 place count 94 transition count 643
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 805 place count 75 transition count 208
Iterating global reduction 4 with 19 rules applied. Total rules applied 824 place count 75 transition count 208
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 833 place count 75 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 837 place count 71 transition count 191
Iterating global reduction 5 with 4 rules applied. Total rules applied 841 place count 71 transition count 191
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 845 place count 67 transition count 183
Iterating global reduction 5 with 4 rules applied. Total rules applied 849 place count 67 transition count 183
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 867 place count 58 transition count 190
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 868 place count 57 transition count 180
Iterating global reduction 5 with 1 rules applied. Total rules applied 869 place count 57 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 870 place count 57 transition count 179
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 875 place count 57 transition count 174
Applied a total of 875 rules in 90 ms. Remains 57 /555 variables (removed 498) and now considering 174/1122 (removed 948) transitions.
[2022-06-10 08:26:53] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:26:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:26:53] [INFO ] Implicit Places using invariants in 161 ms returned []
[2022-06-10 08:26:53] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:26:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:26:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:26:54] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2022-06-10 08:26:54] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 08:26:54] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:26:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:26:54] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/555 places, 174/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/555 places, 174/1122 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-08 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(F(G(X(G((F(p0)||p1))))))))))'
Support contains 6 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 562 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 327 place count 484 transition count 715
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 336 rules applied. Total rules applied 663 place count 158 transition count 705
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 669 place count 153 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 670 place count 152 transition count 704
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 670 place count 152 transition count 684
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 710 place count 132 transition count 684
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 718 place count 124 transition count 675
Iterating global reduction 4 with 8 rules applied. Total rules applied 726 place count 124 transition count 675
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 726 place count 124 transition count 674
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 728 place count 123 transition count 674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 729 place count 122 transition count 672
Iterating global reduction 4 with 1 rules applied. Total rules applied 730 place count 122 transition count 672
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 731 place count 121 transition count 670
Iterating global reduction 4 with 1 rules applied. Total rules applied 732 place count 121 transition count 670
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 776 place count 99 transition count 648
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 791 place count 84 transition count 343
Iterating global reduction 4 with 15 rules applied. Total rules applied 806 place count 84 transition count 343
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 812 place count 84 transition count 337
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 816 place count 80 transition count 329
Iterating global reduction 5 with 4 rules applied. Total rules applied 820 place count 80 transition count 329
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 824 place count 76 transition count 321
Iterating global reduction 5 with 4 rules applied. Total rules applied 828 place count 76 transition count 321
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 846 place count 67 transition count 328
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 847 place count 66 transition count 318
Iterating global reduction 5 with 1 rules applied. Total rules applied 848 place count 66 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 849 place count 66 transition count 317
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 854 place count 66 transition count 312
Applied a total of 854 rules in 84 ms. Remains 66 /555 variables (removed 489) and now considering 312/1122 (removed 810) transitions.
[2022-06-10 08:26:54] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
// Phase 1: matrix 306 rows 66 cols
[2022-06-10 08:26:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:26:54] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-06-10 08:26:54] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
// Phase 1: matrix 306 rows 66 cols
[2022-06-10 08:26:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:26:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:26:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2022-06-10 08:26:54] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 08:26:54] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
// Phase 1: matrix 306 rows 66 cols
[2022-06-10 08:26:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:26:54] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/555 places, 312/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/555 places, 312/1122 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s20 1) (EQ s32 1) (EQ s43 1) (EQ s57 1)), p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-09 finished in 659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U p0))'
Support contains 1 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 567 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 484 transition count 710
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 341 rules applied. Total rules applied 673 place count 153 transition count 700
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 679 place count 148 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 680 place count 147 transition count 699
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 680 place count 147 transition count 679
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 720 place count 127 transition count 679
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 728 place count 119 transition count 670
Iterating global reduction 4 with 8 rules applied. Total rules applied 736 place count 119 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 736 place count 119 transition count 669
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 738 place count 118 transition count 669
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 739 place count 117 transition count 667
Iterating global reduction 4 with 1 rules applied. Total rules applied 740 place count 117 transition count 667
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 741 place count 116 transition count 665
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 116 transition count 665
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 786 place count 94 transition count 643
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 805 place count 75 transition count 208
Iterating global reduction 4 with 19 rules applied. Total rules applied 824 place count 75 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 834 place count 75 transition count 198
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 838 place count 71 transition count 190
Iterating global reduction 5 with 4 rules applied. Total rules applied 842 place count 71 transition count 190
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 846 place count 67 transition count 182
Iterating global reduction 5 with 4 rules applied. Total rules applied 850 place count 67 transition count 182
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 868 place count 58 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 869 place count 57 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 870 place count 57 transition count 179
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 875 place count 57 transition count 174
Applied a total of 875 rules in 66 ms. Remains 57 /555 variables (removed 498) and now considering 174/1122 (removed 948) transitions.
[2022-06-10 08:26:54] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:26:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:26:55] [INFO ] Implicit Places using invariants in 71 ms returned []
[2022-06-10 08:26:55] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:26:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:26:55] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:26:55] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2022-06-10 08:26:55] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 08:26:55] [INFO ] Flow matrix only has 168 transitions (discarded 6 similar events)
// Phase 1: matrix 168 rows 57 cols
[2022-06-10 08:26:55] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 08:26:55] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/555 places, 174/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/555 places, 174/1122 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 2 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-11 finished in 451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 552 transition count 1119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 551 transition count 1118
Applied a total of 8 rules in 36 ms. Remains 551 /555 variables (removed 4) and now considering 1118/1122 (removed 4) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:26:55] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:26:55] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:26:55] [INFO ] Computed 6 place invariants in 9 ms
[2022-06-10 08:26:56] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:26:56] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:26:57] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/555 places, 1118/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 551/555 places, 1118/1122 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s86 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1122 reset in 155 ms.
Product exploration explored 100000 steps with 1116 reset in 206 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618063 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 618063 steps, saw 106228 distinct states, run finished after 3002 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:27:01] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:27:01] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-10 08:27:01] [INFO ] After 490ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 08:27:01] [INFO ] After 585ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-10 08:27:01] [INFO ] After 753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Graph (trivial) has 563 edges and 551 vertex of which 85 / 551 are part of one of the 15 SCC in 0 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1043 edges and 481 vertex of which 476 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 345 rules applied. Total rules applied 347 place count 476 transition count 678
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 350 rules applied. Total rules applied 697 place count 136 transition count 668
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 702 place count 131 transition count 668
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 702 place count 131 transition count 641
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 756 place count 104 transition count 641
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 757 place count 104 transition count 640
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 758 place count 103 transition count 638
Iterating global reduction 4 with 1 rules applied. Total rules applied 759 place count 103 transition count 638
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 760 place count 103 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 761 place count 102 transition count 637
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 762 place count 101 transition count 635
Iterating global reduction 6 with 1 rules applied. Total rules applied 763 place count 101 transition count 635
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 809 place count 78 transition count 612
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 818 place count 78 transition count 603
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 837 place count 59 transition count 164
Iterating global reduction 7 with 19 rules applied. Total rules applied 856 place count 59 transition count 164
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 867 place count 59 transition count 153
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 871 place count 55 transition count 149
Iterating global reduction 8 with 4 rules applied. Total rules applied 875 place count 55 transition count 149
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 885 place count 50 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 891 place count 47 transition count 152
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 899 place count 47 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 901 place count 46 transition count 150
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 909 place count 46 transition count 142
Free-agglomeration rule applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 935 place count 46 transition count 116
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 59 rules applied. Total rules applied 994 place count 20 transition count 83
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 999 place count 15 transition count 78
Iterating global reduction 9 with 5 rules applied. Total rules applied 1004 place count 15 transition count 78
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1019 place count 15 transition count 63
Applied a total of 1019 rules in 100 ms. Remains 15 /551 variables (removed 536) and now considering 63/1118 (removed 1055) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/551 places, 63/1118 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Applied a total of 0 rules in 12 ms. Remains 551 /551 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:27:02] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:27:02] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:27:02] [INFO ] Computed 6 place invariants in 9 ms
[2022-06-10 08:27:03] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:27:03] [INFO ] Computed 6 place invariants in 9 ms
[2022-06-10 08:27:04] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 1118/1118 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642240 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642240 steps, saw 110105 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1118 rows 551 cols
[2022-06-10 08:27:08] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:27:08] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-10 08:27:08] [INFO ] After 497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 08:27:08] [INFO ] After 593ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-10 08:27:08] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Graph (trivial) has 563 edges and 551 vertex of which 85 / 551 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1043 edges and 481 vertex of which 476 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 345 rules applied. Total rules applied 347 place count 476 transition count 678
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 350 rules applied. Total rules applied 697 place count 136 transition count 668
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 702 place count 131 transition count 668
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 702 place count 131 transition count 641
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 756 place count 104 transition count 641
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 757 place count 104 transition count 640
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 758 place count 103 transition count 638
Iterating global reduction 4 with 1 rules applied. Total rules applied 759 place count 103 transition count 638
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 760 place count 103 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 761 place count 102 transition count 637
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 762 place count 101 transition count 635
Iterating global reduction 6 with 1 rules applied. Total rules applied 763 place count 101 transition count 635
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 809 place count 78 transition count 612
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 818 place count 78 transition count 603
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 837 place count 59 transition count 164
Iterating global reduction 7 with 19 rules applied. Total rules applied 856 place count 59 transition count 164
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 867 place count 59 transition count 153
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 871 place count 55 transition count 149
Iterating global reduction 8 with 4 rules applied. Total rules applied 875 place count 55 transition count 149
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 885 place count 50 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 891 place count 47 transition count 152
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 899 place count 47 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 901 place count 46 transition count 150
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 909 place count 46 transition count 142
Free-agglomeration rule applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 935 place count 46 transition count 116
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 59 rules applied. Total rules applied 994 place count 20 transition count 83
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 999 place count 15 transition count 78
Iterating global reduction 9 with 5 rules applied. Total rules applied 1004 place count 15 transition count 78
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1019 place count 15 transition count 63
Applied a total of 1019 rules in 97 ms. Remains 15 /551 variables (removed 536) and now considering 63/1118 (removed 1055) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/551 places, 63/1118 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1117 reset in 246 ms.
Product exploration explored 100000 steps with 1114 reset in 268 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Graph (trivial) has 563 edges and 551 vertex of which 85 / 551 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Performed 330 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 330 rules applied. Total rules applied 331 place count 481 transition count 1038
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 336 place count 481 transition count 1033
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 336 place count 481 transition count 1038
Deduced a syphon composed of 341 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 347 place count 481 transition count 1038
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 630 place count 198 transition count 754
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 913 place count 198 transition count 754
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 914 place count 197 transition count 752
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 915 place count 197 transition count 752
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 954 place count 197 transition count 752
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 1008 place count 143 transition count 273
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 1062 place count 143 transition count 273
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1073 place count 143 transition count 262
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1092 place count 124 transition count 239
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 1111 place count 124 transition count 239
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1115 place count 120 transition count 235
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1119 place count 120 transition count 235
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1127 place count 120 transition count 275
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1140 place count 107 transition count 249
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1153 place count 107 transition count 249
Deduced a syphon composed of 48 places in 0 ms
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 1167 place count 107 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1168 place count 107 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1169 place count 106 transition count 246
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1170 place count 106 transition count 246
Deduced a syphon composed of 48 places in 1 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1174 place count 106 transition count 242
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 1174 rules in 185 ms. Remains 106 /551 variables (removed 445) and now considering 242/1118 (removed 876) transitions.
[2022-06-10 08:27:10] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 08:27:10] [INFO ] Flow matrix only has 236 transitions (discarded 6 similar events)
// Phase 1: matrix 236 rows 106 cols
[2022-06-10 08:27:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:27:10] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/551 places, 242/1118 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/551 places, 242/1118 transitions.
Entered a terminal (fully accepting) state of product in 38206 steps with 2813 reset in 223 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-12 finished in 15716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(!G(p0)) U F(((p1 U p2)&&!p2))))'
Support contains 9 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 558 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 325 place count 484 transition count 717
Reduce places removed 324 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 334 rules applied. Total rules applied 659 place count 160 transition count 707
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 665 place count 155 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 666 place count 154 transition count 706
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 666 place count 154 transition count 686
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 706 place count 134 transition count 686
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 714 place count 126 transition count 677
Iterating global reduction 4 with 8 rules applied. Total rules applied 722 place count 126 transition count 677
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 722 place count 126 transition count 676
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 724 place count 125 transition count 676
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 725 place count 124 transition count 674
Iterating global reduction 4 with 1 rules applied. Total rules applied 726 place count 124 transition count 674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 727 place count 123 transition count 672
Iterating global reduction 4 with 1 rules applied. Total rules applied 728 place count 123 transition count 672
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 772 place count 101 transition count 650
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 787 place count 86 transition count 345
Iterating global reduction 4 with 15 rules applied. Total rules applied 802 place count 86 transition count 345
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 808 place count 86 transition count 339
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 812 place count 82 transition count 331
Iterating global reduction 5 with 4 rules applied. Total rules applied 816 place count 82 transition count 331
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 820 place count 78 transition count 323
Iterating global reduction 5 with 4 rules applied. Total rules applied 824 place count 78 transition count 323
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 842 place count 69 transition count 330
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 843 place count 68 transition count 320
Iterating global reduction 5 with 1 rules applied. Total rules applied 844 place count 68 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 845 place count 68 transition count 319
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 850 place count 68 transition count 314
Applied a total of 850 rules in 99 ms. Remains 68 /555 variables (removed 487) and now considering 314/1122 (removed 808) transitions.
[2022-06-10 08:27:11] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:11] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 08:27:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-06-10 08:27:11] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:27:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:27:12] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2022-06-10 08:27:12] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 08:27:12] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:27:12] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/555 places, 314/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/555 places, 314/1122 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, false, p2]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(EQ s40 1), p1:(OR (AND (EQ s6 1) (EQ s18 1) (EQ s34 1) (EQ s47 1) (EQ s61 1)) (AND (EQ s6 1) (EQ s21 1) (EQ s32 1) (EQ s47 1) (EQ s59 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9448 reset in 265 ms.
Product exploration explored 100000 steps with 2048 reset in 173 ms.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/68 stabilizing places and 19/314 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), true, (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 447 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[true, false, p2]
Incomplete random walk after 10000 steps, including 951 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-10 08:27:13] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:27:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:27:14] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 08:27:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-10 08:27:14] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 08:27:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:27:14] [INFO ] After 85ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 08:27:14] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-10 08:27:14] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 68/68 places, 314/314 transitions.
Graph (complete) has 352 edges and 68 vertex of which 67 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 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 67 transition count 302
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 32 place count 57 transition count 292
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 57 transition count 262
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 96 place count 26 transition count 259
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 21 transition count 254
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 21 transition count 254
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 137 place count 21 transition count 223
Performed 5 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 16 transition count 164
Drop transitions removed 5 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 193 place count 16 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 15 transition count 117
Applied a total of 194 rules in 23 ms. Remains 15 /68 variables (removed 53) and now considering 117/314 (removed 197) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/68 places, 117/314 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), true, (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 490 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[true, false, p2]
Stuttering acceptance computed with spot in 113 ms :[true, false, p2]
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 314/314 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2022-06-10 08:27:15] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:27:15] [INFO ] Implicit Places using invariants in 83 ms returned []
[2022-06-10 08:27:15] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:27:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:27:15] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2022-06-10 08:27:15] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 08:27:15] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:27:16] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 314/314 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/68 stabilizing places and 19/314 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 524 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 159 ms :[true, false, p2]
Incomplete random walk after 10000 steps, including 954 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-10 08:27:17] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:27:17] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 08:27:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:27:17] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 08:27:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:27:17] [INFO ] After 131ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 08:27:18] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-06-10 08:27:18] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 68/68 places, 314/314 transitions.
Graph (complete) has 352 edges and 68 vertex of which 67 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 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 67 transition count 302
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 32 place count 57 transition count 292
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 57 transition count 262
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 96 place count 26 transition count 259
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 21 transition count 254
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 21 transition count 254
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 137 place count 21 transition count 223
Performed 5 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 16 transition count 164
Drop transitions removed 5 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 193 place count 16 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 15 transition count 117
Applied a total of 194 rules in 28 ms. Remains 15 /68 variables (removed 53) and now considering 117/314 (removed 197) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/68 places, 117/314 transitions.
Finished random walk after 100 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 831 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[true, false, p2]
Stuttering acceptance computed with spot in 129 ms :[true, false, p2]
Stuttering acceptance computed with spot in 120 ms :[true, false, p2]
Product exploration explored 100000 steps with 3892 reset in 277 ms.
Product exploration explored 100000 steps with 9380 reset in 416 ms.
Built C files in :
/tmp/ltsmin3256566855882482412
[2022-06-10 08:27:20] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2022-06-10 08:27:20] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:27:20] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2022-06-10 08:27:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:27:20] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2022-06-10 08:27:20] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:27:20] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3256566855882482412
Running compilation step : cd /tmp/ltsmin3256566855882482412;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1298 ms.
Running link step : cd /tmp/ltsmin3256566855882482412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3256566855882482412;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased42984577862493949.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 314/314 transitions.
Applied a total of 0 rules in 18 ms. Remains 68 /68 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2022-06-10 08:27:35] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:27:35] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-06-10 08:27:35] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:27:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:27:35] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2022-06-10 08:27:35] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 08:27:35] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 68 cols
[2022-06-10 08:27:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:27:35] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 314/314 transitions.
Built C files in :
/tmp/ltsmin1867236433235376299
[2022-06-10 08:27:35] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2022-06-10 08:27:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:27:35] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2022-06-10 08:27:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:27:35] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2022-06-10 08:27:35] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:27:35] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1867236433235376299
Running compilation step : cd /tmp/ltsmin1867236433235376299;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1216 ms.
Running link step : cd /tmp/ltsmin1867236433235376299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1867236433235376299;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7412335616093910947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 08:27:50] [INFO ] Flatten gal took : 31 ms
[2022-06-10 08:27:50] [INFO ] Flatten gal took : 29 ms
[2022-06-10 08:27:50] [INFO ] Time to serialize gal into /tmp/LTL15674302840562801205.gal : 5 ms
[2022-06-10 08:27:50] [INFO ] Time to serialize properties into /tmp/LTL14142904349962335619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15674302840562801205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14142904349962335619.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1567430...268
Read 1 LTL properties
Checking formula 0 : !((!((F(!(G("((((p75==1)&&(p210==1))&&((p357==1)&&(p492==1)))&&(p640==1))"))))U(F((("(((((p75==1)&&(p210==1))&&((p357==1)&&(p492==1)))...267
Formula 0 simplified : F!G"((((p75==1)&&(p210==1))&&((p357==1)&&(p492==1)))&&(p640==1))" U F("(p403!=1)" & ("(((((p75==1)&&(p210==1))&&((p357==1)&&(p492==1...250
Reverse transition relation is NOT exact ! Due to transitions t69.t70.t71.t72.t73.t579, t77, t167.t168.t169.t170.t171.t591, t175, t276, t366.t367.t368.t369...629
Computing Next relation with stutter on 14211 deadlock states
Detected timeout of ITS tools.
[2022-06-10 08:28:06] [INFO ] Flatten gal took : 47 ms
[2022-06-10 08:28:06] [INFO ] Applying decomposition
[2022-06-10 08:28:06] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10214646476530982775.txt' '-o' '/tmp/graph10214646476530982775.bin' '-w' '/tmp/graph10214646476530982775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10214646476530982775.bin' '-l' '-1' '-v' '-w' '/tmp/graph10214646476530982775.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:28:06] [INFO ] Decomposing Gal with order
[2022-06-10 08:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:28:06] [INFO ] Removed a total of 1142 redundant transitions.
[2022-06-10 08:28:06] [INFO ] Flatten gal took : 76 ms
[2022-06-10 08:28:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2022-06-10 08:28:06] [INFO ] Time to serialize gal into /tmp/LTL8522819250731716379.gal : 5 ms
[2022-06-10 08:28:06] [INFO ] Time to serialize properties into /tmp/LTL14135310826796644861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8522819250731716379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14135310826796644861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8522819...246
Read 1 LTL properties
Checking formula 0 : !((!((F(!(G("((((i2.u2.p75==1)&&(i2.u3.p210==1))&&((u6.p357==1)&&(u9.p492==1)))&&(u11.p640==1))"))))U(F((("(((((i2.u2.p75==1)&&(i2.u3....345
Formula 0 simplified : F!G"((((i2.u2.p75==1)&&(i2.u3.p210==1))&&((u6.p357==1)&&(u9.p492==1)))&&(u11.p640==1))" U F("(i0.u8.p403!=1)" & ("(((((i2.u2.p75==1)...328
Reverse transition relation is NOT exact ! Due to transitions t265_t346, t53_t573_t542_t543_t41, t53_t575_t371_t372_t373_t408_t444_t445_t41, t53_t570_t273_...693
Computing Next relation with stutter on 14211 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14198672052176176823
[2022-06-10 08:28:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14198672052176176823
Running compilation step : cd /tmp/ltsmin14198672052176176823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1132 ms.
Running link step : cd /tmp/ltsmin14198672052176176823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14198672052176176823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(<>(![]((LTLAPp0==true))) U <>((((LTLAPp1==true) U (LTLAPp2==true))&&!(LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 7519 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05b-LTLFireability-13 finished in 78998 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U p1)))'
Support contains 10 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 551 transition count 1118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 549 transition count 1116
Applied a total of 12 rules in 40 ms. Remains 549 /555 variables (removed 6) and now considering 1116/1122 (removed 6) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:28:30] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:28:30] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:28:30] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-10 08:28:31] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
// Phase 1: matrix 1116 rows 549 cols
[2022-06-10 08:28:31] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 08:28:32] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/555 places, 1116/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 549/555 places, 1116/1122 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p1, p1]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s58 1) (EQ s175 1) (EQ s292 1) (EQ s398 1) (EQ s482 1)), p0:(AND (EQ s33 1) (EQ s150 1) (EQ s245 1) (EQ s340 1) (EQ s446 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1357 ms.
Product exploration explored 100000 steps with 50000 reset in 804 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-05b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-14 finished in 4666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 6 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 1122/1122 transitions.
Graph (trivial) has 562 edges and 555 vertex of which 85 / 555 are part of one of the 15 SCC in 0 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 327 place count 484 transition count 715
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 336 rules applied. Total rules applied 663 place count 158 transition count 705
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 669 place count 153 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 670 place count 152 transition count 704
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 670 place count 152 transition count 684
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 710 place count 132 transition count 684
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 718 place count 124 transition count 675
Iterating global reduction 4 with 8 rules applied. Total rules applied 726 place count 124 transition count 675
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 726 place count 124 transition count 674
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 728 place count 123 transition count 674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 729 place count 122 transition count 672
Iterating global reduction 4 with 1 rules applied. Total rules applied 730 place count 122 transition count 672
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 731 place count 121 transition count 670
Iterating global reduction 4 with 1 rules applied. Total rules applied 732 place count 121 transition count 670
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 778 place count 98 transition count 647
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 793 place count 83 transition count 342
Iterating global reduction 4 with 15 rules applied. Total rules applied 808 place count 83 transition count 342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 814 place count 83 transition count 336
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 818 place count 79 transition count 328
Iterating global reduction 5 with 4 rules applied. Total rules applied 822 place count 79 transition count 328
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 826 place count 75 transition count 320
Iterating global reduction 5 with 4 rules applied. Total rules applied 830 place count 75 transition count 320
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 848 place count 66 transition count 327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 849 place count 65 transition count 317
Iterating global reduction 5 with 1 rules applied. Total rules applied 850 place count 65 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 851 place count 65 transition count 316
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 856 place count 65 transition count 311
Applied a total of 856 rules in 101 ms. Remains 65 /555 variables (removed 490) and now considering 311/1122 (removed 811) transitions.
[2022-06-10 08:28:34] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:28:34] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-06-10 08:28:34] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:34] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 08:28:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:28:35] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2022-06-10 08:28:35] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 08:28:35] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:28:35] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/555 places, 311/1122 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/555 places, 311/1122 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s4 1) (NEQ s18 1) (NEQ s32 1) (NEQ s44 1) (NEQ s56 1)), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 115 reset in 50 ms.
Product exploration explored 100000 steps with 3413 reset in 112 ms.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/65 stabilizing places and 19/311 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 973 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 08:28:36] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:28:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:28:36] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:28:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:28:36] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:28:36] [INFO ] After 42ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:36] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-10 08:28:36] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 311/311 transitions.
Graph (complete) has 349 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 64 transition count 299
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 32 place count 54 transition count 289
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 54 transition count 259
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 110 place count 23 transition count 242
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 18 transition count 237
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 18 transition count 237
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 151 place count 18 transition count 206
Performed 5 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 13 transition count 109
Drop transitions removed 5 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 231 place count 13 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 12 transition count 38
Applied a total of 232 rules in 33 ms. Remains 12 /65 variables (removed 53) and now considering 38/311 (removed 273) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/65 places, 38/311 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 311/311 transitions.
Applied a total of 0 rules in 8 ms. Remains 65 /65 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2022-06-10 08:28:36] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 08:28:37] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-06-10 08:28:37] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:28:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:28:37] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-06-10 08:28:37] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 08:28:37] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 08:28:37] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 311/311 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/65 stabilizing places and 19/311 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 974 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 08:28:38] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:28:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:28:38] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:28:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 08:28:38] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:38] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:28:38] [INFO ] After 44ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:38] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-10 08:28:38] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 311/311 transitions.
Graph (complete) has 349 edges and 65 vertex of which 64 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 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 64 transition count 299
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 32 place count 54 transition count 289
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 54 transition count 259
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 110 place count 23 transition count 242
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 18 transition count 237
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 18 transition count 237
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 151 place count 18 transition count 206
Performed 5 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 13 transition count 109
Drop transitions removed 5 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 231 place count 13 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 12 transition count 38
Applied a total of 232 rules in 32 ms. Remains 12 /65 variables (removed 53) and now considering 38/311 (removed 273) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/65 places, 38/311 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9737 reset in 278 ms.
Product exploration explored 100000 steps with 1768 reset in 97 ms.
Built C files in :
/tmp/ltsmin2448379996226266902
[2022-06-10 08:28:39] [INFO ] Computing symmetric may disable matrix : 311 transitions.
[2022-06-10 08:28:39] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:28:39] [INFO ] Computing symmetric may enable matrix : 311 transitions.
[2022-06-10 08:28:39] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:28:39] [INFO ] Computing Do-Not-Accords matrix : 311 transitions.
[2022-06-10 08:28:39] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:28:39] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2448379996226266902
Running compilation step : cd /tmp/ltsmin2448379996226266902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1378 ms.
Running link step : cd /tmp/ltsmin2448379996226266902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2448379996226266902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12326766324676407563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 311/311 transitions.
Applied a total of 0 rules in 7 ms. Remains 65 /65 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2022-06-10 08:28:54] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:28:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-06-10 08:28:54] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:28:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-10 08:28:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-06-10 08:28:54] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 08:28:54] [INFO ] Flow matrix only has 305 transitions (discarded 6 similar events)
// Phase 1: matrix 305 rows 65 cols
[2022-06-10 08:28:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 08:28:54] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 311/311 transitions.
Built C files in :
/tmp/ltsmin3204959238423112886
[2022-06-10 08:28:54] [INFO ] Computing symmetric may disable matrix : 311 transitions.
[2022-06-10 08:28:54] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:28:54] [INFO ] Computing symmetric may enable matrix : 311 transitions.
[2022-06-10 08:28:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:28:54] [INFO ] Computing Do-Not-Accords matrix : 311 transitions.
[2022-06-10 08:28:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:28:54] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3204959238423112886
Running compilation step : cd /tmp/ltsmin3204959238423112886;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1245 ms.
Running link step : cd /tmp/ltsmin3204959238423112886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3204959238423112886;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18063993785000095745.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 08:29:10] [INFO ] Flatten gal took : 26 ms
[2022-06-10 08:29:10] [INFO ] Flatten gal took : 25 ms
[2022-06-10 08:29:10] [INFO ] Time to serialize gal into /tmp/LTL11901598309182037219.gal : 5 ms
[2022-06-10 08:29:10] [INFO ] Time to serialize properties into /tmp/LTL15273088567453457140.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11901598309182037219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15273088567453457140.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1190159...268
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p270==1)")||(G("((((p28!=1)||(p175!=1))||((p323!=1)||(p458!=1)))||(p593!=1))"))))))
Formula 0 simplified : !GF("(p270==1)" | G"((((p28!=1)||(p175!=1))||((p323!=1)||(p458!=1)))||(p593!=1))")
Reverse transition relation is NOT exact ! Due to transitions t69.t70.t71.t72.t73.t579, t77, t167.t168.t169.t170.t171.t591, t175, t268.t269.t270.t271.t272....649
Computing Next relation with stutter on 14211 deadlock states
Detected timeout of ITS tools.
[2022-06-10 08:29:25] [INFO ] Flatten gal took : 26 ms
[2022-06-10 08:29:25] [INFO ] Applying decomposition
[2022-06-10 08:29:25] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2949007353873704883.txt' '-o' '/tmp/graph2949007353873704883.bin' '-w' '/tmp/graph2949007353873704883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2949007353873704883.bin' '-l' '-1' '-v' '-w' '/tmp/graph2949007353873704883.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:29:25] [INFO ] Decomposing Gal with order
[2022-06-10 08:29:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:29:25] [INFO ] Removed a total of 1142 redundant transitions.
[2022-06-10 08:29:25] [INFO ] Flatten gal took : 46 ms
[2022-06-10 08:29:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2022-06-10 08:29:25] [INFO ] Time to serialize gal into /tmp/LTL5519172752867861032.gal : 4 ms
[2022-06-10 08:29:25] [INFO ] Time to serialize properties into /tmp/LTL6566369231755351024.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5519172752867861032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6566369231755351024.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5519172...245
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i1.u5.p270==1)")||(G("((((i4.u2.p28!=1)||(i5.u4.p175!=1))||((u6.p323!=1)||(u10.p458!=1)))||(i4.u11.p593!=1))"))))))
Formula 0 simplified : !GF("(i1.u5.p270==1)" | G"((((i4.u2.p28!=1)||(i5.u4.p175!=1))||((u6.p323!=1)||(u10.p458!=1)))||(i4.u11.p593!=1))")
Reverse transition relation is NOT exact ! Due to transitions t357_t358_t364_t445, t53_t573_t542_t543_t41, t53_t575_t371_t372_t373_t408_t444_t445_t41, t53_...720
Computing Next relation with stutter on 14211 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7272939547180728185
[2022-06-10 08:29:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7272939547180728185
Running compilation step : cd /tmp/ltsmin7272939547180728185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 905 ms.
Running link step : cd /tmp/ltsmin7272939547180728185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7272939547180728185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 2618 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05b-LTLFireability-15 finished in 69262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!(X(p0) U X(X(p1))) U X(p2)) U (G(p3)||p1)))'
[2022-06-10 08:29:44] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18129820641691766352
[2022-06-10 08:29:44] [INFO ] Computing symmetric may disable matrix : 1122 transitions.
[2022-06-10 08:29:44] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:29:44] [INFO ] Applying decomposition
[2022-06-10 08:29:44] [INFO ] Computing symmetric may enable matrix : 1122 transitions.
[2022-06-10 08:29:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 08:29:44] [INFO ] Flatten gal took : 75 ms
[2022-06-10 08:29:44] [INFO ] Computing Do-Not-Accords matrix : 1122 transitions.
[2022-06-10 08:29:44] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7651415645861273589.txt' '-o' '/tmp/graph7651415645861273589.bin' '-w' '/tmp/graph7651415645861273589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7651415645861273589.bin' '-l' '-1' '-v' '-w' '/tmp/graph7651415645861273589.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:29:44] [INFO ] Built C files in 317ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18129820641691766352
Running compilation step : cd /tmp/ltsmin18129820641691766352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-10 08:29:44] [INFO ] Decomposing Gal with order
[2022-06-10 08:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:29:44] [INFO ] Removed a total of 2732 redundant transitions.
[2022-06-10 08:29:44] [INFO ] Flatten gal took : 173 ms
[2022-06-10 08:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 31 ms.
[2022-06-10 08:29:44] [INFO ] Time to serialize gal into /tmp/LTLFireability11118720898636298776.gal : 15 ms
[2022-06-10 08:29:44] [INFO ] Time to serialize properties into /tmp/LTLFireability15758816789697519416.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11118720898636298776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15758816789697519416.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((((!((X("((((i3.u24.p75==1)&&(i3.u77.p235==1))&&((i3.u90.p370==1)&&(i3.u144.p492==1)))&&(i3.u178.p627==1))"))U(X(X("((((i3.u18.p53==...407
Formula 0 simplified : !((!(X"((((i3.u24.p75==1)&&(i3.u77.p235==1))&&((i3.u90.p370==1)&&(i3.u144.p492==1)))&&(i3.u178.p627==1))" U XX"((((i3.u18.p53==1)&&(...392
Compilation finished in 5856 ms.
Running link step : cd /tmp/ltsmin18129820641691766352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin18129820641691766352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(X((LTLAPp0==true)) U X(X((LTLAPp1==true)))) U X((LTLAPp2==true))) U ([]((LTLAPp3==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 427 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 286704 ms.

BK_STOP 1654849791066

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-05b, 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 r294-smll-165463872700308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b 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 ;