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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10288.396 2212805.00 7708224.00 2402.80 FTTFTFFTFFFFFFFT 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-165463872800324.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-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872800324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.8K May 30 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 30 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K May 30 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 30 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:55 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 1.2M 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-06b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654853810773

Running Version 202205111006
[2022-06-10 09:36:53] [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 09:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 09:36:54] [INFO ] Load time of PNML (sax parser for PT used): 643 ms
[2022-06-10 09:36:54] [INFO ] Transformed 835 places.
[2022-06-10 09:36:54] [INFO ] Transformed 2416 transitions.
[2022-06-10 09:36:54] [INFO ] Found NUPN structural information;
[2022-06-10 09:36:54] [INFO ] Parsed PT model containing 835 places and 2416 transitions in 930 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 180 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-06b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 104 place count 731 transition count 2312
Iterating global reduction 0 with 104 rules applied. Total rules applied 208 place count 731 transition count 2312
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 259 place count 680 transition count 2261
Iterating global reduction 0 with 51 rules applied. Total rules applied 310 place count 680 transition count 2261
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 320 place count 670 transition count 2251
Iterating global reduction 0 with 10 rules applied. Total rules applied 330 place count 670 transition count 2251
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 334 place count 666 transition count 2247
Iterating global reduction 0 with 4 rules applied. Total rules applied 338 place count 666 transition count 2247
Applied a total of 338 rules in 394 ms. Remains 666 /835 variables (removed 169) and now considering 2247/2416 (removed 169) transitions.
// Phase 1: matrix 2247 rows 666 cols
[2022-06-10 09:36:55] [INFO ] Computed 7 place invariants in 109 ms
[2022-06-10 09:36:55] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 2247 rows 666 cols
[2022-06-10 09:36:55] [INFO ] Computed 7 place invariants in 47 ms
[2022-06-10 09:36:56] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
// Phase 1: matrix 2247 rows 666 cols
[2022-06-10 09:36:56] [INFO ] Computed 7 place invariants in 49 ms
[2022-06-10 09:36:58] [INFO ] Dead Transitions using invariants and state equation in 2062 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/835 places, 2247/2416 transitions.
Finished structural reductions, in 1 iterations. Remains : 666/835 places, 2247/2416 transitions.
Support contains 56 out of 666 places after structural reductions.
[2022-06-10 09:36:59] [INFO ] Flatten gal took : 564 ms
[2022-06-10 09:36:59] [INFO ] Flatten gal took : 211 ms
[2022-06-10 09:37:00] [INFO ] Input system was already deterministic with 2247 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 938 ms. (steps per millisecond=10 ) properties (out of 37) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 2247 rows 666 cols
[2022-06-10 09:37:01] [INFO ] Computed 7 place invariants in 35 ms
[2022-06-10 09:37:03] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2022-06-10 09:37:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2022-06-10 09:37:13] [INFO ] After 9118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2022-06-10 09:37:15] [INFO ] Deduced a trap composed of 164 places in 1121 ms of which 10 ms to minimize.
[2022-06-10 09:37:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1350 ms
[2022-06-10 09:37:24] [INFO ] Deduced a trap composed of 165 places in 1663 ms of which 3 ms to minimize.
[2022-06-10 09:37:25] [INFO ] Deduced a trap composed of 169 places in 1489 ms of which 2 ms to minimize.
[2022-06-10 09:37:27] [INFO ] Deduced a trap composed of 171 places in 1296 ms of which 4 ms to minimize.
[2022-06-10 09:37:28] [INFO ] Deduced a trap composed of 168 places in 1180 ms of which 3 ms to minimize.
[2022-06-10 09:37:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-10 09:37:28] [INFO ] After 25398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:30
Fused 30 Parikh solutions to 28 different solutions.
Parikh walk visited 19 properties in 601 ms.
Support contains 16 out of 666 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 658 edges and 666 vertex of which 94 / 666 are part of one of the 17 SCC in 15 ms
Free SCC test removed 77 places
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Graph (complete) has 1398 edges and 589 vertex of which 583 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.49 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 401 rules applied. Total rules applied 403 place count 583 transition count 1742
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 407 rules applied. Total rules applied 810 place count 188 transition count 1730
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 821 place count 182 transition count 1725
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 828 place count 177 transition count 1723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 829 place count 176 transition count 1723
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 829 place count 176 transition count 1692
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 891 place count 145 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 892 place count 144 transition count 1691
Iterating global reduction 5 with 1 rules applied. Total rules applied 893 place count 144 transition count 1691
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 893 place count 144 transition count 1690
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 895 place count 143 transition count 1690
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 896 place count 143 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 897 place count 142 transition count 1446
Iterating global reduction 6 with 1 rules applied. Total rules applied 898 place count 142 transition count 1446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 899 place count 142 transition count 1445
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 955 place count 114 transition count 1416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 963 place count 114 transition count 1408
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 975 place count 102 transition count 737
Iterating global reduction 8 with 12 rules applied. Total rules applied 987 place count 102 transition count 737
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 993 place count 102 transition count 731
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 995 place count 100 transition count 727
Iterating global reduction 9 with 2 rules applied. Total rules applied 997 place count 100 transition count 727
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1007 place count 95 transition count 722
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 1021 place count 88 transition count 729
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 1031 place count 88 transition count 719
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1033 place count 87 transition count 725
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1041 place count 87 transition count 717
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1043 place count 86 transition count 723
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1051 place count 86 transition count 715
Free-agglomeration rule applied 37 times.
Iterating global reduction 9 with 37 rules applied. Total rules applied 1088 place count 86 transition count 678
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 40 rules applied. Total rules applied 1128 place count 49 transition count 675
Drop transitions removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 10 with 192 rules applied. Total rules applied 1320 place count 49 transition count 483
Applied a total of 1320 rules in 941 ms. Remains 49 /666 variables (removed 617) and now considering 483/2247 (removed 1764) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/666 places, 483/2247 transitions.
Finished random walk after 238 steps, including 0 resets, run visited all 11 properties in 19 ms. (steps per millisecond=12 )
Computed a total of 90 stabilizing places and 96 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 662 transition count 2243
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 662 transition count 2243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 660 transition count 2241
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 660 transition count 2241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 658 transition count 2239
Applied a total of 16 rules in 183 ms. Remains 658 /666 variables (removed 8) and now considering 2239/2247 (removed 8) transitions.
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:31] [INFO ] Computed 7 place invariants in 35 ms
[2022-06-10 09:37:31] [INFO ] Implicit Places using invariants in 762 ms returned []
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:31] [INFO ] Computed 7 place invariants in 28 ms
[2022-06-10 09:37:33] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:33] [INFO ] Computed 7 place invariants in 31 ms
[2022-06-10 09:37:35] [INFO ] Dead Transitions using invariants and state equation in 2096 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 658/666 places, 2239/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 658/666 places, 2239/2247 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s469 1), p0:(EQ s411 0)], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 950 reset in 590 ms.
Product exploration explored 100000 steps with 950 reset in 465 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 458975 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458975 steps, saw 79154 distinct states, run finished after 3002 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:40] [INFO ] Computed 7 place invariants in 21 ms
[2022-06-10 09:37:40] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:37:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-06-10 09:37:42] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:37:43] [INFO ] Deduced a trap composed of 164 places in 1432 ms of which 2 ms to minimize.
[2022-06-10 09:37:45] [INFO ] Deduced a trap composed of 164 places in 1434 ms of which 1 ms to minimize.
[2022-06-10 09:37:46] [INFO ] Deduced a trap composed of 168 places in 1334 ms of which 4 ms to minimize.
[2022-06-10 09:37:47] [INFO ] Deduced a trap composed of 163 places in 1231 ms of which 1 ms to minimize.
[2022-06-10 09:37:49] [INFO ] Deduced a trap composed of 165 places in 1325 ms of which 2 ms to minimize.
[2022-06-10 09:37:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 7438 ms
[2022-06-10 09:37:49] [INFO ] After 8499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-06-10 09:37:49] [INFO ] After 8810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 658/658 places, 2239/2239 transitions.
Graph (trivial) has 673 edges and 658 vertex of which 102 / 658 are part of one of the 18 SCC in 3 ms
Free SCC test removed 84 places
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 1380 edges and 574 vertex of which 568 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 403 transitions
Trivial Post-agglo rules discarded 403 transitions
Performed 403 trivial Post agglomeration. Transition count delta: 403
Iterating post reduction 0 with 409 rules applied. Total rules applied 411 place count 568 transition count 1716
Reduce places removed 403 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 415 rules applied. Total rules applied 826 place count 165 transition count 1704
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 833 place count 159 transition count 1703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 834 place count 158 transition count 1703
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 834 place count 158 transition count 1673
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 894 place count 128 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 895 place count 127 transition count 1672
Iterating global reduction 4 with 1 rules applied. Total rules applied 896 place count 127 transition count 1672
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 896 place count 127 transition count 1671
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 898 place count 126 transition count 1671
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 899 place count 126 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 900 place count 125 transition count 1427
Iterating global reduction 5 with 1 rules applied. Total rules applied 901 place count 125 transition count 1427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 902 place count 125 transition count 1426
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 964 place count 94 transition count 1395
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 976 place count 94 transition count 1383
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 1000 place count 70 transition count 272
Iterating global reduction 7 with 24 rules applied. Total rules applied 1024 place count 70 transition count 272
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1036 place count 70 transition count 260
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1042 place count 64 transition count 254
Iterating global reduction 8 with 6 rules applied. Total rules applied 1048 place count 64 transition count 254
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 8 with 12 rules applied. Total rules applied 1060 place count 58 transition count 248
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 1066 place count 55 transition count 256
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1074 place count 55 transition count 248
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 1076 place count 54 transition count 254
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1084 place count 54 transition count 246
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 1086 place count 53 transition count 252
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1094 place count 53 transition count 244
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 1125 place count 53 transition count 213
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 8 with 96 rules applied. Total rules applied 1221 place count 22 transition count 148
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1227 place count 16 transition count 142
Iterating global reduction 9 with 6 rules applied. Total rules applied 1233 place count 16 transition count 142
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 1264 place count 16 transition count 111
Applied a total of 1264 rules in 445 ms. Remains 16 /658 variables (removed 642) and now considering 111/2239 (removed 2128) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/658 places, 111/2239 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 658 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2239/2239 transitions.
Applied a total of 0 rules in 30 ms. Remains 658 /658 variables (removed 0) and now considering 2239/2239 (removed 0) transitions.
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:50] [INFO ] Computed 7 place invariants in 32 ms
[2022-06-10 09:37:51] [INFO ] Implicit Places using invariants in 754 ms returned []
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:51] [INFO ] Computed 7 place invariants in 57 ms
[2022-06-10 09:37:52] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:52] [INFO ] Computed 7 place invariants in 31 ms
[2022-06-10 09:37:55] [INFO ] Dead Transitions using invariants and state equation in 2603 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 658/658 places, 2239/2239 transitions.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 321970 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321970 steps, saw 57067 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2239 rows 658 cols
[2022-06-10 09:37:59] [INFO ] Computed 7 place invariants in 60 ms
[2022-06-10 09:37:59] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:37:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2022-06-10 09:38:00] [INFO ] After 1080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:38:01] [INFO ] Deduced a trap composed of 164 places in 1351 ms of which 2 ms to minimize.
[2022-06-10 09:38:03] [INFO ] Deduced a trap composed of 164 places in 1316 ms of which 1 ms to minimize.
[2022-06-10 09:38:04] [INFO ] Deduced a trap composed of 168 places in 1319 ms of which 1 ms to minimize.
[2022-06-10 09:38:06] [INFO ] Deduced a trap composed of 163 places in 1389 ms of which 2 ms to minimize.
[2022-06-10 09:38:07] [INFO ] Deduced a trap composed of 165 places in 1297 ms of which 1 ms to minimize.
[2022-06-10 09:38:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 7320 ms
[2022-06-10 09:38:07] [INFO ] After 8480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-06-10 09:38:08] [INFO ] After 8784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 658/658 places, 2239/2239 transitions.
Graph (trivial) has 673 edges and 658 vertex of which 102 / 658 are part of one of the 18 SCC in 3 ms
Free SCC test removed 84 places
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 1380 edges and 574 vertex of which 568 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 403 transitions
Trivial Post-agglo rules discarded 403 transitions
Performed 403 trivial Post agglomeration. Transition count delta: 403
Iterating post reduction 0 with 409 rules applied. Total rules applied 411 place count 568 transition count 1716
Reduce places removed 403 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 415 rules applied. Total rules applied 826 place count 165 transition count 1704
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 833 place count 159 transition count 1703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 834 place count 158 transition count 1703
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 834 place count 158 transition count 1673
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 894 place count 128 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 895 place count 127 transition count 1672
Iterating global reduction 4 with 1 rules applied. Total rules applied 896 place count 127 transition count 1672
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 896 place count 127 transition count 1671
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 898 place count 126 transition count 1671
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 899 place count 126 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 900 place count 125 transition count 1427
Iterating global reduction 5 with 1 rules applied. Total rules applied 901 place count 125 transition count 1427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 902 place count 125 transition count 1426
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 964 place count 94 transition count 1395
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 976 place count 94 transition count 1383
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 1000 place count 70 transition count 272
Iterating global reduction 7 with 24 rules applied. Total rules applied 1024 place count 70 transition count 272
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1036 place count 70 transition count 260
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1042 place count 64 transition count 254
Iterating global reduction 8 with 6 rules applied. Total rules applied 1048 place count 64 transition count 254
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 8 with 12 rules applied. Total rules applied 1060 place count 58 transition count 248
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 1066 place count 55 transition count 256
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1074 place count 55 transition count 248
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 1076 place count 54 transition count 254
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1084 place count 54 transition count 246
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1086 place count 53 transition count 252
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1094 place count 53 transition count 244
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 1125 place count 53 transition count 213
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 8 with 96 rules applied. Total rules applied 1221 place count 22 transition count 148
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1227 place count 16 transition count 142
Iterating global reduction 9 with 6 rules applied. Total rules applied 1233 place count 16 transition count 142
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 1264 place count 16 transition count 111
Applied a total of 1264 rules in 296 ms. Remains 16 /658 variables (removed 642) and now considering 111/2239 (removed 2128) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/658 places, 111/2239 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 948 reset in 299 ms.
Product exploration explored 100000 steps with 950 reset in 292 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2239/2239 transitions.
Graph (trivial) has 673 edges and 658 vertex of which 102 / 658 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 574 transition count 2143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 399 place count 574 transition count 2137
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 399 place count 574 transition count 2143
Deduced a syphon composed of 404 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 411 place count 574 transition count 2143
Discarding 334 places :
Symmetric choice reduction at 2 with 334 rule applications. Total rules 745 place count 240 transition count 1809
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 2 with 334 rules applied. Total rules applied 1079 place count 240 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1080 place count 239 transition count 1566
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1081 place count 239 transition count 1566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1082 place count 239 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1083 place count 238 transition count 1564
Deduced a syphon composed of 75 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1084 place count 238 transition count 1564
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 3 with 49 rules applied. Total rules applied 1133 place count 238 transition count 1564
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 1201 place count 170 transition count 403
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 3 with 68 rules applied. Total rules applied 1269 place count 170 transition count 403
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1281 place count 170 transition count 391
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1305 place count 146 transition count 361
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 24 rules applied. Total rules applied 1329 place count 146 transition count 361
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1335 place count 140 transition count 355
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1341 place count 140 transition count 355
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1350 place count 140 transition count 400
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1365 place count 125 transition count 370
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 1380 place count 125 transition count 370
Deduced a syphon composed of 56 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 1396 place count 125 transition count 354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1397 place count 125 transition count 367
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1398 place count 124 transition count 365
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 124 transition count 365
Deduced a syphon composed of 56 places in 1 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1403 place count 124 transition count 361
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 1403 rules in 437 ms. Remains 124 /658 variables (removed 534) and now considering 361/2239 (removed 1878) transitions.
[2022-06-10 09:38:10] [INFO ] Redundant transitions in 34 ms returned []
[2022-06-10 09:38:10] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
// Phase 1: matrix 354 rows 124 cols
[2022-06-10 09:38:10] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-10 09:38:10] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/658 places, 361/2239 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/658 places, 361/2239 transitions.
Product exploration explored 100000 steps with 7752 reset in 658 ms.
Product exploration explored 100000 steps with 7734 reset in 528 ms.
Built C files in :
/tmp/ltsmin410681282418177185
[2022-06-10 09:38:12] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin410681282418177185
Running compilation step : cd /tmp/ltsmin410681282418177185;'/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/ltsmin410681282418177185;'/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/ltsmin410681282418177185;'/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 1 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2239/2239 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 657 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 656 transition count 2237
Applied a total of 4 rules in 98 ms. Remains 656 /658 variables (removed 2) and now considering 2237/2239 (removed 2) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:38:15] [INFO ] Computed 7 place invariants in 26 ms
[2022-06-10 09:38:15] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:38:15] [INFO ] Computed 7 place invariants in 23 ms
[2022-06-10 09:38:17] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2234 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:38:17] [INFO ] Computed 7 place invariants in 42 ms
[2022-06-10 09:38:19] [INFO ] Dead Transitions using invariants and state equation in 2421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2237/2239 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/658 places, 2237/2239 transitions.
Built C files in :
/tmp/ltsmin4799400145278265684
[2022-06-10 09:38:19] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4799400145278265684
Running compilation step : cd /tmp/ltsmin4799400145278265684;'/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/ltsmin4799400145278265684;'/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/ltsmin4799400145278265684;'/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 09:38:23] [INFO ] Flatten gal took : 261 ms
[2022-06-10 09:38:23] [INFO ] Flatten gal took : 202 ms
[2022-06-10 09:38:23] [INFO ] Time to serialize gal into /tmp/LTL11007238460988367213.gal : 42 ms
[2022-06-10 09:38:23] [INFO ] Time to serialize properties into /tmp/LTL13494854227266911842.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/LTL11007238460988367213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13494854227266911842.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/LTL1100723...268
Read 1 LTL properties
Checking formula 0 : !(((G("(p523==0)"))||(X("(p592==1)"))))
Formula 0 simplified : !(G"(p523==0)" | X"(p592==1)")
Detected timeout of ITS tools.
[2022-06-10 09:38:39] [INFO ] Flatten gal took : 258 ms
[2022-06-10 09:38:39] [INFO ] Applying decomposition
[2022-06-10 09:38:39] [INFO ] Flatten gal took : 290 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/graph6819382706242767574.txt' '-o' '/tmp/graph6819382706242767574.bin' '-w' '/tmp/graph6819382706242767574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6819382706242767574.bin' '-l' '-1' '-v' '-w' '/tmp/graph6819382706242767574.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:38:40] [INFO ] Decomposing Gal with order
[2022-06-10 09:38:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:38:41] [INFO ] Removed a total of 9281 redundant transitions.
[2022-06-10 09:38:41] [INFO ] Flatten gal took : 761 ms
[2022-06-10 09:38:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 129 ms.
[2022-06-10 09:38:41] [INFO ] Time to serialize gal into /tmp/LTL16488308369011005377.gal : 31 ms
[2022-06-10 09:38:41] [INFO ] Time to serialize properties into /tmp/LTL11176470854165051581.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/LTL16488308369011005377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11176470854165051581.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/LTL1648830...247
Read 1 LTL properties
Checking formula 0 : !(((G("(i26.i1.i3.u163.p523==0)"))||(X("(i26.i1.i4.u209.p592==1)"))))
Formula 0 simplified : !(G"(i26.i1.i3.u163.p523==0)" | X"(i26.i1.i4.u209.p592==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12694183452260842665
[2022-06-10 09:38:57] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12694183452260842665
Running compilation step : cd /tmp/ltsmin12694183452260842665;'/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/ltsmin12694183452260842665;'/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/ltsmin12694183452260842665;'/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-06b-LTLFireability-00 finished in 89287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U X(X((!p1&&(X(p3)||p2)))))))'
Support contains 14 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 2242
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 2242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 658 transition count 2239
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 658 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 656 transition count 2237
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 656 transition count 2237
Applied a total of 20 rules in 86 ms. Remains 656 /666 variables (removed 10) and now considering 2237/2247 (removed 10) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:00] [INFO ] Computed 7 place invariants in 20 ms
[2022-06-10 09:39:00] [INFO ] Implicit Places using invariants in 675 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:00] [INFO ] Computed 7 place invariants in 21 ms
[2022-06-10 09:39:01] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:01] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-10 09:39:03] [INFO ] Dead Transitions using invariants and state equation in 2049 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/666 places, 2237/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/666 places, 2237/2247 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(AND (EQ s34 1) (EQ s151 1) (EQ s235 1) (EQ s352 1) (EQ s469 1) (EQ s553 1)), p2:(OR (NEQ s378 1) (AND (EQ s81 1) (EQ s176 1) (EQ s271 1) (EQ s377 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 602 ms.
Product exploration explored 100000 steps with 33333 reset in 559 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p2 (NOT p3))
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-06b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLFireability-02 finished in 5370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p1)&&p0) U p2)))'
Support contains 11 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 2242
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 2242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 658 transition count 2239
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 658 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 656 transition count 2237
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 656 transition count 2237
Applied a total of 20 rules in 87 ms. Remains 656 /666 variables (removed 10) and now considering 2237/2247 (removed 10) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:05] [INFO ] Computed 7 place invariants in 19 ms
[2022-06-10 09:39:05] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:05] [INFO ] Computed 7 place invariants in 18 ms
[2022-06-10 09:39:07] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:07] [INFO ] Computed 7 place invariants in 30 ms
[2022-06-10 09:39:09] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/666 places, 2237/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/666 places, 2237/2247 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (NOT (AND (EQ s45 1) (EQ s129 1) (EQ s235 1) (EQ s341 1) (EQ s447 1) (EQ s564 1))) (EQ s513 1)), p0:(AND (EQ s45 1) (EQ s129 1) (EQ s235 1) (EQ s34...], 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]]
Product exploration explored 100000 steps with 950 reset in 515 ms.
Product exploration explored 100000 steps with 954 reset in 383 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (OR (AND (NOT p2) (NOT p0)) (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 803 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 199705 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199705 steps, saw 37018 distinct states, run finished after 3006 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:15] [INFO ] Computed 7 place invariants in 20 ms
[2022-06-10 09:39:15] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2022-06-10 09:39:17] [INFO ] After 1302ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:1
[2022-06-10 09:39:17] [INFO ] After 2074ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 669 ms.
[2022-06-10 09:39:18] [INFO ] After 2937ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :2 real:1
[2022-06-10 09:39:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-10 09:39:20] [INFO ] After 1317ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-06-10 09:39:20] [INFO ] After 1971ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 574 ms.
[2022-06-10 09:39:21] [INFO ] After 2729ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Parikh walk visited 2 properties in 8 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (OR (AND (NOT p2) (NOT p0)) (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (G (NOT (AND p0 (NOT p2) p1))), (G (OR p0 p2)), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 15 factoid took 891 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 11 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2237/2237 transitions.
Applied a total of 0 rules in 21 ms. Remains 656 /656 variables (removed 0) and now considering 2237/2237 (removed 0) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:22] [INFO ] Computed 7 place invariants in 19 ms
[2022-06-10 09:39:22] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:22] [INFO ] Computed 7 place invariants in 19 ms
[2022-06-10 09:39:24] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:24] [INFO ] Computed 7 place invariants in 23 ms
[2022-06-10 09:39:26] [INFO ] Dead Transitions using invariants and state equation in 2342 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/656 places, 2237/2237 transitions.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X p2)), true, (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 495 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 229484 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229484 steps, saw 41902 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:30] [INFO ] Computed 7 place invariants in 18 ms
[2022-06-10 09:39:31] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-10 09:39:32] [INFO ] After 1248ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-10 09:39:32] [INFO ] After 1557ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 256 ms.
[2022-06-10 09:39:32] [INFO ] After 1983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-06-10 09:39:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-06-10 09:39:34] [INFO ] After 1607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 09:39:35] [INFO ] After 2583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1096 ms.
[2022-06-10 09:39:36] [INFO ] After 3872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 126 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=25 )
Parikh walk visited 3 properties in 15 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X p2)), true, (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 492 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 943 reset in 309 ms.
Product exploration explored 100000 steps with 947 reset in 267 ms.
Built C files in :
/tmp/ltsmin3514838994257872228
[2022-06-10 09:39:38] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3514838994257872228
Running compilation step : cd /tmp/ltsmin3514838994257872228;'/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/ltsmin3514838994257872228;'/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/ltsmin3514838994257872228;'/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 11 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2237/2237 transitions.
Applied a total of 0 rules in 20 ms. Remains 656 /656 variables (removed 0) and now considering 2237/2237 (removed 0) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:41] [INFO ] Computed 7 place invariants in 19 ms
[2022-06-10 09:39:41] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:41] [INFO ] Computed 7 place invariants in 21 ms
[2022-06-10 09:39:43] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:39:43] [INFO ] Computed 7 place invariants in 19 ms
[2022-06-10 09:39:45] [INFO ] Dead Transitions using invariants and state equation in 2089 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/656 places, 2237/2237 transitions.
Built C files in :
/tmp/ltsmin1718211581430690053
[2022-06-10 09:39:45] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1718211581430690053
Running compilation step : cd /tmp/ltsmin1718211581430690053;'/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/ltsmin1718211581430690053;'/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/ltsmin1718211581430690053;'/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 09:39:48] [INFO ] Flatten gal took : 254 ms
[2022-06-10 09:39:49] [INFO ] Flatten gal took : 259 ms
[2022-06-10 09:39:49] [INFO ] Time to serialize gal into /tmp/LTL12182211172663787324.gal : 57 ms
[2022-06-10 09:39:49] [INFO ] Time to serialize properties into /tmp/LTL14829946031308304367.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/LTL12182211172663787324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14829946031308304367.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/LTL1218221...268
Read 1 LTL properties
Checking formula 0 : !((G(((((X("((((p29==1)&&(p164==1))&&((p311==1)&&(p459==1)))&&((p569==1)&&(p704==1)))"))&&("(p54==1)"))&&("((p164==1)&&(p299==1))"))&&...292
Formula 0 simplified : !G(("(((p434==1)&&(p569==1))&&(p716==1))" & "((p164==1)&&(p299==1))" & "(p54==1)" & X"((((p29==1)&&(p164==1))&&((p311==1)&&(p459==1)...279
Detected timeout of ITS tools.
[2022-06-10 09:40:04] [INFO ] Flatten gal took : 129 ms
[2022-06-10 09:40:04] [INFO ] Applying decomposition
[2022-06-10 09:40:04] [INFO ] Flatten gal took : 126 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/graph11869635868551505497.txt' '-o' '/tmp/graph11869635868551505497.bin' '-w' '/tmp/graph11869635868551505497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11869635868551505497.bin' '-l' '-1' '-v' '-w' '/tmp/graph11869635868551505497.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:40:05] [INFO ] Decomposing Gal with order
[2022-06-10 09:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:40:05] [INFO ] Removed a total of 9259 redundant transitions.
[2022-06-10 09:40:05] [INFO ] Flatten gal took : 428 ms
[2022-06-10 09:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 82 ms.
[2022-06-10 09:40:05] [INFO ] Time to serialize gal into /tmp/LTL12888631804404337111.gal : 22 ms
[2022-06-10 09:40:05] [INFO ] Time to serialize properties into /tmp/LTL17763489989122549842.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/LTL12888631804404337111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17763489989122549842.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/LTL1288863...247
Read 1 LTL properties
Checking formula 0 : !((G(((((X("((((i8.u7.p29==1)&&(i8.u50.p164==1))&&((i8.u97.p311==1)&&(i8.u130.p459==1)))&&((i8.u180.p569==1)&&(i8.u220.p704==1)))"))&&...435
Formula 0 simplified : !G(("(((i8.u136.p434==1)&&(i8.u180.p569==1))&&(i8.u225.p716==1))" & "((i8.u50.p164==1)&&(i8.u92.p299==1))" & "(i8.u18.p54==1)" & X"(...422
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16912967257662763638
[2022-06-10 09:40:20] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16912967257662763638
Running compilation step : cd /tmp/ltsmin16912967257662763638;'/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/ltsmin16912967257662763638;'/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/ltsmin16912967257662763638;'/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-06b-LTLFireability-03 finished in 78587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!X(X(p0)) U G(p0)) U !X(p1))))'
Support contains 7 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 2242
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 2242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 658 transition count 2239
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 658 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 656 transition count 2237
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 656 transition count 2237
Applied a total of 20 rules in 89 ms. Remains 656 /666 variables (removed 10) and now considering 2237/2247 (removed 10) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:24] [INFO ] Computed 7 place invariants in 21 ms
[2022-06-10 09:40:24] [INFO ] Implicit Places using invariants in 583 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:24] [INFO ] Computed 7 place invariants in 19 ms
[2022-06-10 09:40:26] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:26] [INFO ] Computed 7 place invariants in 20 ms
[2022-06-10 09:40:27] [INFO ] Dead Transitions using invariants and state equation in 1732 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/666 places, 2237/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/666 places, 2237/2247 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), p1, p1, p1, p1, true, (OR (NOT p0) p1)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(EQ s587 1), p1:(AND (EQ s45 1) (EQ s129 1) (EQ s246 1) (EQ s352 1) (EQ s458 1) (EQ s553 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 33333 reset in 586 ms.
Product exploration explored 100000 steps with 33333 reset in 596 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-06b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLFireability-04 finished in 5556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((((!F(p1)&&F(p2)) U p3)&&p0))) U p4))'
Support contains 16 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 666 edges and 666 vertex of which 103 / 666 are part of one of the 18 SCC in 12 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 384 transitions
Trivial Post-agglo rules discarded 384 transitions
Performed 384 trivial Post agglomeration. Transition count delta: 384
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 580 transition count 1765
Reduce places removed 384 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 396 rules applied. Total rules applied 781 place count 196 transition count 1753
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 788 place count 190 transition count 1752
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 789 place count 189 transition count 1752
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 789 place count 189 transition count 1728
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 837 place count 165 transition count 1728
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 846 place count 156 transition count 1718
Iterating global reduction 4 with 9 rules applied. Total rules applied 855 place count 156 transition count 1718
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 856 place count 156 transition count 1717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 857 place count 155 transition count 1717
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 857 place count 155 transition count 1716
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 859 place count 154 transition count 1716
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 861 place count 152 transition count 1713
Iterating global reduction 6 with 2 rules applied. Total rules applied 863 place count 152 transition count 1713
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 864 place count 151 transition count 1711
Iterating global reduction 6 with 1 rules applied. Total rules applied 865 place count 151 transition count 1711
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 915 place count 126 transition count 1686
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 928 place count 113 transition count 1023
Iterating global reduction 6 with 13 rules applied. Total rules applied 941 place count 113 transition count 1023
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 944 place count 113 transition count 1020
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 949 place count 108 transition count 1010
Iterating global reduction 7 with 5 rules applied. Total rules applied 954 place count 108 transition count 1010
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 959 place count 103 transition count 1000
Iterating global reduction 7 with 5 rules applied. Total rules applied 964 place count 103 transition count 1000
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 984 place count 93 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 985 place count 92 transition count 995
Iterating global reduction 7 with 1 rules applied. Total rules applied 986 place count 92 transition count 995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 987 place count 92 transition count 994
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 993 place count 92 transition count 988
Applied a total of 993 rules in 327 ms. Remains 92 /666 variables (removed 574) and now considering 988/2247 (removed 1259) transitions.
[2022-06-10 09:40:29] [INFO ] Flow matrix only has 981 transitions (discarded 7 similar events)
// Phase 1: matrix 981 rows 92 cols
[2022-06-10 09:40:29] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 09:40:30] [INFO ] Implicit Places using invariants in 183 ms returned []
[2022-06-10 09:40:30] [INFO ] Flow matrix only has 981 transitions (discarded 7 similar events)
// Phase 1: matrix 981 rows 92 cols
[2022-06-10 09:40:30] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 09:40:30] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:40:30] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2022-06-10 09:40:30] [INFO ] Redundant transitions in 62 ms returned []
[2022-06-10 09:40:30] [INFO ] Flow matrix only has 981 transitions (discarded 7 similar events)
// Phase 1: matrix 981 rows 92 cols
[2022-06-10 09:40:30] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 09:40:31] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/666 places, 988/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/666 places, 988/2247 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p4), (OR (NOT p3) (NOT p0) (NOT p4)), (OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={} source=0 dest: 1}], [{ cond=(NOT p4), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p4 (NOT p0)) (AND p4 (NOT p3) p1)), acceptance={} source=1 dest: 2}, { cond=(AND p4 p0 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p4 p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p4 p0 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p3) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p3) p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p4:(AND (EQ s9 1) (EQ s22 1) (EQ s36 1) (EQ s49 1) (EQ s66 1) (EQ s80 1)), p0:(AND (EQ s9 1) (EQ s22 1) (EQ s36 1) (EQ s49 1) (EQ s66 1) (EQ s80 1)), p3:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-05 finished in 2170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((G(F(((p0 U G(p0))||p1))) U p2))))))'
Support contains 11 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 671 edges and 666 vertex of which 103 / 666 are part of one of the 18 SCC in 1 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 391 place count 580 transition count 1759
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 402 rules applied. Total rules applied 793 place count 190 transition count 1747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 799 place count 184 transition count 1747
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 799 place count 184 transition count 1723
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 847 place count 160 transition count 1723
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 856 place count 151 transition count 1713
Iterating global reduction 3 with 9 rules applied. Total rules applied 865 place count 151 transition count 1713
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 866 place count 151 transition count 1712
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 867 place count 150 transition count 1712
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 867 place count 150 transition count 1711
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 869 place count 149 transition count 1711
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 872 place count 146 transition count 1465
Iterating global reduction 5 with 3 rules applied. Total rules applied 875 place count 146 transition count 1465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 876 place count 146 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 877 place count 145 transition count 1462
Iterating global reduction 6 with 1 rules applied. Total rules applied 878 place count 145 transition count 1462
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 6 with 50 rules applied. Total rules applied 928 place count 120 transition count 1437
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 942 place count 106 transition count 1002
Iterating global reduction 6 with 14 rules applied. Total rules applied 956 place count 106 transition count 1002
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 961 place count 106 transition count 997
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 965 place count 102 transition count 989
Iterating global reduction 7 with 4 rules applied. Total rules applied 969 place count 102 transition count 989
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 973 place count 98 transition count 981
Iterating global reduction 7 with 4 rules applied. Total rules applied 977 place count 98 transition count 981
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 999 place count 87 transition count 988
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1000 place count 86 transition count 974
Iterating global reduction 7 with 1 rules applied. Total rules applied 1001 place count 86 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1002 place count 86 transition count 973
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1008 place count 86 transition count 967
Applied a total of 1008 rules in 281 ms. Remains 86 /666 variables (removed 580) and now considering 967/2247 (removed 1280) transitions.
[2022-06-10 09:40:32] [INFO ] Flow matrix only has 959 transitions (discarded 8 similar events)
// Phase 1: matrix 959 rows 86 cols
[2022-06-10 09:40:32] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 09:40:32] [INFO ] Implicit Places using invariants in 180 ms returned []
[2022-06-10 09:40:32] [INFO ] Flow matrix only has 959 transitions (discarded 8 similar events)
// Phase 1: matrix 959 rows 86 cols
[2022-06-10 09:40:32] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 09:40:32] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:40:32] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2022-06-10 09:40:32] [INFO ] Redundant transitions in 23 ms returned []
[2022-06-10 09:40:32] [INFO ] Flow matrix only has 959 transitions (discarded 8 similar events)
// Phase 1: matrix 959 rows 86 cols
[2022-06-10 09:40:32] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 09:40:33] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/666 places, 967/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/666 places, 967/2247 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s6 1), p1:(AND (EQ s10 1) (EQ s25 1) (EQ s37 1) (EQ s52 1) (EQ s65 1) (EQ s76 1)), p0:(AND (EQ s13 1) (EQ s25 1) (EQ s39 1) (EQ s50 1) (EQ s65 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-06 finished in 1744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p1)||p0)))&&F(p2)))'
Support contains 8 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 2242
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 2242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 658 transition count 2239
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 658 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 656 transition count 2237
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 656 transition count 2237
Applied a total of 20 rules in 90 ms. Remains 656 /666 variables (removed 10) and now considering 2237/2247 (removed 10) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:33] [INFO ] Computed 7 place invariants in 21 ms
[2022-06-10 09:40:34] [INFO ] Implicit Places using invariants in 586 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:34] [INFO ] Computed 7 place invariants in 18 ms
[2022-06-10 09:40:35] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:35] [INFO ] Computed 7 place invariants in 21 ms
[2022-06-10 09:40:38] [INFO ] Dead Transitions using invariants and state equation in 2174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/666 places, 2237/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/666 places, 2237/2247 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s236 1), p0:(OR (EQ s236 0) (EQ s39 0)), p1:(OR (EQ s81 0) (EQ s187 0) (EQ s271 0) (EQ s388 0) (EQ s494 0) (EQ s611 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 427 steps with 3 reset in 2 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-08 finished in 4839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !X((X(!G(p1))||F(!p0)))))'
Support contains 7 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 2242
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 2242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 658 transition count 2239
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 658 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 656 transition count 2237
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 656 transition count 2237
Applied a total of 20 rules in 143 ms. Remains 656 /666 variables (removed 10) and now considering 2237/2247 (removed 10) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:38] [INFO ] Computed 7 place invariants in 30 ms
[2022-06-10 09:40:39] [INFO ] Implicit Places using invariants in 732 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:39] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-10 09:40:40] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:40] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-10 09:40:43] [INFO ] Dead Transitions using invariants and state equation in 2375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/666 places, 2237/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/666 places, 2237/2247 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(OR p0 p1), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}]], initial=0, aps=[p0:(NEQ s391 1), p1:(AND (EQ s81 1) (EQ s165 1) (EQ s271 1) (EQ s377 1) (EQ s483 1) (EQ s600 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]]
Entered a terminal (fully accepting) state of product in 1576 steps with 14 reset in 5 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-09 finished in 5376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)&&!(F(G(F(p1))) U !p2)))))'
Support contains 8 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 672 edges and 666 vertex of which 96 / 666 are part of one of the 17 SCC in 1 ms
Free SCC test removed 79 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 586 transition count 1760
Reduce places removed 396 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 408 rules applied. Total rules applied 805 place count 190 transition count 1748
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 812 place count 184 transition count 1747
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 815 place count 183 transition count 1745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 816 place count 182 transition count 1745
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 816 place count 182 transition count 1720
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 866 place count 157 transition count 1720
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 875 place count 148 transition count 1710
Iterating global reduction 5 with 9 rules applied. Total rules applied 884 place count 148 transition count 1710
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 885 place count 148 transition count 1709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 886 place count 147 transition count 1709
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 886 place count 147 transition count 1708
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 888 place count 146 transition count 1708
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 891 place count 143 transition count 1462
Iterating global reduction 7 with 3 rules applied. Total rules applied 894 place count 143 transition count 1462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 895 place count 143 transition count 1461
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 896 place count 142 transition count 1459
Iterating global reduction 8 with 1 rules applied. Total rules applied 897 place count 142 transition count 1459
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 50 rules applied. Total rules applied 947 place count 117 transition count 1434
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 965 place count 99 transition count 414
Iterating global reduction 8 with 18 rules applied. Total rules applied 983 place count 99 transition count 414
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 991 place count 99 transition count 406
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 995 place count 95 transition count 398
Iterating global reduction 9 with 4 rules applied. Total rules applied 999 place count 95 transition count 398
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1003 place count 91 transition count 390
Iterating global reduction 9 with 4 rules applied. Total rules applied 1007 place count 91 transition count 390
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1029 place count 80 transition count 397
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1030 place count 79 transition count 383
Iterating global reduction 9 with 1 rules applied. Total rules applied 1031 place count 79 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1032 place count 79 transition count 382
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 1039 place count 79 transition count 375
Applied a total of 1039 rules in 361 ms. Remains 79 /666 variables (removed 587) and now considering 375/2247 (removed 1872) transitions.
[2022-06-10 09:40:44] [INFO ] Flow matrix only has 368 transitions (discarded 7 similar events)
// Phase 1: matrix 368 rows 79 cols
[2022-06-10 09:40:44] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:40:44] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-06-10 09:40:44] [INFO ] Flow matrix only has 368 transitions (discarded 7 similar events)
// Phase 1: matrix 368 rows 79 cols
[2022-06-10 09:40:44] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 09:40:44] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:40:44] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2022-06-10 09:40:44] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-10 09:40:44] [INFO ] Flow matrix only has 368 transitions (discarded 7 similar events)
// Phase 1: matrix 368 rows 79 cols
[2022-06-10 09:40:44] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:40:44] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/666 places, 375/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/666 places, 375/2247 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s65 0), p2:(AND (EQ s4 1) (EQ s18 1) (EQ s31 1) (EQ s42 1) (EQ s54 1) (EQ s67 1)), p1:(EQ s7 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-10 finished in 1504 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)&&p0))||F(p1)||X(X(p1))))'
Support contains 2 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 680 edges and 666 vertex of which 101 / 666 are part of one of the 18 SCC in 1 ms
Free SCC test removed 83 places
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 402 transitions
Trivial Post-agglo rules discarded 402 transitions
Performed 402 trivial Post agglomeration. Transition count delta: 402
Iterating post reduction 0 with 402 rules applied. Total rules applied 403 place count 582 transition count 1750
Reduce places removed 402 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 414 rules applied. Total rules applied 817 place count 180 transition count 1738
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 823 place count 174 transition count 1738
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 823 place count 174 transition count 1714
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 871 place count 150 transition count 1714
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 879 place count 142 transition count 1705
Iterating global reduction 3 with 8 rules applied. Total rules applied 887 place count 142 transition count 1705
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 888 place count 142 transition count 1704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 889 place count 141 transition count 1704
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 889 place count 141 transition count 1703
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 891 place count 140 transition count 1703
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 894 place count 137 transition count 1457
Iterating global reduction 5 with 3 rules applied. Total rules applied 897 place count 137 transition count 1457
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 898 place count 137 transition count 1456
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 899 place count 136 transition count 1454
Iterating global reduction 6 with 1 rules applied. Total rules applied 900 place count 136 transition count 1454
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 6 with 50 rules applied. Total rules applied 950 place count 111 transition count 1429
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 970 place count 91 transition count 329
Iterating global reduction 6 with 20 rules applied. Total rules applied 990 place count 91 transition count 329
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1001 place count 91 transition count 318
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1005 place count 87 transition count 310
Iterating global reduction 7 with 4 rules applied. Total rules applied 1009 place count 87 transition count 310
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1013 place count 83 transition count 302
Iterating global reduction 7 with 4 rules applied. Total rules applied 1017 place count 83 transition count 302
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1039 place count 72 transition count 309
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 1053 place count 72 transition count 295
Applied a total of 1053 rules in 285 ms. Remains 72 /666 variables (removed 594) and now considering 295/2247 (removed 1952) transitions.
[2022-06-10 09:40:45] [INFO ] Flow matrix only has 287 transitions (discarded 8 similar events)
// Phase 1: matrix 287 rows 72 cols
[2022-06-10 09:40:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 09:40:45] [INFO ] Implicit Places using invariants in 162 ms returned []
[2022-06-10 09:40:45] [INFO ] Flow matrix only has 287 transitions (discarded 8 similar events)
// Phase 1: matrix 287 rows 72 cols
[2022-06-10 09:40:45] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:40:45] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:40:45] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2022-06-10 09:40:45] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 09:40:45] [INFO ] Flow matrix only has 287 transitions (discarded 8 similar events)
// Phase 1: matrix 287 rows 72 cols
[2022-06-10 09:40:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 09:40:46] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/666 places, 295/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 72/666 places, 295/2247 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s14 1), p0:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-11 finished in 1046 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p0))||p1) U p1))'
Support contains 7 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 2242
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 2242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 658 transition count 2239
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 658 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 656 transition count 2237
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 656 transition count 2237
Applied a total of 20 rules in 84 ms. Remains 656 /666 variables (removed 10) and now considering 2237/2247 (removed 10) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:46] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-10 09:40:47] [INFO ] Implicit Places using invariants in 721 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:47] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-10 09:40:48] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:48] [INFO ] Computed 7 place invariants in 28 ms
[2022-06-10 09:40:50] [INFO ] Dead Transitions using invariants and state equation in 2318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/666 places, 2237/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/666 places, 2237/2247 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1), true]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s70 1) (EQ s187 1) (EQ s293 1) (EQ s377 1) (EQ s494 1) (EQ s611 1)), p0:(EQ s230 1)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-12 finished in 4503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 679 edges and 666 vertex of which 103 / 666 are part of one of the 18 SCC in 1 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 400 place count 580 transition count 1750
Reduce places removed 399 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 411 rules applied. Total rules applied 811 place count 181 transition count 1738
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 819 place count 175 transition count 1736
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 821 place count 173 transition count 1736
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 821 place count 173 transition count 1712
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 869 place count 149 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 878 place count 140 transition count 1702
Iterating global reduction 4 with 9 rules applied. Total rules applied 887 place count 140 transition count 1702
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 888 place count 140 transition count 1701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 889 place count 139 transition count 1701
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 889 place count 139 transition count 1700
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 891 place count 138 transition count 1700
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 894 place count 135 transition count 1454
Iterating global reduction 6 with 3 rules applied. Total rules applied 897 place count 135 transition count 1454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 898 place count 135 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 899 place count 134 transition count 1451
Iterating global reduction 7 with 1 rules applied. Total rules applied 900 place count 134 transition count 1451
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 948 place count 110 transition count 1427
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 968 place count 90 transition count 326
Iterating global reduction 7 with 20 rules applied. Total rules applied 988 place count 90 transition count 326
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 999 place count 90 transition count 315
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1004 place count 85 transition count 305
Iterating global reduction 8 with 5 rules applied. Total rules applied 1009 place count 85 transition count 305
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1014 place count 80 transition count 295
Iterating global reduction 8 with 5 rules applied. Total rules applied 1019 place count 80 transition count 295
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1039 place count 70 transition count 302
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1040 place count 69 transition count 290
Iterating global reduction 8 with 1 rules applied. Total rules applied 1041 place count 69 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1042 place count 69 transition count 289
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1048 place count 69 transition count 283
Applied a total of 1048 rules in 273 ms. Remains 69 /666 variables (removed 597) and now considering 283/2247 (removed 1964) transitions.
[2022-06-10 09:40:51] [INFO ] Flow matrix only has 276 transitions (discarded 7 similar events)
// Phase 1: matrix 276 rows 69 cols
[2022-06-10 09:40:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:40:51] [INFO ] Implicit Places using invariants in 159 ms returned []
[2022-06-10 09:40:51] [INFO ] Flow matrix only has 276 transitions (discarded 7 similar events)
// Phase 1: matrix 276 rows 69 cols
[2022-06-10 09:40:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:40:51] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:40:51] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2022-06-10 09:40:51] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 09:40:51] [INFO ] Flow matrix only has 276 transitions (discarded 7 similar events)
// Phase 1: matrix 276 rows 69 cols
[2022-06-10 09:40:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 09:40:51] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/666 places, 283/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/666 places, 283/2247 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s62 1), p1:(EQ s23 1)], nbAcceptance=2, 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 10 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-13 finished in 1010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&F(p0))))'
Support contains 6 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 2242
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 2242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 658 transition count 2239
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 658 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 656 transition count 2237
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 656 transition count 2237
Applied a total of 20 rules in 86 ms. Remains 656 /666 variables (removed 10) and now considering 2237/2247 (removed 10) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:51] [INFO ] Computed 7 place invariants in 20 ms
[2022-06-10 09:40:52] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:52] [INFO ] Computed 7 place invariants in 25 ms
[2022-06-10 09:40:53] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:53] [INFO ] Computed 7 place invariants in 18 ms
[2022-06-10 09:40:55] [INFO ] Dead Transitions using invariants and state equation in 1738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/666 places, 2237/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/666 places, 2237/2247 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s34 0) (EQ s140 0) (EQ s246 0) (EQ s352 0) (EQ s447 0) (EQ s575 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 945 reset in 238 ms.
Product exploration explored 100000 steps with 943 reset in 247 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 336236 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336236 steps, saw 59330 distinct states, run finished after 3004 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:40:59] [INFO ] Computed 7 place invariants in 18 ms
[2022-06-10 09:40:59] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:40:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-06-10 09:41:01] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:41:01] [INFO ] After 1449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 247 ms.
[2022-06-10 09:41:01] [INFO ] After 1835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2237/2237 transitions.
Applied a total of 0 rules in 27 ms. Remains 656 /656 variables (removed 0) and now considering 2237/2237 (removed 0) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:41:02] [INFO ] Computed 7 place invariants in 24 ms
[2022-06-10 09:41:02] [INFO ] Implicit Places using invariants in 662 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:41:02] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-10 09:41:04] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:41:04] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-10 09:41:06] [INFO ] Dead Transitions using invariants and state equation in 2390 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/656 places, 2237/2237 transitions.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318289 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318289 steps, saw 56399 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:41:10] [INFO ] Computed 7 place invariants in 17 ms
[2022-06-10 09:41:10] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:41:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-10 09:41:11] [INFO ] After 1152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:41:12] [INFO ] After 1619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 409 ms.
[2022-06-10 09:41:12] [INFO ] After 2219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 947 reset in 320 ms.
Product exploration explored 100000 steps with 949 reset in 348 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2237/2237 transitions.
Graph (trivial) has 667 edges and 656 vertex of which 102 / 656 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 387 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 387 rules applied. Total rules applied 388 place count 572 transition count 2141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 394 place count 572 transition count 2135
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 394 place count 572 transition count 2141
Deduced a syphon composed of 399 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 406 place count 572 transition count 2141
Discarding 330 places :
Symmetric choice reduction at 2 with 330 rule applications. Total rules 736 place count 242 transition count 1811
Deduced a syphon composed of 74 places in 2 ms
Iterating global reduction 2 with 330 rules applied. Total rules applied 1066 place count 242 transition count 1811
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 123 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 1115 place count 242 transition count 1811
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1178 place count 179 transition count 830
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 1241 place count 179 transition count 830
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1249 place count 179 transition count 822
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1269 place count 159 transition count 796
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 1289 place count 159 transition count 796
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1295 place count 153 transition count 790
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1301 place count 153 transition count 790
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1310 place count 153 transition count 835
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1325 place count 138 transition count 805
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 1340 place count 138 transition count 805
Deduced a syphon composed of 60 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 1356 place count 138 transition count 789
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1357 place count 138 transition count 802
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1358 place count 137 transition count 800
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1359 place count 137 transition count 800
Deduced a syphon composed of 60 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 1363 place count 137 transition count 796
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 1363 rules in 393 ms. Remains 137 /656 variables (removed 519) and now considering 796/2237 (removed 1441) transitions.
[2022-06-10 09:41:14] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-10 09:41:14] [INFO ] Flow matrix only has 789 transitions (discarded 7 similar events)
// Phase 1: matrix 789 rows 137 cols
[2022-06-10 09:41:14] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 09:41:15] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/656 places, 796/2237 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/656 places, 796/2237 transitions.
Product exploration explored 100000 steps with 2770 reset in 289 ms.
Product exploration explored 100000 steps with 7305 reset in 730 ms.
Built C files in :
/tmp/ltsmin789499331016491027
[2022-06-10 09:41:16] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin789499331016491027
Running compilation step : cd /tmp/ltsmin789499331016491027;'/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/ltsmin789499331016491027;'/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/ltsmin789499331016491027;'/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 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2237/2237 transitions.
Applied a total of 0 rules in 35 ms. Remains 656 /656 variables (removed 0) and now considering 2237/2237 (removed 0) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:41:19] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-10 09:41:19] [INFO ] Implicit Places using invariants in 675 ms returned []
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:41:19] [INFO ] Computed 7 place invariants in 20 ms
[2022-06-10 09:41:21] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
// Phase 1: matrix 2237 rows 656 cols
[2022-06-10 09:41:21] [INFO ] Computed 7 place invariants in 19 ms
[2022-06-10 09:41:22] [INFO ] Dead Transitions using invariants and state equation in 1639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 656/656 places, 2237/2237 transitions.
Built C files in :
/tmp/ltsmin17947721075563255312
[2022-06-10 09:41:23] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17947721075563255312
Running compilation step : cd /tmp/ltsmin17947721075563255312;'/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/ltsmin17947721075563255312;'/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/ltsmin17947721075563255312;'/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 09:41:26] [INFO ] Flatten gal took : 154 ms
[2022-06-10 09:41:26] [INFO ] Flatten gal took : 157 ms
[2022-06-10 09:41:26] [INFO ] Time to serialize gal into /tmp/LTL2737703204382023001.gal : 34 ms
[2022-06-10 09:41:26] [INFO ] Time to serialize properties into /tmp/LTL10021021861424363513.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/LTL2737703204382023001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10021021861424363513.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/LTL2737703...267
Read 1 LTL properties
Checking formula 0 : !((G((X("((((p41==0)||(p176==0))||((p311==0)||(p446==0)))||((p569==0)||(p729==0)))"))&&(F("((((p41==0)||(p176==0))||((p311==0)||(p446=...191
Formula 0 simplified : !G(X"((((p41==0)||(p176==0))||((p311==0)||(p446==0)))||((p569==0)||(p729==0)))" & F"((((p41==0)||(p176==0))||((p311==0)||(p446==0)))...182
Detected timeout of ITS tools.
[2022-06-10 09:41:41] [INFO ] Flatten gal took : 128 ms
[2022-06-10 09:41:41] [INFO ] Applying decomposition
[2022-06-10 09:41:41] [INFO ] Flatten gal took : 132 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/graph13056492772382137970.txt' '-o' '/tmp/graph13056492772382137970.bin' '-w' '/tmp/graph13056492772382137970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13056492772382137970.bin' '-l' '-1' '-v' '-w' '/tmp/graph13056492772382137970.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:41:42] [INFO ] Decomposing Gal with order
[2022-06-10 09:41:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:41:42] [INFO ] Removed a total of 9221 redundant transitions.
[2022-06-10 09:41:43] [INFO ] Flatten gal took : 414 ms
[2022-06-10 09:41:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 56 ms.
[2022-06-10 09:41:43] [INFO ] Time to serialize gal into /tmp/LTL14747005699652014706.gal : 27 ms
[2022-06-10 09:41:43] [INFO ] Time to serialize properties into /tmp/LTL15209741130207656735.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/LTL14747005699652014706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15209741130207656735.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/LTL1474700...247
Read 1 LTL properties
Checking formula 0 : !((G((X("((((i26.u2.p41==0)||(i26.u53.p176==0))||((i26.u97.p311==0)||(i26.u127.p446==0)))||((i7.u175.p569==0)||(i26.u214.p729==0)))"))...289
Formula 0 simplified : !G(X"((((i26.u2.p41==0)||(i26.u53.p176==0))||((i26.u97.p311==0)||(i26.u127.p446==0)))||((i7.u175.p569==0)||(i26.u214.p729==0)))" & F...280
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3041259820680584145
[2022-06-10 09:41:58] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3041259820680584145
Running compilation step : cd /tmp/ltsmin3041259820680584145;'/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/ltsmin3041259820680584145;'/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/ltsmin3041259820680584145;'/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-06b-LTLFireability-14 finished in 69605 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0)) U p1)||p2)))'
Support contains 8 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 662 transition count 2243
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 662 transition count 2243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 660 transition count 2241
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 660 transition count 2241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 659 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 659 transition count 2240
Applied a total of 14 rules in 185 ms. Remains 659 /666 variables (removed 7) and now considering 2240/2247 (removed 7) transitions.
// Phase 1: matrix 2240 rows 659 cols
[2022-06-10 09:42:01] [INFO ] Computed 7 place invariants in 33 ms
[2022-06-10 09:42:02] [INFO ] Implicit Places using invariants in 718 ms returned []
// Phase 1: matrix 2240 rows 659 cols
[2022-06-10 09:42:02] [INFO ] Computed 7 place invariants in 33 ms
[2022-06-10 09:42:03] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
// Phase 1: matrix 2240 rows 659 cols
[2022-06-10 09:42:03] [INFO ] Computed 7 place invariants in 24 ms
[2022-06-10 09:42:06] [INFO ] Dead Transitions using invariants and state equation in 2251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 659/666 places, 2240/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 659/666 places, 2240/2247 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s59 1) (EQ s187 1) (EQ s282 1) (EQ s402 1) (EQ s508 1) (EQ s603 1)), p2:(EQ s313 0), p0:(EQ s299 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 914 ms.
Product exploration explored 100000 steps with 50000 reset in 751 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-06b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLFireability-15 finished in 6670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p1)&&p0) U p2)))'
Found a SL insensitive property : StigmergyElection-PT-06b-LTLFireability-03
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Support contains 11 out of 666 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 672 edges and 666 vertex of which 103 / 666 are part of one of the 18 SCC in 1 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 392 place count 580 transition count 1758
Reduce places removed 391 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 403 rules applied. Total rules applied 795 place count 189 transition count 1746
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 802 place count 183 transition count 1745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 803 place count 182 transition count 1745
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 803 place count 182 transition count 1721
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 851 place count 158 transition count 1721
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 860 place count 149 transition count 1711
Iterating global reduction 4 with 9 rules applied. Total rules applied 869 place count 149 transition count 1711
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 870 place count 149 transition count 1710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 871 place count 148 transition count 1710
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 871 place count 148 transition count 1709
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 873 place count 147 transition count 1709
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 876 place count 144 transition count 1463
Iterating global reduction 6 with 3 rules applied. Total rules applied 879 place count 144 transition count 1463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 880 place count 144 transition count 1462
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 881 place count 143 transition count 1460
Iterating global reduction 7 with 1 rules applied. Total rules applied 882 place count 143 transition count 1460
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 930 place count 119 transition count 1436
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 946 place count 103 transition count 595
Iterating global reduction 7 with 16 rules applied. Total rules applied 962 place count 103 transition count 595
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 969 place count 103 transition count 588
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 974 place count 98 transition count 578
Iterating global reduction 8 with 5 rules applied. Total rules applied 979 place count 98 transition count 578
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 984 place count 93 transition count 568
Iterating global reduction 8 with 5 rules applied. Total rules applied 989 place count 93 transition count 568
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1009 place count 83 transition count 575
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1010 place count 82 transition count 563
Iterating global reduction 8 with 1 rules applied. Total rules applied 1011 place count 82 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1012 place count 82 transition count 562
Applied a total of 1012 rules in 309 ms. Remains 82 /666 variables (removed 584) and now considering 562/2247 (removed 1685) transitions.
[2022-06-10 09:42:08] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:08] [INFO ] Computed 2 place invariants in 40 ms
[2022-06-10 09:42:08] [INFO ] Implicit Places using invariants in 160 ms returned []
[2022-06-10 09:42:08] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:08] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:42:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:42:09] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2022-06-10 09:42:09] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:09] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:42:09] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 82/666 places, 562/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/666 places, 562/2247 transitions.
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (NOT (AND (EQ s7 1) (EQ s18 1) (EQ s29 1) (EQ s42 1) (EQ s56 1) (EQ s72 1))) (EQ s61 1)), p0:(AND (EQ s7 1) (EQ s18 1) (EQ s29 1) (EQ s42 1) (EQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8512 reset in 309 ms.
Product exploration explored 100000 steps with 8489 reset in 356 ms.
Computed a total of 4 stabilizing places and 21 stable transitions
Computed a total of 4 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (OR (AND (NOT p2) (NOT p0)) (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 631 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 858 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 447032 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{2=1}
Probabilistic random walk after 447032 steps, saw 96396 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :1
Running SMT prover for 4 properties.
[2022-06-10 09:42:14] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:14] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:42:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 09:42:15] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-10 09:42:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-10 09:42:15] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-06-10 09:42:15] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:42:15] [INFO ] After 210ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-06-10 09:42:15] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2022-06-10 09:42:16] [INFO ] After 824ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 562/562 transitions.
Graph (complete) has 497 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 81 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 14 place count 81 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 80 transition count 547
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 38 place count 69 transition count 536
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 69 transition count 530
Free-agglomeration rule applied 36 times.
Iterating global reduction 2 with 36 rules applied. Total rules applied 80 place count 69 transition count 494
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 120 place count 32 transition count 491
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 26 transition count 485
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 26 transition count 485
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 163 place count 26 transition count 454
Performed 7 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 177 place count 19 transition count 349
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 189 place count 19 transition count 337
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 18 transition count 336
Applied a total of 190 rules in 132 ms. Remains 18 /82 variables (removed 64) and now considering 336/562 (removed 226) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/82 places, 336/562 transitions.
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (OR (AND (NOT p2) (NOT p0)) (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (G (NOT (AND p0 (NOT p2) p1))), (G (OR p0 p2)), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 15 factoid took 774 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 562/562 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2022-06-10 09:42:17] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:17] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:42:17] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-06-10 09:42:17] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:17] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:42:17] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:42:17] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2022-06-10 09:42:17] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:17] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:42:18] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 562/562 transitions.
Computed a total of 4 stabilizing places and 21 stable transitions
Computed a total of 4 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X p2)), true, (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 845 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 519674 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{0=1}
Probabilistic random walk after 519674 steps, saw 111713 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :1
Running SMT prover for 2 properties.
[2022-06-10 09:42:22] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:22] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:42:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 09:42:22] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 09:42:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 09:42:23] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 09:42:23] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:42:23] [INFO ] After 314ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 09:42:24] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 213 ms.
[2022-06-10 09:42:24] [INFO ] After 1320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 562/562 transitions.
Graph (complete) has 497 edges and 82 vertex of which 81 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 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 81 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 14 place count 81 transition count 547
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 80 transition count 547
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 38 place count 69 transition count 536
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 69 transition count 530
Free-agglomeration rule applied 36 times.
Iterating global reduction 2 with 36 rules applied. Total rules applied 80 place count 69 transition count 494
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 120 place count 32 transition count 491
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 26 transition count 485
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 26 transition count 485
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 163 place count 26 transition count 454
Performed 7 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 177 place count 19 transition count 349
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 189 place count 19 transition count 337
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 18 transition count 336
Applied a total of 190 rules in 78 ms. Remains 18 /82 variables (removed 64) and now considering 336/562 (removed 226) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/82 places, 336/562 transitions.
Finished random walk after 102 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X p2)), true, (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 8499 reset in 321 ms.
Product exploration explored 100000 steps with 8477 reset in 302 ms.
Built C files in :
/tmp/ltsmin14065943275457834883
[2022-06-10 09:42:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14065943275457834883
Running compilation step : cd /tmp/ltsmin14065943275457834883;'/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 2320 ms.
Running link step : cd /tmp/ltsmin14065943275457834883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14065943275457834883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2225688712560287971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 562/562 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2022-06-10 09:42:41] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:41] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:42:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2022-06-10 09:42:41] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:41] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:42:41] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:42:41] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2022-06-10 09:42:41] [INFO ] Flow matrix only has 555 transitions (discarded 7 similar events)
// Phase 1: matrix 555 rows 82 cols
[2022-06-10 09:42:41] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:42:42] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin15306215995928552789
[2022-06-10 09:42:42] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15306215995928552789
Running compilation step : cd /tmp/ltsmin15306215995928552789;'/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 2338 ms.
Running link step : cd /tmp/ltsmin15306215995928552789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15306215995928552789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1326743414360018113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 09:42:57] [INFO ] Flatten gal took : 58 ms
[2022-06-10 09:42:57] [INFO ] Flatten gal took : 81 ms
[2022-06-10 09:42:57] [INFO ] Time to serialize gal into /tmp/LTL11055097335661539093.gal : 10 ms
[2022-06-10 09:42:57] [INFO ] Time to serialize properties into /tmp/LTL6502548576332702565.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/LTL11055097335661539093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6502548576332702565.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/LTL1105509...267
Read 1 LTL properties
Checking formula 0 : !((G(((((X("((((p29==1)&&(p164==1))&&((p311==1)&&(p459==1)))&&((p569==1)&&(p704==1)))"))&&("(p54==1)"))&&("((p164==1)&&(p299==1))"))&&...292
Formula 0 simplified : !G(("(((p434==1)&&(p569==1))&&(p716==1))" & "((p164==1)&&(p299==1))" & "(p54==1)" & X"((((p29==1)&&(p164==1))&&((p311==1)&&(p459==1)...279
Detected timeout of ITS tools.
[2022-06-10 09:43:12] [INFO ] Flatten gal took : 82 ms
[2022-06-10 09:43:12] [INFO ] Applying decomposition
[2022-06-10 09:43:12] [INFO ] Flatten gal took : 137 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/graph8216579869984024199.txt' '-o' '/tmp/graph8216579869984024199.bin' '-w' '/tmp/graph8216579869984024199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8216579869984024199.bin' '-l' '-1' '-v' '-w' '/tmp/graph8216579869984024199.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:43:12] [INFO ] Decomposing Gal with order
[2022-06-10 09:43:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:43:12] [INFO ] Removed a total of 2785 redundant transitions.
[2022-06-10 09:43:12] [INFO ] Flatten gal took : 74 ms
[2022-06-10 09:43:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 10 ms.
[2022-06-10 09:43:12] [INFO ] Time to serialize gal into /tmp/LTL11215642183057013718.gal : 3 ms
[2022-06-10 09:43:12] [INFO ] Time to serialize properties into /tmp/LTL11754931751970685499.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/LTL11215642183057013718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11754931751970685499.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/LTL1121564...247
Read 1 LTL properties
Checking formula 0 : !((G(((((X("((((i6.u2.p29==1)&&(i6.u5.p164==1))&&((u8.p311==1)&&(i6.u10.p459==1)))&&((i6.u14.p569==1)&&(i6.u17.p704==1)))"))&&("(u1.p5...401
Formula 0 simplified : !G(("(((i6.u11.p434==1)&&(i6.u14.p569==1))&&(u16.p716==1))" & "((i6.u5.p164==1)&&(i6.u7.p299==1))" & "(u1.p54==1)" & X"((((i6.u2.p29...388
Reverse transition relation is NOT exact ! Due to transitions t163_t164_t165_t166_t167_t168_t169_t175_t257, t65_t66_t67_t68_t69_t70_t71_t77_t157, t663_t655...1056
Computing Next relation with stutter on 100453 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3327960233525359188
[2022-06-10 09:43:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3327960233525359188
Running compilation step : cd /tmp/ltsmin3327960233525359188;'/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 2156 ms.
Running link step : cd /tmp/ltsmin3327960233525359188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3327960233525359188;'/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((LTLAPp1==true))&&(LTLAPp0==true)) U (LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyElection-PT-06b-LTLFireability-03 finished in 94989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&F(p0))))'
Found a SL insensitive property : StigmergyElection-PT-06b-LTLFireability-14
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 666 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 666/666 places, 2247/2247 transitions.
Graph (trivial) has 677 edges and 666 vertex of which 103 / 666 are part of one of the 18 SCC in 0 ms
Free SCC test removed 85 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 580 transition count 1753
Reduce places removed 396 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 408 rules applied. Total rules applied 805 place count 184 transition count 1741
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 811 place count 178 transition count 1741
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 811 place count 178 transition count 1717
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 859 place count 154 transition count 1717
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 868 place count 145 transition count 1707
Iterating global reduction 3 with 9 rules applied. Total rules applied 877 place count 145 transition count 1707
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 878 place count 145 transition count 1706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 879 place count 144 transition count 1706
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 879 place count 144 transition count 1705
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 881 place count 143 transition count 1705
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 884 place count 140 transition count 1459
Iterating global reduction 5 with 3 rules applied. Total rules applied 887 place count 140 transition count 1459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 888 place count 140 transition count 1458
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 889 place count 139 transition count 1456
Iterating global reduction 6 with 1 rules applied. Total rules applied 890 place count 139 transition count 1456
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 6 with 50 rules applied. Total rules applied 940 place count 114 transition count 1431
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 956 place count 98 transition count 751
Iterating global reduction 6 with 16 rules applied. Total rules applied 972 place count 98 transition count 751
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 978 place count 98 transition count 745
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 983 place count 93 transition count 735
Iterating global reduction 7 with 5 rules applied. Total rules applied 988 place count 93 transition count 735
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 993 place count 88 transition count 725
Iterating global reduction 7 with 5 rules applied. Total rules applied 998 place count 88 transition count 725
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1018 place count 78 transition count 732
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1019 place count 77 transition count 720
Iterating global reduction 7 with 1 rules applied. Total rules applied 1020 place count 77 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1021 place count 77 transition count 719
Applied a total of 1021 rules in 267 ms. Remains 77 /666 variables (removed 589) and now considering 719/2247 (removed 1528) transitions.
[2022-06-10 09:43:43] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:43] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:43:43] [INFO ] Implicit Places using invariants in 252 ms returned []
[2022-06-10 09:43:43] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:43] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:43:44] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:43:44] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2022-06-10 09:43:44] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:44] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:43:44] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 77/666 places, 719/2247 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/666 places, 719/2247 transitions.
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s5 0) (EQ s18 0) (EQ s30 0) (EQ s42 0) (EQ s54 0) (EQ s68 0))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8832 reset in 466 ms.
Product exploration explored 100000 steps with 4742 reset in 215 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 891 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 923940 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923940 steps, saw 178357 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 09:43:49] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:49] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:43:49] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:43:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 09:43:49] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:43:49] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:43:49] [INFO ] After 200ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 09:43:49] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-06-10 09:43:49] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 77/77 places, 719/719 transitions.
Graph (complete) has 502 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 76 transition count 705
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 38 place count 64 transition count 693
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 64 transition count 687
Free-agglomeration rule applied 36 times.
Iterating global reduction 2 with 36 rules applied. Total rules applied 80 place count 64 transition count 651
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 150 place count 27 transition count 618
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 156 place count 21 transition count 612
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 21 transition count 612
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 225 place count 21 transition count 549
Performed 6 Post agglomeration using F-continuation condition with reduction of 368 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 237 place count 15 transition count 175
Drop transitions removed 6 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 4 with 103 rules applied. Total rules applied 340 place count 15 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 344 place count 13 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 345 place count 12 transition count 69
Applied a total of 345 rules in 97 ms. Remains 12 /77 variables (removed 65) and now considering 69/719 (removed 650) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/77 places, 69/719 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 719/719 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2022-06-10 09:43:50] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:50] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:43:50] [INFO ] Implicit Places using invariants in 198 ms returned []
[2022-06-10 09:43:50] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:50] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:43:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:43:51] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2022-06-10 09:43:51] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:43:51] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 719/719 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 892 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 942457 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 942457 steps, saw 179900 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 09:43:54] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:43:54] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:43:54] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:43:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-10 09:43:55] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:43:55] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:43:55] [INFO ] After 237ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 09:43:55] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-06-10 09:43:55] [INFO ] After 901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 77/77 places, 719/719 transitions.
Graph (complete) has 502 edges and 77 vertex of which 76 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 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 76 transition count 705
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 38 place count 64 transition count 693
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 64 transition count 687
Free-agglomeration rule applied 36 times.
Iterating global reduction 2 with 36 rules applied. Total rules applied 80 place count 64 transition count 651
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 150 place count 27 transition count 618
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 156 place count 21 transition count 612
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 21 transition count 612
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 225 place count 21 transition count 549
Performed 6 Post agglomeration using F-continuation condition with reduction of 368 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 237 place count 15 transition count 175
Drop transitions removed 6 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 4 with 103 rules applied. Total rules applied 340 place count 15 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 344 place count 13 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 345 place count 12 transition count 69
Applied a total of 345 rules in 67 ms. Remains 12 /77 variables (removed 65) and now considering 69/719 (removed 650) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/77 places, 69/719 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8861 reset in 542 ms.
Product exploration explored 100000 steps with 8864 reset in 486 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 719/719 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 77 transition count 713
Applied a total of 6 rules in 44 ms. Remains 77 /77 variables (removed 0) and now considering 713/719 (removed 6) transitions.
[2022-06-10 09:43:57] [INFO ] Redundant transitions in 8 ms returned []
[2022-06-10 09:43:57] [INFO ] Flow matrix only has 706 transitions (discarded 7 similar events)
// Phase 1: matrix 706 rows 77 cols
[2022-06-10 09:43:57] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:43:58] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/77 places, 713/719 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 713/719 transitions.
Product exploration explored 100000 steps with 8866 reset in 502 ms.
Product exploration explored 100000 steps with 8873 reset in 459 ms.
Built C files in :
/tmp/ltsmin3047408168734620264
[2022-06-10 09:43:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3047408168734620264
Running compilation step : cd /tmp/ltsmin3047408168734620264;'/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 2764 ms.
Running link step : cd /tmp/ltsmin3047408168734620264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3047408168734620264;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9180790147529796473.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 719/719 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2022-06-10 09:44:14] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:44:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:44:14] [INFO ] Implicit Places using invariants in 167 ms returned []
[2022-06-10 09:44:14] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:44:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:44:14] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-10 09:44:15] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2022-06-10 09:44:15] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 77 cols
[2022-06-10 09:44:15] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:44:15] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 719/719 transitions.
Built C files in :
/tmp/ltsmin9735940602837467473
[2022-06-10 09:44:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9735940602837467473
Running compilation step : cd /tmp/ltsmin9735940602837467473;'/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 2762 ms.
Running link step : cd /tmp/ltsmin9735940602837467473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9735940602837467473;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13159394662430428886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 09:44:30] [INFO ] Flatten gal took : 65 ms
[2022-06-10 09:44:31] [INFO ] Flatten gal took : 67 ms
[2022-06-10 09:44:31] [INFO ] Time to serialize gal into /tmp/LTL4243880829751703487.gal : 8 ms
[2022-06-10 09:44:31] [INFO ] Time to serialize properties into /tmp/LTL4707320657229328011.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/LTL4243880829751703487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4707320657229328011.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/LTL4243880...266
Read 1 LTL properties
Checking formula 0 : !((G((X("((((p41==0)||(p176==0))||((p311==0)||(p446==0)))||((p569==0)||(p729==0)))"))&&(F("((((p41==0)||(p176==0))||((p311==0)||(p446=...191
Formula 0 simplified : !G(X"((((p41==0)||(p176==0))||((p311==0)||(p446==0)))||((p569==0)||(p729==0)))" & F"((((p41==0)||(p176==0))||((p311==0)||(p446==0)))...182
Detected timeout of ITS tools.
[2022-06-10 09:44:46] [INFO ] Flatten gal took : 65 ms
[2022-06-10 09:44:46] [INFO ] Applying decomposition
[2022-06-10 09:44:46] [INFO ] Flatten gal took : 63 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/graph8879867327528074634.txt' '-o' '/tmp/graph8879867327528074634.bin' '-w' '/tmp/graph8879867327528074634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8879867327528074634.bin' '-l' '-1' '-v' '-w' '/tmp/graph8879867327528074634.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:44:46] [INFO ] Decomposing Gal with order
[2022-06-10 09:44:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:44:46] [INFO ] Removed a total of 3756 redundant transitions.
[2022-06-10 09:44:46] [INFO ] Flatten gal took : 160 ms
[2022-06-10 09:44:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 15 ms.
[2022-06-10 09:44:46] [INFO ] Time to serialize gal into /tmp/LTL10207662205651385357.gal : 3 ms
[2022-06-10 09:44:46] [INFO ] Time to serialize properties into /tmp/LTL983784645508944799.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/LTL10207662205651385357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL983784645508944799.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/LTL1020766...245
Read 1 LTL properties
Checking formula 0 : !((G((X("((((u1.p41==0)||(u4.p176==0))||((u7.p311==0)||(u10.p446==0)))||((i6.u14.p569==0)||(i6.u17.p729==0)))"))&&(F("((((u1.p41==0)||...245
Formula 0 simplified : !G(X"((((u1.p41==0)||(u4.p176==0))||((u7.p311==0)||(u10.p446==0)))||((i6.u14.p569==0)||(i6.u17.p729==0)))" & F"((((u1.p41==0)||(u4.p...236
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14248444170302648895
[2022-06-10 09:45:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14248444170302648895
Running compilation step : cd /tmp/ltsmin14248444170302648895;'/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 2876 ms.
Running link step : cd /tmp/ltsmin14248444170302648895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14248444170302648895;'/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))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyElection-PT-06b-LTLFireability-14 finished in 93692 ms.
[2022-06-10 09:45:16] [INFO ] Flatten gal took : 123 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11079618092674737019
[2022-06-10 09:45:17] [INFO ] Too many transitions (2247) to apply POR reductions. Disabling POR matrices.
[2022-06-10 09:45:17] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11079618092674737019
Running compilation step : cd /tmp/ltsmin11079618092674737019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 09:45:17] [INFO ] Applying decomposition
[2022-06-10 09:45:17] [INFO ] Flatten gal took : 129 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/graph6917007318528985373.txt' '-o' '/tmp/graph6917007318528985373.bin' '-w' '/tmp/graph6917007318528985373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6917007318528985373.bin' '-l' '-1' '-v' '-w' '/tmp/graph6917007318528985373.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:45:17] [INFO ] Decomposing Gal with order
[2022-06-10 09:45:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:45:18] [INFO ] Removed a total of 9377 redundant transitions.
[2022-06-10 09:45:18] [INFO ] Flatten gal took : 293 ms
[2022-06-10 09:45:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 36 ms.
[2022-06-10 09:45:18] [INFO ] Time to serialize gal into /tmp/LTLFireability10217494076967744370.gal : 16 ms
[2022-06-10 09:45:18] [INFO ] Time to serialize properties into /tmp/LTLFireability8355302686123510688.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/LTLFireability10217494076967744370.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8355302686123510688.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...268
Read 3 LTL properties
Checking formula 0 : !(((G("(i6.i0.i3.u168.p523==0)"))||(X("(i6.i0.i5.u215.p592==1)"))))
Formula 0 simplified : !(G"(i6.i0.i3.u168.p523==0)" | X"(i6.i0.i5.u215.p592==1)")
Compilation finished in 11001 ms.
Running link step : cd /tmp/ltsmin11079618092674737019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin11079618092674737019;'/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))||X((LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t24, t77, t156, t158, t175, t220, t256, t257, t275, t354, t356, t373, t419, t453, t455, t472,...651
Computing Next relation with stutter on 810360 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin11079618092674737019;'/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))||X((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11079618092674737019;'/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((LTLAPp3==true))&&(LTLAPp2==true)) U (LTLAPp4==true)))' '--buchi-type=spotba'
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
60368 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,603.902,7872176,1,0,7.16331e+06,2090,10841,6.41209e+07,153,3540,2267760
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyElection-PT-06b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(((((X("((((i1.u8.p29==1)&&(i1.u54.p164==1))&&((i1.u91.p311==1)&&(i1.u133.p459==1)))&&((i1.u182.p569==1)&&(i1.u228.p704==1)))"))&&...433
Formula 1 simplified : !G(("(((i1.u138.p434==1)&&(i1.u182.p569==1))&&(i1.u233.p716==1))" & "((i1.u54.p164==1)&&(i1.u97.p299==1))" & "(i1.u2.p54==1)" & X"((...420
Computing Next relation with stutter on 810360 deadlock states
Detected timeout of ITS tools.
[2022-06-10 10:08:06] [INFO ] Applying decomposition
[2022-06-10 10:08:07] [INFO ] Flatten gal took : 330 ms
[2022-06-10 10:08:07] [INFO ] Decomposing Gal with order
[2022-06-10 10:08:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:08:08] [INFO ] Removed a total of 9129 redundant transitions.
[2022-06-10 10:08:08] [INFO ] Flatten gal took : 859 ms
[2022-06-10 10:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 81 ms.
[2022-06-10 10:08:08] [INFO ] Time to serialize gal into /tmp/LTLFireability16696756026595270569.gal : 28 ms
[2022-06-10 10:08:08] [INFO ] Time to serialize properties into /tmp/LTLFireability12957909116701455260.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/LTLFireability16696756026595270569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12957909116701455260.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 2 LTL properties
Checking formula 0 : !((G(((((X("((((i0.i0.i0.i0.i0.u6.p29==1)&&(i0.i0.i0.i0.i0.u7.p164==1))&&((i0.i0.i0.i0.u8.p311==1)&&(i0.i0.i0.u9.p459==1)))&&((i0.i0.u...542
Formula 0 simplified : !G(("(((i0.i0.i0.u9.p434==1)&&(i0.i0.u10.p569==1))&&(i0.u11.p716==1))" & "((i0.i0.i0.i0.i0.u7.p164==1)&&(i0.i0.i0.i0.u8.p299==1))" &...529
Reverse transition relation is NOT exact ! Due to transitions t687, u12.t50, u12.t56, i0.u11.t77, i0.u11.t86, i0.u11.t120, i0.u11.t121, i0.u11.t122, i0.u11...1198
Computing Next relation with stutter on 810360 deadlock states
176 unique states visited
176 strongly connected components in search stack
177 transitions explored
176 items max in DFS search stack
7330 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,73.3752,1362160,1,0,504595,3.07831e+06,11745,1.33445e+06,7789,1.57798e+07,446360
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyElection-PT-06b-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X("((((i0.i0.i0.i0.i0.u6.p41==0)||(i0.i0.i0.i0.i0.u7.p176==0))||((i0.i0.i0.i0.u8.p311==0)||(i0.i0.i0.u9.p446==0)))||((i0.i0.u10....351
Formula 1 simplified : !G(X"((((i0.i0.i0.i0.i0.u6.p41==0)||(i0.i0.i0.i0.i0.u7.p176==0))||((i0.i0.i0.i0.u8.p311==0)||(i0.i0.i0.u9.p446==0)))||((i0.i0.u10.p5...342
Computing Next relation with stutter on 810360 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7453 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,147.91,2230580,1,0,762842,5.91182e+06,498,1.93328e+06,3661,2.60872e+07,1893
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA StigmergyElection-PT-06b-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2210161 ms.

BK_STOP 1654856023578

--------------------
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-06b"
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-06b, 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-165463872800324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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