MCC'2022- Execution of r294-smll-165463872500148

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1557.147	240703.00	364119.00	1227.10	FTFTFTFFFFFFFFTF	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-165463872500148.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 StigmergyCommit-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K May 30 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.9K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 6.8K May 30 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 30 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 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.4M 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 StigmergyCommit-PT-05b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654780762627

Running Version 202205111006
[2022-06-09 13:19:25] [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-09 13:19:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:19:25] [INFO ] Load time of PNML (sax parser for PT used): 642 ms
[2022-06-09 13:19:26] [INFO ] Transformed 1837 places.
[2022-06-09 13:19:26] [INFO ] Transformed 3460 transitions.
[2022-06-09 13:19:26] [INFO ] Found NUPN structural information;
[2022-06-09 13:19:26] [INFO ] Parsed PT model containing 1837 places and 3460 transitions in 904 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 132 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyCommit-PT-05b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 145 place count 1692 transition count 3315
Iterating global reduction 0 with 145 rules applied. Total rules applied 290 place count 1692 transition count 3315
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 382 place count 1600 transition count 3223
Iterating global reduction 0 with 92 rules applied. Total rules applied 474 place count 1600 transition count 3223
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 527 place count 1547 transition count 3170
Iterating global reduction 0 with 53 rules applied. Total rules applied 580 place count 1547 transition count 3170
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 627 place count 1500 transition count 3123
Iterating global reduction 0 with 47 rules applied. Total rules applied 674 place count 1500 transition count 3123
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 715 place count 1459 transition count 3082
Iterating global reduction 0 with 41 rules applied. Total rules applied 756 place count 1459 transition count 3082
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 797 place count 1418 transition count 3041
Iterating global reduction 0 with 41 rules applied. Total rules applied 838 place count 1418 transition count 3041
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 879 place count 1377 transition count 3000
Iterating global reduction 0 with 41 rules applied. Total rules applied 920 place count 1377 transition count 3000
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 960 place count 1337 transition count 2960
Iterating global reduction 0 with 40 rules applied. Total rules applied 1000 place count 1337 transition count 2960
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 1033 place count 1304 transition count 2927
Iterating global reduction 0 with 33 rules applied. Total rules applied 1066 place count 1304 transition count 2927
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1093 place count 1277 transition count 2900
Iterating global reduction 0 with 27 rules applied. Total rules applied 1120 place count 1277 transition count 2900
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1126 place count 1277 transition count 2894
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1137 place count 1266 transition count 2883
Iterating global reduction 1 with 11 rules applied. Total rules applied 1148 place count 1266 transition count 2883
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1159 place count 1255 transition count 2872
Iterating global reduction 1 with 11 rules applied. Total rules applied 1170 place count 1255 transition count 2872
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1175 place count 1250 transition count 2867
Iterating global reduction 1 with 5 rules applied. Total rules applied 1180 place count 1250 transition count 2867
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1185 place count 1245 transition count 2862
Iterating global reduction 1 with 5 rules applied. Total rules applied 1190 place count 1245 transition count 2862
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1195 place count 1240 transition count 2857
Iterating global reduction 1 with 5 rules applied. Total rules applied 1200 place count 1240 transition count 2857
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1205 place count 1235 transition count 2852
Iterating global reduction 1 with 5 rules applied. Total rules applied 1210 place count 1235 transition count 2852
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1215 place count 1230 transition count 2847
Iterating global reduction 1 with 5 rules applied. Total rules applied 1220 place count 1230 transition count 2847
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1225 place count 1225 transition count 2842
Iterating global reduction 1 with 5 rules applied. Total rules applied 1230 place count 1225 transition count 2842
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1235 place count 1220 transition count 2837
Iterating global reduction 1 with 5 rules applied. Total rules applied 1240 place count 1220 transition count 2837
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1245 place count 1215 transition count 2832
Iterating global reduction 1 with 5 rules applied. Total rules applied 1250 place count 1215 transition count 2832
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1255 place count 1210 transition count 2827
Iterating global reduction 1 with 5 rules applied. Total rules applied 1260 place count 1210 transition count 2827
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1265 place count 1205 transition count 2822
Iterating global reduction 1 with 5 rules applied. Total rules applied 1270 place count 1205 transition count 2822
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 1275 place count 1205 transition count 2817
Applied a total of 1275 rules in 3346 ms. Remains 1205 /1837 variables (removed 632) and now considering 2817/3460 (removed 643) transitions.
// Phase 1: matrix 2817 rows 1205 cols
[2022-06-09 13:19:29] [INFO ] Computed 7 place invariants in 80 ms
[2022-06-09 13:19:30] [INFO ] Implicit Places using invariants in 730 ms returned []
// Phase 1: matrix 2817 rows 1205 cols
[2022-06-09 13:19:30] [INFO ] Computed 7 place invariants in 64 ms
[2022-06-09 13:19:31] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 2141 ms to find 0 implicit places.
// Phase 1: matrix 2817 rows 1205 cols
[2022-06-09 13:19:32] [INFO ] Computed 7 place invariants in 51 ms
[2022-06-09 13:19:34] [INFO ] Dead Transitions using invariants and state equation in 2752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1205/1837 places, 2817/3460 transitions.
Finished structural reductions, in 1 iterations. Remains : 1205/1837 places, 2817/3460 transitions.
Support contains 56 out of 1205 places after structural reductions.
[2022-06-09 13:19:35] [INFO ] Flatten gal took : 463 ms
[2022-06-09 13:19:35] [INFO ] Flatten gal took : 260 ms
[2022-06-09 13:19:36] [INFO ] Input system was already deterministic with 2817 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 1136 ms. (steps per millisecond=8 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 2817 rows 1205 cols
[2022-06-09 13:19:37] [INFO ] Computed 7 place invariants in 35 ms
[2022-06-09 13:19:39] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2022-06-09 13:19:41] [INFO ] After 2187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:19
[2022-06-09 13:19:42] [INFO ] After 2812ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:20
Attempting to minimize the solution found.
Minimization took 190 ms.
[2022-06-09 13:19:42] [INFO ] After 4158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:20
[2022-06-09 13:19:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-06-09 13:19:50] [INFO ] After 6186ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2022-06-09 13:19:52] [INFO ] Deduced a trap composed of 296 places in 1359 ms of which 3 ms to minimize.
[2022-06-09 13:19:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1683 ms
[2022-06-09 13:20:01] [INFO ] After 17463ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 6201 ms.
[2022-06-09 13:20:07] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 13 properties in 455 ms.
Support contains 20 out of 1205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Graph (trivial) has 1179 edges and 1205 vertex of which 102 / 1205 are part of one of the 18 SCC in 10 ms
Free SCC test removed 84 places
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2060 edges and 1121 vertex of which 1115 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.35 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 820 transitions
Trivial Post-agglo rules discarded 820 transitions
Performed 820 trivial Post agglomeration. Transition count delta: 820
Iterating post reduction 0 with 826 rules applied. Total rules applied 828 place count 1115 transition count 1877
Reduce places removed 820 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 838 rules applied. Total rules applied 1666 place count 295 transition count 1859
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1674 place count 288 transition count 1858
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 287 transition count 1858
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 69 Pre rules applied. Total rules applied 1675 place count 287 transition count 1789
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 1813 place count 218 transition count 1789
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1814 place count 217 transition count 1788
Iterating global reduction 4 with 1 rules applied. Total rules applied 1815 place count 217 transition count 1788
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1815 place count 217 transition count 1787
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 1817 place count 216 transition count 1787
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1818 place count 216 transition count 1786
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1904 place count 173 transition count 1743
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1916 place count 173 transition count 1731
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 1943 place count 146 transition count 1183
Iterating global reduction 6 with 27 rules applied. Total rules applied 1970 place count 146 transition count 1183
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1979 place count 146 transition count 1174
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1996 place count 129 transition count 1157
Iterating global reduction 7 with 17 rules applied. Total rules applied 2013 place count 129 transition count 1157
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2024 place count 118 transition count 1146
Iterating global reduction 7 with 11 rules applied. Total rules applied 2035 place count 118 transition count 1146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2040 place count 118 transition count 1141
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 2052 place count 112 transition count 1135
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2058 place count 109 transition count 1150
Free-agglomeration rule applied 43 times.
Iterating global reduction 8 with 43 rules applied. Total rules applied 2101 place count 109 transition count 1107
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 46 rules applied. Total rules applied 2147 place count 66 transition count 1104
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2153 place count 60 transition count 1098
Iterating global reduction 9 with 6 rules applied. Total rules applied 2159 place count 60 transition count 1098
Drop transitions removed 118 transitions
Redundant transition composition rules discarded 118 transitions
Iterating global reduction 9 with 118 rules applied. Total rules applied 2277 place count 60 transition count 980
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2279 place count 59 transition count 979
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2283 place count 57 transition count 997
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2284 place count 57 transition count 996
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2285 place count 56 transition count 996
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2290 place count 56 transition count 996
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2292 place count 56 transition count 994
Applied a total of 2292 rules in 1449 ms. Remains 56 /1205 variables (removed 1149) and now considering 994/2817 (removed 1823) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/1205 places, 994/2817 transitions.
Incomplete random walk after 10000 steps, including 511 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 994 rows 56 cols
[2022-06-09 13:20:10] [INFO ] Computed 7 place invariants in 8 ms
[2022-06-09 13:20:10] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 13:20:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-09 13:20:10] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 13:20:10] [INFO ] State equation strengthened by 866 read => feed constraints.
[2022-06-09 13:20:11] [INFO ] After 743ms SMT Verify possible using 866 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 13:20:11] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-06-09 13:20:11] [INFO ] After 1375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 255 stabilizing places and 267 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(p0)||p1))) U p0))'
Support contains 2 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1203 transition count 2815
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1203 transition count 2815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1201 transition count 2813
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1201 transition count 2813
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1199 transition count 2811
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1199 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1198 transition count 2810
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1198 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1197 transition count 2809
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1197 transition count 2809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1196 transition count 2808
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1196 transition count 2808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1195 transition count 2807
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1195 transition count 2807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1194 transition count 2806
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1194 transition count 2806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1193 transition count 2805
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1193 transition count 2805
Applied a total of 24 rules in 832 ms. Remains 1193 /1205 variables (removed 12) and now considering 2805/2817 (removed 12) transitions.
// Phase 1: matrix 2805 rows 1193 cols
[2022-06-09 13:20:13] [INFO ] Computed 7 place invariants in 23 ms
[2022-06-09 13:20:13] [INFO ] Implicit Places using invariants in 810 ms returned []
// Phase 1: matrix 2805 rows 1193 cols
[2022-06-09 13:20:13] [INFO ] Computed 7 place invariants in 37 ms
[2022-06-09 13:20:16] [INFO ] Implicit Places using invariants and state equation in 2487 ms returned []
Implicit Place search using SMT with State Equation took 3304 ms to find 0 implicit places.
// Phase 1: matrix 2805 rows 1193 cols
[2022-06-09 13:20:16] [INFO ] Computed 7 place invariants in 35 ms
[2022-06-09 13:20:19] [INFO ] Dead Transitions using invariants and state equation in 2684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1193/1205 places, 2805/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 1193/1205 places, 2805/2817 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s146 1), p1:(EQ s1079 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-00 finished in 7338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||G(F(p1))))))'
Support contains 7 out of 1205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Graph (trivial) has 1179 edges and 1205 vertex of which 102 / 1205 are part of one of the 18 SCC in 6 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 817 transitions
Trivial Post-agglo rules discarded 817 transitions
Performed 817 trivial Post agglomeration. Transition count delta: 817
Iterating post reduction 0 with 817 rules applied. Total rules applied 818 place count 1120 transition count 1903
Reduce places removed 817 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 835 rules applied. Total rules applied 1653 place count 303 transition count 1885
Reduce places removed 7 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 19 rules applied. Total rules applied 1672 place count 296 transition count 1873
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1684 place count 284 transition count 1873
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 1684 place count 284 transition count 1812
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1806 place count 223 transition count 1812
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1814 place count 215 transition count 1804
Iterating global reduction 4 with 8 rules applied. Total rules applied 1822 place count 215 transition count 1804
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1824 place count 213 transition count 1802
Iterating global reduction 4 with 2 rules applied. Total rules applied 1826 place count 213 transition count 1802
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1828 place count 211 transition count 1800
Iterating global reduction 4 with 2 rules applied. Total rules applied 1830 place count 211 transition count 1800
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1832 place count 209 transition count 1798
Iterating global reduction 4 with 2 rules applied. Total rules applied 1834 place count 209 transition count 1798
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1836 place count 209 transition count 1796
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1930 place count 162 transition count 1749
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1965 place count 127 transition count 390
Iterating global reduction 5 with 35 rules applied. Total rules applied 2000 place count 127 transition count 390
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2018 place count 127 transition count 372
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2035 place count 110 transition count 349
Iterating global reduction 6 with 17 rules applied. Total rules applied 2052 place count 110 transition count 349
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2069 place count 93 transition count 326
Iterating global reduction 6 with 17 rules applied. Total rules applied 2086 place count 93 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2091 place count 93 transition count 321
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 2111 place count 83 transition count 328
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2112 place count 82 transition count 316
Iterating global reduction 7 with 1 rules applied. Total rules applied 2113 place count 82 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2114 place count 82 transition count 315
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2120 place count 82 transition count 309
Applied a total of 2120 rules in 601 ms. Remains 82 /1205 variables (removed 1123) and now considering 309/2817 (removed 2508) transitions.
[2022-06-09 13:20:20] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 82 cols
[2022-06-09 13:20:20] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 13:20:20] [INFO ] Implicit Places using invariants in 176 ms returned []
[2022-06-09 13:20:20] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 82 cols
[2022-06-09 13:20:20] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 13:20:20] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 13:20:20] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2022-06-09 13:20:20] [INFO ] Redundant transitions in 21 ms returned []
[2022-06-09 13:20:20] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 82 cols
[2022-06-09 13:20:20] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:20:20] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/1205 places, 309/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/1205 places, 309/2817 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s52 1) (EQ s65 1) (EQ s79 1)), p1:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8610 reset in 524 ms.
Product exploration explored 100000 steps with 8633 reset in 332 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 : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 858 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 866014 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{0=1}
Probabilistic random walk after 866014 steps, saw 160046 distinct states, run finished after 3002 ms. (steps per millisecond=288 ) properties seen :1
Running SMT prover for 1 properties.
[2022-06-09 13:20:25] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 82 cols
[2022-06-09 13:20:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:20:25] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 13:20:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 13:20:25] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 309/309 transitions.
Applied a total of 0 rules in 16 ms. Remains 82 /82 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2022-06-09 13:20:26] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 82 cols
[2022-06-09 13:20:26] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:20:26] [INFO ] Implicit Places using invariants in 168 ms returned []
[2022-06-09 13:20:26] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 82 cols
[2022-06-09 13:20:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:20:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 13:20:26] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2022-06-09 13:20:26] [INFO ] Redundant transitions in 9 ms returned []
[2022-06-09 13:20:26] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 82 cols
[2022-06-09 13:20:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:20:27] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 309/309 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 876 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 484403 steps, run visited all 1 properties in 1046 ms. (steps per millisecond=463 )
Probabilistic random walk after 484403 steps, saw 95752 distinct states, run finished after 1046 ms. (steps per millisecond=463 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8573 reset in 380 ms.
Product exploration explored 100000 steps with 8638 reset in 367 ms.
Built C files in :
/tmp/ltsmin12394099458126543285
[2022-06-09 13:20:29] [INFO ] Computing symmetric may disable matrix : 309 transitions.
[2022-06-09 13:20:29] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:20:29] [INFO ] Computing symmetric may enable matrix : 309 transitions.
[2022-06-09 13:20:29] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:20:29] [INFO ] Computing Do-Not-Accords matrix : 309 transitions.
[2022-06-09 13:20:29] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:20:29] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12394099458126543285
Running compilation step : cd /tmp/ltsmin12394099458126543285;'/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 1426 ms.
Running link step : cd /tmp/ltsmin12394099458126543285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12394099458126543285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10836545449074733642.hoa' '--buchi-type=spotba'
LTSmin run took 1245 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-05b-LTLFireability-04 finished in 12961 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 8 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1201 transition count 2813
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1201 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1198 transition count 2810
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1198 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 1195 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 1195 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1193 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1191 transition count 2803
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1191 transition count 2803
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1189 transition count 2801
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1182 transition count 2794
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1181 transition count 2793
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1180 transition count 2792
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1179 transition count 2791
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1178 transition count 2790
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1178 transition count 2789
Applied a total of 55 rules in 1259 ms. Remains 1178 /1205 variables (removed 27) and now considering 2789/2817 (removed 28) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:33] [INFO ] Computed 7 place invariants in 38 ms
[2022-06-09 13:20:34] [INFO ] Implicit Places using invariants in 819 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:34] [INFO ] Computed 7 place invariants in 43 ms
[2022-06-09 13:20:36] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:36] [INFO ] Computed 7 place invariants in 42 ms
[2022-06-09 13:20:39] [INFO ] Dead Transitions using invariants and state equation in 2886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1205 places, 2789/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1205 places, 2789/2817 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s932 1) (EQ s1177 1)), p1:(AND (EQ s23 1) (EQ s258 1) (EQ s409 1) (EQ s623 1) (EQ s837 1) (EQ s1030 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-06 finished in 6685 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!(G(!p0) U p1)&&F(G(X(p2)))))))'
Support contains 8 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1201 transition count 2813
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1201 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1198 transition count 2810
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1198 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 1195 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 1195 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1193 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1191 transition count 2803
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1191 transition count 2803
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1189 transition count 2801
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1182 transition count 2794
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1181 transition count 2793
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1180 transition count 2792
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1179 transition count 2791
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1178 transition count 2790
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1178 transition count 2789
Applied a total of 55 rules in 1737 ms. Remains 1178 /1205 variables (removed 27) and now considering 2789/2817 (removed 28) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:41] [INFO ] Computed 7 place invariants in 42 ms
[2022-06-09 13:20:41] [INFO ] Implicit Places using invariants in 945 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:41] [INFO ] Computed 7 place invariants in 44 ms
[2022-06-09 13:20:43] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2564 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:43] [INFO ] Computed 7 place invariants in 43 ms
[2022-06-09 13:20:46] [INFO ] Dead Transitions using invariants and state equation in 2979 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1205 places, 2789/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1205 places, 2789/2817 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, (AND p1 (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s33 1), p0:(AND (EQ s23 1) (EQ s258 1) (EQ s430 1) (EQ s602 1) (EQ s837 1) (EQ s1030 1)), p2:(EQ s906 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 884 reset in 329 ms.
Product exploration explored 100000 steps with 878 reset in 527 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:48] [INFO ] Computed 7 place invariants in 26 ms
[2022-06-09 13:20:48] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 13:20:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2022-06-09 13:20:49] [INFO ] After 1254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 13:20:52] [INFO ] Deduced a trap composed of 298 places in 2159 ms of which 3 ms to minimize.
[2022-06-09 13:20:53] [INFO ] Deduced a trap composed of 301 places in 1456 ms of which 1 ms to minimize.
[2022-06-09 13:20:54] [INFO ] Deduced a trap composed of 298 places in 1143 ms of which 1 ms to minimize.
[2022-06-09 13:20:56] [INFO ] Deduced a trap composed of 298 places in 1659 ms of which 2 ms to minimize.
[2022-06-09 13:20:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7064 ms
[2022-06-09 13:20:56] [INFO ] After 8415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-06-09 13:20:57] [INFO ] After 8783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1175 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 4 ms
Free SCC test removed 84 places
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2026 edges and 1094 vertex of which 1088 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 822 transitions
Trivial Post-agglo rules discarded 822 transitions
Performed 822 trivial Post agglomeration. Transition count delta: 822
Iterating post reduction 0 with 828 rules applied. Total rules applied 830 place count 1088 transition count 1847
Reduce places removed 822 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 840 rules applied. Total rules applied 1670 place count 266 transition count 1829
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 1677 place count 260 transition count 1828
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1678 place count 259 transition count 1828
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 1678 place count 259 transition count 1761
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 1812 place count 192 transition count 1761
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1813 place count 192 transition count 1760
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1899 place count 149 transition count 1717
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1911 place count 149 transition count 1705
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1948 place count 112 transition count 339
Iterating global reduction 6 with 37 rules applied. Total rules applied 1985 place count 112 transition count 339
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 2003 place count 112 transition count 321
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2021 place count 94 transition count 303
Iterating global reduction 7 with 18 rules applied. Total rules applied 2039 place count 94 transition count 303
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2051 place count 82 transition count 291
Iterating global reduction 7 with 12 rules applied. Total rules applied 2063 place count 82 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2069 place count 82 transition count 285
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 2081 place count 76 transition count 279
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 2087 place count 73 transition count 287
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2119 place count 73 transition count 255
Reduce places removed 32 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 97 rules applied. Total rules applied 2216 place count 41 transition count 190
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2222 place count 35 transition count 184
Iterating global reduction 9 with 6 rules applied. Total rules applied 2228 place count 35 transition count 184
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 9 with 69 rules applied. Total rules applied 2297 place count 35 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2299 place count 34 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2303 place count 32 transition count 132
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2305 place count 32 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2307 place count 30 transition count 130
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2310 place count 30 transition count 130
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2312 place count 30 transition count 128
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2313 place count 29 transition count 126
Iterating global reduction 10 with 1 rules applied. Total rules applied 2314 place count 29 transition count 126
Applied a total of 2314 rules in 293 ms. Remains 29 /1178 variables (removed 1149) and now considering 126/2789 (removed 2663) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/1178 places, 126/2789 transitions.
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 471 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 137 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Support contains 8 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 75 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:58] [INFO ] Computed 7 place invariants in 25 ms
[2022-06-09 13:20:58] [INFO ] Implicit Places using invariants in 761 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:20:59] [INFO ] Computed 7 place invariants in 43 ms
[2022-06-09 13:21:00] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:00] [INFO ] Computed 7 place invariants in 33 ms
[2022-06-09 13:21:02] [INFO ] Dead Transitions using invariants and state equation in 2579 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1178 places, 2789/2789 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 342 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 141 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:03] [INFO ] Computed 7 place invariants in 29 ms
[2022-06-09 13:21:03] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 13:21:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-06-09 13:21:05] [INFO ] After 1378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 13:21:07] [INFO ] Deduced a trap composed of 298 places in 1846 ms of which 2 ms to minimize.
[2022-06-09 13:21:09] [INFO ] Deduced a trap composed of 301 places in 1874 ms of which 1 ms to minimize.
[2022-06-09 13:21:11] [INFO ] Deduced a trap composed of 298 places in 1926 ms of which 1 ms to minimize.
[2022-06-09 13:21:13] [INFO ] Deduced a trap composed of 298 places in 1772 ms of which 2 ms to minimize.
[2022-06-09 13:21:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8032 ms
[2022-06-09 13:21:13] [INFO ] After 9489ms 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-09 13:21:13] [INFO ] After 9893ms 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 1178 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1175 edges and 1178 vertex of which 102 / 1178 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 2026 edges and 1094 vertex of which 1088 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 822 transitions
Trivial Post-agglo rules discarded 822 transitions
Performed 822 trivial Post agglomeration. Transition count delta: 822
Iterating post reduction 0 with 828 rules applied. Total rules applied 830 place count 1088 transition count 1847
Reduce places removed 822 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 840 rules applied. Total rules applied 1670 place count 266 transition count 1829
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 1677 place count 260 transition count 1828
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1678 place count 259 transition count 1828
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 1678 place count 259 transition count 1761
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 1812 place count 192 transition count 1761
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1813 place count 192 transition count 1760
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1899 place count 149 transition count 1717
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1911 place count 149 transition count 1705
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1948 place count 112 transition count 339
Iterating global reduction 6 with 37 rules applied. Total rules applied 1985 place count 112 transition count 339
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 2003 place count 112 transition count 321
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2021 place count 94 transition count 303
Iterating global reduction 7 with 18 rules applied. Total rules applied 2039 place count 94 transition count 303
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2051 place count 82 transition count 291
Iterating global reduction 7 with 12 rules applied. Total rules applied 2063 place count 82 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2069 place count 82 transition count 285
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 2081 place count 76 transition count 279
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 2087 place count 73 transition count 287
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2119 place count 73 transition count 255
Reduce places removed 32 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 97 rules applied. Total rules applied 2216 place count 41 transition count 190
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2222 place count 35 transition count 184
Iterating global reduction 9 with 6 rules applied. Total rules applied 2228 place count 35 transition count 184
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 9 with 69 rules applied. Total rules applied 2297 place count 35 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2299 place count 34 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2303 place count 32 transition count 132
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2305 place count 32 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2307 place count 30 transition count 130
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2310 place count 30 transition count 130
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2312 place count 30 transition count 128
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2313 place count 29 transition count 126
Iterating global reduction 10 with 1 rules applied. Total rules applied 2314 place count 29 transition count 126
Applied a total of 2314 rules in 230 ms. Remains 29 /1178 variables (removed 1149) and now considering 126/2789 (removed 2663) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/1178 places, 126/2789 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 346 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 135 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 896 reset in 316 ms.
Product exploration explored 100000 steps with 890 reset in 321 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Support contains 8 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1167 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 803 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 803 rules applied. Total rules applied 804 place count 1094 transition count 2693
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 816 place count 1094 transition count 2681
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 816 place count 1094 transition count 2687
Deduced a syphon composed of 851 places in 3 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 864 place count 1094 transition count 2687
Discarding 721 places :
Symmetric choice reduction at 2 with 721 rule applications. Total rules 1585 place count 373 transition count 1966
Deduced a syphon composed of 135 places in 2 ms
Iterating global reduction 2 with 721 rules applied. Total rules applied 2306 place count 373 transition count 1966
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 202 places in 1 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 2373 place count 373 transition count 1984
Discarding 106 places :
Symmetric choice reduction at 2 with 106 rule applications. Total rules 2479 place count 267 transition count 799
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 2 with 106 rules applied. Total rules applied 2585 place count 267 transition count 799
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2604 place count 267 transition count 780
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 2649 place count 222 transition count 729
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 3 with 45 rules applied. Total rules applied 2694 place count 222 transition count 729
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2712 place count 204 transition count 711
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 2730 place count 204 transition count 711
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2736 place count 204 transition count 705
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2748 place count 192 transition count 693
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 2760 place count 192 transition count 693
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2769 place count 192 transition count 738
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2784 place count 177 transition count 708
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 2799 place count 177 transition count 708
Deduced a syphon composed of 84 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2811 place count 177 transition count 696
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 2811 rules in 669 ms. Remains 177 /1178 variables (removed 1001) and now considering 696/2789 (removed 2093) transitions.
[2022-06-09 13:21:16] [INFO ] Redundant transitions in 23 ms returned []
[2022-06-09 13:21:16] [INFO ] Flow matrix only has 689 transitions (discarded 7 similar events)
// Phase 1: matrix 689 rows 177 cols
[2022-06-09 13:21:16] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 13:21:16] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1178 places, 696/2789 transitions.
Finished structural reductions, in 1 iterations. Remains : 177/1178 places, 696/2789 transitions.
Product exploration explored 100000 steps with 6866 reset in 617 ms.
Stuttering criterion allowed to conclude after 28372 steps with 1943 reset in 166 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-07 finished in 38551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)&&G(p1)) U (p2 U X(p3))))'
Support contains 17 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1201 transition count 2813
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1201 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1198 transition count 2810
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1198 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 1195 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 1195 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1193 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1191 transition count 2803
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1191 transition count 2803
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1189 transition count 2801
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1182 transition count 2794
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1181 transition count 2793
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1180 transition count 2792
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1179 transition count 2791
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1178 transition count 2790
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1178 transition count 2789
Applied a total of 55 rules in 731 ms. Remains 1178 /1205 variables (removed 27) and now considering 2789/2817 (removed 28) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:18] [INFO ] Computed 7 place invariants in 42 ms
[2022-06-09 13:21:19] [INFO ] Implicit Places using invariants in 719 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:19] [INFO ] Computed 7 place invariants in 28 ms
[2022-06-09 13:21:20] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:20] [INFO ] Computed 7 place invariants in 45 ms
[2022-06-09 13:21:23] [INFO ] Dead Transitions using invariants and state equation in 3265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1205 places, 2789/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1205 places, 2789/2817 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), true, (OR (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND p0 p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (AND (NOT p3) p0 p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s28 1), p2:(AND (EQ s121 1) (EQ s293 1) (EQ s486 1) (EQ s679 1) (EQ s893 1) (EQ s1044 1)), p0:(AND (EQ s79 1) (EQ s314 1) (EQ s486 1) (EQ s679 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-08 finished in 6277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Graph (trivial) has 1200 edges and 1205 vertex of which 102 / 1205 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 828 transitions
Trivial Post-agglo rules discarded 828 transitions
Performed 828 trivial Post agglomeration. Transition count delta: 828
Iterating post reduction 0 with 828 rules applied. Total rules applied 829 place count 1120 transition count 1892
Reduce places removed 828 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 846 rules applied. Total rules applied 1675 place count 292 transition count 1874
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1683 place count 285 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1684 place count 284 transition count 1873
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 1684 place count 284 transition count 1811
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1808 place count 222 transition count 1811
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1816 place count 214 transition count 1803
Iterating global reduction 4 with 8 rules applied. Total rules applied 1824 place count 214 transition count 1803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1824 place count 214 transition count 1802
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1826 place count 213 transition count 1802
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1828 place count 211 transition count 1800
Iterating global reduction 4 with 2 rules applied. Total rules applied 1830 place count 211 transition count 1800
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1832 place count 209 transition count 1798
Iterating global reduction 4 with 2 rules applied. Total rules applied 1834 place count 209 transition count 1798
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1836 place count 207 transition count 1796
Iterating global reduction 4 with 2 rules applied. Total rules applied 1838 place count 207 transition count 1796
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1840 place count 207 transition count 1794
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1934 place count 160 transition count 1746
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1969 place count 125 transition count 387
Iterating global reduction 5 with 35 rules applied. Total rules applied 2004 place count 125 transition count 387
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2022 place count 125 transition count 369
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2039 place count 108 transition count 346
Iterating global reduction 6 with 17 rules applied. Total rules applied 2056 place count 108 transition count 346
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2073 place count 91 transition count 323
Iterating global reduction 6 with 17 rules applied. Total rules applied 2090 place count 91 transition count 323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2095 place count 91 transition count 318
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 2115 place count 81 transition count 325
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2116 place count 80 transition count 313
Iterating global reduction 7 with 1 rules applied. Total rules applied 2117 place count 80 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2118 place count 80 transition count 312
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2124 place count 80 transition count 306
Applied a total of 2124 rules in 246 ms. Remains 80 /1205 variables (removed 1125) and now considering 306/2817 (removed 2511) transitions.
[2022-06-09 13:21:24] [INFO ] Flow matrix only has 299 transitions (discarded 7 similar events)
// Phase 1: matrix 299 rows 80 cols
[2022-06-09 13:21:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:21:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2022-06-09 13:21:24] [INFO ] Flow matrix only has 299 transitions (discarded 7 similar events)
// Phase 1: matrix 299 rows 80 cols
[2022-06-09 13:21:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:21:24] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 13:21:24] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2022-06-09 13:21:24] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 13:21:24] [INFO ] Flow matrix only has 299 transitions (discarded 7 similar events)
// Phase 1: matrix 299 rows 80 cols
[2022-06-09 13:21:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:21:24] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/1205 places, 306/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/1205 places, 306/2817 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-09 finished in 912 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((X(G(p1)) U p2)||(p0 U p1))))'
Support contains 13 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1201 transition count 2813
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1201 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1198 transition count 2810
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1198 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 1195 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 1195 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1193 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1191 transition count 2803
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1191 transition count 2803
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1189 transition count 2801
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1182 transition count 2794
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1181 transition count 2793
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1180 transition count 2792
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1179 transition count 2791
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1178 transition count 2790
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1178 transition count 2789
Applied a total of 55 rules in 995 ms. Remains 1178 /1205 variables (removed 27) and now considering 2789/2817 (removed 28) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:25] [INFO ] Computed 7 place invariants in 26 ms
[2022-06-09 13:21:26] [INFO ] Implicit Places using invariants in 577 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:26] [INFO ] Computed 7 place invariants in 44 ms
[2022-06-09 13:21:27] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:27] [INFO ] Computed 7 place invariants in 30 ms
[2022-06-09 13:21:30] [INFO ] Dead Transitions using invariants and state equation in 2634 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1205 places, 2789/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1205 places, 2789/2817 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), true, (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s23 1) (EQ s237 1) (EQ s430 1) (EQ s602 1) (EQ s816 1) (EQ s1030 1)), p2:(EQ s234 1), p0:(AND (EQ s44 1) (EQ s216 1) (EQ s409 1) (EQ s644 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-10 finished in 5632 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(p0))))))'
Support contains 1 out of 1205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Graph (trivial) has 1200 edges and 1205 vertex of which 102 / 1205 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 828 transitions
Trivial Post-agglo rules discarded 828 transitions
Performed 828 trivial Post agglomeration. Transition count delta: 828
Iterating post reduction 0 with 828 rules applied. Total rules applied 829 place count 1120 transition count 1892
Reduce places removed 828 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 846 rules applied. Total rules applied 1675 place count 292 transition count 1874
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1683 place count 285 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1684 place count 284 transition count 1873
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 1684 place count 284 transition count 1811
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1808 place count 222 transition count 1811
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1816 place count 214 transition count 1803
Iterating global reduction 4 with 8 rules applied. Total rules applied 1824 place count 214 transition count 1803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1824 place count 214 transition count 1802
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 1826 place count 213 transition count 1802
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1828 place count 211 transition count 1800
Iterating global reduction 4 with 2 rules applied. Total rules applied 1830 place count 211 transition count 1800
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1832 place count 209 transition count 1798
Iterating global reduction 4 with 2 rules applied. Total rules applied 1834 place count 209 transition count 1798
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1836 place count 207 transition count 1796
Iterating global reduction 4 with 2 rules applied. Total rules applied 1838 place count 207 transition count 1796
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1840 place count 207 transition count 1794
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 5 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1934 place count 160 transition count 1746
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1969 place count 125 transition count 387
Iterating global reduction 5 with 35 rules applied. Total rules applied 2004 place count 125 transition count 387
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2022 place count 125 transition count 369
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2039 place count 108 transition count 346
Iterating global reduction 6 with 17 rules applied. Total rules applied 2056 place count 108 transition count 346
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2073 place count 91 transition count 323
Iterating global reduction 6 with 17 rules applied. Total rules applied 2090 place count 91 transition count 323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2095 place count 91 transition count 318
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 2115 place count 81 transition count 325
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2116 place count 80 transition count 313
Iterating global reduction 7 with 1 rules applied. Total rules applied 2117 place count 80 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2118 place count 80 transition count 312
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2124 place count 80 transition count 306
Applied a total of 2124 rules in 200 ms. Remains 80 /1205 variables (removed 1125) and now considering 306/2817 (removed 2511) transitions.
[2022-06-09 13:21:30] [INFO ] Flow matrix only has 299 transitions (discarded 7 similar events)
// Phase 1: matrix 299 rows 80 cols
[2022-06-09 13:21:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:21:30] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-06-09 13:21:30] [INFO ] Flow matrix only has 299 transitions (discarded 7 similar events)
// Phase 1: matrix 299 rows 80 cols
[2022-06-09 13:21:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:21:31] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 13:21:31] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2022-06-09 13:21:31] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-09 13:21:31] [INFO ] Flow matrix only has 299 transitions (discarded 7 similar events)
// Phase 1: matrix 299 rows 80 cols
[2022-06-09 13:21:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:21:31] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/1205 places, 306/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/1205 places, 306/2817 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-11 finished in 1043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 7 out of 1205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Graph (trivial) has 1194 edges and 1205 vertex of which 102 / 1205 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 822 transitions
Trivial Post-agglo rules discarded 822 transitions
Performed 822 trivial Post agglomeration. Transition count delta: 822
Iterating post reduction 0 with 822 rules applied. Total rules applied 823 place count 1120 transition count 1898
Reduce places removed 822 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 840 rules applied. Total rules applied 1663 place count 298 transition count 1880
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1671 place count 291 transition count 1879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1672 place count 290 transition count 1879
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 1672 place count 290 transition count 1817
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1796 place count 228 transition count 1817
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1804 place count 220 transition count 1809
Iterating global reduction 4 with 8 rules applied. Total rules applied 1812 place count 220 transition count 1809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1812 place count 220 transition count 1808
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 1814 place count 219 transition count 1808
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1816 place count 217 transition count 1806
Iterating global reduction 4 with 2 rules applied. Total rules applied 1818 place count 217 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1820 place count 215 transition count 1804
Iterating global reduction 4 with 2 rules applied. Total rules applied 1822 place count 215 transition count 1804
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1824 place count 213 transition count 1802
Iterating global reduction 4 with 2 rules applied. Total rules applied 1826 place count 213 transition count 1802
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1828 place count 213 transition count 1800
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1922 place count 166 transition count 1752
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1953 place count 135 transition count 653
Iterating global reduction 5 with 31 rules applied. Total rules applied 1984 place count 135 transition count 653
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1997 place count 135 transition count 640
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2014 place count 118 transition count 617
Iterating global reduction 6 with 17 rules applied. Total rules applied 2031 place count 118 transition count 617
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2048 place count 101 transition count 594
Iterating global reduction 6 with 17 rules applied. Total rules applied 2065 place count 101 transition count 594
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2070 place count 101 transition count 589
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 2090 place count 91 transition count 596
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2091 place count 90 transition count 584
Iterating global reduction 7 with 1 rules applied. Total rules applied 2092 place count 90 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2093 place count 90 transition count 583
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2099 place count 90 transition count 577
Applied a total of 2099 rules in 246 ms. Remains 90 /1205 variables (removed 1115) and now considering 577/2817 (removed 2240) transitions.
[2022-06-09 13:21:31] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
// Phase 1: matrix 570 rows 90 cols
[2022-06-09 13:21:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:21:32] [INFO ] Implicit Places using invariants in 205 ms returned []
[2022-06-09 13:21:32] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
// Phase 1: matrix 570 rows 90 cols
[2022-06-09 13:21:32] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:21:32] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 13:21:32] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2022-06-09 13:21:32] [INFO ] Redundant transitions in 5 ms returned []
[2022-06-09 13:21:32] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
// Phase 1: matrix 570 rows 90 cols
[2022-06-09 13:21:32] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:21:32] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/1205 places, 577/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/1205 places, 577/2817 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s8 1) (EQ s23 1) (EQ s35 1) (EQ s52 1) (EQ s67 1) (EQ s80 1)), p0:(EQ s38 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 96 steps with 7 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-12 finished in 1341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(X(p0))))))'
Support contains 6 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1201 transition count 2813
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1201 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1198 transition count 2810
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1198 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 1195 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 1195 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1193 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1191 transition count 2803
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1191 transition count 2803
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1189 transition count 2801
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1182 transition count 2794
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1181 transition count 2793
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1180 transition count 2792
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1179 transition count 2791
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1178 transition count 2790
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1178 transition count 2789
Applied a total of 55 rules in 1052 ms. Remains 1178 /1205 variables (removed 27) and now considering 2789/2817 (removed 28) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:34] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-09 13:21:34] [INFO ] Implicit Places using invariants in 650 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:34] [INFO ] Computed 7 place invariants in 35 ms
[2022-06-09 13:21:35] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:35] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-09 13:21:38] [INFO ] Dead Transitions using invariants and state equation in 2282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1205 places, 2789/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1205 places, 2789/2817 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s79 1) (EQ s314 1) (EQ s507 1) (EQ s658 1) (EQ s872 1) (EQ s1086 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-13 finished in 5334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))||p1))))'
Support contains 10 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1201 transition count 2813
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1201 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1198 transition count 2810
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1198 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 1195 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 1195 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1193 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1191 transition count 2803
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1191 transition count 2803
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1189 transition count 2801
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1182 transition count 2794
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1181 transition count 2793
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1180 transition count 2792
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1179 transition count 2791
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1178 transition count 2790
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1178 transition count 2789
Applied a total of 55 rules in 1012 ms. Remains 1178 /1205 variables (removed 27) and now considering 2789/2817 (removed 28) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:39] [INFO ] Computed 7 place invariants in 26 ms
[2022-06-09 13:21:39] [INFO ] Implicit Places using invariants in 530 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:39] [INFO ] Computed 7 place invariants in 26 ms
[2022-06-09 13:21:41] [INFO ] Implicit Places using invariants and state equation in 2015 ms returned []
Implicit Place search using SMT with State Equation took 2547 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:41] [INFO ] Computed 7 place invariants in 45 ms
[2022-06-09 13:21:44] [INFO ] Dead Transitions using invariants and state equation in 2845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1178/1205 places, 2789/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1205 places, 2789/2817 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s258 1) (EQ s409 1) (EQ s602 1) (EQ s837 1) (EQ s988 1)), p0:(OR (EQ s44 0) (EQ s237 0) (EQ s409 0) (EQ s644 0) (EQ s795 0) (EQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1161 ms.
Product exploration explored 100000 steps with 25000 reset in 795 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207203 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207203 steps, saw 45025 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:50] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-09 13:21:50] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 13:21:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-06-09 13:21:52] [INFO ] After 1453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 13:21:52] [INFO ] After 2083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 606 ms.
[2022-06-09 13:21:53] [INFO ] After 2902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 188 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=62 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 99 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:54] [INFO ] Computed 7 place invariants in 44 ms
[2022-06-09 13:21:55] [INFO ] Implicit Places using invariants in 871 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:55] [INFO ] Computed 7 place invariants in 43 ms
[2022-06-09 13:21:56] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 2320 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:21:56] [INFO ] Computed 7 place invariants in 44 ms
[2022-06-09 13:21:59] [INFO ] Dead Transitions using invariants and state equation in 2990 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1178 places, 2789/2789 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 195213 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195213 steps, saw 42797 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:22:02] [INFO ] Computed 7 place invariants in 26 ms
[2022-06-09 13:22:03] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 13:22:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2022-06-09 13:22:05] [INFO ] After 1673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 13:22:05] [INFO ] After 2308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 603 ms.
[2022-06-09 13:22:06] [INFO ] After 3263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 188 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=94 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 971 ms.
Product exploration explored 100000 steps with 25000 reset in 922 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1167 edges and 1178 vertex of which 102 / 1178 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 803 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 803 rules applied. Total rules applied 804 place count 1094 transition count 2693
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 816 place count 1094 transition count 2681
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 816 place count 1094 transition count 2687
Deduced a syphon composed of 851 places in 3 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 864 place count 1094 transition count 2687
Discarding 722 places :
Symmetric choice reduction at 2 with 722 rule applications. Total rules 1586 place count 372 transition count 1965
Deduced a syphon composed of 134 places in 2 ms
Iterating global reduction 2 with 722 rules applied. Total rules applied 2308 place count 372 transition count 1965
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 201 places in 1 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 2375 place count 372 transition count 1983
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 2480 place count 267 transition count 960
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 2585 place count 267 transition count 960
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2605 place count 267 transition count 940
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2649 place count 223 transition count 890
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 3 with 44 rules applied. Total rules applied 2693 place count 223 transition count 890
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2711 place count 205 transition count 872
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 2729 place count 205 transition count 872
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2735 place count 205 transition count 866
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2747 place count 193 transition count 854
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 2759 place count 193 transition count 854
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2768 place count 193 transition count 899
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2783 place count 178 transition count 869
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 2798 place count 178 transition count 869
Deduced a syphon composed of 84 places in 1 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2810 place count 178 transition count 857
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 2810 rules in 550 ms. Remains 178 /1178 variables (removed 1000) and now considering 857/2789 (removed 1932) transitions.
[2022-06-09 13:22:09] [INFO ] Redundant transitions in 22 ms returned []
[2022-06-09 13:22:09] [INFO ] Flow matrix only has 850 transitions (discarded 7 similar events)
// Phase 1: matrix 850 rows 178 cols
[2022-06-09 13:22:09] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 13:22:10] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/1178 places, 857/2789 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/1178 places, 857/2789 transitions.
Product exploration explored 100000 steps with 25000 reset in 1968 ms.
Product exploration explored 100000 steps with 25000 reset in 1599 ms.
Built C files in :
/tmp/ltsmin4426309754245588298
[2022-06-09 13:22:13] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4426309754245588298
Running compilation step : cd /tmp/ltsmin4426309754245588298;'/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/ltsmin4426309754245588298;'/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/ltsmin4426309754245588298;'/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 10 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 52 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:22:17] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-09 13:22:17] [INFO ] Implicit Places using invariants in 542 ms returned []
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:22:17] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-09 13:22:19] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2461 ms to find 0 implicit places.
// Phase 1: matrix 2789 rows 1178 cols
[2022-06-09 13:22:19] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-09 13:22:22] [INFO ] Dead Transitions using invariants and state equation in 2915 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1178/1178 places, 2789/2789 transitions.
Built C files in :
/tmp/ltsmin4739196406540356142
[2022-06-09 13:22:22] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4739196406540356142
Running compilation step : cd /tmp/ltsmin4739196406540356142;'/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/ltsmin4739196406540356142;'/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/ltsmin4739196406540356142;'/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-09 13:22:26] [INFO ] Flatten gal took : 243 ms
[2022-06-09 13:22:26] [INFO ] Flatten gal took : 221 ms
[2022-06-09 13:22:26] [INFO ] Time to serialize gal into /tmp/LTL17128619839300164142.gal : 120 ms
[2022-06-09 13:22:26] [INFO ] Time to serialize properties into /tmp/LTL2824898589619763208.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17128619839300164142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2824898589619763208.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/LTL1712861...267
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X("((((p51==0)||(p353==0))||((p633==0)||(p980==0)))||((p1237==0)||(p1584==0)))")))||("((((p51==1)&&(p376==1))&&((p633==1)&&(...198
Formula 0 simplified : !XF("((((p51==1)&&(p376==1))&&((p633==1)&&(p935==1)))&&((p1282==1)&&(p1539==1)))" | XX"((((p51==0)||(p353==0))||((p633==0)||(p980==0...187
Detected timeout of ITS tools.
[2022-06-09 13:22:41] [INFO ] Flatten gal took : 171 ms
[2022-06-09 13:22:41] [INFO ] Applying decomposition
[2022-06-09 13:22:41] [INFO ] Flatten gal took : 168 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/graph9957995512968050491.txt' '-o' '/tmp/graph9957995512968050491.bin' '-w' '/tmp/graph9957995512968050491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9957995512968050491.bin' '-l' '-1' '-v' '-w' '/tmp/graph9957995512968050491.weights' '-q' '0' '-e' '0.001'
[2022-06-09 13:22:42] [INFO ] Decomposing Gal with order
[2022-06-09 13:22:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 13:22:44] [INFO ] Removed a total of 9310 redundant transitions.
[2022-06-09 13:22:44] [INFO ] Flatten gal took : 754 ms
[2022-06-09 13:22:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 78 ms.
[2022-06-09 13:22:44] [INFO ] Time to serialize gal into /tmp/LTL6528874118093635936.gal : 31 ms
[2022-06-09 13:22:44] [INFO ] Time to serialize properties into /tmp/LTL15068873728011152927.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/LTL6528874118093635936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15068873728011152927.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/LTL6528874...246
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X("((((i11.u4.p51==0)||(i11.u121.p353==0))||((i11.u170.p633==0)||(i11.u244.p980==0)))||((i11.u331.p1237==0)||(i11.u407.p1584...301
Formula 0 simplified : !XF("((((i11.u4.p51==1)&&(i11.u83.p376==1))&&((i11.u170.p633==1)&&(i11.u249.p935==1)))&&((i11.u326.p1282==1)&&(i11.u413.p1539==1)))"...290
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4273552661099556864
[2022-06-09 13:22:59] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4273552661099556864
Running compilation step : cd /tmp/ltsmin4273552661099556864;'/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/ltsmin4273552661099556864;'/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/ltsmin4273552661099556864;'/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 StigmergyCommit-PT-05b-LTLFireability-14 finished in 84261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||(p2 U X(X(X((G(p3)||p2)))))))))'
Support contains 11 out of 1205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Graph (trivial) has 1188 edges and 1205 vertex of which 102 / 1205 are part of one of the 18 SCC in 0 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 817 transitions
Trivial Post-agglo rules discarded 817 transitions
Performed 817 trivial Post agglomeration. Transition count delta: 817
Iterating post reduction 0 with 817 rules applied. Total rules applied 818 place count 1120 transition count 1903
Reduce places removed 817 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 835 rules applied. Total rules applied 1653 place count 303 transition count 1885
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1660 place count 296 transition count 1885
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 1660 place count 296 transition count 1822
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 1786 place count 233 transition count 1822
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1793 place count 226 transition count 1815
Iterating global reduction 3 with 7 rules applied. Total rules applied 1800 place count 226 transition count 1815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1800 place count 226 transition count 1814
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1802 place count 225 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1803 place count 224 transition count 1813
Iterating global reduction 3 with 1 rules applied. Total rules applied 1804 place count 224 transition count 1813
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1805 place count 223 transition count 1812
Iterating global reduction 3 with 1 rules applied. Total rules applied 1806 place count 223 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1807 place count 222 transition count 1811
Iterating global reduction 3 with 1 rules applied. Total rules applied 1808 place count 222 transition count 1811
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1809 place count 222 transition count 1810
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1903 place count 175 transition count 1762
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 1932 place count 146 transition count 1068
Iterating global reduction 4 with 29 rules applied. Total rules applied 1961 place count 146 transition count 1068
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1973 place count 146 transition count 1056
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1990 place count 129 transition count 1033
Iterating global reduction 5 with 17 rules applied. Total rules applied 2007 place count 129 transition count 1033
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2024 place count 112 transition count 1010
Iterating global reduction 5 with 17 rules applied. Total rules applied 2041 place count 112 transition count 1010
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2046 place count 112 transition count 1005
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2066 place count 102 transition count 1019
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2067 place count 101 transition count 1007
Iterating global reduction 6 with 1 rules applied. Total rules applied 2068 place count 101 transition count 1007
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2069 place count 101 transition count 1006
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 2075 place count 101 transition count 1000
Applied a total of 2075 rules in 254 ms. Remains 101 /1205 variables (removed 1104) and now considering 1000/2817 (removed 1817) transitions.
[2022-06-09 13:23:02] [INFO ] Flow matrix only has 993 transitions (discarded 7 similar events)
// Phase 1: matrix 993 rows 101 cols
[2022-06-09 13:23:02] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 13:23:03] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-06-09 13:23:03] [INFO ] Flow matrix only has 993 transitions (discarded 7 similar events)
// Phase 1: matrix 993 rows 101 cols
[2022-06-09 13:23:03] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 13:23:03] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 13:23:03] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2022-06-09 13:23:03] [INFO ] Redundant transitions in 16 ms returned []
[2022-06-09 13:23:03] [INFO ] Flow matrix only has 993 transitions (discarded 7 similar events)
// Phase 1: matrix 993 rows 101 cols
[2022-06-09 13:23:03] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 13:23:04] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/1205 places, 1000/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/1205 places, 1000/2817 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s71 1), p2:(AND (EQ s8 1) (EQ s23 1) (EQ s44 1) (EQ s56 1) (EQ s74 1) (EQ s92 1)), p3:(AND (EQ s8 1) (EQ s21 1) (EQ s41 1) (EQ s59 1) (EQ s76 1) (E...], nbAcceptance=1, 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 9 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-15 finished in 2163 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))||p1))))'
Found a CL insensitive property : StigmergyCommit-PT-05b-LTLFireability-14
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 10 out of 1205 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1205/1205 places, 2817/2817 transitions.
Graph (trivial) has 1192 edges and 1205 vertex of which 102 / 1205 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 821 transitions
Trivial Post-agglo rules discarded 821 transitions
Performed 821 trivial Post agglomeration. Transition count delta: 821
Iterating post reduction 0 with 821 rules applied. Total rules applied 822 place count 1120 transition count 1899
Reduce places removed 821 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 839 rules applied. Total rules applied 1661 place count 299 transition count 1881
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1668 place count 292 transition count 1881
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 1668 place count 292 transition count 1819
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 1792 place count 230 transition count 1819
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1800 place count 222 transition count 1811
Iterating global reduction 3 with 8 rules applied. Total rules applied 1808 place count 222 transition count 1811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1808 place count 222 transition count 1810
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1810 place count 221 transition count 1810
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1812 place count 219 transition count 1808
Iterating global reduction 3 with 2 rules applied. Total rules applied 1814 place count 219 transition count 1808
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1816 place count 217 transition count 1806
Iterating global reduction 3 with 2 rules applied. Total rules applied 1818 place count 217 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1820 place count 215 transition count 1804
Iterating global reduction 3 with 2 rules applied. Total rules applied 1822 place count 215 transition count 1804
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1824 place count 215 transition count 1802
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1918 place count 168 transition count 1754
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 1948 place count 138 transition count 817
Iterating global reduction 4 with 30 rules applied. Total rules applied 1978 place count 138 transition count 817
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1991 place count 138 transition count 804
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2008 place count 121 transition count 781
Iterating global reduction 5 with 17 rules applied. Total rules applied 2025 place count 121 transition count 781
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2042 place count 104 transition count 758
Iterating global reduction 5 with 17 rules applied. Total rules applied 2059 place count 104 transition count 758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2064 place count 104 transition count 753
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 6 with 20 rules applied. Total rules applied 2084 place count 94 transition count 760
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2085 place count 93 transition count 748
Iterating global reduction 6 with 1 rules applied. Total rules applied 2086 place count 93 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2087 place count 93 transition count 747
Applied a total of 2087 rules in 229 ms. Remains 93 /1205 variables (removed 1112) and now considering 747/2817 (removed 2070) transitions.
[2022-06-09 13:23:05] [INFO ] Flow matrix only has 740 transitions (discarded 7 similar events)
// Phase 1: matrix 740 rows 93 cols
[2022-06-09 13:23:05] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 13:23:05] [INFO ] Implicit Places using invariants in 149 ms returned []
[2022-06-09 13:23:05] [INFO ] Flow matrix only has 740 transitions (discarded 7 similar events)
// Phase 1: matrix 740 rows 93 cols
[2022-06-09 13:23:05] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:23:05] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 13:23:05] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2022-06-09 13:23:05] [INFO ] Flow matrix only has 740 transitions (discarded 7 similar events)
// Phase 1: matrix 740 rows 93 cols
[2022-06-09 13:23:05] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:23:06] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 93/1205 places, 747/2817 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/1205 places, 747/2817 transitions.
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s22 1) (EQ s34 1) (EQ s47 1) (EQ s66 1) (EQ s79 1)), p0:(OR (EQ s5 0) (EQ s20 0) (EQ s34 0) (EQ s50 0) (EQ s63 0) (EQ s82 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 410 ms.
Product exploration explored 100000 steps with 25000 reset in 387 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 : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 874 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 82 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 762898 steps, run visited all 1 properties in 2928 ms. (steps per millisecond=260 )
Probabilistic random walk after 762898 steps, saw 150738 distinct states, run finished after 2929 ms. (steps per millisecond=260 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 747/747 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-06-09 13:23:10] [INFO ] Flow matrix only has 740 transitions (discarded 7 similar events)
// Phase 1: matrix 740 rows 93 cols
[2022-06-09 13:23:10] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:23:10] [INFO ] Implicit Places using invariants in 145 ms returned []
[2022-06-09 13:23:10] [INFO ] Flow matrix only has 740 transitions (discarded 7 similar events)
// Phase 1: matrix 740 rows 93 cols
[2022-06-09 13:23:10] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:23:11] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 13:23:11] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2022-06-09 13:23:11] [INFO ] Flow matrix only has 740 transitions (discarded 7 similar events)
// Phase 1: matrix 740 rows 93 cols
[2022-06-09 13:23:11] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:23:11] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 747/747 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 : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 859 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 762898 steps, run visited all 1 properties in 2852 ms. (steps per millisecond=267 )
Probabilistic random walk after 762898 steps, saw 150738 distinct states, run finished after 2852 ms. (steps per millisecond=267 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 542 ms.
Product exploration explored 100000 steps with 25000 reset in 353 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 747/747 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 93 transition count 741
Applied a total of 6 rules in 75 ms. Remains 93 /93 variables (removed 0) and now considering 741/747 (removed 6) transitions.
[2022-06-09 13:23:16] [INFO ] Redundant transitions in 15 ms returned []
[2022-06-09 13:23:16] [INFO ] Flow matrix only has 734 transitions (discarded 7 similar events)
// Phase 1: matrix 734 rows 93 cols
[2022-06-09 13:23:16] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 13:23:17] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 741/747 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 741/747 transitions.
Product exploration explored 100000 steps with 25000 reset in 1131 ms.
Product exploration explored 100000 steps with 25000 reset in 1173 ms.
Built C files in :
/tmp/ltsmin3274273282031696836
[2022-06-09 13:23:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3274273282031696836
Running compilation step : cd /tmp/ltsmin3274273282031696836;'/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 2775 ms.
Running link step : cd /tmp/ltsmin3274273282031696836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3274273282031696836;'/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/stateBased11673760640609389828.hoa' '--buchi-type=spotba'
LTSmin run took 272 ms.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-14 finished in 18183 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-14 TRUE TECHNIQUES CL_INSENSITIVE
[2022-06-09 13:23:23] [INFO ] Flatten gal took : 191 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 238069 ms.

BK_STOP 1654781003330

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872500148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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